CIMS设计过程中存在的一些问题及解决方案

提出了一种新的集成的I2 DEF方法 ,并介绍了与之配套的设计开发工具 ,用以支持大型复杂信息系统的设计与开发 ,它可以成功地解决计算机集成制造系统设计开发过程中遇到的许多问题。本文指出了我国CIMS工程存在的问题 ,分析了这些问题产生的原因 ,并结合企业实际给出了应用I2 DEF方法的解决方案。

对象互操作的行为模型

对象互操作表达了一组对象在完成某一任务时的动态协作关系，对象互操作的行为描述与抽象是支持面向应用对象互操作的基础．对此，提出一种活动模型作为描述对象互操作行为的方法．该方法以一阶时态逻辑为基础，表达了互操作对象之间交换消息的时态顺序和不同活动之间的行为关系．在该方法中，提出了活动特化和活动聚合两种行为抽象机制，实现了对象互操作行为的复用．最后讨论了给定论域的类模式和活动模式的一致性集成问题。

EDI在CIMS中的应用技术研究

本文在分析了ＥＤＩ与ＣＩＭＳ系统集成的重要性后，提出了用面向报文的方法来组织和实施该项集成过程，然后对该过程中所涉及到的有关技术，包括信息提取、平文件映射和翻译方法等进行了分析，并用基于表格的方法建立平文件模式和映射参考文件，从而有效地实现了ＥＤＩ与ＣＩＭＳ系统的有机集成

MSMQ和.Net Remoting在MES开发中的应用

在.Net平台下,基于MSMQ和.Net Remoting构建MES系统中生产事件消息通信机制,利用MSMQ实现生产事件的消息传递,利用.Net Remoting实现生产事件的订阅,有效解决了以往开发应用中遇到的问题,提高了系统的可靠性和灵活性。

基于中间件的MES与ERP系统信息集成技术研究

现在企业系统与控制系统的主流的集成技术为基于中间件的系统集成,即通过中间件的桥梁作用把各种ERP和MES系统连接起来,实现信息在两者之间的交互与共享。因此本文提出“信息集成内容遵循S95标准,消息封装格式应用XML技术,企业应用集成平台采用BizTalkserver来实现”的中间件集成方法,最后应用此中间件引擎给出了一个在MES与ERP系统之间实现信息集成的示例。

基于匹配追踪方法的地震信号时频分析研究

Seismic signal is a typical non-stationary signal, whose frequency is continuously changing with time and is determined by the bandwidth of seismic source and the absorption characteristic of the media underground. The most interesting target of seismic signal’s processing and explaining is to know about the local frequency’s abrupt changing with the time, since this kind of abrupt changing is indicating the changing of the physical attributes of the media underground. As to the seismic signal’s instantaneous attributes taken from time-frequency domain, the key target is to search a effective, non-negative and fast algorithm time-frequency distribution, and transform the seismic signal into this time-frequency domain to get its instantaneous power spectrum density, and then use the process of weighted adding and average etc. to get the instantaneous attributes of seismic signal. Time-frequency analysis as a powerful tool to deal with time variant non-stationary signal is becoming a hot researching spot of modern signal processing, and also is an important method to make seismic signal’s attributes analysis. This kind of method provides joint distribution message about time domain and frequency domain, and it clearly plots the correlation of signal’s frequency changing with the time. The spectrum decomposition technique makes seismic signal’s resolving rate reach its theoretical level, and by the method of all frequency scanning and imaging the three dimensional seismic data in frequency domain, it improves and promotes the resolving abilities of seismic signal vs. geological abnormal objects. Matching pursuits method is an important way to realize signal’s self-adaptive decomposition. Its main thought is that any signal can be expressed by a series of time-frequency atoms’ linear composition. By decomposition the signal within an over completed library, the time-frequency atoms which stand for the signal itself are selected neatly and self-adaptively according to the signal’s characteristics. This method has excellent sparse decomposition characteristics, and is widely used in signal de-noising, signal coding and pattern recognizing processing and is also adaptive to seismic signal’s decomposition and attributes analysis. This paper takes matching pursuits method as the key research object. As introducing the principle and implementation techniques of matching pursuits method systematically, it researches deeply the pivotal problems of atom type’s selection, the atom dictionary’s discrete, and the most matching atom’s searching algorithm, and at the same time, applying this matching pursuits method into seismic signal’s processing by picking-up correlative instantaneous messages from time-frequency analysis and spectrum decomposition to the seismic signal. Based on the research of the theory and its correlative model examination of the adaptively signal decomposition with matching pursuit method, this paper proposes a fast optimal matching time-frequency atom’s searching algorithm aimed at seismic signal’s decomposition by frequency-dominated pursuit method and this makes the MP method pertinence to seismic signal’s processing. Upon the research of optimal Gabor atom’s fast searching and matching algorithm, this paper proposes global optimal searching method using Simulated Annealing Algorithm, Genetic Algorithm and composed Simulated Annealing and Genetic Algorithm, so as to provide another way to implement fast matching pursuit method. At the same time, aimed at the characteristics of seismic signal, this paper proposes a fast matching atom’s searching algorithm by means of designating the max energy points of complex seismic signal, searching for the most optimal atom in the neighbor area of these points according to its instantaneous frequency and instantaneous phase, and this promotes the calculating efficiency of seismic signal’s matching pursuit algorithm. According to these methods proposed above, this paper implements them by programmed calculation, compares them with some open algorithm and proves this paper’s conclusions. It also testifies the active results of various methods by the processing of actual signals. The problems need to be solved further and the aftertime researching targets are as follows: continuously seeking for more efficient fast matching pursuit algorithm and expanding its application range, and also study the actual usage of matching pursuit method.

DAS24-3B数据采集系统控制系统软件的研制与开发

Under the auspices of the 'knowledge-Innovation Program' of CAS, Institute of Geology and Geophysics has established the Broadband Seismic Laboratory. A new kind of 24-bit high-resolution seismograph DAS24-3B has been designed and manufactured in an effort of developing China's own technology of seismic array. Since these instruments will primarily be used in field operation, there is a need to optimize the system software of data acquisition system (DAS) to enhance its stability, compatibility and maintenance. The design ideas of the system software of DAS24-3B are partly learned from the advanced DAS 72A-08. In this system there are two exclusive communication programs DNAPI-COM1 and DNAPI-LPT1, which are suitable for all standard industrial computers with ECP parallel port and serial port. By these exclusive parallel and serial communication interface the system software is split into three parts, acquisition program, user's control program and graphical display program, which can function well in separate units and can run correctly in whole. The three parts of DAS24-3B's system software possess different functions and advantages. The function of acquisition program is to control the process of seismic data acquisition. DAS24-3B system reduced its power and harddisk read-write disturbance by using the extended memory attached to its CPU, which functions as enlarging the data buffer of system and lessening the times of harddisk read-write operations. Since GPS receiver of DAS is strongly sensitive to the around environment and has the possibility of signal loss the acquisition program has been designed with the ability to automatically trail the GPS locked time. The function of user's controlling program is to configure the system's work environment, to inform the user's commands to DAS, to trail the status of DAS in real-time. The function of graphical display program is to illustrate data in figures, to convert data file into some common formatted file, to split data file in parts and combine data files into one. Both user's control program and graphical display program are API (Application Programming Interface) in window 95/98 system. Both possess the features of clearness and friendship by use of all kind of window controls, which are composed by menu, toolbar, statusbar, dialogue box, message box, edit box, scrollbar, time control, button and so on. Two programs of systemic exception handles are provided to treat the trouble in field. The DAS24-3B DAS has been designed to be easier to use-better ability, more stable and simpler. It has been tested in field and base station and has been proved more suitable for field operation of seismic array than other native instruments.

内容预警对说服的影响

There are still some controversies surrounding the effects of forewarning of message content on persuasion and the mediating mechanism operating when persons are forwarned of message content on high involvement. Two experiments were designed to investigate these questionable points. It was found: 1. The effects of a warning on persuasion depends on the extent of involvement. Subjects who were highly involved in the topic showed resistance to persuasion. 2. However, forewarning have different effects on persuasion in the low-involvement condition according to some sub-variables (such as commitment, self -presentation motive, etc.). 3. The mechanism mediating the resistance to persuasion conveyed by a warning concerning the content of an impending discrepand communication on a highly involving topic is very complicated. The experiments indicated that anticipatory counterargument is a typical cognitive response, besides, source degoration and "tubborn refusal to give in" are also usually found.

The Behavior Language; User's Guide

The Behavior Language is a rule-based real-time parallel robot programming language originally based on ideas from [Brooks 86], [Connell 89], and [Maes 89]. It compiles into a modified and extended version of the subsumption architecture [Brooks 86] and thus has backends for a number of processors including the Motorola 68000 and 68HCll, the Hitachi 6301, and Common Lisp. Behaviors are groups of rules which are activatable by a number of different schemes. There are no shared data structures across behaviors, but instead all communication is by explicit message passing. All rules are assumed to run in parallel and asynchronously. It includes the earlier notions of inhibition and suppression, along with a number of mechanisms for spreading of activation.

Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths

The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant paths, they are not inherently fault-tolerant, and so their use in large-scale multiprocessors is problematic. Unfortunately, the addition of multiple paths between message sources and sinks in a network complicates the calculation of blocking probabilities. A methodology for exact calculation of blocking probabilities for small networks with redundant paths is presented here, with some discussion of its potential use in approximating blocking probabilities for large networks with redundant paths.

The M-Machine Multicomputer

The M-Machine is an experimental multicomputer being developed to test architectural concepts motivated by the constraints of modern semiconductor technology and the demands of programming systems. The M- Machine computing nodes are connected with a 3-D mesh network; each node is a multithreaded processor incorporating 12 function units, on-chip cache, and local memory. The multiple function units are used to exploit both instruction-level and thread-level parallelism. A user accessible message passing system yields fast communication and synchronization between nodes. Rapid access to remote memory is provided transparently to the user with a combination of hardware and software mechanisms. This paper presents the architecture of the M-Machine and describes how its mechanisms maximize both single thread performance and overall system throughput.

MIT SchMUSE: Class-Based Remote Delegation in a Capricious Distributed Environment

MIT SchMUSE (pronounced "shmooz") is a concurrent, distributed, delegation-based object-oriented interactive environment with persistent storage. It is designed to run in a "capricious" network environment, where servers can migrate from site to site and can regularly become unavailable. Our design introduces a new form of unique identifiers called "globally unique tickets" that provide globally unique time/space stamps for objects and classes without being location specific. Object location is achieved by a distributed hierarchical lazy lookup mechanism that we call "realm resolution." We also introduce a novel mechanism called "message deferral" for enhanced reliability in the face of remote delegation. We conclude with a comparison to related work and a projection of future work on MIT SchMUSE.

Revised Report on the Algorithmic Language Scheme

Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the Lambda Order they are all first-class. One thing to name them all, one things to define them, one thing to place them in environments and bind them, in the Lambda Order they are all first-class. Keywords: Scheme, Lisp, functional programming, computer languages.

Probabilistic Analysis of Multistage Interconnection Network Performance

We present methods of calculating the value of two performance parameters for multipath, multistage interconnection networks: the normalized throughput and the probability of successful message transmission. We develop a set of exact equations for the loading probability mass functions of network channels and a program for solving them exactly. We also develop a Monte Carlo method for approxmiate solution of the equations, and show that the resulting approximation method will always calculate the values of the performance parameters more quickly than direct simulation.

Reliable Interconnection Networks for Parallel Computers

This technical report describes a new protocol, the Unique Token Protocol, for reliable message communication. This protocol eliminates the need for end-to-end acknowledgments and minimizes the communication effort when no dynamic errors occur. Various properties of end-to-end protocols are presented. The unique token protocol solves the associated problems. It eliminates source buffering by maintaining in the network at least two copies of a message. A token is used to decide if a message was delivered to the destination exactly once. This technical report also presents a possible implementation of the protocol in a worm-hole routed, 3-D mesh network.