C代码API一致性检验中的等值分析

在实际中对C代码进行API一致性检验的过程中发现，API(application programming interface)规范大都涉及以数值为论域的时序性质与在静态分析过程中所能获取的以变量符号为占位符的独立语义之间存在分析上的缺口．在仔细考察c代码变量符号间等值关系的基础上，给出基于值等价类空间的等值分析方法．这种流相关的分析方法不仅可以在API一致性检验的过程中维护变量符号域和数值域之间的对应关系，而且由于能够屏蔽等值关系以外的其他信息，还可以为后继分析的优化提供有力的支持．

smoothing document language model with local word graph

ACM SIGIR; ACM SIGWEB

基于WinSock API局域网通信的应用与实现

介绍了Winsock API(Windows Sockets API)通信原理,讨论了Winsock API实现异步通信的具体方法,以及解决多客户端的连接技术,最后给出了相应的关键性程序代码。

The hydrogen permeation investigation of API X56 steel in sea mud

It was found that the corrosion rate of steel in the sea mud with sulfate-reducing bacteria (SRB) could be as high as 10 times of that in the sea mud without SRB. And the hydrogen permeation reaction would occur when metals were corroded. So it is necessary to investigate the effect of living SRB on hydrogen permeation in the sea mud. Cathodic potential was often added to metals in order to protect them. But hydrogen permeation could be affected by the cathodic potential. So it is also necessary to study the effect of cathodic potential on hydrogen permeation. In this paper, the hydrogen permeation actions of APT X56 steel in the sea mud with and without SRB at corrosion and cathodic potential were studied with an improved Devanathan-Stachurski's electrolytic cell. Experimental results showed that during the growth of SRB, the current density curve of hydrogen permeation was accordant with the growth curve of SRB. But the hydrogen permeation current density of APT X56 steel hardly changed in the sterilized sea mud. Compared with the hydrogen permeation current density of APT X56 steel in the sterilized sea mud, the hydrogen permeation of APT X56 steel in the sea mud could be accelerated by living SRB. Experimental results also showed that the hydrogen permeation current density increased rapidly when the cathodic potential was added to the three-electrode system of the cathodic cell, and then the hydrogen permeation current density could obtain a stable value slowly. So the cathodic potential added to the cathodic cell could accelerate hydrogen permeation.

Automated Program Recognition by Graph Parsing

Recognizing standard computational structures (cliches) in a program can help an experienced programmer understand the program. We develop a graph parsing approach to automating program recognition in which programs and cliches are represented in an attributed graph grammar formalism and recognition is achieved by graph parsing. In studying this approach, we evaluate our representation's ability to suppress many common forms of variation which hinder recognition. We investigate the expressiveness of our graph grammar formalism for capturing programming cliches. We empirically and analytically study the computational cost of our recognition approach with respect to two medium-sized, real-world simulator programs.

Utilizando a API HTTPUnit no Sistema Agritempo.

Este trabalho apresenta o uso da API HTTPUnit para recuperar dados de previsão do tempo utilizados na geração dos mapas a partir do site www.somarmeteorologia.com.br

The Use of Graph Grammars for Model-based Reasoning in Diagnostic Expert Systems

Flasinski M. and Lee M.H., The Use of Graph Grammars for Model-based Reasoning in Diagnostic Expert Systems, Prace Informatyczne, Zeszyty Naukowe Uniwersytetu Jagiellonskiego, 9, 1999, pp147-165.

itmBench: Generalized API for Internet Traffic Managers

Internet Traffic Managers (ITMs) are special machines placed at strategic places in the Internet. itmBench is an interface that allows users (e.g. network managers, service providers, or experimental researchers) to register different traffic control functionalities to run on one ITM or an overlay of ITMs. Thus itmBench offers a tool that is extensible and powerful yet easy to maintain. ITM traffic control applications could be developed either using a kernel API so they run in kernel space, or using a user-space API so they run in user space. We demonstrate the flexibility of itmBench by showing the implementation of both a kernel module that provides a differentiated network service, and a user-space module that provides an overlay routing service. Our itmBench Linux-based prototype is free software and can be obtained from http://www.cs.bu.edu/groups/itm/.

PeriScope: An Active Internet Probing and Measurement API

Growing interest in inference and prediction of network characteristics is justified by its importance for a variety of network-aware applications. One widely adopted strategy to characterize network conditions relies on active, end-to-end probing of the network. Active end-to-end probing techniques differ in (1) the structural composition of the probes they use (e.g., number and size of packets, the destination of various packets, the protocols used, etc.), (2) the entity making the measurements (e.g. sender vs. receiver), and (3) the techniques used to combine measurements in order to infer specific metrics of interest. In this paper, we present Periscope: a Linux API that enables the definition of new probing structures and inference techniques from user space through a flexible interface. PeriScope requires no support from clients beyond the ability to respond to ICMP ECHO REQUESTs and is designed to minimize user/kernel crossings and to ensure various constraints (e.g., back-to-back packet transmissions, fine-grained timing measurements) We show how to use Periscope for two different probing purposes, namely the measurement of shared packet losses between pairs of endpoints and for the measurement of subpath bandwidth. Results from Internet experiments for both of these goals are also presented.

Graph Wavelets for Spatial Traffic Analysis

A number of problems in network operations and engineering call for new methods of traffic analysis. While most existing traffic analysis methods are fundamentally temporal, there is a clear need for the analysis of traffic across multiple network links — that is, for spatial traffic analysis. In this paper we give examples of problems that can be addressed via spatial traffic analysis. We then propose a formal approach to spatial traffic analysis based on the wavelet transform. Our approach (graph wavelets) generalizes the traditional wavelet transform so that it can be applied to data elements connected via an arbitrary graph topology. We explore the necessary and desirable properties of this approach and consider some of its possible realizations. We then apply graph wavelets to measurements from an operating network. Our results show that graph wavelets are very useful for our motivating problems; for example, they can be used to form highly summarized views of an entire network's traffic load, to gain insight into a network's global traffic response to a link failure, and to localize the extent of a failure event within the network.

Isoperimetric Graph Partitioning for Data Clustering and Image Segmentation

Spectral methods of graph partitioning have been shown to provide a powerful approach to the image segmentation problem. In this paper, we adopt a different approach, based on estimating the isoperimetric constant of an image graph. Our algorithm produces the high quality segmentations and data clustering of spectral methods, but with improved speed and stability.

Isoperimetric Partitioning: A New Algorithm for Graph Partitioning

Temporal structure is skilled, fluent action exists at several nested levels. At the largest scale considered here, short sequences of actions that are planned collectively in prefronatal cortex appear to be queued for performance by a cyclic competitive process that operates in concert with a parallel analog representation that implicitly specifies the relative priority of elements of the sequence. At an intermediate scale, single acts, like reaching to grasp, depend on coordinated scaling of the rates at which many muscles shorten or lengthen in parallel. To ensure success of acts such as catching an approaching ball, such parallel rate scaling, which appears to be one function of the basal ganglia, must be coupled to perceptual variables such as time-to-contact. At a finer scale, within each act, desired rate scaling can be realized only if precisely timed muscle activations first accelerate and then decelerate the limbs, to ensure that muscle length changes do not under- or over- shoot the amounts needed for precise acts. Each context of action may require a different timed muscle activation pattern than similar contexts. Because context differences that require different treatment cannot be known in advance, a formidable adaptive engine-the cerebellum-is needed to amplify differences within, and continuosly search, a vast parallel signal flow, in order to discover contextual "leading indicators" of when to generate distinctive patterns of analog signals. From some parts of the cerebellum, such signals control muscles. But a recent model shows how the lateral cerebellum may serve the competitive queuing system (frontal cortex) as a repository of quickly accessed long-term sequence memories. Thus different parts of the cerebellum may use the same adaptive engine design to serve the lowest and highest of the three levels of temporal structure treated. If so, no one-to-one mapping exists between leveels of temporal structure and major parts of the brain. Finally, recent data cast doubt on network-delay models of cerebellar adaptive timing.