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 102 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. Limitation of object-oriented language’s polymorphism | |||
Elias Yu,Zeng XiJun | |||
Computer Science and Technology 28 July 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The polymorphism of object-oriented language is the key technology, the use of the method and internal principle is one of the most difficult technologies. In this paper, C + + as an example, analyzed the theory of Polymorphism and pointed out the limitation when rewrite few virtual function in derived class, and put forward a kind of solving method with the string matches to replace the seek address. | |||
TO cite this article:Elias Yu,Zeng XiJun. Limitation of object-oriented language’s polymorphism[OL].[28 July 2009] http://en.paper.edu.cn/en_releasepaper/content/34133 |
2. The Study on JVM and the Transportability of Java | |||
Zheng Weiguo,Tian Qichong | |||
Computer Science and Technology 27 July 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper introduces the Java virtual machine based on which analyzes the dynamic loading mechanism, the working principles and uses of class loader, expounds the implementation process of Java class is loaded, summarizes the impact of class loader on efficiency of the Java virtual machine. At last, Java transportability is also discussed, analyzes the relevant factors that influence the transportability of Java. | |||
TO cite this article:Zheng Weiguo,Tian Qichong. The Study on JVM and the Transportability of Java[OL].[27 July 2009] http://en.paper.edu.cn/en_releasepaper/content/34103 |
3. A comparison of exception system between C++ and Java | |||
Bao Peng,Gao Heng,Qiu Ye | |||
Computer Science and Technology 01 July 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This article investigates the exception system in C++ and Java separately. It compares the rules in both language for matching the exception, the hierarchy and pattern of exception code, and discusses the lifetime and storage of exception objects. Finally it conceives other exception systems that similar with exceptions in other language. | |||
TO cite this article:Bao Peng,Gao Heng,Qiu Ye. A comparison of exception system between C++ and Java[OL].[ 1 July 2009] http://en.paper.edu.cn/en_releasepaper/content/33563 |
4. Design and Implementation of Web Application Framework based on SOA | |||
Xiaoyun Chen,Baojun Gao,Yu Zhou | |||
Computer Science and Technology 10 June 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:As the dominant approach to enterprise integration, SOA (Service-Oriented Architecture) has a profound impact on the enterprise-level software architecture. By analyzing and researching SOA and Web Services platform, with the help of advanced software development platform J2EE and Web Services engine XFire we complete the Web application framework based on SOA. | |||
TO cite this article:Xiaoyun Chen,Baojun Gao,Yu Zhou. Design and Implementation of Web Application Framework based on SOA[OL].[10 June 2009] http://en.paper.edu.cn/en_releasepaper/content/33031 |
5. 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 |
6. The Research and Implementation of Information Customization and Active Distribution System Based on Web Service | |||
Li Ying,Hu Fei,Sun Bo | |||
Computer Science and Technology 05 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:“Pull” mode, the traditional access to information, has many defects, while “Push” mode is an effective solution to the vast amounts of information and information noise problems. This paper introduces an information customization and active distribution system based on web service, which featured by customized services designed templates, the required distribution of the relevant information and dynamic customization capabilities. This system uses web service to query the information the users want, which makes the date platform-independent and completely transparent to users. Information customization makes use of ontology concepts, which are related to data to give users the freedom of customization. | |||
TO cite this article:Li Ying,Hu Fei,Sun Bo. The Research and Implementation of Information Customization and Active Distribution System Based on Web Service[OL].[ 5 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28471 |
7. TTS-Coded Genetic Algorithm for QoS-driven Web Service Selection | |||
Zhang Lei,Shuang Kai | |||
Computer Science and Technology 13 January 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:To maximize user satisfaction during composition of web services, a novel Genetic Algorithm based on a special Tree Traversal Sequence (TTS) coding scheme is presented in this paper. Utilizing the tree traversal information toted by individuals of genetic population and the composite logical information stored in Tree Composite Pattern (TCP), TTS coding scheme can support all the 4 basic models of service composition flows in a much simpler and more effective way. Additionally, an adaptive crossover and mutation strategy is adopted to improve the algorithm\ | |||
TO cite this article:Zhang Lei,Shuang Kai. TTS-Coded Genetic Algorithm for QoS-driven Web Service Selection[OL].[13 January 2009] http://en.paper.edu.cn/en_releasepaper/content/27740 |
8. A Web-based Problem Solving Environments for Weave Pattern Design | |||
GAO Peng,LIU Shijun,ZHANG Yong,MENG Xiangxu | |||
Computer Science and Technology 09 January 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A web-based problem solving environment for weave pattern design is proposed in this paper. The contribution of this PSE platform is on providing a SaaS-type application model, and SaaS-type application integration in PSE. Besides, the PSE presents designers a very friendly personal workspace in which they can customize services, information and schedule. This paper describes the PSE architecture, details of SaaS-type application model as well as how to implement the PSE. | |||
TO cite this article:GAO Peng,LIU Shijun,ZHANG Yong, et al. A Web-based Problem Solving Environments for Weave Pattern Design[OL].[ 9 January 2009] http://en.paper.edu.cn/en_releasepaper/content/27563 |
9. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner | |||
Xiaoyun Chen,Huiling Liu,Pengfei Chen,Longjie Li | |||
Computer Science and Technology 02 September 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we present a novel data-mining algorithm, called LPS-Miner, to mine the complete frequent patterns in the transaction database. LPS-Miner algorithm bases the pattern growth principle and uses two new data structures, LPS-FP-Tree (Light Partial-Support FP-Tree) and LPS-Forest (Light Partial-Support FP-Tree Forest) to present the database. LPS-FP-Tree is a variation of FP-Tree with lighter and unidirectional nodes and mining process depends on partial-support of the patterns. The algorithm adopts partition and divide-and-conquer strategies in maximum, which decomposes the mining task into a set of smaller tasks. The light data structure and the efficient memory management mechanism keep the memory usage stable and efficient. Moreover, other implementation-based optimizations, such as pruning and outputting-optimization, make the algorithm achieve high efficiency. We test our c++ implementation of this algorithm versus several other algorithms on four datasets. The experimental results show that our algorithm has better space and time efficiency. | |||
TO cite this article:Xiaoyun Chen,Huiling Liu,Pengfei Chen, et al. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner[OL].[ 2 September 2008] http://en.paper.edu.cn/en_releasepaper/content/23675 |
10. Design and Implementation of the Spatial Index Structure QER+-tree | |||
Xiaoli Qi,Chen Xiaoyun ,Ma Jun | |||
Computer Science and Technology 18 August 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:QER+-tree, a new spatial index structure based on quad-tree, R-tree and R+-tree, is proposed. Its data structure, operation algorithms and experimental results are also stated. The main thought of QER+-tree is partitioning the whole index space to multi-levels using quad-tree. Then R-tree or R+-tree is used for indexing the subspaces. This way not only restrains the query space, but also decreases the overlap of index space. In addition, QER+-tree uses the reinserting mechanism while splitting nodes. It can better the trees’ structure. So QER+-tree has more superiority than R-tree and R+-tree. | |||
TO cite this article:Xiaoli Qi,Chen Xiaoyun ,Ma Jun . Design and Implementation of the Spatial Index Structure QER+-tree[OL].[18 August 2008] http://en.paper.edu.cn/en_releasepaper/content/23410 |
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