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

arXiv 2019年

作者： Danh, Le Qui Khanh, Huynh Viet Faculty of Mathematics and Computer Science VNUHCM-University of Science 227 Nguyen Van Cu Str. Dist. 5 HCM-City Viet Nam Department of Mathematics Mechanics and Informatics University of Architecture 196 Pasteur Str. Dist. 3 HCM-City Viet Nam Faculty of Mathematics and Computer Science VNUHCM - University of Science 227 Nguyen Van Cu Str. Dist. 5 Ho Chi Minh City Viet Nam

Let D be a division ring with center F, and G a subnormal or quasinormal subgroup of D∗. We show that if G is locally solvable, then G is contained in F. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implementations of the C-calculus

引用

Connection science 1989年第1期1卷 41-51页

作者： Caianiello, Eduardo R. Eklund, Patrik E. Ventre, Aldo G. S. Department of Theoretical Physics and its Methodologies for the Applied Sciences University of Salerno Italy Depanment of Computer Science Abo Akademi Finland Institute of Mathematics of the Faculty of Architecture University of Napoli Monteoliveto 3 80134 Italy

C-calculus is a method for combining less descriptive information for larger sets to obtain detailed descriptions about smaller sets. This is achieved by iteratively taking products of information in the form of C-sets. A sequential model for implementing the C-calculus for applications in digitized imaging is presented. The sequential model is a base for a parallel implementation, which is measured for efficiency and applicability. © 1989, Taylor & Francis Group, LLC. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Book review Witold Pedrycz, Knowledge-Based Clustering: From Data to Information Granules, January 2005 (336 pp., Hardcover), ISBN: 0-471-46966-1, US $84.95.

引用

Information Processing & Management 2006年第1期42卷 321-322页

作者： Mihaela Ulieru Canada Research Chair in Adaptive Information Infrastructures for the e-Society Faculty of Computer Science Gillin Hall Room E-128 540 Windsor Street University of New Brunswick Fredericton NB E3B 5A3 Canada Tel.: +1 506 453 4566 fax: +1 506 453 3566.

来源：评论

学校读者我要写书评

暂无评论

Improving communication in PGAS environments: Static and dynamic coalescing in UPC 13

Improving communication in PGAS environments: Static and dyn...

引用

27th ACM International Conference on Supercomputing, ICS 2013

作者： Alvanos, Michail Farreras, Montse Tiotto, Ettore Amaral, José Nelson Martorell, Xavier Programming Models Barcelona Supercomputer Center Barcelona Spain Department of Computer Architecture Universitat Politecnica de Catalunya Cr. Jordi Girona 1-3 08034 Barcelona Spain Static Compilation Technology IBM Toronto Laboratory Toronto ON Canada Dep. of Computing Science University of Alberta Edmonton AB Canada Barcelona Supercomputing Center Cr. Jordi Girona 29 08034 Barcelona Spain IBM Canada CAS Research Markham ON Canada

ISBN: (纸本)9781450321303

The goal of Partitioned Global Address Space (PGAS) languages is to improve programmer productivity in large scale parallel machines. However, PGAS programs may have many fine-grained shared accesses that lead to performance degradation. Manual code transformations or compiler optimizations are required to improve the performance of programs with fine-grained accesses. The downside of manual code transformations is the increased program complexity that hinders programmer productivity. On the other hand, most compiler optimizations of fine-grain accesses require knowledge of physical data mapping and the use of parallel loop constructs. This paper presents an optimization for the Unified Parallel C language that combines compile time (static) and runtime (dynamic) coalescing of shared data, without the knowledge of physical data mapping. Larger messages increase the network efficiency and static coalescing decreases the overhead of library calls. The performance evaluation uses two microbenchmarks and three benchmarks to obtain scaling and absolute performance numbers on up to 32768 cores of a Power 775 machine. Our results show that the compiler transformation results in speedups from 1.15X up to 21X compared with the baseline versions and that they achieve up to 63% the performance of the MPI versions. © 2013 ACM.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Permutable subgroups in GLn(D) and applications to locally finite group algebras

arXiv

引用

arXiv 2019年

作者： Danh, Le Qui Bien, Mai Hoang Hai, Bui Xuan Faculty of Mathematics and Computer Science VNUHCM-University of Science 227 Nguyen Van Cu Str. Dist. 5 HCM-City Viet Nam Department of Mathematics Mechanics and Informatics University of Architecture 196 Pasteur Str. Dist. 3 HCM-City Viet Nam

In this paper we study the existence of free non-abelian subgroups in non-central permutable subgroups of general skew linear groups and locally finite group algebras. Copyright © 2019, The Authors. All rights re... 详细信息

关键词： Group theory

来源：评论

学校读者我要写书评

暂无评论

A Geographic-Semantic Context-Aware Urban Commuting Flow Prediction Model Using Graph Neural Network

SSRN

引用

SSRN 2024年

作者： Nejadshamsi, Shayan Bentahar, Jamal Eicker, Ursula Wang, Chun Jamshidi, Faezeh Concordia University MontrealQCH3G 1M8 Canada Department of Computer Science Khalifa University Abu Dhabi United Arab Emirates Canada Excellence Research Chair Next Generation Cities Gina Cody School of Engineering and Computer Science Concordia University MontrealQCH3G 1M8 Canada MOE International Joint Lab of Trustworthy Software East China Normal University Shanghai China

Prediction of urban-scale commuting flow plays an important role in the engineering of urban and transportation planning and optimization systems. The traditional and machine-learning solutions used for this purpose have some limitations. Traditional models, such as gravity model, are analytical physics-based models that lack important origin and destination features like land use and socio-demographic information. On the other hand, machine learning-based models leverage the essential information of origin and destination zones, which makes them better than traditional ones;however, they mostly ignore the influence of other zones. Recently, deep learning models were developed and integrated spatial dependency by including geographical adjacency graph. However, spatial dependency cannot always be captured from geographically nearby zones. To address this issue, we propose a hybrid graph-based deep learning model that captures the information of the neighbor zones both geographically and semantically and improves the prediction accuracy. The semantic adjacency is defined by the connectivity of zones using metro lines. We evaluate our proposed model on a real-world dataset for the city of Montreal, Canada, demonstrating our model's effectiveness relative to the state of the art. © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Multi-objective Optimization Framework for Multi-stakeholder Fairness-aware Recommendation

arXiv

引用

arXiv 2021年

作者： Wu, Haolun Ma, Chen Mitra, Bhaskar Diaz, Fernando Liu, Xue School of Computer Science McGill University 845 Sherbrooke St W MontrealQCH3A 0G4 Canada Department of Computer Science City University of Hong Kong 83 Tat Chee Avenue Y6302 Yeung Kin Man Academic Building Kowloon Tong Hong Kong Microsoft Research 2000 McGill College Ave MontrealQCH3A 3H3 Canada Google Canadian CIFAR AI Chair 1253 McGill College Ave MontrealQCH3B 2Y5 Canada

Nowadays, most online services are hosted on multi-stakeholder marketplaces, where consumers and producers may have different objectives. Conventional recommendation systems, however, mainly focus on maximizing consumers’ satisfaction by recommending the most relevant items to each individual. This may result in unfair exposure of items, thus jeopardizing producer benefits. Additionally, they do not care whether consumers from diverse demographic groups are equally satisfied. To address these limitations, we propose a multiobjective optimization framework for fairness-aware recommendation, Multi-FR, that adaptively balances accuracy and fairness for various stakeholders with Pareto optimality guarantee. We first propose four fairness constraints on consumers and producers. In order to train the whole framework in an end-to-end way, we utilize the smooth rank and stochastic ranking policy to make these fairness criteria differentiable and friendly to back-propagation. Then, we adopt the multiple gradient descent algorithm to generate a Pareto set of solutions, from which the most appropriate one is selected by the Least Misery Strategy. The experimental results demonstrate that Multi-FR largely improves recommendation fairness on multiple stakeholders over the state-of-the-art approaches while maintaining almost the same recommendation accuracy. The training efficiency study confirms our model’s ability to simultaneously optimize different fairness constraints for many stakeholders efficiently. Copyright © 2021, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED MEDIA ACCESS PROTOCOL FOR PACKET RADIO NETWORKS AND PERFORMANCE ANALYSIS .2. NETWORK SET-UP TIME AND DATA RATE

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 1995年第1期8卷 49-63页

作者： POND, LC LI, VOK Communication Sciences Electrical Engineering Systems University of Southern California Los Angeles CA 90089-2565 U.S.A. Lawrence C. Pond received the M.Sc. and Ph.D. degrees in electrical engineering from the University of Southern California in 1983 and 1990 respectively. Dr. Pond is currently a scientist at Hughes Space and Communications Company having joined in 1980. He has worked in the fields of communication system design mobile communication network and spacecraft payload design. He is currently working on the development of satellite-based ATM transport and switching architectures for BISDN and Defense Information System Network amlications. Dr. Pond is a member of IEEE. Victor O. K. Li was born in Hong Kong in 1954. He received his SB SM and Sc.D. degrees in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology Cambridge Massachusetts in 1977 1979 and 1981 respectively. Since February 1981 he has been with the University of Southern California (USC) LOS Angeles California where he is Professor of Electrical Engineering and Director of the USC Communication Sciences Institute. He has published 150 technical papers and has lectured and consulted extensively around the world. His research interests include high-speed communication networks personal communication networks intelligent networks distributed databases queueing theory graph theory and applied probability. Dr. Li is very active in the Institute of Electrical and Electronic Engineers (IEEE) having been a member of the Computer Communications Technical Committee since 1983 and having served as Chairman from 1987–1989. He served as Chairman of the Los Angeles Chapter of the IEEE Information Theory Group from 1983–1985. He is the Steering Committee Chair of the International Conference on Computer Communications and Networks (IC3 N) General Chair of the 1st Annual IC3N held in San Diego California in June 1992 General Chair and Technical Program Chair of the 4th IEEE Workshop on Comp

In this, the second part of a two-part paper, the required time for establishing a mobile packet radio network using the virtual circuit and time division multiple access protocol developed in Part 1 is analysed. Tools are developed to determine the virtual circuit and network set-up times in terms of the channel bandwidth allocated to establish and maintain the network. The tools are then extended to include the effects of user mobility. Then these results are combined with the network capacity results of Part 1 to analyse the trade-off between the data rate and set-up time of the network. Next a hierarchical architecture is proposed and the network data rate versus set-up time trade-off of this architecture is analysed using these tools. This architecture is shown to both provide a higher data rate and establish faster than flat networks of the same number of nodes.

关键词： PACKET RADIO NETWORK EPLRS DISTRIBUTED NETWORK TDMA VIRTUAL CIRCUITS MULTIHOP NETWORK BOUNDED DELAY MOBILITY NETWORK SET-UP TIME HIERARCHICAL NETWORK NETWORK DATA RATE

来源：评论

学校读者我要写书评

暂无评论

Services for numerical simulations and optimizations in grids

Services for numerical simulations and optimizations in grid...

引用

International Conference on Parallel Distributed and Grid Computing (PDGC)

作者： Steffen Limmer André Schneider Christian Boehme Dietmar Fey Simon Schmitz Achim Graupner Martin Sülzle Friedrich-Alexander-Universitat Erlangen-Nürnberg Chair of Computer Science Architecture Erlangen Germany Fraunhofer Institute for Integrated Circuits IIS Design Automation Division EAS Dresden Germany GWDG Göttingen Germany ERAS GmbH Göttingen Germany ZMD AG Dresden Germany EQUlcon Software GmbH Jena Germany

Numerical simulations are typically very compute intensive. A way to satisfy the arising demands for compute power is the employment of grid technology. But today, there exist only few tools, supporting the user in using grids for numerical simulations. Additionally, some basic problems of grid technology, are not solved with satisfaction. The goal of the project OptiNum-Grid was, to address these issues. We present a number of tools that were developed in the project. These are tools for parameter sweeps and optimizations in grids, for data security and automatic software installation, as well as for virtual environments in grids.

关键词： Cryptography Adaptation models Software

来源：评论

学校读者我要写书评

暂无评论

Conic Crease Patterns with Reflecting Rule Lines

arXiv

引用

arXiv 2018年

作者： Demaine, Erik D. Demaine, Martin L. Huffman, David A. Koschitz, Duks Tachi, Tomohiro Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology MA Cambridge32 Vassar Street02139 United States Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology MA Cambridge32 Vassar Street02139 United States Department of Computer Science University of California Santa CruzCA95064 United States School of Architecture Pratt Institute 200 Willoughby Avenue Brooklyn NY11205 United States Graduate School of Arts and Sciences The University of Toyo Meguro-ku TokyoKomaba 3-8-1153-8902 Japan

We characterize when two conic curved creases are compatible with each other, when the rule lines must converge to conic foci and reflect at the crease. Namely, two conics are compatible (can be connected by rule segments in a foldable curved crease pattern) if and only if they have equal or reciprocal eccentricity. Thus, circles (eccentricity 0) and parabolas (eccentricity 1) are compatible with only themselves (when scaled from a focus), and ellipses (eccentricity strictly between 0 and 1) and hyperbolas (eccentricity above 1) are compatible with themselves and each other (but only in specific pairings). The foundation of this result is a general condition relating any two curved creases connected by rule segments. We also use our characterization to analyze several curved crease designs. Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：