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

16th International Conference on Diversity, Divergence, Dialogue, iConference 2021

作者： Tari, Mina Hua, Vivian Ng, Lauren Annabi, Hala ACCESS-IT Research Group University of Washington SeattleWA98105 United States

ISBN: (纸本)9783030712914

Asians are perceived as overrepresented in computing fields. However, understanding how intersecting identities complicates this view is essential. When considering gender, ethnicity, and socioeconomic class, it becomes clear Asians have varying experiences and representation within computing. Using critical race theory and feminist theory, our exploratory case study describes Asian women’s perceptions of inclusionary and exclusionary factors in their introductory computing courses as well as their undergraduate teaching assistants (TAs). We found that intersecting identities and context of the university change the salience of race for Asian women. Additionally, undergraduate TAs are seen as more relatable because of near-peer status, and their personalities more impactful than any identity characteristic. © 2021, Springer Nature Switzerland AG.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Framework Fuzzing Based on Model Mutation 6

Deep Learning Framework Fuzzing Based on Model Mutation

引用

6th IEEE International Conference on Data Science in Cyberspace, DSC 2021

作者： Shen, Xiangzhong Zhang, Jieyi Wang, Xiaonan Yu, Hongfang Sun, Gang School Of Information Communication Engineering University Of Electronic Science And Technology Of China Chengdu China

ISBN: (纸本)9781665418157

Deep learning(DL) frameworks are widely used for neural network model training and prediction in a lot of areas such as computer vision, natural language processing, medical image and so on. However, DL frameworks may contain bugs that lead to serious security problems, e.g., resource leakage, crashes, computational errors and abnormal behaviors, etc. In this work, we proposed FAME, a DL framework fuzzing system extended from LEMON with API mutation and optimizations for layer and weight mutation. FAME takes inconsistency as feedback to guide fuzzing and it's also able to detect two types of bugs: NaN bugs and crashes. In detail, NaN bugs represent computational logic defects in DL framework while crashes means serious problem in program logic or implementation. Compared with LEMON, FAME is able to adopt API mutation to generate models which could cover a mass of available values of parameters for selected layers. To be more clear, illegal parameters could cause model construction failure or DL frameworks' abnormal behaviors. In addition, we analyzed the disadvantages of some layer mutations and weight mutations of LEMON and proposed optimized methods to overcome them. We conducted FAME on five DL frameworks, i.e., TensorFlow, Pytorch, CNTK, Theano and MXNet to evaluate the effectiveness of our approach. The results of 7-day experiments demonstrate that FAME is effective to detect bugs in DL frameworks with totally 4 NaN and Crash bugs found. © 2021 IEEE.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Computing Grothendieck Point Residues via Solving Holonomic Systems of First Order Partial Differential Equations 21

Computing Grothendieck Point Residues via Solving Holonomic ...

引用

46th International Symposium on Symbolic and Algebraic computation, ISSAC 2021

作者： Tajima, Shinichi Nabeshima, Katsusuke Graduate School of Science and Technology Niigata University Nigata Japan Department of Applied Mathematics Tokyo University of Science Tokyo Japan

ISBN: (纸本)9781450383820

Grothendieck point residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules associated to a local cohomology class, a new effective method is given for computing Grothendieck point residue mappings. A basic strategy of our approach is the use of holonomic systems of first order linear partial differential equations. The resulting algorithm is easy to implement and can also be used to compute Grothendieck point residues in an effective manner. © 2021 Owner/Author.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

EFFECTIVE HOMOLOGY AND PERIODS OF COMPLEX PROJECTIVE HYPERSURFACES

arXiv

引用

arXiv 2023年

作者： Lairez, Pierre Pichon-Pharabod, Eric Vanhove, Pierre Université Paris-Saclay Inria Palaiseau91120 France Institut de Physique Theorique Université Paris-Saclay CEA CNRS Gif-sur-YvetteF-91191Cedex France

We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on Picard-Lefschetz theory and relies on the computation of the monodromy action induced by a one-parameter family of hyperplane sections on the homology of a given section. We provide a SageMath implementation. For example, on a laptop, it makes it possible to compute the periods of a smooth complex quartic surface with hundreds of digits of precision in typically an *** Codes Primary 14Q15, Secondary 32G20, 14D05 © 2023, CC BY.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Perturbative RG flows in AdS: an étude

arXiv

引用

arXiv 2023年

作者： Lauria, Edoardo Milam, Michael N. van Rees, Balt C. Mines Paris - PSL Université PSL Sorbonne Université CNRS Inria Paris75005 France CPHT CNRS École polytechnique Institut Polytechnique de Paris Palaiseau91120 France Institut de Physique Théorique Université Paris-Saclay CNRS CEA Gif-sur-YvetteF-9119 France

We discuss general properties of perturbative RG flows in AdS with a focus on the treatment of boundary conditions and infrared divergences. In contrast with flat-space boundary QFT, general covariance in AdS implies the absence of independent boundary flows. We illustrate how boundary correlation functions remain conformally covariant even if the bulk QFT has a scale. We apply our general discussion to the RG flow between consecutive unitary diagonal minimal models which is triggered by the (1,3) operator. For these theories we conjecture a flow diagram whose form is significantly simpler than that in flat-space boundary QFT. In several stand-alone appendices we discuss two-dimensional BCFTs in general and the minimal model BCFTs in particular. These include both an extensive review as well as the computation of several new BCFT correlation functions. © 2023, CC BY.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Exploring Patients’ AI Adoption Intention in the Context of Healthcare 1

引用

2nd International Conference on Digital Health and Medical Analytics, DHA 2020

作者： Zhu, Yiwei Sun, Shiwei School of Economics and Management Beijing Institute of Technology Beijing100081 China

ISBN: (数字)9789811636318

ISBN: (纸本)9789811636301

Artificial intelligence (AI) produces positive effects on the productivity and efficiency for organizations and is widely adopted in various contexts. Although individuals’ adoption of new technology has been studied widely, very few studies has been devoted to the adoption of AI in the context of healthcare. Based on technology adoption related theories, the study explains how the proposed factors impact patients’ trust toward AI technology and in turn their adoption attention. Using 304 patients’ sample, we built the conceptual model and conclude that trust toward AI technology, perceived ease of use, relative advantage, and perceived risk in the healthcare background significantly affect AI adoption intention. Our study thus extends the understanding of AI use in the healthcare industry. © 2021, Springer Nature Singapore Pte Ltd.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion 21

Tight Lower Bound for the RMR Complexity of Recoverable Mutu...

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2021

作者： Chan, David Yu Cheng Woelfel, Philipp University of Calgary CalgaryAB Canada

ISBN: (纸本)9781450385480

We present a tight RMR complexity lower bound for the recoverable mutual exclusion (RME) problem, defined by Golab and Ramaraju [9]. In particular, we show that any n-process RME algorithm using only atomic read, write, fetch-and-store, fetch-and-increment, and compare-and-swap operations, has an RMR complexity of ω(log n/log log n) on the CC and DSM model. This lower bound covers all realistic synchronization primitives that have been used in RME algorithms and matches the best upper bounds of algorithms employing swap objects (e.g.,[6,7,11]). Algorithms with better RMR complexity than that have only been obtained by either(i) assuming that all failures are system-wide [8], (ii) employing fetch-and-add objects of size (log n)ω;(1) [13], or (iii) using artificially defined synchronization primitives that are not available in actual systems [7, 10]. © 2021 ACM.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Detecting narrativity across long time scales

Detecting narrativity across long time scales

引用

2021 Conference on computational Humanities Research, CHR 2021

作者： Piper, Andrew Bagga, Sunyam Monteiro, Laura Yang, Andrew Labrosse, Marie Liu, Yu Lu McGill University 688 Sherbrooke St MontrealH2J3B2 Canada

Storytelling is a universal human practice that serves as a key site of education, collective memory, fostering social belief systems, and furthering human creativity. It can occur in different discursive domains for different social purposes with differing degrees of intensity. In this project, we develop computational methods for measuring the degree of narrativity in over 335,000 text passages distributed across two- to three-hundred years of history and four separate discursive domains (fiction, non-fiction, science, and poetry). We show how these domains are strongly differentiated according to their degree of narrative communication and, second, how truth-based discourse has declined considerably in its utilization of narrative communication. These findings suggest that there has been a long-term historical differentiation between the practices of knowing and telling, which raises important questions with respect to the social acceptance of both science and the arts. © 2021 Copyright for this paper by its authors.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Accurate Geometrical Modeling and Field-to-Wire Coupling Prediction in Wiring-Structures with Loops 34

Accurate Geometrical Modeling and Field-to-Wire Coupling Pre...

引用

34th General Assembly and Scientific Symposium of the International Union of Radio Science, URSI GASS 2021

作者： Liu, X. Grassi, F. Spadacini, G. Pignari, S.A. Politecnico di Milano Department of Electronics Information and Bioengineering Milan20133 Italy

ISBN: (纸本)9789463968027

Irregular-shaped wiring structures are usually encountered in practical applications. In this work, a wiring structure encompassing a loop is modeled geometrically by resorting to a 3D cylindrical helix. To predict the disturbances induced by an incident electromagnetic field at the terminals of such a nonuniform structure, a simplified numerical solution based on transmission-line (TL) theory is developed. To this end, the structure is discretized in segments and the Agrawal TL model is formulated by accounting for the actual orientation of each wire segment with respect to the incident electric field vector. Full-wave simulations of the current induced in the terminations of the wiring structure under analysis are used to validate the accuracy of the proposed numerical TL-based method as well as its computational effectiveness. © 2021 URSI.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Design Reverse Converter for Balanced RNS with Three Low-cost Modules 10

Design Reverse Converter for Balanced RNS with Three Low-cos...

引用

10th Mediterranean Conference on Embedded Computing, MECO 2021

作者： Lyakhov, Pavel Bergerman, Maxim Semyonova, Nataliya Kaplun, Dmitrii Voznesensky, Alexander North-Caucasus Federal University Stavropol Department of Mathematical Modeling Russia St. Petersburg Electrotechnical University 'Leti' St. Petersburg Department of Automation and Control Processes Russia

ISBN: (纸本)9780738133614

The development of modern computer technologies makes an urgent task of improving methods of storing, transferring and processing information. One of these methods is the Residue Number System (RNS), based on parallel computing of arithmetic operations [1]-[2].in This Paper, the Analysis of Three-Module Rns Was Carried Out Using a Measure of Rns Balance, the Crtf Constants for Rns 2n,2n-1,2n-1-1 Were Calculated, a Device Was Proposed that Implements the Reverse Conversion for Rns 2n,2n-1,2n-1-1, the Simulation Was Carried Out on Fpga, Which Confirmed the Quality of the Proposed Reverse Conversion. the Simulation Results Have Confirmed that the Proposed Reverse Conversion Takes Fewer Hardware Costs By 10-15%and Higher Speed By 2-25%. © 2021 IEEE.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：