The effect of presynaptic inhibition in switching neurostructures

A presynaptic inhibition function is described based on the language of Boolean algebra. A Fibonacci neuron is adduced as the equivalent of the sequential composition of such functions. Effective implementations of logic circuits are proposed. Affine transformations of necessary arguments are determined by Walsh spectral representations. The complexity of switching neural networks with dual neurons is analyzed.     

自控网系统的仿真分析与硬件实现的研究

自控网系统是Petri网的一个子类,与P/T系统相比,有更强的描述能力和更复杂的性质。由于它的非线性关系,无法直接套用其它网系统的分析技术,影响了对它的研究。文章提出了用硬件描述语言对自控网系统进行描述,通过EDA工具进行仿真分析,揭示系统的性质。文章针对计算Fibonacci数列的自控网系统模型,详细介绍了这一方法,给出了ABEL语言源代码和仿真波形,源代码经编译、优化、适配并下载到在系统可编程逻辑器件中,得到了计算Fibonacci数列的专用芯片,这为自控网系统的分析和应用研究开辟了新的途径。     

Extended Fibonacci Cubes

The Fibonacci Cube is an interconnection network that possesses many desirable properties that are important in network design and application. The Fibonacci Cube can efficiently emulate many hypercube algorithms and uses fewer links than the comparable hypercube, while its size does not increase as fast as the hypercube. However, most Fibonacci Cubes (more than 2/3 of all) are not Hamiltonian. In this paper, we propose an Extended Fibonacci Cube (EFC₁) with an even number of nodes. It is defined based on the same sequence F(i)=F(i-1)+F(i-2) as the regular Fibonacci sequence; however, its initial conditions are different. We show that the Extended Fibonacci Cube includes the Fibonacci Cube as a subgraph and maintains its sparsity property. In addition, it is Hamiltonian and is better in emulating other topologies. Specifically, the Extended Fibonacci Cube can embed binary trees more efficiently than the regular Fibonacci Cube and is almost as efficient as the hypercube, even though the Extended Fibonacci Cube is a much sparser network than the hypercube. We also propose a series of Extended Fibonacci Cubes with even number of nodes. Any Extended Fibonacci Cube (EFC_k, with k⩾) in the series contains the node set of any other cube that precedes EFC_k in the series. We show that any Extended Fibonacci Cube maintains virtually all the desirable properties of the Fibonacci Cube. The EFC_ks can be considered as flexible versions of incomplete hypercubes, which eliminates their restriction on the number of nodes, and, thus, makes it possible to construct parallel machines with arbitrary sizes     

一种基于Petri网原理的数据流模型研究

数据是系统信息资源的主要表现形式,在信息系统的系统设计和系统分析过程中,数据流建模是一个不可缺少的核心环节。从分析数据资源的特点出发,重点介绍了一种基于Petri网原理的新型的数据流程建模方法——数据流Petri网（DSPN）,给出了数据流Petri网模型的形式化定义和图形表示,并以求解裴波那契数列第n项数值为例,详细说明了数据流Petri网模型在数据流程建模上的表达能力和建模特点。     

Morphology-based language modeling for conversational Arabic speech recognition

Language modeling for large-vocabulary conversational Arabic speech recognition is faced with the problem of the complex morphology of Arabic, which increases the perplexity and out-of-vocabulary rate. This problem is compounded by the enormous dialectal variability and differences between spoken and written language. In this paper, we investigate improvements in Arabic language modeling by developing various morphology-based language models. We present four different approaches to morphology-based language modeling, including a novel technique called factored language models. Experimental results are presented for both rescoring and first-pass recognition experiments.     

类斐波纳契算法的智能化研究

首先从斐波纳契数列定义引出类斐波纳契数列的定义,然后分析求斐波纳契数的算法。提出了类斐波纳契智能化算法及科学计算软件引用类斐波纳契智能化算法的解决方案及其实现。类斐波纳契数智能化算法新思想引入科学计算软件将极大提高计算性能,节省运算时间。     

On the sizes of extended Fibonacci cubes

Hypercube is a popular interconnection network whose size must be a power of 2. Several interconnection networks have been proposed that do not suffer this limitation. Among them the extended Fibonacci cubes are based on the same sequence of the Fibonacci cubes and share many appealing structural properties. In this paper, we show how Extended Fibonacci Cubes can be seen as (Cartesian) product graphs whose components are hypercubes and Fibonacci Cubes. By exposing this property, we prove a conjecture that there are no distinct Extended Fibonacci Cubes (except the trivial ones) with the same number of nodes. Our result further validates the motivations behind the proposal of this interconnection network as a flexible alternative to hypercubes     

一种基于Fibonacci数的有序线性表查找算法

在设计F ibonacci(菲波那契)查找算法的基础上定义了F ibonacci查找判定树,并利用F ibonacci数的封闭型表达式推导出此种判定树的高度计算公式;证明了在查找成功时,F ibonacci查找的一个优点是总查找长度优于折半查找,F ibonacci查找的另一优点在于访问存放在外存储器上大量的有序表数据时,只需对有序表进行加减运算分割。     

基于Fibonacci置乱的小波域数字图像盲水印算法

针对数字图像的版权保护问题,提出一种基于Fibonacci置乱的小波域数字图像盲水印方案。将原图像中的感兴趣区域(ROI)作为水印来源,以此提高水印的隐蔽性。在水印嵌入过程中,将原图像进行分块,对每个块进行Fibonacci置乱和离散小波变换(DWT),选择出低频子带,用于水印嵌入。同时,对水印也执行DWT,选择出低频子带,通过Fibonacci置乱得到置乱矩阵,将水印的置乱矩阵嵌入到主图像的块中。在水印提取过程中,根据嵌入过程中设定的秘钥,通过逆Fibonacci置乱和逆DWT过程提取水印。在多种图像攻击下的仿真结果表明,该水印方案具有较高的安全性、鲁棒性和隐蔽性。     

Dynamic partitioning of complex process models

The E³ modeling language offers a set of mechanisms to support the modeling of complex business and engineering processes. The language is based on well-known object-oriented concepts, extended with specific process-related notions. The E³ language is supported by a modeling tool (called E³ p-draw) that offers mechanisms to support the dynamic partitioning of the process model, and enables the creation and the exploitation of multiple model slices. These mechanisms make it possible to master complex and large process models, since the process engineer can focus on specific factors and aspects of the process, ignoring those information that are irrelevant in a specific stage of the modeling activity. The language and the supporting tool have been applied to the modeling of real industrial processes.     

Towards a decision-aware declarative process modeling language for knowledge-intensive processes

Modeling loosely framed and knowledge-intensive business processes with the currently available process modeling languages is very challenging. Some lack the flexibility to model this type of processes, while others are missing one or more perspectives needed to add the necessary level of detail to the models. In this paper we have composed a list of requirements that a modeling language should fulfil in order to adequately support the modeling of this type of processes. Based on these requirements, a metamodel for a new modeling language was developed that satisfies them all. The new language, called DeciClare, incorporates parts of several existing modeling languages, integrating them with new solutions to requirements that had not yet been met. Deciclare is a declarative modeling language at its core, and therefore, can inherently deal with the flexibility required to model loosely framed processes. The complementary resource and data perspectives add the capability to reason about, respectively, resources and data values. The latter makes it possible to encapsulate the knowledge that governs the process flow by offering support for decision modeling. The abstract syntax of DeciClare has been implemented in the form of an Ecore model. Based on this implementation, the language-domain appropriateness of the language was validated by domain experts using the arm fracture case as application scenario.     

Fast decoding algorithms for variable-lengths codes

Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. There exist many coding algorithms, e.g. Elias-delta codes, Fibonacci codes and other variable-length codes which are often applied to encoding of numbers. Although we often do not consider time consumption of decompression as well as compression algorithms, there are cases where the decompression time is a critical issue. For example, a real-time compression of data structures, applied in the case of the physical implementation of database management systems, follows this issue. In this case, pages of a data structure are decompressed during every reading from a secondary storage into the main memory or items of a page are decompressed during every access to the page. Obviously, efficiency of a decompression algorithm is extremely important. Since fast decoding algorithms were not known until recently, variable-length codes have not been used in the data processing area. In this article, we introduce fast decoding algorithms for Elias-delta, Fibonacci of order 2 as well as Fibonacci of order 3 codes. We provide a theoretical background making these fast algorithms possible. Moreover, we introduce a new code, called the Elias–Fibonacci code, with a lower compression ratio than the Fibonacci of order 3 code for lower numbers; however, this new code provides a faster decoding time than other tested codes. Codes of Elias–Fibonacci are shorter than other compared codes for numbers longer than 26 bits. All these algorithms are suitable in the case of data processing tasks with special emphasis on the decompression time.     

基于Rebeca模型的硬件设计形式化验证

形式化验证是对传统验证方法的补充,是数字电路验证的一条有效途径,对于并发系统,行为建模是一种非常合适的建模方法;Rebeca是由Sirjani和Movaghar提出的一种基于行为的建模语言,支持形式化,一方面,Rebeca是一种类Java的语言,软件工程师很容易使用,另一方面,它是一种支持形式化验证及其相关理论的模型语言,可以为不精通于形式化方法的开发人员和研究人员提供方便的验证过程;在深入研究Rebeca的基础上,采用Rebeca对硬件设计进行建模,然后Modere形式化验证工具对AES密码芯片进行形式化验证。     

建模语言DSC和BPMN的对比分析

业务流程建模是业务流程管理(Business Process Management,BPM)中最为重要的环节,一个好的建模语言对业务流程的建模和开发起到非常关键的作用。各具特色的业务过程建模语言不断出现,对语言的研究、分析和比较已经成为流程设计与流程实现之间的一个重要问题。介绍了一种新的业务流程建模语言DSC(Dynamic SystemChart),并将DSC和目前比较流行的建模语言BPMN(Business Process Modeling Notation)做了比较分析。     

Random forests and the data sparseness problem in language modeling

Language modeling is the problem of predicting words based on histories containing words already hypothesized. Two key aspects of language modeling are effective history equivalence classification and robust probability estimation. The solution of these aspects is hindered by the data sparseness problem.Application of random forests (RFs) to language modeling deals with the two aspects simultaneously. We develop a new smoothing technique based on randomly grown decision trees (DTs) and apply the resulting RF language models to automatic speech recognition. This new method is complementary to many existing ones dealing with the data sparseness problem. We study our RF approach in the context of n-gram type language modeling in which n − 1 words are present in a history. Unlike regular n-gram language models, RF language models have the potential to generalize well to unseen data, even when histories are longer than four words. We show that our RF language models are superior to the best known smoothing technique, the interpolated Kneser–Ney smoothing, in reducing both the perplexity (PPL) and word error rate (WER) in large vocabulary state-of-the-art speech recognition systems. In particular, we will show statistically significant improvements in a contemporary conversational telephony speech recognition system by applying the RF approach only to one of its many language models.     

16位嵌入式微处理器核的设计及验证

采用自顶向下方法,设计实现16位精简指令集计算机架构的嵌入式微处理器核HEUSoC 1,利用现场可编程门阵列片内的大量存储资源实现双端口存储器及零等待的指令和数据访问,从而保证指令的单周期执行。通过Verilog硬件描述语言实现微处理器核的RTL级描述,编写计算斐波那契数列的测试程序验证了HEUSoC 1的正确性。在Xilinx Spartan 2芯片上的统计结果表明,HEUSoC 1的资源占用率较低,处理器最高频率约为22 MHz,适合于对功耗和性价比要求严格的嵌入式应用领域。     

Modellierung für Integrated Enterprise Balancing

The development of models and methods is a vital element of design science in information systems research. In this paper a formal process modeling language is developed which incorporates IEB (Integrated Enterprise Balancing)/4R (Risk, Return, Regulation, Reporting) requirements formulated by Faisst and Buhl [FaBu05]. This is realized through the inclusion of 4R elements and 4R relations into the new 4R process modeling language. An evaluation of the process modeling language with regard to the assessment criterion “feasibility of implementation” was successfully executed using the meta modeling platform ADONIS. For that purpose the ADONIS modeling language for business processes (ADONIS BPMS) was extended with additional 4R modeling elements. Furthermore a new model type as well as required classes and relation classes have been developed which enable the connection of the 4R process modeling language to the research results of the above mentioned contribution.     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.     

Fibonacci cubes-a new interconnection technology

A novel interconnection topology called the Fibonacci cube is shown to possess attractive recurrent structures in spite of its asymmetric and relatively sparse interconnections. Since it can be embedded as a subgraph in the Boolean cube (hypercube) and it is also a supergraph of other structures, the Fibonacci cube may find applications in fault-tolerant computing. For a graph with N nodes, the diameter, the edge connectivity, and the node connectivity of the Fibonacci cube are in the logarithmic order of N. It is also shown that common system communication primitives can be implemented efficiently     

Inversion of the generalized Fibonacci matrix by convolution

A convolution formula containing the generalized Fibonacci numbers and applications of this formula are investigated. Starting from the convolution formula, we derive combinatorial identities involving generalized and usual Fibonacci numbers, as well as the Lucas numbers. The inversion of a lower triangular matrix and the generalized inversion of strictly lower triangular Toeplitz matrix whose non-zero elements are generalized Fibonacci numbers are considered.