一种电话语音卡系统软件平台的设计与实现

介绍一种基于虚拟设备驱动程序（ＶｘＤ）的电话语音卡系统软件平台的设计方法,并探讨了电话语音卡系统软件平台未来的发展方向。     

一种电话语音卡系统软件平台的设计与实现

本文主要介绍一种基于虚拟设备驱动程序（ＶｘＤ）的电话语音卡系统软件平台的设计方法,并探讨了电话语音卡系统软件平台未来的发展方向。     

多数据库声讯服务系统

文章利用基于Ｄｉａｌｏｇｉｃ电话语音卡的软件开发平台,实现了一个电话访问文本文件、查询数据库信息的声讯系统。     

基于TAPI的3G应用开发

详细讨论了基于Mobile平台的TAPI 2.0应用开发过程,包括线路初始化、打开线路设备、电话呼叫、挂断电话以及最后的线路拆除过程。     

基于Linux—Java的新一代智能电话软件平台的研究

文章对新一代智能电话软件开发平台进行了分析，结合移动通讯的发展趋势，论证了基于Linux-Java技术构建新一代智能电话软件平台的可行性及技术方案。     

基于S3C2410智能手机电话短信功能的开发应用

采用应用处理器+基带处理器的系统设计方案,以S3C2410为应用处理器、SIM300C为基带处理器设计了一款智能手机.给出了智能手机的硬件结构及系统软件平台的搭建与设计方法,结合GSM/GPRS无线通信模块的电话短信功能,在嵌入式Linux操作系统平台上开发了基于Qtopia平台的电话短信程序.     

Android平台智能防火墙系统的设计与实现

近年来,随着智能手机的普通,智能手机的安全领域越来越受到人们的关注。作为市场占有率第一的移动平台操作系统,Android用户同样面临了很多的安全方面的威胁。本文针对用户日常生活中受到的垃圾短信、电话的骚扰,重点研究短信、电话屏蔽的相关技术,设计并实现了一种基于黑白名单的Android平台智能防火墙系统。     

基于SIP及WebSocket的VoIP电话呼叫技术

为了实现VoIP与业务能力的结合,实现基于VoIP软电话的呼叫中心平台能力,提出了通过WebSocket、SIP协议和FreeSWITCH的技术结合,打造IP-PBX[1]交换机方式的VoIP呼叫中心平台方案,来替代传统的基于电路的呼叫中心平台系统,从而在不影响呼叫中心功能的情况下实现系统的灵活部署、低廉成本等优势。     

基于用户行为分析的诈骗电话识别

本文的研究目的是提高诈骗电话的识别率和识别准确性.基于大数据平台采集用户通话行为、上网行为等通信过程数据,结合用户基本属性、手机终端信息等进行综合分析,并采用合适的识别算法进行机器学习建立识别模型,能更好的发现诈骗电话与普通电话的内在差异,相比传统基于呼叫行为的分析,能有效提高骚扰诈骗电话识别的准确度和覆盖率,降低漏判、减少误判.经实际数据验证,对诈骗电话识别效果有明显提升,可作为诈骗电话识别的一种新的技术选择.     

基于PXA270的嵌入式SIP电话的设计与实现

SIP电话具有广泛的应用前景,开发便携式的SIP电话终端有非常重要的研究意义和使用价值.目前SIP电话有软件SIP电话与硬件SIP电话两种实现方式.针对现有软件SIP电话依赖PC机终端的缺点和硬件SIP电话的网关价格昂贵不易普及的问题,将软件SIP电话移植到PXA270嵌入式平台,完成了软件SIP电话与嵌入式系统的结合,实现了基于PXA270的嵌入式SIP电话终端.嵌入式SIP电话终端能够解决现有SIP电话依赖PC终端和电话网关的问题,且体积小、接入方便,易于普及应用.     

基于AOV网的应用程序构建模型研究

消灭“软件遗产工程”,实现软件的“自由动态修改维护”,是软件工程学面临的一大难题,至今尚未彻底解决。文中提出一种新的应用程序的构建模型—“AOV网模型”(modelofActivityOnVertexnetwork),即用AOV网描述应用程序的拓扑结构,用脚本语言构造AOV描述文件,利用事件驱动机制,通过周游AOV网,控制调度程序的运行。使程序的功能流程完全由可编辑的AOV描述文件确定,实现了软件的完全、自由意义上动态修改、维护特性。解决了可执行软件像铁板一块,不可改变和重用等弊端。作为构建模型的应用,给出了“语音服务系统”的设计与实现。     

自动声讯系统中数字汉语发音规律的研究与实现

自动声讯系统中经常遇到语音报数功能，据此，深入分析了数字汉语发音规律，总结编制由算法框图，对基于VC 和Dialogic语音卞若干开发要点进行探讨，并在多个工程项目中应用。     

The expressiveness of locally stratified programs

This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be defined by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model). This is an optimal result, since the perfect model of a locally stratified program is itself an implicitly definable hyperarithmetic set (under a recursive coding of the Herbrand base); hence, to obtain all hyperarithmetic sets requires something new, in this case selecting one predicate from the model. We find that the expressive power of programs does not increase when one considers the programs which have a unique stable model or a total well-founded model. This shows that all these classes of structures (perfect models of logically stratified logic programs, well-founded models which turn out to be total, and stable models of programs possessing a unique stable model) are all closely connected with Kleene's hyperarithmetical hierarchy. Thus, for general logic programming, negation with respect to two-valued logic is related to the hyperarithmetic hierarchy in the same way as Horn logic is to the class of recursively enumerable sets. In particular, a set is definable in the well-founded semantics by a programP whose well-founded partial model is total iff it is hyperarithmetic.Research partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by NSF Grant IRI-9012902 and partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by NSF Grant IRI-8905166 and partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.     

一种基于关键路径分析的CPU-GPU异构系统综合能耗优化方法

GPU强大的计算性能使得CPU-GPU异构体系结构成为高性能计算领域热点研究方向.虽然GPU的性能/功耗比较高,但在构建大规模计算系统时,功耗问题仍然是限制系统运行的关键因素之一.现在已有的针对GPU的功耗优化研究主要关注如何降低GPU本身的功耗,而没有将CPU和GPU作为一个整体进行综合考虑.文中深入分析了CUDA程序在CPU-GPU异构系统上的运行特点,归纳其中的任务依赖关系,给出了使用AOV网表示程序执行过程的方法,并在此基础上分析程序运行的关键路径,找出程序中可以进行能耗优化的部分,并求解相应的频率调节幅度,在保持程序性能不变的前提下最小化程序的整体能量消耗.     

Sequential and jumping machines and their relation to computers

Summary We consider sequential and jumping machines as generalized computers, and note that complexity bounds on internal operations are required to distinguish the two classes. We then place these notions, as well as tesselation automata, in the framework of a general definition of parallel stored program machines.Research supported in part by the U.S. Army Research Office, Durham, under Grant No. DAHC 04-07-C-0043.     

The uniform beam

The development and use of a minicomputer-based interactive graphics program for a uniform beam arbitrarily loaded and arbitrarily supported. The program uses the linear stiffness matrix technique to solve for the reactions, bending moments, shear stress and deflection in the beam and supports. At University College London the program is implemented in FORTRAN on a PDP 11/40 using a VT 11 display. Interactively loading, supporting, changing the characteristics of the beam is accomplished using a light pen. At the U.S. Naval Academy the program is implemented in FORTRAN on a PDP 11/45 with an Evans and Sutherland Picture System. Interactively loading, supporting, changing the characteristics of the beam is accomplished using an analog tablet. The stiffness matrix analysis subroutine is the same in the two implementations; the graphics is, of course, similar in concept but different in implementation. In both cases the programs are educationally oriented. At UCL the program is presently being used with first and second year students. At the U.S. Naval Academy the program is used in Strength of Materials at the sophomore/junior level.     

基于AOV图存储PLC梯形图的方法

提出一种直接以AOV(Activity On Vertex)图存储PLC(Programmable Logic Controller)梯形图的方法。编辑梯形图的同时,修改AOV图,然后根据AOV图的拓扑结构更新梯形图图符坐标,最后进行绘制显示。该方法无需进行梯形图向AOV图的转换,通过操作规则的约束来替代语法的检查,使梯形图的编辑更加便捷和规范。详细介绍了AOV图的编辑过程和坐标的更新算法。对AOV图向二叉树的转换算法进行修改,使其能适应于所有AOV图,并给出了相应的实例。     

LAOV网络及其拓扑排序算法

针对网格工作流调度、生产和施工计划的制订等领域的特殊需求,引入了一类顶点带层次的AOV网络-LAOV网络。本文对AOV网络、层次、LAOV网络进行了严格的定义,并对顶点层次取值的几种情形作了详细的讨论。然后针对其中一种合理情形的LAOV网络提出了拓扑排序算法,讨论了栈或队列的选择、有向回路的判定等问题,并分析了算法的复杂度。最后对LAOV网络及拓扑排序算法进行实验分析。因为算法输出的解不唯一,在实验分析时设计了评判程序对算法输出进行验证。实验分析结果表明算法是正确的,时空效率也比较好。     

The problem of naming and function replacement

This article is the twenty-eighth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria that an automated reasoning program can profitably use to remove functions present in the representation and replace them with appropriate predicates or constants thatname the entities that werenamed by the functions. The notation used to present a problem to a reasoning program can have a profound effect on the likelihood of the program's success.This work was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

An automated reasoning problem associated with proving claims about programs using Floyd-Hoare inductive assertion methods

Proving claims about behavior of software is essential for the qualification of computer-based systems used in the control of nuclear reactors. For this Problem Corner, we select one of the verification conditions for a C program that initializes an array to zero. We add assertions about the initial conditions and state of the program and about the expected behavior of the program in terms of its state. The modeling and specification technique is the inductive assertion technique of Floyd-Hoare. The program with assertions is then transformed by the source-to-source program transformation system TAMPR into a set of separate verification conditions to be proven by the automated reasoning system. Our experience with this program demonstrates the typical automated reasoning problems we have encountered and illustrates how we have approached solutions to the problems.Work supported by the Civilian Reactor Development Program and the Applied Mathematical Sciences Research subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract No. W-31-109-ENG-38.