Accelerated algorithm for pattern detection in logical analysis of data

Sets of “positive” and “negative” points (observations) in n-dimensional discrete space given along with their non-negative integer multiplicities are analyzed from the perspective of the Logical Analysis of Data (LAD). A set of observations satisfying upper and/or lower bounds imposed on certain components is called a positive pattern if it contains some positive observations and no negative one. The number of variables on which such restrictions are imposed is called the degree of the pattern. A total polynomial algorithm is proposed for the enumeration of all patterns of limited degree, and special efficient variants of it for the enumeration of all patterns with certain “sign” and “coverage” requirements are presented and evaluated on a publicly available collection of benchmark datasets.     

FRS: Replication Driver Layer-Based Data Replication System on FreeBSD

Data replication is a key way to design a disaster tolerance system.This paper presents a replication driver layer-based data replication system on FreeBSD(FRS).The system is embedded into the replication device driver layer,does not depend on specific storage devices and logical volume manager,and can achieve replication on data block level.The design considerations and decisions in defining FRS are described in detail.     

与ITMS融合的E8-C终端管理技术

通信交换网络正朝着宽带化,IP化的方向发展,介绍了在ITMS系统中E8-C终端的管理实现方案,并就与ITMS融合前后E8-C终端管理技术的比较,为实现通过ITMS统一管理用户侧E8-C终端提供有益的参考。     

Irreversibility and dissipation in finite-state automata

Irreversibility and dissipation in finite-state automata (FSA) are considered from a physical-information-theoretic perspective. A quantitative measure for the computational irreversibility of finite automata is introduced, and a fundamental lower bound on the average energy dissipated per state transition is obtained and expressed in terms of FSA irreversibility. The irreversibility measure and energy bound are germane to any realization of a deterministic automaton that faithfully registers abstract FSA states in distinguishable states of a physical system coupled to a thermal environment, and that evolves via a sequence of interactions with an external system holding a physical instantiation of a random input string. The central result, which is shown to follow from quantum dynamics and entropic inequalities alone, can be regarded as a generalization of Landauer?s Principle applicable to FSAs and tailorable to specified automata. Application to a simple FSA is illustrated.     

Black swans and white eagles: on mathematics and finance

It is often objected that we cannot use mathematical methods in finance because (1) finance is dominated by unpredictable unique events (the black swans), (2) there are qualitative effects that cannot be quantified, and (3) the laws themselves of finance keep on changing. In this paper we discuss these three objections, offering arguments to reject them. We begin by reviewing the development of the physical sciences, pointing out parallels that are relevant for our discussion. Modern science has abandoned the objective of describing reality and has adopted an operational point of view that regards physical laws as tools to connect observations. Modern science is no longer deterministic, but has accepted a fundamental uncertainty in physical laws both at micro and macroscopic levels. Unpredictable pivotal events exist in the physical sciences as well in finance but this does not lead us to question the use of mathematics in the physical sciences. On the contrary, using principles of safe design, we try to understand how to avoid and contain unpredictability. Financial markets are manmade artifacts with, as actors, a large number of interacting agents. If we so wish, we can reduce the level of uncertainty present in markets: But if we try to do so describing financial markets with simple mathematical laws, we find that these laws are not stable but change over time, eventually with sudden structural breaks. This makes the use of mathematical finance difficult but not impossible. We can forecast human decision-making processes, crucial in forecasting financial markets, at the statistical level in aggregate. From an operational point of view, we have the tools to understand and describe the behavior of large number of interacting agents. At the present stage of development of our science, we need to use the mathematics of adaptive systems, changing mathematical models in function of different market states. However, reductionism to a small number of basic laws remains a fundamental objective of financial economics as it is in the physical sciences.     

Characterizing Belnap's Logic via De Morgan's Laws

The aim of this paper is technically to study Belnap's four-valued sentential logic (see [2]). First, we obtain a Gentzen-style axiomatization of this logic that contains no structural rules while all they are still admissible in the Gentzen system what is proved with using some algebraic tools. Further, the mentioned logic is proved to be the least closure operator on the set of {Λ, V, ?}-formulas satisfying Tarski's conditions for classical conjunction and disjunction together with De Morgan's laws for negation. It is also proved that Belnap's logic is the only sentential logic satisfying the above-mentioned conditions together with Anderson-Belnap's Variable-Sharing Property. Finally, we obtain a finite Hilbert-style axiomatization of this logic. As a consequence, we obtain a finite Hilbert-style axiomatization of Priest's logic of paradox (see [12]).     

Design space exploration of low-power flip-flops in FinFET technology

As technology evolves, new devices emerge to overcome the known short-channel effects of conventional MOSFETs. FinFETs, as recent devices, are widely used in modern processor designs. Elaborate design of circuit elements can effectively increase the overall chip performance. In this paper we studied the design of high performance flip-flop (FF) using FinFET devices. We have investigated several transistor sizing methods in FinFET technology to design the FF circuit based on different input and output capacitances. The results indicate that the circuit designed using minimum-energy-delay-area product (min-EDAP) approach has the lowest PDP. We developed a modified logical effort approach that leads to a minimum EDP design compared to the other approaches. The performance of flip-flop is also investigated based on the metrics extracted from energy efficient curve (EEC). Results show that the ED metric has the minimum EDP in all cases. Moreover, the E⁴D metric shows the least variations against frequency and voltage fluctuations, while the ED⁴ metric is more robust against temperature variations. Simulations are performed using HSPICE in 16 nm FinFET technology with shorted-gate (SG) mode configuration.     

N-半单代数中的剩余格结构

在N-半单代数的中心幂等元构成的集合G(R)中引入了"→、*、、Θ"运算和一个二元关系"≤",证明"≤"构成G(R)上的偏序关系,和Θ分别是偏序集(G(R),≤)上的上确界运算和下确界运算;进而证明了(G(R),,Θ,→,1,0)是剩余格。在此基础上得到了N-半单代数可以构成与M TL代数,BL代数,G-代数,G oguen代数,BR0-代数和R0-代数等价的代数系统,从而将模糊逻辑与结合代数有机地结合起来。     

通用集成电路设计规则检查

文章介绍了利用SUN工作站上Cadence中的Dracula工具进行集成电路设计规划检查（DRC）的全过程;较详细地介绍了DRC文件的编写、运行及输出结果的查看,并给出了实例。     

基于VHDL设计综合的扫描控制

运用VHDL硬件语言完成了激光成像雷达中扫描系统控制的描述。设计由ALTERA公司的MAX70010系列可编程逻辑器件实现。VHDL语言与可编程逻辑器件(CPLD)的结合使用,将传统上由硬件电路实现的功能转变为软件参与实现,从而易于修改和改进。给出了部分VHDL源代码描述,通过逻辑综合优化了设计,实现了设计的时序仿真,分析了VHDL语言在设计中应注意的一些问题。