Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 954 papers published in subject: since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. An Extensible Embedded System Architecture based on Client-Server Computing | |||
Wu Yuechuan,Zhang Youhui,Tian Tao | |||
Computer Science and Technology 22 May 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents an extensible architecture for embedded systems, which borrows some features from the client-server computing and Common Interface Specification for Conditional Access (CA) of Digital Video Broadcasting Decoder Applications to endow the stand-alone embedded systems with new functions in a compact mode. Compared with the traditional CA module that uses PCMCIA standard, in our solution, USB interfaces and IP-over-USB are used to connect the original system to one or more extensible nodes with new functions to construct a “network”. Through the high-speed USB network, the existing client-server computing mode can be ported to embedded systems. That is, the extensible node acts as the server that deals with requests from the client—the original system. And functions of original embedded systems can be extended or upgraded easily if new nodes are attached. We believe this solution will bring forward new applications for some existing systems. For example, if Digital TV (DTV) owns this feature to interact with extensible nodes, DTV itself can act as a graphic terminal and provide new applications, including games and WWW programs, to users only if the attached node can provide such functions. And users can upgrade or select the nodes as they prefer. In this paper, a system model for the extension is introduced as well as a demo prototype implementation. In the prototype, the USB-based Ethernet is simulated and the TCP/IP protocol can be used directly. | |||
TO cite this article:Wu Yuechuan,Zhang Youhui,Tian Tao. An Extensible Embedded System Architecture based on Client-Server Computing[OL].[22 May 2009] http://en.paper.edu.cn/en_releasepaper/content/32471 |
2. A Rough Set Model of Binary Relation Based on pr pair product | |||
Xiaojuan Yuan,He Lin,Xiao Yang,Liankui Mao | |||
Computer Science and Technology 21 May 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Rough set theory is a tool handling with fuzzy and uncertain knowledge, it mainly deals with rough set model of unary relation. This paper puts forward unordered-pair product of binary relation based on rough set model of binary relation in the sense of Cartesian product, and improve it, defines some basic concepts, such as lower approximation, upper approximation, and so on, and has designed an algorithm. It shows that the improved method is effective through example. | |||
TO cite this article:Xiaojuan Yuan,He Lin,Xiao Yang, et al. A Rough Set Model of Binary Relation Based on pr pair product[OL].[21 May 2009] http://en.paper.edu.cn/en_releasepaper/content/32392 |
3. HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm | |||
CHEN Xiaoyun,HE Yanshan,CHEN Pengfei,MIAO Shengfa,YUE Min,SONG Weiguo | |||
Computer Science and Technology 08 April 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Frequent itemset mining is a fundamental and essential issue in data mining field and can be used in many data mining tasks. Most of these mining tasks require multiple passes over the database and if the database size is large, which is usually the case, scalable high performance solutions involving multiple processors are required. In this paper, we present a novel parallel frequent itemset mining algorithm which is called HPFP-Miner. The proposed algorithm is based on FP-Growth and introduces little communication overheads by efficiently partitioning the list of frequent elements list over processors. The results of experiment show that HPFP-Miner has good scalability and performance. | |||
TO cite this article:CHEN Xiaoyun,HE Yanshan,CHEN Pengfei, et al. HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm[OL].[ 8 April 2009] http://en.paper.edu.cn/en_releasepaper/content/31153 |
4. Sentiment Classification Using Supervised and Semi-supervised Conditional Maximum Entropy Modeling | |||
Qi Zhang,Xuangjing Huang,Lide Wu | |||
Computer Science and Technology 25 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents our work on determining the sentiment polarity of sentences and articles. Feature combinations is the first novelty of our approaches. In order to explore better feature sets, we do some data analysis of the MPQA corpus and a few of experiments to evaluate combinations. Through those efforts, our approach achieves 77.0% accuracy in MPQA data set. Another novelty of this work is that Semi-supervised Conditional Maximum Entropy (SCME) modeling is used to combine labeled and unlabeled data. Experimental results show that our approach can significantly improve performance. In sentence-level, our approach achieves 78.2% accuracy in MPQA data set, the relative improvement given by semi-supervised technique is 5.2% over the supervised method. | |||
TO cite this article:Qi Zhang,Xuangjing Huang,Lide Wu. Sentiment Classification Using Supervised and Semi-supervised Conditional Maximum Entropy Modeling[J].International Journal of Computer Processing Of Languages ,2008年,21卷,4期,295 ~ 308 |
5. Messenger Nodes Based Routing Protocol for Sparse MANET and Performance Analysis | |||
Yibo Zhu,Xiaojun Wu,Sheng Yuan,Ming Zeng | |||
Computer Science and Technology 20 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Recently, the routing issue in sparse Mobile Ad hoc NETwork (MANET) has drawn many researchers’ attention. However, almost all routing protocols resort to either Global Position System (GPS) or trajectory-control, which increase the cost of entire network. In this paper, the Messenger nodes based Routing (MR) protocol, a novel opportunistic routing protocol, is proposed to serve sparse MANET without either GPS or trajectory-control. With the assistance of the MR protocol, sparse MANET can accordingly be deployed much more conveniently. The simulation results in this paper demonstrate that the MR protocol is able to provide a high rate of packets reception. Moreover, the theoretical models for both the average delivery delay and the average number of hops of the MR protocol are constructed in this paper. Finally, the comparison between simulation and theoretical analysis indicates the coincidence of the analytical models with the simulation results. | |||
TO cite this article:Yibo Zhu,Xiaojun Wu,Sheng Yuan, et al. Messenger Nodes Based Routing Protocol for Sparse MANET and Performance Analysis[OL].[20 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30549 |
6. Fast Identity-Based Encryption Using Combined Public Keys | |||
Jiqiang Liu,Sheng Zhong | |||
Computer Science and Technology 20 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Identity-based encryption (IBE) is a very useful tool in cryptography. It has many potential applications. However, existing IBE schemes are signicantly slower than regular public key cryptosystems; thus, they may not be able to meet the need of some applications in practice. In this paper, we propose a simple IBE scheme, using a technique of combined public keys. Our IBE scheme is very fast, having time costs close to those of a regular public key cryptosystem, the ElGamal cryptosystem. We show that our IBE scheme is semantically secure under the Decisional Diffie-Hellman (DDH) Assumption. In addition, we give an identity-based signature scheme using the same technique. | |||
TO cite this article:Jiqiang Liu,Sheng Zhong. Fast Identity-Based Encryption Using Combined Public Keys[OL].[20 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30527 |
7. An online music recognizing and indexing system | |||
Guanxiong Wang,Liu Gang | |||
Computer Science and Technology 27 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we present a human tone based online music system. This system not only espouses the tradition key word retrieval, but also espouses the humming and fragment of a music input to find out the according music. Through the procedures of recognition, coding and indexing, this system could locate target files properly and efficiently. Comparing with the key word retrieval method, the system is more convenient for users, specially the forget the name, libretto, composer and so on. | |||
TO cite this article:Guanxiong Wang,Liu Gang . An online music recognizing and indexing system[OL].[27 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29737 |
8. Research on P2PSIP oriented P2PNS System Design | |||
Jia Lin,Gengyu Wei | |||
Computer Science and Technology 26 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:P2P-SIP is the combination of Peer-to-peer (P2P) networks and the Session Initiation Protocol (SIP). This combination can improve survivability and scalability, as well as enabling new applications. P2PNS is a secure distributed name service for P2PSIP, which can be used to resolve SIP AoRs to Contact URIs without using DNS or central SIP servers. In order to realize this goal, we explore and implement a distributed naming system using DHash, which is a peer-to-peer distributed hash table built on top of Chord. This system inherits Chord\\\\\\\\\\\\\\\ | |||
TO cite this article:Jia Lin,Gengyu Wei. Research on P2PSIP oriented P2PNS System Design[OL].[26 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29717 |
9. A Cancer Recognition Method Based on DNA Microarray | |||
Su Qian,An Dong,Zhai Yafeng,Wang Ku,Wang Shoujue | |||
Computer Science and Technology 26 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The accurate cancer classification is of great importance in clinical treatment. Recently, the DNA microarray technology provides a promising approach to the diagnosis and prognosis of cancer types. However, it has no perfect method for the multiclass classification problem. The difficulty lies in the fact that the data are of high dimensionality with small sample size. This paper proposed an automatic classification method of multiclass cancers based on biomimetic pattern recognition (BPR). To the public GCM data set, the average correct classification rate reaches 80% under the condition that the correct rejection rate is 81%. | |||
TO cite this article:Su Qian,An Dong,Zhai Yafeng, et al. A Cancer Recognition Method Based on DNA Microarray[OL].[26 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29666 |
10. A Novel Fast and Effective Hierarchical Thermal-Aware Floorplanning Algorithm | |||
Pingjie Cheng,Ning Xu | |||
Computer Science and Technology 24 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Hierarchical approaches are employed in current floorplanning algorithms for scaling to large number modules. With the development of VLSI technology, the thermal problem has been emerged as one of the key issues for IC design. In this paper, we propose a novel power density clustering method to guide the optimization of floorplanning, which aims to efficiently reduce the hotspots while optimizing design metrics such as area and total wirelength.The experimental results with GSRC benchmarks show that the thermal effect is well controlled so that the temperature of ”hot spots” has decreased on the chip. Our algorithm is compared with the state-of-the-art thermal-aware floorplanning algorithm Hotspot Floorplan, it can reduce the max temperature by 3% while saving time by about 300%. | |||
TO cite this article:Pingjie Cheng,Ning Xu. A Novel Fast and Effective Hierarchical Thermal-Aware Floorplanning Algorithm[OL].[24 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29596 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated