期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Several Legal Issues Relating to Service Technological Results
1
作者 Liu Xiaohai Professor of the Intellectual Property School of the Tongji University and Professor of the German Bayer Intellectual Property Foundation of Sino-German School. 《中国专利与商标》 2006年第4期22-29,共8页
How "the rights and interests in the intellectual property rights of the scientists and technicians should be protected and the entity achieving the service-related technological results should remunerate, under ... How "the rights and interests in the intellectual property rights of the scientists and technicians should be protected and the entity achieving the service-related technological results should remunerate, under law, those achieving the service-related technological results and those making outstanding contribution to the transfer of the technological results" are important issues encountered in China in its efforts to improve its innovation capacity and build up a new nation. The current legal system in... 展开更多
关键词 Several Legal Issues Relating to Service Technological results
下载PDF
Polynomial Tests of Normal Forms and Some Related Results
2
作者 王克 《Journal of Computer Science & Technology》 SCIE EI CSCD 1992年第1期75-82,共8页
The following problem is called the everywhere-cover problem:“Given a set of dependencies over a database scheme,is the set of dependencies explicitly given for each relation scheme equivalent to the dependencies imp... The following problem is called the everywhere-cover problem:“Given a set of dependencies over a database scheme,is the set of dependencies explicitly given for each relation scheme equivalent to the dependencies implied for that relation scheme?”It is shown that when the everywhere-cover problem has a ‘yes’ answer,examining only the dependencies explicitly given will suffice to test 3NF,BCNF and 4NF of a database scheme.But this does not hold for 2NF.Consequently,in such cases,tests of BCNF and 4NF all take polynomial time.Then a proof is given that test of 3NF of a database scheme is Co-NP-complete,and from this result it is shown that everywhere-cover is also Co-NP-complete when only functional dependencies are allowed.These results lead to doubt the truth of the well believed conjec- ture that no polynomial time algorithm for designing a Iossless BCNF database scheme is likely to exist. 展开更多
关键词 Polynomial Tests of Normal Forms and Some Related results
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部