期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
人工智能算法可专利性探析——从知识生产角度区分抽象概念与具体应用 被引量:29
1
作者 狄晓斐 《知识产权》 CSSCI 北大核心 2020年第6期81-96,共16页
人工智能算法的客体属性是人工智能技术可专利性问题的核心。根据方法发明专利保护的发展历史可知,方法可专利性判定的原则应当是考察权利要求作为一个整体是否构成对抽象概念的具体应用。同时,历史的经验还表明,目前主流测试标准的实... 人工智能算法的客体属性是人工智能技术可专利性问题的核心。根据方法发明专利保护的发展历史可知,方法可专利性判定的原则应当是考察权利要求作为一个整体是否构成对抽象概念的具体应用。同时,历史的经验还表明,目前主流测试标准的实质要求均只构成该原则的充分不必要条件。具体适用该原则时,相比于已有区分标准,从知识生产的角度能够更有效地界分抽象概念和具体应用。根据这一标准,人工智能算法属于对抽象概念的具体应用。这样,人工智能技术的可专利性问题就转化为对抽象概念实际应用程度的阈值设置问题。鉴于行业发展现状、专利法的立法目的、我国现阶段的战略规划和法制环境,应当给予人工智能算法专利保护。 展开更多
关键词 人工智能算法 可专利性 知识生产 抽象概念 具体应用
下载PDF
Mobile-Service Based Max-Min Fairness Resource Scheduling for Heterogeneous Vehicular Networks
2
作者 ZHANG Yu XIONG Ke +2 位作者 AN Fengping di xiaofei SU Jingtao 《China Communications》 SCIE CSCD 2015年第S2期10-18,共9页
This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside inf... This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other moving vehicles. For such a system, we propose a mobile-service based max-min fairness resource scheduling scheme, where service amount which is more suitable for high mobility scenarios is adopted to characterize the information transmission capacity of the links and the max-min criteria is adopted to meet the fairness requirement of the moving vehicles. Simulation results demonstrate the effectiveness of our proposed scheme. It is shown that our proposed scheme archives higher throughput and better fairness compared with random scheduling scheme and non-relaying scheme. 展开更多
关键词 HETEROGENEOUS vehicular network vehicular COMMUNICATIONS cooperative RELAYING MAX-MIN FAIRNESS
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部