首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   80篇
  国内免费   3篇
  完全免费   6篇
  自动化技术   89篇
  2019年   1篇
  2016年   1篇
  2014年   6篇
  2013年   2篇
  2012年   4篇
  2011年   7篇
  2010年   7篇
  2009年   5篇
  2008年   5篇
  2007年   7篇
  2006年   3篇
  2005年   4篇
  2004年   3篇
  2003年   3篇
  2002年   3篇
  2001年   3篇
  2000年   4篇
  1999年   2篇
  1998年   5篇
  1997年   1篇
  1996年   2篇
  1995年   1篇
  1993年   4篇
  1992年   3篇
  1991年   1篇
  1990年   1篇
  1979年   1篇
排序方式: 共有89条查询结果,搜索用时 31 毫秒
1.
During the computer-aided design of assemblies, or of single objects composed of primitive elements, the positions of their constituent parts must be determined. These parts can be positioned absolutely in terms of some coordinate system, or relatively in terms of the relationships or constraints that implicitly exist between their constituents. Despite having many advantages, the latter approach presents computational problems which have resulted in its limited acceptance. The paper describes a system which uses techniques from computer algebra to avoid these problems, and discusses its advantages and disadvantages.  相似文献
2.
3.
Using computer algebra systems in mathematical classrooms   总被引:2,自引:0,他引:2  
Abstract This paper describes a research whose main focus is the use of Computer Algebra Systems (CAS) in mathematical classrooms and the didactical possibilities linked with its use. The possibilities of integrating Self-Regulated Learning (SRL) within the CAS environment are brought into focus. Forty-three Israeli students (mean age 13.3) were assigned to two learning algebraic groups. The first group received explicit meta-cognitive SRL with CAS (CAS + SRL); the second group was exposed to CAS without SRL (CAS). Empirical results from the experimental and case study designs revealed that (CAS + SRL) students outperformed (CAS) students on algebraic thinking and that (CAS + SRL) students regulated their learning more effectively.  相似文献
4.
平面代数剖分样本点的一个有效算法   总被引:2,自引:1,他引:1  
本文提出了寻找平面数剖分样本点的一个有效算法给出了实现该算法的一个完整的Maple程序。  相似文献
5.
基于模式识别的多项式因式分解算法及其应用   总被引:2,自引:1,他引:1  
讨论模式识别和搜索技术在智能教学软件设计中的应用,特别是多项式因式分解的算法和解题过程的自动产生。  相似文献
6.
求解孙子问题的算法及符号计算软件   总被引:1,自引:0,他引:1  
本文阐述在计算机上求解孙子问题的算法,并在微机上用符号计算语言CASC实现了这些算法,软件CHINREMD可对任意大整数情况求解孙子问题。  相似文献
7.
控制系统计算机代数工具Symbol CAD   总被引:1,自引:0,他引:1       下载免费PDF全文
研究控制系统计算机辅助设计的计算机代数方法,概要叙述了控制系统计算机代数 工具Symbol CAD的设计方法和设计结构.Symbol CAD使用面向对象方法,采用图形窗口 环境,具有符号运算和数值计算能力,可以进行适合控制系统分析和设计的算法编程,具有系 统扩充功能.  相似文献
8.
高效符号数值混合计算系统研究与设计   总被引:1,自引:0,他引:1       下载免费PDF全文
符号与数值混合计算是一种利用数值计算和符号计算方法解决大规模问题的计算方法,它为符号计算与数值计算提供一种新的思维模式和方法。近年来,混合计算的理论研究取得一些重要的进展。然而,混合计算的系统软件设计还处于探索阶段。基于此,提出了一种基于改进的开放源代码的符号数值计算应用环境库(SYNAPS)的高效符号数值混合计算系统的设计方法,并进行了实现。实验结果表明,该系统高效可靠。  相似文献
9.
Automatic Construction and Verification of Isotopy Invariants   总被引:1,自引:0,他引:1  
We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Isotopism is an important generalisation of isomorphism, and is studied by mathematicians in domains such as loop theory. This extension was not straightforward, and we had to solve two major technical problems, namely, generating and verifying isotopy invariants. Concentrating on the domain of loop theory, we have developed three novel techniques for generating isotopic invariants, by using the notion of universal identities and by using constructions based on subblocks. In addition, given the complexity of the theorems that verify that a conjunction of the invariants form an isotopy class, we have developed ways of simplifying the problem of proving these theorems. Our techniques employ an interplay of computer algebra, model generation, theorem proving, and satisfiability-solving methods. To demonstrate the power of the approach, we generate isotopic classification theorems for loops of size 6 and 7, which extend the previously known enumeration results. This work was previously beyond the capabilities of automated reasoning techniques. The author’s work was supported by EPSRC MathFIT grant GR/S31099.  相似文献
10.
We describe an algorithm for obtaining the central primitive idempotents of the algebra associated with a monomial representation. As a consequence, we obtain its irreducible constituents. This is implemented in Magma, using an algorithm based on Dixon’s modular approach. In the case of permutation representations, we get a simplified version of the algorithms of Michler and Weller.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号