达梦数据库Web服务技术研究

本文提出了一种将数据库同Web服务技术相结合的方法，一方面使得数据库可以将其存储的数据以Web服务的形式提供给外部使用，另一方面也可以在数据库内部直接使用SQL语句或存储过程调用外部的Web服务对数据进行处理或取得数据，该方法具有使得数据库能够不依赖应用程序而直接同Web服务进行交互的特点。     

给Word打造外部工具栏

我们平时在使用Word软件的过程中，时不时地要调用一些外部程序．如截图软件．通讯簿和计算器等。一般情况下．调用它们需要我们打开“开始”菜单或者回到桌面双击程序快捷图标——很繁琐，该怎么样才能最方便、快捷地访问这些外部工具呢？     

PPT幻灯片中调用视频文件和flash影片的方法

在PPT课件、电子教案或其他PPT作品运行过程中,经常需要随时切换到其他程序窗口来完成操作或调用外部应用程序如Flash动画、视频等以达到PowerPoint程序本身无法实现的效果和功能.本文总结三种PPT文件中调用视频文件和flash影片的常用方法.     

Oracle8i PL/SQL外部过程在海量数据处理中的应用

介绍了PL／SQL外部过程，给出了在C／S模式下利用外部过程编写和调用海理数据处理模块的方法。     

试析PowerPoint中Flash动画的合理接口

通过合理接口调用外部媒体，可以有效保证调用方不会因为被调用方的进入而在视觉效果上受到破坏。本文主要介绍了在PowerPoint中通过合理接口调用Flash动画的方法。     

Oracle数据库调用外部过程的方法与实现

PL/SQL 时是 Oracle 数据库中一个功能强大的工具,通过它可以实现面向事务的 SQL 处理,针对 oracle 数据库 PL/SQL 工具无法实现那些需要复杂计算和处理功能的情况,本文提出了一种在客户端对数据库访问即可调用数据库服务端程序的方法,这种方法可以减小网络开销和降低对客户端的要求。文中介绍了 Oracle 数据库对外部过程调用的机制,详细描述了外部过程的使用步骤,通过具体例子实现了在 Oracle 数据库内部调用存在于服务器的动态库或程序的过程。     

Turbo软件的图像映象格式与汉字显示

在Turbo Pascal或Turbo C的图形模式下显示汉字,通常采用描点方法。因此显示一个16＊16点阵的汉字,要循环调用256次PutPixel过程。为了更快地显示汉字,我们可以根据Turbo Pascal或Turbo C的图像映象格式,将汉字点阵转化成图像映象,然后调用Putlmage过程,一次可以显示一个或几个汉字,速度非常快。笔者将此方法用在友人的毕业设计软件中,效果很好。 笔者使用Turbo Pascal版本4.0和6.0,发现其图像映象格式与所使用的图形驱动器类型有关。在CGA     

Windows命令模式另类用法

正Windows命令的执行模式主要有两种。我们最常用的方法是选择菜单项目来完成命令的执行,虽然简捷方便但有时操作起来很绕弯,在老版本系统中调用过画笔或计算器程序,就会体会到这一点。还有一种方式是通过命令提示符窗口来完成,这种方式执行命令效率很高,只需输入几个简单的字符就可调用程序,但需要记住一些特征命令。对于命令提示符窗口,高版本的系统还有普通权限和管理员权限之分。但是大家可能已经注意到,调用某个文件夹     

程序调用外部进程

我们在自己的程序中有时需要调用外部进程或DOS外壳,这主要是因为:①该高级语言无法完成某项功能;②调用现有的外部进程比自己     

GCLISP对其他高级语言的调用方法

目前的GCLISP版本,对用其他高级语言编写的程序交互能力差,这对需要进行复杂计算或想直接调用其他高级语言编写的“标准程序”的用户造成了一定的困难。本文介绍了作者在使用GCLISP调用其他高级语言的一点体会,提出了用高级批处理的方法来解决这种联接调用。这对使用GCLISP的用户可能会有一定的启发。     

Are currency devaluations necessarily bad? New Keynesian arguments for intervention rather than monetarist orthodoxy

Traditional monetarist thinking argues that currency devaluations are counterproductive because they generate additional inflationary pressures. Expectations that future inflation will have to be accommodated undermine the credibility (and hence effectiveness) of current monetary policies. However, these arguments neglect the impact on activity levels and whether there is spare capacity. Hard (or contractionary) monetary policies in recession will cause an equal loss of credibility with investors and forward-looking consumers who will make their expenditures elsewhere. These are therefore circumstances when currency devaluation could be helpful, and without inflationary consequences if rising productivity and spare capacity offset import price rises. Moreover, devaluation within a currency bloc can leave the effective exchange rate unchanged if the bloc is rising against external currencies; while boosting demand at the same time if the within-bloc import/export elasticities are higher than those outside. This paper tests these arguments econo-metrically, and shows that the conditions for a successful Sterling devaluation did exist in 1992.     

多通道并行接口

本文所介绍的IBM个人计算机多通道并行接口，能够在仅占用IBM个人计算机一个插槽和一个中断源情况下，经500米以上长线同时管理、并行驱动5台外围设备（打印机或显示器等），它不仅扩展了IBM个人计算机的硬件功能，而且增强了可靠性和抗干扰能力，使IBM个个计算机系统能够在工业生产环境下传送和处理信息。     

A comparative study of Java and C performance in two large‐scale parallel applications

In the 1990s the Message Passing Interface Forum defined MPI bindings for Fortran, C, and C++. With the success of MPI these relatively conservative languages have continued to dominate in the parallel computing community. There are compelling arguments in favour of more modern languages like Java. These include portability, better runtime error checking, modularity, and multi‐threading. But these arguments have not converted many HPC programmers, perhaps due to the scarcity of full‐scale scientific Java codes, and the lack of evidence for performance competitive with C or Fortran. This paper tries to redress this situation by porting two scientific applications to Java. Both of these applications are parallelized using our thread‐safe Java messaging system—MPJ Express. The first application is the Gadget‐2 code, which is a massively parallel structure formation code for cosmological simulations. The second application uses the finite‐domain time‐difference method for simulations in the area of computational electromagnetics. We evaluate and compare the performance of the Java and C versions of these two scientific applications, and demonstrate that the Java codes can achieve performance comparable with legacy applications written in conventional HPC languages. Copyright © 2009 John Wiley & Sons, Ltd.     

A longitudinal experimental study on the interaction effects of persuasion quality, user training, and first-hand use on user perceptions of new information technology

While prior research has investigated the main effects of external factors on user perceptions of a new IT, little work has been into the interaction effect of external factors on user perceptions. In a longitudinal experimental study, we examined the effect of the quality of persuasive argument, user training, and first-hand use on user perceptions of the new technology over time. We found that the effect of argument quality on users’ perceived ease of use was greater when users had no training. However, we did not find the same effect occurred due to perceived usefulness. We also found that first-hand use changed users’ perceived usefulness more over time when users received high quality arguments or when they had no training. While we found that first-hand use changed users’ perceived ease of use more when users received high quality arguments, first-hand use did not change users’ perceived ease of use differently whether they had or had not received prior training.     

A Reasoning Model Based on the Production of Acceptable Arguments

Argumentation is a reasoning model based on the construction of arguments and counter-arguments (or defeaters) followed by the selection of the most acceptable of them. In this paper, we refine the argumentation framework proposed by Dung by taking into account preference relations between arguments in order to integrate two complementary points of view on the concept of acceptability: acceptability based on the existence of direct counter-arguments and acceptability based on the existence of defenders. An argument is thus acceptable if it is preferred to its direct defeaters or if it is defended against its defeaters. This also refines previous works by Prakken and Sartor, by associating with each argument a notion of strength, while these authors embed preferences in the definition of the defeat relation. We propose a revised proof theory in terms of AND/OR trees, verifying if a given argument is acceptable, which better reflects the dialectical form of argumentation.     

运用多层注意力神经网络识别中文隐式篇章关系

中文隐式篇章关系识别是一个具有挑战性的任务,其难点在于如何捕获论元的语义信息。该文提出了一个模拟人类双向阅读和重复阅读过程的三层注意力网络模型(TLAN)用于识别中文隐式篇章关系。首先,使用Self-Attention层对论元进行编码;然后,通过细粒度的Interactive Attention层模拟双向阅读过程以生成包含交互信息的论元表示,并且通过非线性变换获得论元对信息的外部记忆;最后,通过包含外部记忆的注意力层来模拟重复阅读过程,在论元对记忆的引导下生成论元的最终表示。在中文篇章树库(CDTB)上进行的隐式篇章关系识别实验结果显示,该文提出的模型TLAN在Micro-F1和Macro-F1上超过了多个基准模型。     

Remark on algorithm 24, regarding a very common violation of the Fortran standard

According to the Fortran standard, variables in a subprogram will become undefined at the execution of the RETURN statement, if they are not contained in the list of dummy arguments or in a common block.     

Input-to-state stability analysis for interconnected difference equations with delay

Input-to-state stability (ISS) of interconnected systems with each subsystem described by a difference equation subject to an external disturbance is considered. Furthermore, special attention is given to time delay, which gives rise to two relevant problems: (i) ISS of interconnected systems with interconnection delays, which arise in the paths connecting the subsystems, and (ii) ISS of interconnected systems with local delays, which arise in the dynamics of the subsystems. The fact that a difference equation with delay is equivalent to an interconnected system without delay is the crux of the proposed framework. Based on this fact and small-gain arguments, it is demonstrated that interconnection delays do not affect the stability of an interconnected system if a delay-independent small-gain condition holds. Furthermore, also using small-gain arguments, ISS for interconnected systems with local delays is established via the Razumikhin method as well as the Krasovskii approach. A combination of the results for interconnected systems with interconnection delays and local delays, respectively, provides a framework for ISS analysis of general interconnected systems with delay. Thus, a scalable ISS analysis method is obtained for large-scale interconnections of difference equations with delay.     

Algorithms and complexity results for persuasive argumentation

The study of arguments as abstract entities and their interaction as introduced by Dung (1995) [1] has become one of the most active research branches within Artificial Intelligence and Reasoning. A main issue for abstract argumentation systems is the selection of acceptable sets of arguments. Value-based argumentation, as introduced by Bench-Capon (2003) [8], extends Dung?s framework. It takes into account the relative strength of arguments with respect to some ranking representing an audience: an argument is subjectively accepted if it is accepted with respect to some audience, it is objectively accepted if it is accepted with respect to all audiences.Deciding whether an argument is subjectively or objectively accepted, respectively, are computationally intractable problems. In fact, the problems remain intractable under structural restrictions that render the main computational problems for non-value-based argumentation systems tractable. In this paper we identify nontrivial classes of value-based argumentation systems for which the acceptance problems are polynomial-time tractable. The classes are defined by means of structural restrictions in terms of the underlying graphical structure of the value-based system. Furthermore we show that the acceptance problems are intractable for two classes of value-based systems that where conjectured to be tractable by Dunne (2007) [12].     

A Reductio of Kripke-Wittgenstein's Objections to Dispositionalism about Meaning

A central part of Kripke's influential interpretation of Wittgenstein's sceptical argument about meaning is the rejection of dispositional analyses of what it is for a word to mean what it does (Kripke, 1982). In this paper I show that Kripke's arguments prove too much: if they were right, they would preclude not only the idea that dispositional properties can make statements about the meanings of words true, but also the idea that dispositional properties can make true statements about paradigmatic dispositional properties such as a cup's fragility or a person's bravery. However, since dispositional properties can make such statements true, Kripke-Wittgenstein's arguments against dispositionalism about meaning are mistaken.