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 10 papers published in subject: > since this site started. |
Results per page: |
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 Efficient Trip Planning Algorithm Under Constraints | |||
Jinling Bao,Xiaochun Yang,Bin Wang | |||
Computer Science and Technology 08 August 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The problem of trip planning has received wide concerns in recent years. More and more people require the service of automatically confirming the optimal tour route. When users assign the source and the destination, and the time limit of the tour, how can automatically decide the optimal tour route with the highest sum of the popularity scores of scenic spots. Current methods for trip planning are on the setting that providing with the route which is composed of the scenic spots to travel. These would work poorly for the pre-mentioned problem when the route satisfying the constraints can not be found. Thus we adjust the setting to giving the route composed of the scenic spots which users visit or simply pass by. Obviously, the modified problem would incur larger search cost as each scenic spot in the given route has two states. It can be demonstrated that this new problem is NP hard, making it difficult to find an efficient exact algorithm for the present. In this paper, we propose a greedy strategy based algorithm to solve the trip planning problem, and we also present an improved algorithm with better performance. The experimental results on synthesized and real data sets reveal that our algorithm is able to find the approximately optimal path in high efficiency. | |||
TO cite this article:Jinling Bao,Xiaochun Yang,Bin Wang. An Efficient Trip Planning Algorithm Under Constraints[OL].[ 8 August 2013] http://en.paper.edu.cn/en_releasepaper/content/4554413 |
2. Model-checking of Linear-Time Properties in possibilistic Kripke structure | |||
LI Lijun,LI Yongming | |||
Computer Science and Technology 14 November 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Firstly, in this paper, we study the Linear Temporal Logic (LTL) model-checking of linear-time properties in possibilistic Kripke structure. Secondly, we introduce the expression of the safety property and regular property in possibilistic Kripke structure, then give some calculation method related to the above Linear-time properties. Finally , we thoroughly study the verification of safety property and omega regular property using automata. | |||
TO cite this article:LI Lijun,LI Yongming. Model-checking of Linear-Time Properties in possibilistic Kripke structure[OL].[14 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4449957 |
3. Possibilistic Kripke Structure Decision Processes | |||
XUE Yan,LEI Hongxuan,LI Yongming | |||
Computer Science and Technology 14 November 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:We propose the concept of possibilistic Kripke structure decision process (PKSDP), PKSDP is a generalization of possibilistic Kripke structure (PKS), useful for modeling and quantifying the possible outcomes of random actions. We define the path in a PKSDP, scheduler, PKS of a PKSDP induced by a scheduler, memoryless scheduler, present the theory of reachability possibilities. We also address some examples of PKSDPs, Finally, we discuss the existence of optimal memoryless schedulers and value iteration for step-bounded reachability properties. | |||
TO cite this article:XUE Yan,LEI Hongxuan,LI Yongming. Possibilistic Kripke Structure Decision Processes[OL].[14 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4449954 |
4. Research on Component Trustiness Based on Entropy | |||
ZHANG Wenbo,TIAN Yafei,XIE Huanqing,WANG Guanghui | |||
Computer Science and Technology 03 December 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:High trustiness components are of great value, because the reuse of them can sharply enhance the software productivity and quality. How to measure and ensure the component trustiness becomes more important in the procedures of software development and software testing. The thesis proposes the using of entropy to measure the component trustiness and exemplifying the specific application steps by data processing components. For other types of software provides a theoretical basis for the credibility of the amount and method of reference. | |||
TO cite this article:ZHANG Wenbo,TIAN Yafei,XIE Huanqing, et al. Research on Component Trustiness Based on Entropy[OL].[ 3 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4393068 |
5. A complete algorithm to find exact minimal polynomial by approximations | |||
Xiaolin Qin,Yong Feng,Jingwei Chen,Jingzhong Zhang | |||
Computer Science and Technology 11 January 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approximate root. This also enables us to provide an efficient method of converting the rational approximation representation to the minimal polynomial representation, and devise a simple algorithm to factor multivariate polynomials with rational coefficients. Compared with the subsistent methods, our method combines advantage of high efficiency in numerical computation, and exact, stable results in symbolic computation. we also discuss some applications to some transcendental numbers by approximations. Moreover, the \\emph{Digits} of our algorithm is far less than the LLL-lattice basis reduction technique in theory. In this paper, we completely implement how to obtain exact results by numerical approximate computations. | |||
TO cite this article:Xiaolin Qin,Yong Feng,Jingwei Chen, et al. A complete algorithm to find exact minimal polynomial by approximations[OL].[11 January 2010] http://en.paper.edu.cn/en_releasepaper/content/38727 |
6. 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 |
7. A Vague Relational Model and Algebra | |||
Faxin Zhao,Z.M. Ma,Li Yan | |||
Computer Science and Technology 07 August 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Imprecision and uncertainty in data values are pervasive in real-world environments and have received much attention in the literature. Several methods have been proposed for incorporating uncertain data into relational databases. However, the current approaches have many shortcomings and have not established an acceptable extension of the relational model. In this paper, we propose a consistent extension of the relational model to represent and deal with fuzzy information by means of vague sets. We present a revised relational structure and extend the relational algebra. The extended algebra is shown to be closed and reducible to the fuzzy relational algebra and further to the conventional relational algebra. | |||
TO cite this article:Faxin Zhao,Z.M. Ma,Li Yan. A Vague Relational Model and Algebra[OL].[ 7 August 2007] http://en.paper.edu.cn/en_releasepaper/content/14436 |
8. Similarity Measures of Vague Sets Based on the Set-theoretic Approach | |||
Faxin Zhao,Zongmin Ma | |||
Computer Science and Technology 18 September 2006 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Vague set, as a generalized fuzzy set, has more powerful ability to process fuzzy information than fuzzy set. In this paper, we propose a new similarity measure between vague sets based on the set-theoretic approach. The proposed measure can provide a useful way for measuring the degree of similarity between vague sets. | |||
TO cite this article:Faxin Zhao,Zongmin Ma. Similarity Measures of Vague Sets Based on the Set-theoretic Approach[OL].[18 September 2006] http://en.paper.edu.cn/en_releasepaper/content/8391 |
9. Research of BPM and its System Based on Dynamic Process Framework | |||
CHEN Jian-Rong,CHEN Jian-Wu,CHEN Wei-Xin | |||
Computer Science and Technology 15 August 2006 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The intrinsic defects of traditional BPM technologies resulted in many companies’ failure in process management as enterprises trapped in a complex and changeful market environment. Through a thorough research of BPM, a new software architecture with the name of Dynamic Process Framework (DPF) is brought forward. After an analysis of its architecture and core components, a discussion about how to build a BPMS based on DPF is carried on. Results show that DPF surpasses many others in BPM because of its characteristics of fine descriptiveness, abstract, flexibility etc. | |||
TO cite this article:CHEN Jian-Rong,CHEN Jian-Wu,CHEN Wei-Xin. Research of BPM and its System Based on Dynamic Process Framework[OL].[15 August 2006] http://en.paper.edu.cn/en_releasepaper/content/7921 |
10. Semantics of Framed Temporal Logic Programs | |||
Duan Zhenhua ,Yang Xiaoxiao ,Maciej Koutny | |||
Computer Science and Technology 23 September 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper investigates semantics of framed temporal logic programs. To this end, a projection temporal logic and its executable subset are presented. Based on this language, a framing technique is introduced. The semantics of a non-framed program is well interpreted by the canonical model. However, since introducing a framing operator destroys monotonicity, a canonical model may no longer capture the intended meaning of a program. Hence, a minimal model theory is developed. Within this model, negation by default is used to manipulate frame operator. Further, the temporal semantics of framed programs is captured by means of the minimal models. The existence of a minimal model for a given framed program is also proved. An example is given to illustrate how the semantics of framed programs can be captured | |||
TO cite this article:Duan Zhenhua ,Yang Xiaoxiao ,Maciej Koutny. Semantics of Framed Temporal Logic Programs[OL].[23 September 2005] http://en.paper.edu.cn/en_releasepaper/content/2997 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated