首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 140 毫秒
1.
给出对编译程序的输出进行人工优化的一种方法及一个程序例子,它不降低高级语言源程序的可读性,但加快了程序的运行速度,并说明了在VC 6.0中测量程序运行时间的方法,使用这种方法给出了程序例子在优化前和优化后的运行时间的实验数据。  相似文献   

2.
本文给出了一种“双通道随机数据流的中断驻留接收技术方案”,详细描述了内存驻留中断接收、开设数据缓冲区、数据段地址保存、驻留/解除和数据缓冲区读取,讨论了高级语言程序信息处理,举出了该技术方案在“水泥生产线微机全自动配料测控系统”中应用的实例,介绍了调试方法和步骤,给出了汇编语言中断驻留接收源程序和高级语言读取数据缓冲区数据及调用源程序。  相似文献   

3.
源程序在线评测系统是一个基于网络的通用程序设计语言的自动评测系统,该系统为学生学习基本的程序设计语言提供了良好的训练平台,培养学生程序设计的兴趣,提高学生程序设计的能力。  相似文献   

4.
给出了一种“多通道随机数据流的中为驻留接收技术方案”,详细描述了内存驻留中断接收、开设数据缓冲区、数据段地址保存、驻留/解除和数据缓冲区读取,讨论了高级语言程序信息处理,举出了该技术方案在“水泥生产线微机全自动配为测控系统”中应用的实例,介绍了测试方法和步骤,给出了高级语言读取数据缓冲区数据及调用源程序  相似文献   

5.
本文首先例举了句长限制一定、训练语料不同的情况下,GIZA++运行中的一些数据和图表,其中包括对运行时间、内存等资源消耗量的统计;然后统计了句长限制不同但训练语料相同的情况下,GIZA++的运行数据。通过使用最小二乘法对这些数据进行函数拟合,对GIZA++的计算性能进行初步的预测分析。该方法可以在过程运行前大致估计出所消耗的资源量,从而避免在运行中出现由于资源不足而导致程序崩溃的情况。  相似文献   

6.
以一个屏幕图形随机存储程序为例,讨论用高级语言编写内存驻留程序的一般方法,并给出了TC++3.0源程序  相似文献   

7.
针对ACM国际大学生程序设计竞赛培训教学中程序评测的需求,开发程序在线测评系统。系统基于Apache服务器,采用PHP和MYSQL数据库技术运行于Windows Sever 2003平台。采用软件工程黑盒测试的思想对用户提交的程序进行测评,系统主要分为三个部分:网站部分,数据库部分及测评部分。数据库部分对系统提供数据存储支持;网站部分则是系统与用户的交互接口;测评部分则是对用户提交程序运行的主要控制部分,它将控制提交程序的运行时间以及内存,并对运行程序的结果进行判断。  相似文献   

8.
针对ACM国际大学生程序设计竞赛培训教学中程序评测的需求,开发程序在线测评系统。系统基于Apache服务器,采用PHP和MYSQL数据库技术运行于Windows Sever 2003平台。采用软件工程黑盒测试的思想对用户提交的程序进行测评,系统主要分为三个部分:网站部分,数据库部分及测评部分。数据库部分对系统提供数据存储支持;网站部分则是系统与用户的交互接口;测评部分则是对用户提交程序运行的主要控制部分,它将控制提交程序的运行时间以及内存,并对运行程序的结果进行判断。  相似文献   

9.
把程序运行n次的总时间除以n的方法不能用来测量程序的运行时间,可以通过访问机器的软件或硬件计数数器的方法来测量程序运行一次的时间。给出了在VC 6.0中,正确测量运行时间的程序段和程序实际运行的结果。对测量的误差进行了分析,指出了必须从测得的数据中剔除“ 坏数据“,在剔除后数据的误差可达微秒级。最后,指出了在处理8254计数值时的一个易犯的错误,还指出了对被测程序的运行时间需有一个限制。  相似文献   

10.
源程序分析的实质是程序的过程分析和数据分析,目的是提供一种程序阅读的方法,实现程序理解。方法是详细分析复杂程序的执行过程,关键语句的结构与功能,建立变量、数组、二维数组或者辅助数组3个层次的程序数据的处理架构,并且用数据行和一维数据集合表示。源程序分析的5个规范使过程分析和数据分析有章可循。程序的功能分析是更进一步的分析方法,发现源程序的具有不可分割性的功能块,以此建立程序的功能结构,掌握高级编程方法。  相似文献   

11.

In order to assess if productivity based on extrapolated data is a good predictor of longer texts, an experimental study was conducted. Two full-sized text input devices for touch typing and two miniaturized for tapping were used, all featuing QWERTY layout, in a repeated measurement design. Twenty subjects were exposed to both a task within the limit of working memory (nine words) and four running memory tasks (approx. 275 words). For miniaturized tapping keyboards, extrapolated data significantly underestimated both entry speed (uncorrected wpm, up to 17%) and character error rate (up to 61%) whereas it significantly overestimated ratio of correct words (up to 62%) of running memory tasks. Further, error-corrected entry speed was significantly overestimated up to a factor of 2.7. Results based on extrapolated productivity metrics must therefore be interpreted with caution. Running memory tasks with text length of more than 32 words is needed to assess productivity of text input devices if tapping is used.  相似文献   

12.
In order to assess if productivity based on extrapolated data is a good predictor of longer texts, an experimental study was conducted. Two full-sized text input devices for touch typing and two miniaturized for tapping were used, all featuing QWERTY layout, in a repeated measurement design. Twenty subjects were exposed to both a task within the limit of working memory (nine words) and four running memory tasks (approx. 275 words). For miniaturized tapping keyboards, extrapolated data significantly underestimated both entry speed (uncorrected wpm, up to 17%) and character error rate (up to 61%) whereas it significantly overestimated ratio of correct words (up to 62%) of running memory tasks. Further, error-corrected entry speed was significantly overestimated up to a factor of 2.7. Results based on extrapolated productivity metrics must therefore be interpreted with caution. Running memory tasks with text length of more than 32 words is needed to assess productivity of text input devices if tapping is used.  相似文献   

13.
在SCDMA接入系统的运行过程中,同时存在大量的用户鉴权、呼叫,对数据的访问实时性要求高。针对此情况,提出一种内存数据库的设计开发思路。通过哈希表的形式,把业务需要访问的数据和表加载到内存中,采用统一数据库接口的方式进行数据交互,实现内存与物理数据库之间的数据同步问题。该内存数据库已在上线的SCDMA接入系统中成功使用,其可靠性、安全性得到检验。  相似文献   

14.
阐述了Flash存储器在线编程的自烧写程序设计思想.被烧写目标文件作为数据嵌入到烧写程序中,经过编译链接生成最终的执行文件.运行烧写执行文件时,执行文件时将嵌入的目标数据烧写到Flash存储器中,从而实现在线或在系统编程.给出了相关程序的核心代码,并测试通过,可作为DSP嵌入式系统设计的参考.  相似文献   

15.
BIRCH: A New Data Clustering Algorithm and Its Applications   总被引:14,自引:0,他引:14  
Data clustering is an important technique for exploratory data analysis, and has been studied for several years. It has been shown to be useful in many practical domains such as data classification and image processing. Recently, there has been a growing emphasis on exploratory analysis of very large datasets to discover useful patterns and/or correlations among attributes. This is called data mining, and data clustering is regarded as a particular branch. However existing data clustering methods do not adequately address the problem of processing large datasets with a limited amount of resources (e.g., memory and cpu cycles). So as the dataset size increases, they do not scale up well in terms of memory requirement, running time, and result quality.In this paper, an efficient and scalable data clustering method is proposed, based on a new in-memory data structure called CF-tree, which serves as an in-memory summary of the data distribution. We have implemented it in a system called BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies), and studied its performance extensively in terms of memory requirements, running time, clustering quality, stability and scalability; we also compare it with other available methods. Finally, BIRCH is applied to solve two real-life problems: one is building an iterative and interactive pixel classification tool, and the other is generating the initial codebook for image compression.  相似文献   

16.
针对实时数据的在线处理问题,提出了一种基于Boosting的在线回归算法,通过对学习机适宜度置信区间的定义,建立了对概念漂移的实时判断方法,利用最新流入的数据块,及时对集成算法中的个体学习机进行逐一迭代更新,从而起到在线学习的效果。通过对标准数据库的数据建立仿真模型,验证这种在线回归算法可以与离线Boosting回归算法达到相似的精度,同时占用较少的存储记忆单元,提高学习速度,能够对学习机参数进行及时调整;该算法还可引入到工业生产中,对生产数据起到实时监控的作用。  相似文献   

17.
Operator scheduling in data stream systems   总被引:5,自引:0,他引:5  
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in such an environment must be prepared to deal gracefully with bursts in data arrival without compromising system performance. We discuss one strategy for processing bursty streams - adaptive, load-aware scheduling of query operators to minimize resource consumption during times of peak load. We show that the choice of an operator scheduling strategy can have significant impact on the runtime system memory usage as well as output latency. Our aim is to design a scheduling strategy that minimizes the maximum runtime system memory while maintaining the output latency within prespecified bounds. We first present Chain scheduling, an operator scheduling strategy for data stream systems that is near-optimal in minimizing runtime memory usage for any collection of single-stream queries involving selections, projections, and foreign-key joins with stored relations. Chain scheduling also performs well for queries with sliding-window joins over multiple streams and multiple queries of the above types. However, during bursts in input streams, when there is a buildup of unprocessed tuples, Chain scheduling may lead to high output latency. We study the online problem of minimizing maximum runtime memory, subject to a constraint on maximum latency. We present preliminary observations, negative results, and heuristics for this problem. A thorough experimental evaluation is provided where we demonstrate the potential benefits of Chain scheduling and its different variants, compare it with competing scheduling strategies, and validate our analytical conclusions.Received: 18 October 2003, Accepted: 16 April 2004, Published online: 14 September 2004Edited by: J. Gehrke and J. HellersteinBrian Babcock: Supported in part by a Rambus Corporation Stanford Graduate Fellowship and NSF Grant IIS-0118173.Shivnath Babu: Supported in part by NSF Grants IIS-0118173 and IIS-9817799.Mayur Datar: Supported in part by Siebel Scholarship and NSF Grant IIS-0118173.Rajeev Motwani: Supported in part by NSF Grant IIS-0118173, an Okawa Foundation Research Grant, an SNRC grant, and grants from Microsoft and Veritas.Dilys Thomas: Supported by NSF Grant EIA-0137761 and NSF ITR Award Number 0331640.  相似文献   

18.
单源最短路问题是算法研究中由来已久的一个问题,在算法领域早期已经得到了较好的解决,但是在应用计算机语言实现的过程中往往不够优化.导致较高的时间复杂度和空间复杂度。从原始的迪杰斯特拉算法入手,进行透彻分析,在算法思想和实现方式上提出一种全面优化的算法方案,并给出了核心代码。实现过程中使用了堆的数据结构,并在具体的实现过程中进行灵活的优化。经过理论的算法复杂度分析,以及实际的数据测试,都证明全新优化后地单源最短路算法计算耗时非常少,空间复杂度也得到很大程度的降低.应用价值更强。  相似文献   

19.
三相异步电机因其结构简单、维护方便、可靠性高等特点被广泛应用到工业生产中,所以保证三相异步电机在生产环境中的安全与稳定运行具有十分重要的意义;传统的三相异步电机故障诊断均采用特征电流法,但在实际应用中由于特征谐波难以分离,从而导致无法判断;采用先进的长短期记忆(LSTM)神经网络以及最新提出的RAdam优化器,在电机正常运转时对其运行特性进行实时采集,通过双峰谱线插值法以及滑窗法提取谐波之后,对电机输出结果进行时序预测和比对;最后以工程中实际电机数据为例,通过测量其故障运行实际数据,验证了该算法的可行性;经实验测试可得,相比于传统神经网络,该算法具有更好的故障检测能力。  相似文献   

20.
The Levenberg-Marquardt (LM) learning algorithm is a popular algorithm for training neural networks; however, for large neural networks, it becomes prohibitively expensive in terms of running time and memory requirements. The most time-critical step of the algorithm is the calculation of the Gauss-Newton matrix, which is formed by multiplying two large Jacobian matrices together. We propose a method that uses backpropagation to reduce the time of this matrix-matrix multiplication. This reduces the overall asymptotic running time of the LM algorithm by a factor of the order of the number of output nodes in the neural network.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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