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 > Computer-Science-and-Technology

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

Results per page:

49 Total, 5 Pages | << First < Previous 1 2 3 4 5 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)

Second-level Subject

Artificial Intelligence(287)
Basic Subject of Computer...(134)
Computer Applications(231)
Computer Architecture(136)
Computer Engineering(7)
Computer Software(104)
Other Subjects of Compute...(25)

Rank

Results per page:

49 Total, 5 Pages | << First < Previous 1 2 3 4 5 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. Wiener Granger Causality Index based on a generalized Akaike's Information Criterion and its application in EEG
	YANG Chunfeng,XIANG Wentao,Wu Jiasong,LE BOUQUIN JEANNES Régine,SHU Huazhong
	Computer Science and Technology 21 August 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Our objective is to analyze EEG signals recorded with depth electrodes during seizures in patients with drug-resistant epilepsy. The Wiener-Granger Causality Index (WGCI) is an effective measure to detect causal relations of interdependence in EEG signals. In this paper, a generalized Akaike's Information Criterion (gAIC) algorithm is presented and incorporated in the WGCI to estimate the model orders which play an important role in such an approach. Experimental simulation results support the interesting performance of the proposed algorithm to characterize the information flow both in a linear stochastic system and in a physiology-based model.
	TO cite this article:YANG Chunfeng,XIANG Wentao,Wu Jiasong, et al. Wiener Granger Causality Index based on a generalized Akaike's Information Criterion and its application in EEG[OL].[21 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4607101


	2. Sparse representation based on manifold learning
	Yang Zheng, Liu Haifeng
	Computer Science and Technology 17 December 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As a technology derived from the Human Visual System, sparse coding has attracted a lot of attentions in recent years. It aims to learn sparse coordinates in terms of the basis set, which is given directly or learned from the original data set. Because of the sparsity, the learned sparse representation can be used in further data processing( such as clustering and classifying) efficiently. But the canonical sparse coding methods are all ignored the intrinsic structure of the data. From the perspective of manifold learning, this paper propose a novel sparse coding method, called Sparse Coding based on Manifold learning (MSC). Inspired by LPP, MSC finds a basis set which can be used to represent the intrinsic manifold space of the data set, and then sparse representations will be learned in this space. The most obvious advantage of MSC compared with the algorithms which impose a manifold regularizer to the objective function directly is that MSC is nonparametric. In other words, MSC is more robust. A set of evaluations on real world applications demonstrate the effectiveness of this novel algorithm.
	TO cite this article:Yang Zheng, Liu Haifeng. Sparse representation based on manifold learning[OL].[17 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4575298

Saved Papers

Saved Papers


	3. Band-reweighed Gabor Kernel Embedding for Face Recognition
	Chuan-Xian Ren, Dao-Qing Dai
	Computer Science and Technology 07 December 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Face recognition with illumination or pose variation is a challenging problem in image processing and pattern recognition. A novel algorithm using band-reweighed Gabor kernel embedding to deal with the problem is proposed in this paper. For a given image, it is firstly transformed by a group of Gabor filters, which output Gabor features using different orientation and scale parameters. Fisher scoring function is used to measure the importance of features in each band, and then the features with the largest scores are preserved for saving memory requirement. The reduced bands are combined by a vector, which is determined by a weighted kernel discriminant criterion and solved by a constrained quadratic programming method, and then the weighted sum of these nonlinear bands is defined as the similarity between two images. Compared with existing concatenation based Gabor feature representation and the uniformly weighted similarity calculation approaches, our method provides a new way to use Gabor features for face recognition, and presents a reasonable interpretation for highlighting discriminant orientations and scales. The minimum Mahalanobis distance considering the spatial correlations within the data is exploited for feature matching, and the graphical lasso is used therein for directly estimating the sparse inverse covariance matrix. Experiments using benchmark databases show that our new algorithm improves the recognition results and obtains competitive performance.
	TO cite this article:Chuan-Xian Ren, Dao-Qing Dai. Band-reweighed Gabor Kernel Embedding for Face Recognition[OL].[ 7 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4571407


	4. Generalized Format-preserving Encryption for Character Data
	Ma Haoyu,Liu Zheli,Jia Chunfu,Yuan Ke
	Computer Science and Technology 04 May 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:We studied format-preserving encryption (FPE) for character data, for solutions that encipher character strings while preserving both their lengths and memory consumptions. By clustering characters into multiple sets according to the number of bytes they are encoded, we managed to establish mixed-radix numeral systems for character data. Under such systems, we proposed a basic method for character data that exploits existing FPEs, as well as a generalized character FPE scheme using Feistel-based construction, where a customized ``dynamic modular addition'' is used to ensure the feasibility the scheme. Our work showed a new way of designing encryption methods for arbitrary message spaces, which involves no tradeoff between efficacy and efficiency.
	TO cite this article:Ma Haoyu,Liu Zheli,Jia Chunfu, et al. Generalized Format-preserving Encryption for Character Data[OL].[ 4 May 2013] http://en.paper.edu.cn/en_releasepaper/content/4540303


	5. Symmetric Bayesian-Nash Equilibrium of Simultaneous Vickrey Auctions with Perfect Substitutes
	Bu Tianming,Qi Qi
	Computer Science and Technology 08 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper studies the model that there are two simultaneous one-round sealed-bid second-price/Vickrey auctions. Each auction sells on eidentical object. For each bidder, there is no extra beneﬁt from winning more than one object. This model is in spired by the similar phenomenon appears pervasively on eBay which is the world’s largest online marketplace for businesses and consumers to auction oﬀ goods through it. The paper focuses on the buyers’s trategic behavior in this model. The symmetric Bayesian-Nash equilibria under several constraints are characterized. In addition, the expected total revenue under the symmetric Bayesian-Nash equilibrium of simultaneous Vickrey auctions is analyzed.
	TO cite this article:Bu Tianming,Qi Qi. Symmetric Bayesian-Nash Equilibrium of Simultaneous Vickrey Auctions with Perfect Substitutes[OL].[ 8 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4509967


	6. Parallel hash function using DM-based integer-valued chaotic maps network
	Liao Dong,Wang Xiaomin
	Computer Science and Technology 10 December 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A parallel hash function using DM-based integer-valued chaotic maps network is proposed which combines the advantage of both chaotic system and DM scheme. And the algorithm has avoided the flaw of the forgery attack of the exiting parallel hash functions. The algorithm can be used to calculate hash values of 128, 160, 192, 256, 384 and 512 bits with little difference in performance for the different hash values. The message is partitioned into message blocks with fixed length and each message block is processed by the integer-valued chaotic maps network in parallel. The final hash value is generated with a sponge-like construction， which confuses the mixed result of all the outputs of the integer-valued chaotic maps network. The hash function is mainly implemented by extend integer-valued tent maps and can work in a parallel mode, which guarantees good security and high efficiency. Theoretical and simulation results show that the proposed hash algorithm has strong diffusion and confusion capability and good collision resistance. These properties make it a good candidate for hash on platforms that support parallel processing.
	TO cite this article:Liao Dong,Wang Xiaomin. Parallel hash function using DM-based integer-valued chaotic maps network[OL].[10 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4500967


	7. Space Partitioned AFDX Switch Design Based on Shared Memory Architecture
	Hu Jingfei,Li Jian,Hu Fei
	Computer Science and Technology 30 November 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:As a new generation of aviation network communication standard, AFDX has been applied to the A380 and other large civil aircraft due to its advantages of full-duplex, high-bandwidth, low latency, low packet loss and low cost. Switches are key devices influencing the overall performance of an AFDX network. A shared memory architecture is widely used but this has imperfect reliability and scalability, because all the output ports share only one memory and one scheduler, which can lead to severe resource contention and scheduling latency. This article employs space partition techniques to isolate the memory space for each output port, and proposes a new space partitioned shared memory switch (SPSMS) architecture for AFDX networks. This architecture reduces the competition for resources and avoid conflicts, thereby decreasing the latency of packets through the switch. Simulation of the architecture with OPNET shows significant performance improvement over a classic shared memory switch in terms of switch overall packet latency, queuing delay and queue size.
	TO cite this article:Hu Jingfei,Li Jian,Hu Fei. Space Partitioned AFDX Switch Design Based on Shared Memory Architecture[OL].[30 November 2012] http://en.paper.edu.cn/en_releasepaper/content/4496819


	8. Research on Distributed Web Service Mining Method Based on Peer to Peer
	Zhu Hongkang,Yu Xueli
	Computer Science and Technology 18 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Composite service selection is a research difficulty in service-oriented computing domain. Most selection approaches are based on service QoS information which is difficult to acquire accurately. In this paper, a distributed web service usage pattern mining infrastructure based on services execution information is proposed. In order to meet the cross-organizational associated business requirement, a service registry federation mechanism is presented. Then, a distributed algorithm of composite service frequent sequential mining within registry federation is described. In the end, some simulation results are demonstrated to show the effectiveness of the proposed method.
	TO cite this article:Zhu Hongkang,Yu Xueli. Research on Distributed Web Service Mining Method Based on Peer to Peer[OL].[18 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4464144


	9. Multiple Description Video Coding Using Rate-Distortion Optimized Temporal Sampling
	Huihui Bai,Lili Wan
	Computer Science and Technology 10 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, an effective multiple description video codec is designed based on pre- and post-processing of video sequences without modifying the actual coding process itself, which makes it compatible with the current standard coding. In pre-processing, adaptive modes of temporal sampling are employed to regulate the motion change between frames before performing odd/even frame splitting, which facilitates a good estimation of lost frames in post-processing after side decoding. In particular, given a central distortion, rate-distortion optimization with La-grangian formulation is applied in pre-processing to achieve a good tradeoff between bit rate and side distortion. Furthermore, for simplicity of the Lagrangian multiplier selection, a new optimization criterion is proposed based on the correlation of intra-/inter-description. The experimental results exhibit better performance of the proposed scheme than other tested schemes.
	TO cite this article:Huihui Bai,Lili Wan. Multiple Description Video Coding Using Rate-Distortion Optimized Temporal Sampling[OL].[10 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4465152


	10. Conditionally Anonymous Ring Signature \ Scheme without Random Oracles
	Zeng Shengke,Qin Zhiguang,Lu Qing
	Computer Science and Technology 08 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Compared to the original ring signature scheme, conditionally anonymous ring signature allows to revoke the anonymity of the actual signer without the group manager's help, i.e., in case of dispute, the actual signer can be traced through signer's confirmation or the non-signers' disavowal. However, the previous conditionally anonymous ring signature schemes rely on random oracles, in the other words, the security of such schemes depend on the randomness of the hash functions. In order to improve the security, this paper proposes a ring signature scheme with traceability without random oracles in the common reference string model.
	TO cite this article:Zeng Shengke,Qin Zhiguang,Lu Qing. Conditionally Anonymous Ring Signature \ Scheme without Random Oracles[OL].[ 8 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4463457

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