Reformulation of the support set selection problem in the logical analysis of data

The paper is concerned with the problem of binary classification of data records, given an already classified training set of records. Among the various approaches to the problem, the methodology of the logical analysis of data (LAD) is considered. Such approach is based on discrete mathematics, with special emphasis on Boolean functions. With respect to the standard LAD procedure, enhancements based on probability considerations are presented. In particular, the problem of the selection of the optimal support set is formulated as a weighted set covering problem. Testable statistical hypothesis are used. Accuracy of the modified LAD procedure is compared to that of the standard LAD procedure on datasets of the UCI repository. Encouraging results are obtained and discussed.     

On routing in large WDM networks

An important problem in WDM network design is to construct a logical topology and determine an optimal routing over that topology. Mixed Integer Linear Program (MILP) formulations to generate optimal solutions for this problem have been presented. Such formulations are computationally intractable, even for moderate sized networks. A standard approach is to decouple the problem of logical topology design and the problem of routing the traffic on this logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation can be used to solve the routing problem over a given logical topology. We have found that such LP formulations become computationally infeasible for large networks. In this paper, we present a new formulation, based on the arc-chain representation, for optimally routing the specified traffic over a given logical topology to minimize the congestion of the network. We have used the revised simplex method incorporating an implicit column generation technique, and exploited the special Generalized Upper Bounding structure as well as the possibility of eta-factorization for efficiently updating the dual variables and finding the solution. Experimental results on a number of networks demonstrate the suitability of this approach.     

基于ForCES协议的软件集群路由器模型研究

文章提出了软件集群路由器的参考模型。且对软件集群路由器模型的物理结构、逻辑结构和流量场景进行了深入的分析。通过一个简单的模型实例，提出了总体设计的方案。     

On the polynomial-space completeness of intuitionistic propositional logic

We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. % Mathematics Subject Classification (2000):     

适用于ASIC的高速低功耗逻辑单元

本文介绍一种ECL电路结构形式的ASIC逻辑单元的设计和应用。该单元使用2.5V的电源,内部开关电流设计为0.5mA,逻辑摆幅设计为340mV,输入输出均采用双向互补信号。它具有信息的基本记忆功能,用它进行多级组合配套设计,可制作不同模数的分频器、寄存器和计数器等。设计灵活,功能强,电路速度快,功耗低,仅为具有相同功能的普通ECL电路的1/30。这些电路可用在通讯机、电子控制系统、电子测量系结中作高速数字锁相环,数字信号处理的专用集成电路。     

Efficient multi-hop scheduling algorithms for packet transmissions in WDM optical star networks

This paper proposes multi-hop scheduling algorithms for the All-to-All Broadcast (AAB) problem in Wavelength Division Multiplexed (WDM) optical star networks. The multi-hop AAB problem can be split into two subproblems: Logical Topologies Construction (LTC) problem, and Transmission Scheduling (TS) problem. For improving the efficiency of multi-hop scheduling, we focus on a new multi-hop transmission model and transfer the LTC problem to a special case of the Round Robin Tournament (RRT) problem. In the proposed logical topologies, our multi-hop scheduling algorithms can easily overlap the tuning latency and reduce the number of tuning operations on each node. We compare our results with previous research in terms of schedule length. Overall results indicate that our multi-hop scheduling algorithms have better performance than previous algorithms.     

Enhanced logical stochastic resonance under periodic forcing

It was demonstrated recently that noise in an optimal window allows a bistable system to operate reliably as reconfigurable logic gates (Murali et al., 2009) [1], as well as a memory device (Kohar and Sinha, 2012) [11]. Namely, in a range of moderate noise, the system can operate flexibly, both as a NAND/AND/OR/NOR gate and a Set Reset latch. Here we demonstrate how the width of the optimal noise window can be increased by utilizing the constructive interplay of noise and periodic forcing, namely noise in conjunction with a periodic drive yields consistent logic outputs for all noise strengths below a certain threshold. Thus we establish that in scenarios where noise level is below the minimum threshold required for logical stochastic resonance (or stochastic resonance in general), we can add a periodic forcing to obtain the desired effects. Lastly, we also show how periodic forcing reduces the switching time, leading to faster operation of devices and lower latency effects.     

神经网络稳定性的逻辑分析

神经网络稳定性分析的传统方法是采用权矩阵的定量分析。本文提出一种基于推理和矛盾分析的逻辑分析法，并阐明导致网络不稳定的局部结构因素，这有利于神经网络的分析和设计。     

关于逻辑函数化简的行为诊断的研究

本文以逻辑函数化简的行为诊断为研究背景，提出了一种适合于解题ＩＣＡＩ系统中学生行为的、符合人类思维特征的认识诊断系统模型，详细论述了逻辑函数化简过程中，学生行为认识诊断的具体实现，在准确捕捉学生行为中的错误及错误原因等重要问题上取得了意义的研究成果。