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

International Symposium on Multiple-Valued Logic

作者： Claudio Moraga Radomir S. Stanković Milena Stanković Faculty of Computer Science TU Dortmund University Dortmund Germany Department of Informatics Technical University &#x201C Federico Santa Mar&#x00ED a&#x201D Valpara&#x00ED so Chile Department of Computer Science Faculty of Electronic Engineering Ni&#x0161 Serbia Mathematical Institute Serbian Academy of Sciences and Arts Belgrade Serbia Faculty of Electronic Engineering Department of Computer ScienceNi&#x0161 Serbia18000

ISBN: (数字)9781665423953

ISBN: (纸本)9781665423960

Maiorana-McFarland ternary bent functions are analyzed with respect to their relationship with spectral invariant operations and with respect to self-duality. In analogy to the Maiorana-McFarland method to generate binary bent functions, an equation is introduced to generate ternary bent functions in an even number of variables. It is shown that Maiorana-McFarland ternary bent functions are strict bent and that their duals may not be Maiorana-McFarland. It is known that spectral invariant operations preserve the bentness of a function. We show that most spectral invariant operations preserve that Maiorana-McFarland bentness of ternary functions. The concept of generalized self-duality is introduced and it is shown how Maiorana-McFarland ternary bent functions exhibit this kind of self-duality. It is shown that Maiorana-McFarland ternary bent functions in two variables may be divided into 3 classes of 54 functions each. A list of these functions for a first class is given in an Appendix.

关键词： Tensors Transforms Symbols computer science Boolean functions Qubit Nickel

来源：评论

学校读者我要写书评

暂无评论

Bilevel programming approach to demand response management with day-ahead tariff

引用

Journal of Modern Power Systems and Clean Energy 2019年第6期7卷 1632-1643页

作者： Andras KOVACS EPIC Center of Excellence in Production Informatics and Control Institute for Computer Science and ControlHungarian Academy of SciencesBudapestHungary

This paper introduces a bilevel programming approach to electricity tariff optimization for the purpose of demand response management(DRM)in smart *** the multi-follower Stackelberg game model,the leader is the profit-maximizing electricity retailer,who must set a time-of-use variable energy tariff in the *** correspond to the groups of prosumers(simultaneous producers and consumers of the electricity).They respond to the observed tariff,schedule controllable loads and determine the charging/discharging policy of their batteries to minimize the cost of electricity and to maximize the utility at the same time.A bilevel programming formulation of the problem is defined,and its fundamental properties are *** primal-dual reformulation is proposed in this paper to convert the bilevel optimization problem into a single-level quadratically constrained quadratic program(QCQP),and a successive linear programming(SLP)algorithm is applied to solve *** is demonstrated in computational experiments that the proposed approach outperforms earlier typical methods based on the KarushKuhn-Tucker(KKT)reformulation regarding both solution quality and computational efficiency on practically relevant problem ***,it also offers more flexible modeling capabilities.

关键词： Demand response management(DRM) Smart grid Game theory Optimization Bilevel programming

来源：评论

学校读者我要写书评

暂无评论

DeepFaceEditing: Deep face generation and editing with disentangled geometry and appearance control

arXiv

引用

arXiv 2021年

作者： Chen, Shu-Yu Liu, Feng-Lin Lai, Yu-Kun Rosin, Paul L. Li, Chunpeng Fu, Hongbo Gao, Lin Institute of Computing Technology CAS University of Chinese Academy of Sciences School of Computer Science and Informatics Cardiff University

Recent facial image synthesis methods have been mainly based on conditional generative models. Sketch-based conditions can effectively describe the geometry of faces, including the contours of facial components, hair structures, as well as salient edges (e.g., wrinkles) on face surfaces but lack effective control of appearance, which is influenced by color, material, lighting condition, etc. To have more control of generated results, one possible approach is to apply existing disentangling works to disentangle face images into geometry and appearance representations. However, existing disentangling methods are not optimized for human face editing, and cannot achieve fine control of facial details such as wrinkles. To address this issue, we propose DeepFaceEditing, a structured disentanglement framework specifically designed for face images to support face generation and editing with disentangled control of geometry and appearance. We adopt a local-to-global approach to incorporate the face domain knowledge: local component images are decomposed into geometry and appearance representations, which are fused consistently using a global fusion module to improve generation quality. We exploit sketches to assist in extracting a better geometry representation, which also supports intuitive geometry editing via sketching. The resulting method can either extract the geometry and appearance representations from face images, or directly extract the geometry representation from face sketches. Such representations allow users to easily edit and synthesize face images, with decoupled control of their geometry and appearance. Both qualitative and quantitative evaluations show the superior detail and appearance control abilities of our method compared to state-of-the-art methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Bounds on the Rate of Convergence for a Nonstationary Two – Class Priority Queuing System

Bounds on the Rate of Convergence for a Nonstationary Two –...

引用

Information, Control, and Communication Technologies (ICCT), International Conference on

作者： Ilya Usov Alexander Zeifman Yacov Satin Galina Shilova Alexander Sipin Department of Applied Mathematics Vologda State University Vologda Russia Moscow Center for Fundamental and Applied Mathematics Lomonosov Moscow State University Moscow Russia Federation Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences Moscow Russia Federation Vologda Research Center of the Russian Academy of Sciences Vologda Russia Federation Depfrtment of Mathematics and Informatics Vologda State University Vologda Russia

ISBN: (数字)9798331517564

ISBN: (纸本)9798331517571

In this article, an approach to studying two-dimensional processes of birth and death was considered using the example of a non-stationary two – class priority queuing system. An estimate of the rate of convergence of the original process was obtained, with the help of which one can study, first of all, the projections of process Z(t). Estimates for the projection of process Z(t) = (X(t),Y (t)) were obtained using the logarithmic norm method. A numerical example illustrates the behavior of projections X(t) and Y (t) of the original two-dimensional process Z(t); graphs are constructed for the probability of an empty queue, the average number of customers in the system for specific intensity functions λ 1 (t),μ 1 (t),λ 2 (t),μ 2 (t). An estimate of the rate of convergence of the original process Z(t) and an estimate of the limiting average were also obtained.

关键词： Limiting Process control Communications technology Convergence

来源：评论

学校读者我要写书评

暂无评论

Improvement of Self-Timed Pipeline Immunity of Soft Errors

Improvement of Self-Timed Pipeline Immunity of Soft Errors

引用

IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW)

作者： Yury A. Stepchenkov Yury V. Rogdestvenski Yury I. Shikunov Denis Y. Diachenko Yury G. Diachenko Institute of Informatics Problems Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences Moscow Russia

ISBN: (数字)9781665404761

ISBN: (纸本)9781665446426

The paper presents the results of a study of self-timed (ST) digital circuits' soft-error tolerance. Practical ST circuits have a pipeline structure. The combinational parts of the ST pipeline are naturally immune to 72% of short-term soft errors. The proposed circuitry and layout methods increase the ST pipeline combinational part's failure tolerance to 98% and higher. ST pipeline stage register is the most susceptible to soft errors. A typical variant of the ST pipeline register bit unit based on C-elements has a failure tolerance of 83%. The proposed register bit implementation cases increase the failure tolerance of the ST pipeline up to 98%.

关键词： Conferences Pipelines Layout Registers Transistors Digital circuits

来源：评论

学校读者我要写书评

暂无评论

Bounds on the Rate of Convergence for a class of Birth–death Process with Two Types of Catastrophes

Bounds on the Rate of Convergence for a class of Birth–deat...

引用

Information, Control, and Communication Technologies (ICCT), International Conference on

作者： Alexander Zeifman Ilya Usov Anastasia Kryukova Yacov Satin Department of Applied Mathematics Vologda State University Vologda Russia Moscow Center for Fundamental and Applied Mathematics Lomonosov Moscow State University Moscow Russia Federation Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences Moscow Russia Federation Vologda Research Center of the Russian Academy of Sciences Vologda Russia Federation Department of Mathematics and Informatics Vologda State University Vologda Russia

ISBN: (数字)9798331517564

ISBN: (纸本)9798331517571

This paper examines a special class of inhomogeneous birth-death process with two types of catastrophes. The first catastrophe, denoted as the α(t) catastrophe, results in the complete annihilation of all individuals in the system, while the second, β(t) catastrophe, leads to the partial demise of individuals, leaving only one survivor. In addition, we deal with general type of impatience. Namely, we assume that the incoming arrival rates decrease and the service rates increase as the queue length increases. By analyzing the forward Kolmogorov system and employing the logarithmic norm of the reduced infinitesimal characteristic matrix, we derived an estimate for the convergence rate to the limiting regime in both the l1 norm and the "weighted" 1D norm. Additionally, we provided an estimate for the expected number of individuals remaining in the system. A numerical example is presented, wherein the process X(t) is analyzed with specific intensity functions, illustrating the behavior of probabilities p 0 (t), p 1 (t), p 2 (t) along with their mean values.

关键词： Limiting Process control Nonhomogeneous media Communications technology Convergence

来源：评论

学校读者我要写书评

暂无评论

Verified reductions for optimization

arXiv

引用

arXiv 2023年

作者： Bentkamp, Alexander Mir, Ramon Fernández Avigad, Jeremy Heinrich-Heine-Universität Düsseldorf Germany State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Informatics University of Edinburgh Edinburgh United Kingdom Carnegie Mellon University PittsburghPA United States

Numerical and symbolic methods for optimization are used extensively in engineering, industry, and finance. Various methods are used to reduce problems of interest to ones that are amenable to solution by these methods. We develop a framework for designing and applying such reductions, using the Lean programming language and interactive proof assistant. Formal verification makes the process more reliable, and the availability of an interactive framework and ambient mathematical library provides a robust environment for constructing the reductions and reasoning about *** Codes 90C25, 68V15 Copyright © 2023, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

A novel approach for intelligent diagnosis and grading of diabetic retinopathy

引用

computers in Biology and Medicine 2024年 172卷 108246-108246页

作者： Hai, Zeru Zou, Beiji Xiao, Xiaoxia Peng, Qinghua Yan, Junfeng Zhang, Wensheng Yue, Kejuan School of Informatics Hunan University of Chinese Medicine Hunan Province Changsha410208 China School of Computer Science and Engineering Central South University Hunan Province Changsha410083 China School of Traditional Chinese Medicine Hunan University of Chinese Medicine Hunan Province Changsha410208 China Beijing100049 China Research Center of Precision Sensing and Control Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Computer Science Hunan First Normal University Hunan Province Changsha410205 China

Diabetic retinopathy (DR) is a severe ocular complication of diabetes that can lead to vision damage and even blindness. Currently, traditional deep convolutional neural networks (CNNs) used for DR grading tasks face two primary challenges: (1) insensitivity to minority classes due to imbalanced data distribution, and (2) neglecting the relationship between the left and right eyes by utilizing the fundus image of only one eye for training without differentiating between them. To tackle these challenges, we proposed the DRGCNN (DR Grading CNN) model. To solve the problem caused by imbalanced data distribution, our model adopts a more balanced strategy by allocating an equal number of channels to feature maps representing various DR categories. Furthermore, we introduce a CAM-EfficientNetV2-M encoder dedicated to encoding input retinal fundus images for feature vector generation. The number of parameters of our encoder is 52.88 M, which is less than RegNet_y_16gf (80.57 M) and EfficientNetB7 (63.79 M), but the corresponding kappa value is higher. Additionally, in order to take advantage of the binocular relationship, we input fundus retinal images from both eyes of the patient into the network for features fusion during the training phase. We achieved a kappa value of 86.62% on the EyePACS dataset and 86.16% on the Messidor-2 dataset. Experimental results on these representative datasets for diabetic retinopathy (DR) demonstrate the exceptional performance of our DRGCNN model, establishing it as a highly competitive intelligent classification model in the field of DR. The code is available for use at https://***/Fat-Hai/DRGCNN. © 2024 The Authors

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

ON SEMI-NIL CLEAN RINGS WITH APPLICATIONS

arXiv

引用

arXiv 2024年

作者： Bien, M.H. Danchev, Peter V. Ramezan-Nassab, M. Faculty of Mathematics and Computer Science University of Science Ho Chi Minh City Viet Nam Vietnam National University Ho Chi Minh City Viet Nam Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia1113 Bulgaria Department of Mathematics Kharazmi University 50 Taleghani Street Tehran Iran P.O. Box 19395-5746 Tehran Iran

We investigate the notion of semi-nil clean rings, defined as those rings in which each element can be expressed as a sum of a periodic and a nilpotent element. Among our results, we show that if R is a semi-nil clean NI ring, then R is periodic. Additionally, we demonstrate that every group ring RG of a nilpotent group G over a weakly 2-primal ring R is semi-nil clean if, and only if, R is periodic and G is locally finite. Moreover, we also study those rings in which every unit is a sum of a periodic and a nilpotent element, calling them unit semi-nil clean rings. As a remarkable result, we show that if R is an algebraic algebra over a field, then R is unit semi-nil clean if, and only if, R is periodic. Besides, we explore those rings in which non-zero elements are a sum of a torsion element and a nilpotent element, naming them t-fine rings, which constitute a proper subclass of the class of all fine rings. One of the main results is that matrix rings over t-fine rings are again t-fine rings. © 2024, CC BY.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Parallel Programming Strategies for Computing Walsh Spectra of Boolean Functions 1

引用

12th International ICT Innovations Conference, ICT Innovations 2020

作者： Bikov, Dushan Pashinska, Maria Faculty of Computer Science Goce Delchev University Shtip Macedonia Institute of Mathematics and Informatics Bulgarian Academy of Sciences Veliko Tarnovo Bulgaria

ISBN: (数字)9783030620981

ISBN: (纸本)9783030620974

The utilization of all computational resources is significant to achieve efficient computation. In order to exploit the available computation resources, we combine two parallel programming models such as MPI and CUDA. Combining of these two programming models ensures usage of the whole computation resources available in one computer system (CPU and GPU). In this paper, we present a way to use the available parallel processing resources to their full potential utilizing different strategies and techniques regarding data transfer. We perform experimental computation of well know algorithm for computing Walsh spectra of Boolean functions by combining these two parallel programming models. Experiments are performed on two different class of parallel processing capability hardware. Randomly generated Boolean functions of fourteen, sixteen, eighteen and twenty variables represent the used data set for experiments evaluations. Performed experiments show how the growth of the data size results in gaining more parallelization and therefore accelerate the execution. © 2020, Springer Nature Switzerland AG.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：