检索结果-内蒙古大学图书馆

A SIMPLE CIRCUIT WITH DYNAMIC LOGIC ARCHITECTURE OF BASIC LOGIC GATES

INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS 2010年第8期20卷 2547-2551页

作者： Campos-Canton, I. Pecina-Sanchez, J. A. Campos-Canton, E. Rosu, H. C. Univ Autonoma San Luis Potosi Fac Ciencias San Luis Potosi 78000 Slp Mexico Univ Autonoma San Luis Potosi Dept Fis Matemat San Luis Potosi 78000 Slp Mexico Inst Potosino Invest Cient & Tecnol San Luis Potosi 78216 Slp Mexico

We report experimental results obtained with a circuit possessing dynamic logic architecture based on one of the theoretical schemes proposed by H. Peng and collaborators in 2008. The schematic diagram of the electronic circuit and its implementation to get different basic logic gates are displayed and discussed. In particular, we show explicitly how to get the electronic NOR, NAND and XOR gates. The proposed electronic circuit is easy to build because it employs only resistors, operational amplifiers and comparators.

关键词： Chaos computing analog electronic piecewise-linear functions

来源：评论

学校读者我要写书评

暂无评论

INTEGER AND MIXED-INTEGER PROGRAMMING MODELS - GENERAL PROPERTIES

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1975年第3-4期16卷 191-206页

作者： MEYER, RR UNIV WISCONSIN MATH RES CTRMADISONWI 53706 UNIV WISCONSIN COMP SCI DEPTMADISONWI 53706

It is well known that mixed-integer formulations can be used tomodel important classes of nonconvex functions, such as fixed-charge functions and linear economy-of-scale cost functions. The purpose of this paper is to formulate a rigorous definition of a mixed-integer model of a given function and to study the properties of the functions that can be so modelled. An interesting byproduct of this approach is the identification of a simple class of functions that cannot be modelled by computer-representable mixed-integer formulations, even though mixed-integer models based on the use of a single arbitrary irrational constant are available for this class.

关键词： Mixed-integer programming integer programming fixed-charge problems piecewise-linear functions modeling

来源：评论

学校读者我要写书评

暂无评论

Decidable and undecidable prime theories in infinite-valued logic

引用

ANNALS OF PURE AND APPLIED LOGIC 2001年第1-3期108卷 269-278页

作者： Mundici, D Panti, G Univ Milan Dept Comp Sci I-20135 Milan Italy Univ Udine Dept Math I-33100 Udine Italy

In classical propositional logic, a theory T is prime (i.e., for every pair of formulas F,G, either T proves F --> G or T proves G --> F) iff it is complete. In Lukasiewicz infinite-valued logic the two notions split, completeness being stronger than primeness. Using toric desingularization algorithms and the fine structure of prime ideal spaces of free C-groups, in this paper we shall characterize prime theories in infinite-valued logic. We will show that recursively enumerable (r.e.) prime theories over a finite number of variables are decidable, and we will exhibit an example of an undecidable r.e. prime theory over countably many variables. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： lattice-ordered abelian groups piecewise-linear functions MV-algebras fan desingularization decidable theories

来源：评论

学校读者我要写书评

暂无评论

Alternative-fuel station network design under impact of station failures

引用

ANNALS OF OPERATIONS RESEARCH 2019年第1-2期279卷 151-186页

作者： Trung Hieu Tran Nguyen, Thu Ba T. Univ Nottingham Lab Urban Complex & Sustainabil Nottingham NG7 2RB England Univ Nottingham Fac Engn Nottingham NG7 2GX England

In this paper, we have formulated a mixed-integer non-linear programming model for alternative-fuel station location problem in which each station can fail with a site-specific probability. The model aims to maximise the total expected traffic volume that can be refuelled by the unreliable alternative-fuel stations. Based on the linearisation techniques, i.e., probability chains and piecewise-linear functions, we linearise the non-linearity of compound probability terms in the non-linear model to solve this problem efficiently. An efficient Tabu search algorithm is also developed to solve the large-size instances. In addition, we extend the model to deal with reliable multi-period alternative-fuel station network design. Computational experiments, carried out on the well-known benchmark instances where the probability of station failures is uniformly generated, show that the proposed models and algorithm can obtain the optimal solutions within a reasonable computation time. Compared to a standard station location model that disregards the potential for station failures, our model designs more reliable alternative-fuel station network under risk of station failures. A sensitivity analysis of failure probabilities in the station network design is investigated to demonstrate the robustness of our model and study how variability in the probability of station failure affects solution robustness.

关键词： Location Alternative-fuel vehicle Station failure Probability chains piecewise-linear functions Tabu search

来源：评论

学校读者我要写书评

暂无评论

Canonical basis linearity regions arising from quiver representations

引用

JOURNAL OF ALGEBRA 2003年第2期270卷 696-727页

作者： Marsh, BR Reineke, M Univ Leicester Dept Math & Comp Sci Univ Rd Leicester LE1 7RH Leics England Berg Univ Wuppertal D-42097 Wuppertal Germany

In this paper we show that there is a link between the combinatorics of the canonical basis of a quantized enveloping algebra and the monomial bases of the second author [Math. Z. 237 (2001) 639] arising from representations of quivers. We Prove that some reparametrization functions of the canonical basis, arising from the link between Lusztig's approach to the canonical basis and the string parametrization of the canonical basis, are given on a large cone by linear functions arising from these monomial bases for a quantized enveloping algebra. (C) 2003 Elsevier Inc. All rights reserved.

关键词： quantum group Lie algebra canonical basis parametrization functions monomial basis representations of quivers degenerations piecewise-linear functions

来源：评论

学校读者我要写书评

暂无评论

Regions of linearity, lusztig cones, and canonical basis elements for the quantized enveloping algebra of type A₄

引用

JOURNAL OF ALGEBRA 2000年第2期234卷 545-603页

作者： Carter, R Marsh, BR Univ Warwick Math Inst Coventry CV4 7AL W Midlands England Univ Leicester Dept Math & Comp Sci Leicester LE1 7RH Leics England

Let U-q be the quantum group associated to a Lie algebra g of rank n. The negative part U- of U has a canonical basis B with favourable properties (see M. Kashiwara (1991, Duke Math. J. 63, 465-516) and G. Lusztig (1993. "Introduction to Quantum Groups," Sect. 14.4.6, Birkhauser, Boston)). The approaches of Lusztig and Kashiwara lead to a set of alternative parametrizations of the canonical basis, one for each reduced expression for the longest word in the Weyl group of g. We show that if g is of type A(4) there are close relationships between the Lusztig cones, canonical basis elements, and the regions of linearity of reparametrization functions arising from the above parametrizations. A graph can be defined on the set of simplicial regions of linearity with respect to adjacency, and we further show that this graph is isomorphic to the graph with vertices given by the reduced expressions of the longest word of the Weyl group modulo commutation and edges given by long braid relations, (C) 2000 Academic Press.

关键词： quantum group lie algebra canonical basis tight monomials, weyl group piecewise-linear functions

来源：评论

学校读者我要写书评

暂无评论

Positive definiteness of piecewise-linear function

引用

EXPOSITIONES MATHEMATICAE 2017年第3期35卷 357-361页

作者： Manov, Anatoliy Zastavnyi, Viktor Donetsk Natl Univ Fac Math & Informat Technol Univ Skaya Str 24 UA-83001 Donetsk Ukraine

Let alpha is an element of (0, 1), h is an element of R and let f(alpha,h) be an even function with the properties: f(alpha,h) (x) = 0 for x is an element of (1, + infinity), f(alpha,h) is linear over the intervals [0, alpha] and [alpha, 1], f(alpha,h)(0) = 1, f(alpha,h)(alpha) = h, and f(alpha,h)(1) = 0. In this paper we prove that f(alpha,h) is positive definite on R double left right arrow m(alpha) <= h <= 1 alpha, where m(alpha) = 0 if 1/alpha is not an element of N, and m(alpha) = -alpha if 1/alpha is an element of N. (C) 2017 Elsevier GmbH. All rights reserved.

关键词： Positive-definite functions piecewise-linear functions Bochner theorem

来源：评论

学校读者我要写书评

暂无评论

Simplicial piecewise linear Computation Complexity for Vector-Vector Products

Simplicial Piecewise Linear Computation Complexity for Vecto...

引用

2nd Argentine Conference on Electronics (CAE)

作者： Julian, P. Villemur, M. DIEC IIIE Univ Nacl Sur CONICET San Andres 800 Bahia Blanca Argentina Johns Hopkins Univ ECE Dept 3400 North Charles St Baltimore MD 21218 USA

In this paper we analyze several simplicial piecewise-linear digital computation architectures that are good candidates to replace the multiply and accumulate (MAC) units in deep neural networks. We analyze them in te... 详细信息

ISBN: (纸本)9781728161952

关键词： linear combination vector-vector multiplication piecewise-linear functions

来源：评论

学校读者我要写书评

暂无评论

A Reduced-Complexity Successive-Cancellation Decoding Algorithm for Polar Codes

A Reduced-Complexity Successive-Cancellation Decoding Algori...

引用

6th International Congress on Image and Signal Processing (CISP)

作者： Xing, Chao Wang, Bei Zhao, Shengmei Nanjing Univ Posts & Telecommun Inst Signal Proc & Transmiss Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781479927630

Polar codes are codes which provably achieve the capacity of arbitrary symmetric binary-input channels with the complexity of encoders and decodersO(Nlog N), where N is the code block-length. In the paper, we will focus on a lower complexity implementation of decoding algorithm in the log-likelihood ratio domain. We use the update rule proposed by Gallager in the decoding algorithm of low density parity check (LDPC) codes to replace the node update rules used in successive cancellation (SC) algorithm for polar codes. To simplify the logarithmic and the exponential operations in the Gallager's approach node updates rule for polar codes, we further utilize a piece-wise linear algorithm to approximate the involution transform function, where the piece-wise linear algorithm only uses multiplication and addition operation. It has resulted in a reduced complexity SC decoding algorithm for polar codes. The numerical simulations show that our proposed SC algorithm (Piece-wise approx.) has a lower implementation complexity for polar code decoding, but at the cost about 0.7dB degradation in the bit-error-rate (BER) performance in comparison with the SC algorithm proposed by Arikan when the BER is 10(-5). The proposed SC algorithm (Piece-wise approx.) is a tradeoff between the error performance and the decoding complexity.

关键词： Polar codes Successive-Cancelation Algorithm Reduced-Complexity Decoding piecewise-linear functions

来源：评论

学校读者我要写书评

暂无评论

Compact formulations for efficient early-phas e field development optimization of multi-reservoir fields

引用

COMPUTERS & CHEMICAL ENGINEERING 2021年 150卷 107319-107319页

作者： Lei, Guowen Silva, Thiago Lima Stanko, Milan NTNU Dept Geosci & Petr N-7031 Trondheim Norway

A compact formulation has been developed to efficiently optimize early-stage field development planning of multi-reservoir fields. The proposed formulation is a mixed-integer linear programming model which employs piecewise-linear functions to approximate the model non-linearities. The project economic value is maximized by optimizing the production allocation and the drilling schedule. The field production profiles are estimated with production potential curves calculated from simulated data of an integrated reservoir and surface facilities model. The novelties of this work are: a scalable model for the well combination selection, a logarithmic piecewise-linear model to approximate the well production potential curves, and the modeling and solution of realistic field development optimization problems. Through simulation analysis of a real field case study, the logarithmic and standard SOS2 formulations are compared in terms of computational performance and accuracy. The results show that the logarithmic formulation has significantly reduced the computational time and achieved improved accuracy over SOS2. (c) 2021 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )

关键词： Field development optimization Mixed-Integer linear programming piecewise-linear functions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：