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

XIth International Scientific and Technical Conference Computer Sciences and Information Technologies (CSIT)

作者： Stefanovych, Tetyana Shcherbovskykh, Serhiy Lviv Polytech Natl Univ Dept Mech Engn Bandera St 12 UA-79013 Lvov Ukraine Lviv Polytech Natl Univ Theoret Radio Engn & Radio Measurements Dept Bandera St 12 UA-79013 Lvov Ukraine

The automatized reliability analysis technique based on fault tree is given. Using this technique for fault trees based on OR-gates and AND-gates structures the research are done. It is shown what stages of computatio... 详细信息

ISBN: (纸本)9781509027392

关键词： computational problems reliability fault tree combinatorial analysis time cost

来源：评论

学校读者我要写书评

暂无评论

computational problems in Automatized Reliability Analysis based on Fault Tree

Computational Problems in Automatized Reliability Analysis b...

引用

International Scientific and Technical Conference on Computer Science and Information Technologies

作者： Tetyana Stefanovych Serhiy Shcherbovskykh Mechanical Engineering Department Lviv Polytechnic National University Theoretical Radio Engineering and Radio Measurements Department Lviv Polytechnic National University

ISBN: (纸本)9781509027415

关键词： computational problems Reliability Fault tree Combinatorial analysis Time cost

来源：评论

学校读者我要写书评

暂无评论

Deciding representability of sets of words of equal length

引用

THEORETICAL COMPUTER SCIENCE 2013年 475卷 34-46页

作者： Blanchet-Sadri, F. Simmons, Sean Univ N Carolina Dept Comp Sci Greensboro NC 27402 USA MIT Dept Math Cambridge MA 02139 USA

Partial words are sequences over a finite alphabet that may have holes that match, or are compatible with, all letters in the alphabet;partial words without holes are simply words. Given a partial word w, we denote by sub(w) (n) the set of subwords of w of length n, i.e., words over the alphabet that are compatible with factors of w of length n. We call a set S of words h-representable if S = sub(w) (n) for some integer n and partial word w with h holes. Using a graph theoretical approach, we show that the problem of whether a given set is h-representable can be decided in polynomial time. We also investigate other computational problems related to this concept of representability. (C) 2013 Elsevier B.V. All rights reserved.

关键词： computational problems Algorithms Complexity classes P and NP Combinatorics on words Partial words Subwords Representable sets

来源：评论

学校读者我要写书评

暂无评论

Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography

引用

IET INFORMATION SECURITY 2023年第2期17卷 171-209页

作者： Biasse, J-F Bonnetain, X. Kirshanova, E. Schrottenloher, A. Song, F. Univ S Florida Ctr Cryptog Res 4202 E Fowler Ave Tampa FL 33620 USA Inria Nancy Grand Est CARAMBA Team Villers Les Nancy France I Kant Baltic Fed Univ Math Methods Informat Secur Lab Kaliningrad Kaliningrad Obl Russia CWI Cryptol Grp Amsterdam Netherlands Portland State Univ Dept Comp Sci Portland OR 97207 USA

In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post-quantum secure cryptosystems. The authors provide details on the cost of the quantum algorithms presented in this survey. The authors furthermore discuss ongoing research directions that can impact quantum cryptanalysis in the future.

关键词： public key cryptography post-quantum secure cryptosystems Reviews and tutorial papers post-quantum cryptography Quantum computation quantum cryptanalysis quantum computing hardness assumptions Cryptography computational problems quantum cryptography classically secure cryptosystems Cryptography theory Data security main quantum algorithms cryptography resource letters cryptosystem

来源：评论

学校读者我要写书评

暂无评论

Stochastic Analysis of Control Systems Subject to Communication and Computation Faults

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2023年第5期22卷 1-25页

作者： Vreman, Nils Maggio, Martina Lund Univ Dept Automat Control Ole Romers Vag 1 S-22363 Lund Sweden Univ Saarland Dept Comp Sci E1 3 Saarland Informat Campus D-66123 Saarbrucken Germany

Control theory allows one to design controllers that are robust to external disturbances, model simplification, andmodelling inaccuracy. Researchers have investigatedwhether the robustness carries on to the controller's digital implementation, mostly looking at how the controller reacts to either communication or computational problems. Communication problems are typically modelled using random variables (i.e., estimating the probability that a fault will occur during a transmission), while computational problems are modelled using deterministic guarantees on the number of deadlines that the control task has to meet. These fault models allow the engineer to both design robust controllers and assess the controllers' behaviour in the presence of isolated faults. Despite being very relevant for the real-world implementations of control system, the question of what happens when these faults occur simultaneously does not yet have a proper answer. In this paper, we answer this question in the stochastic setting, using the theory of Markov Jump Linear Systems to provide stability contracts with almost sure guarantees of convergence. For linear time-invariant Markov jump linear systems, mean square stability implies almost sure convergence - a property that is central to our investigation. Our research primarily emphasises the validation of this property for closed-loop systems that are subject to packet losses and computational overruns, potentially occurring simultaneously. We apply our method to two case studies from the recent literature and show their robustness to a comprehensive set of faults. We employ closed-loop system simulations to empirically derive performance metrics that elucidate the quality of the controller implementation, such as the system settling time and the integral absolute error.

关键词： computational problems deadline misses packet dropouts

来源：评论

学校读者我要写书评

暂无评论

VISUAL SHAPE COMPUTATION

引用

PROCEEDINGS OF THE IEEE 1988年第8期76卷 899-916页

作者： ALOIMONOS, J UNIV MARYLAND DEPT COMP SCICOLLEGE PKMD 20742 UNIV MARYLAND INST ADV COMP STUDIESCOLLEGE PKMD 20742

Perceptual processes responsible for computing shape from several cues, including shading, texture, contour, and stereo, are examined. It is noted that these computational problems, as well as that of computing shaping from motion, are ill-posed in the sense of Hadamard. It is suggested that regularization theory can be used along with a priori knowledge to restrict the space of possible solutions, and thus restore the problem's well-prosedness. Some alternative methods are outlined, and the idea of active vision is explored briefly in connection with the problem

关键词： a priori knowledge active vision computational problems computer vision computer vision computing shaping from motion contour cues ill posed problems regularization theory sense of Hadamard shading space of possible solutions stereo vision texture visual shape computation

来源：评论

学校读者我要写书评

暂无评论

Statistical model selection with "Big Data"

引用

COGENT ECONOMICS & FINANCE 2015年第1期3卷 1-N.PAG页

作者： Doornik, Jurgen A. Hendry, David F. Oxford Martin Sch Inst New Econ Thinking Oxford England Univ Oxford Econ Dept Oxford England

Big Data offer potential benefits for statistical modelling, but confront problems including an excess of false positives, mistaking correlations for causes, ignoring sampling biases and selecting by inappropriate methods. We consider the many important requirements when searching for a data-based relationship using Big Data, and the possible role of Autometrics in that context. Paramount considerations include embedding relationships in general initial models, possibly restricting the number of variables to be selected over by non-statistical criteria (the formulation problem), using good quality data on all variables, analyzed with tight significance levels by a powerful selection procedure, retaining available theory insights (the selection problem) while testing for relationships being well specified and invariant to shifts in explanatory variables (the evaluation problem), using a viable approach that resolves the computational problem of immense numbers of possible models.

关键词： Big Data model selection location shifts Autometrics computational problems

来源：评论

学校读者我要写书评

暂无评论

A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving 12th

A Language-Independent Framework for Reasoning About Prefere...

引用

12th International Symposium on Frontiers of Combining Systems (FroCoS)

作者： Ensan, Alireza Ternovska, Eugenia Simon Fraser Univ Burnaby BC Canada

ISBN: (纸本)9783030290078;9783030290061

Automated decision making often requires solving difficult and primarily NP-hard problems. In many AI applications (e.g., planning, robotics, recommender systems, etc.), users can assist decision making by specifying their preferences over some domain of interest. To take preferences into account, we take a model-theoretic approach to computationally hard problems with preferences. computational problems are characterized as Model Expansion, that is, the logical task of expanding an input structure to satisfy a set of specifications. The uniformity of the model-theoretic approach allows us to combine computational problems with preferences regardless of the syntax of their specifications. We introduce a formalism to represent preferences of users associated with computationally hard problems. We introduce Prioritized Model Expansion, which is Model Expansion based on preferences. We investigate properties of Prioritized Model Expansion and conduct a thorough study of the impact of introducing preferences on the computational complexity of Sigma(P)(k)-complete Model Expansion problems. We also discuss how Prioritized Model Expansion is related to other preference-based declarative approaches, such as SAT with preferences and preference-based Logic Programming.

关键词： Preference Model Expansion computational problems

来源：评论

学校读者我要写书评

暂无评论

Basic Transitions of Physarum Polycephalum

Basic Transitions of <i>Physarum Polycephalum</i>

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Dimonte, Alice Berzina, Tatiana Erokhin, Victor CNR IMEM Parco Area Sci 37-A I-43124 Parma Italy

ISBN: (纸本)9788360810668

The main charter of this work is the organism Physarum polycephalum, in particular plasmodium, Physarum's vegetative phase. During this latter form, the organism is more active and moves searching for food. Plasmodium behaves like a giant amoeba, and more interestingly, its way of foraging can be interpreted as a computation. By comparing the reaction of this organism with attractors and repellents, knowing its capability of solving computational problems with natural parallelism, we dedicated the present work to study the behavior of Physarum polycephalum slime mold under different conditions.

关键词： biotechnology microorganisms Physarum polycephalum organism Physarum polycephalum slime mold Physarum vegetative phase amoeba attractors computational problems natural parallelism plasmodium repellents Biomedical optical imaging Clocks Glass Microscopy Optical microscopy Organisms Veins

来源：评论

学校读者我要写书评

暂无评论

Portfolio Optimization With Investor Utility Preference of Higher-Order Moments: A Behavioral Approach

REVIEW OF BEHAVIORAL ECONOMICS

引用

REVIEW OF BEHAVIORAL ECONOMICS 2017年第2期4卷 83-106页

作者： Bekiros, Stelios Loukeris, Nikolaos Eleftheriadis, Iordanis EUI Dept Econ Florence Italy IPAG Business Sch Paris France Univ Macedonia Dept Business Adm Thessaloniki Greece

We incorporate advanced higher moments of individual or institutional investors in a new approach dealing with the portfolio selection problem, formulated under a multi-criteria optimization framework. The "integrated portfolio intelligence" model extracts hidden patterns out of company fundamental indices and filters out effects such as trader noise or fraud utilizing advanced big data machine learning modeling. One of the main advantages of this novel system aside from providing with computer-efficient algorithmic optimality and predictive out performance is that it detects and extracts hidden trader behavioral patterns and firm investment "styles" from the data sets of large-scale institutional portfolios, which ultimately leads to the aversion and protection of extensive market manipulation and speculation.

关键词： Utility preference Support Vector Machines Genetic Evolution Financial markets Financial markets: Portfolio theory Behavioral Decision Making Financial econometrics computational problems Information Systems Economics: Trading systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：