共查询到20条相似文献,搜索用时 62 毫秒
1.
本文提出基于标准单元实现的工艺映射技术,映射过程采用子逻辑结构变换及逻辑函数匹配加以实现,很好地兼顾了电路设计对延迟时间及芯片面积的要求。该过程在Sun-4/SPARC上用C语言实现,具有很好的时、空复杂性,能处理超大规模(5000门以上)数字同步时序电路的映射过程,对纯组合逻辑电路的映射结果较好。 相似文献
2.
任意分布数据的基数分配链接排序算法 总被引:18,自引:0,他引:18
文中将映射链接思想引入了基数排序,提出了一种谓之基数分配链接的新排序方法(以下简称为“基数分配链接排序”),给出了该排序算法的描述、时间复杂度分析及用C语言编写程序进行算法比较的实验结果,算法分析和实验结果都表明:基数分配链接排序方法和待排序数据分布无关,其时间复杂度为O(N),并且排序速度明显优于Quick Sort^[1],Flash Sort^[1],Proportion Split Sor 相似文献
3.
4.
5.
Lurie型控制系统的鲁棒决定稳定性 总被引:50,自引:1,他引:49
本文给出了Lurie型间接控制系统x=G[B,C]x+G[R,S]f(σ);σ=c^Tx-ρf(σ);f(σ)∈K[0,∞);和直接控制系统x=G[B,C]x+G[R,S]f(σ);σ=C^Tx,f(σ)∈K[0,∞),绝对稳定的若干充分条件。 相似文献
6.
张民选 《计算机工程与科学》1995,17(1):27-31
本文给出了数学库中各标准子程序的调用频度及统计方法;讨论了函数计算对整机性能的影响。研究结果表明:加速常用函数计算,可显著提高超级计算机的实用性能。R、SQRT、SIN/COS计算的2 ̄x,Iog2 ̄x、Sign(x_l,x_2)某函数计算的辅助性指令,直接用硬件实现;设置固定函数库装入最常用函数标子,可显著提高整机的综合计算速度,在参考文献[3]中的模拟分析也验证了这一结论。 相似文献
7.
非线性等式与不等式问题的信赖域算法 总被引:4,自引:0,他引:4
51.引言 本文讨论如下非线性等式与不等式问题的求解问题:其中,吐。)是*”+B的连续可微函数. 非线性问题(1.1)广泛出现于优化问题、互补问题及变分不等式等应用数学领域中,因而对其算法的研究也是计算数学的一个重要部分.许多作者考察了该问题的求解,如Dennis和Schnabe[6], Pshenichllyi[9], Robinson[101等人讨论了该问题的牛顿法求解,梯度法求解,Burke和 Han[‘]讨论了高斯一牛顿法求解. Dennis在[5]中首次采用了信赖域算法的求解,[5]中通过引… 相似文献
8.
以BASIC语言在IBM和APPLE─Ⅱ微机上编写了一种用于估计普通单底物酶动力学重要参数的微机程序。实验数据[v]和[s]经该程序处理,便可迅速得到酶动力学参数K_m和V_m值,同时还可得到酶动力学曲线([S]对v和1/[S]对1/[v])的图形等。 相似文献
9.
10.
1Windows98安装程序SETUP可以使用的参数格式 :SETUP[batch][/T:tmpdir][/im][/id][/is][/iq][ie][/ih][iv]batch指定包含安装选项的文件名及其位置。/T:tmpdir为安装程序指定复制临时文件的目录。如果目录不存在 ,将自动创建该目录。注意 ,如果该目录已经存在 ,则该目录中的任何旧文件都将被删除。建议将其指向非安装盘 ,可以减少安装盘上的文件碎片。/im跳过常规内存检查。/id忽略磁盘空间检查。/is跳过常规的系统检查(即不运行Scan… 相似文献
11.
Jonas Lundberg Tobias Gutzmann Marcus Edvinsson Welf Lwe 《Information and Software Technology》2009,51(10):1428-1439
Many software engineering applications require points-to analysis. These client applications range from optimizing compilers to integrated program development environments (IDEs) and from testing environments to reverse-engineering tools. Moreover, software engineering applications used in an edit-compile cycle need points-to analysis to be fast and precise.In this article, we present a new context- and flow-sensitive approach to points-to analysis where calling contexts are distinguished by the points-to sets analyzed for their call target expressions. Compared to other well-known context-sensitive techniques it is faster in practice, on average, twice as fast as the call string approach and by an order of magnitude faster than the object-sensitive technique. In fact, it shows to be only marginally slower than a context-insensitive baseline analysis. At the same time, it provides higher precision than the call string technique and is similar in precision to the object-sensitive technique. We confirm these statements with experiments using a number of abstract precision metrics and a concrete client application: escape analysis. 相似文献
12.
源代码分析技术对于软件安全缺陷分析是一项非常重要的手段.分析了软件源代码分析工具的技术手段和发展过程,最后对源代码分析的理论和实践进行了分析总结. 相似文献
13.
别名分析对于数据流分析、程序优化和分析工具的实现非常重要.文章提出了一种需求驱动,流非敏感的分析算法来解决指针别名问题.通过构造程序表达式图(PEG)把指针别名问题转化成判断两个指针节点是否是联通的问题,它不同于传统的别名分析方法,它不需要构造别名集合和对其求交集,所以提高了分析指针别名的效率. 相似文献
14.
《Ergonomics》2012,55(11):1787-1800
Abstract The role of cognitively oriented tasks in the workplace continues to increase as automation of physical task components advances. Difficulties in automating the operator's cognitive processes have placed a renewed emphasis on the human component in advanced manufacturing systems. While traditional task analysis techniques have made significant contributions to improving productivity when important task elements are visually observable, their focus on manual task procedures make them less effective for cognitively oriented activities. This research has made a first attempt at integrating techniques from several disciplines to develop a cognitive task analysis methodology. The utility of this combined approach is examined for a new system being tested in the United States Postal Service. This task requires operators to encode, via a keyboard, addresses presented on a video display terminal. Results support the hypothesis that, for cognitively oriented tasks, a consensus based analysis technique (the Position Analysis Questionnaire) can be significantly improved by including data from task analysis provided the methodology is suitable for identifying non-physical task components. 相似文献
15.
M. H. Williams 《Software》1982,12(5):487-491
The researcher who knows little about computers but wants to conduct a survey and analyse the results by computer can land himself in some difficulty if he does not appreciate some of the problems of computerization. This paper describes a system which is designed to aid such a person by providing assistance with the design of the questionnaire, the capturing of the data and the final analyses. 相似文献
16.
张浩 《电脑编程技巧与维护》2011,(18):42-43,66
重点选取了15个副省级城市的第一产业比重、人口密度、人均绿地、园林面积、医院数目,市政建设面积、地方财政税收等42个指标,使用SPSS作为计算工具,使用因子分析方法简化评价指标,计算相关系数矩阵,判别因子分析可行性,利用主成分分析法求因子载荷,将因子进行旋转得出更有实际意义的因子解释,并计算因子得分,利用该结果计算Mi... 相似文献
17.
The size of today’s programs continues to grow, as does the number of bugs they contain. Testing alone is rarely able to flush out all bugs, and many lurk in difficult-to-test corner cases. An important alternative is static analysis, in which correctness properties of a program are checked without running it. While it cannot catch all errors, static analysis can catch many subtle problems that testing would miss.We propose a new space of abstractions for pointer analysis—an important component of static analysis for C and similar languages. We identify two main components of any abstraction—how to model statement order and how to model conditionals, then present a new model of programs that enables us to explore different abstractions in this space. Our assign-fetch graph represents reads and writes to memory instead of traditional points-to relations and leads to concise function summaries that can be used in any context. Its flexibility supports many new analysis techniques with different trade-offs between precision and speed.We present the details of our abstraction space, explain where existing algorithms fit, describe a variety of new analysis algorithms based on our assign-fetch graphs, and finally present experimental results that show our flow-aware abstraction for statement ordering both runs faster and produces more precise results than traditional flow-insensitive analysis. 相似文献
18.
19.
Elvira AlbertPuri Arenas Samir GenaimGerman Puebla Damiano Zanardini 《Theoretical computer science》2012,413(1):142-159
Cost analysis statically approximates the cost of programs in terms of their input data size. This paper presents, to the best of our knowledge, the first approach to the automatic cost analysis of object-oriented bytecode programs. In languages such as Java and C#, analyzing bytecode has a much wider application area than analyzing source code since the latter is often not available. Cost analysis in this context has to consider, among others, dynamic dispatch, jumps, the operand stack, and the heap. Our method takes a bytecode program and a cost model specifying the resource of interest, and generates cost relations which approximate the execution cost of the program with respect to such resource. We report on COSTA, an implementation for Java bytecode which can obtain upper bounds on cost for a large class of programs and complexity classes. Our basic techniques can be directly applied to infer cost relations for other object-oriented imperative languages, not necessarily in bytecode form. 相似文献