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

1991 Symposium on Applied Computing, SOAC 1991

作者： Ham, Lein Computer Science Telecommunications Program University of Missouri-Kansas City Kansas CityMO64110 United States

ISBN: (纸本)0818621362

A dynamic password authentication scheme based on public-key concept is proposed in this paper. The login password is changed dynamically and users can use this scheme within a remote login environment. Since we employ the public-key concept to bind each user's password to that user's identification, we eliminate the necessity for the system to store the encrypted password file. This approach has greatly reduced the risk of cracking the password from attacking the encrypted password file. In addition, we reduce the amount of information needed to be stored in the host system. © 1991 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Parallel bundle-based decomposition for large-scale structured mathematical programming problems

引用

Annals of Operations Research 1990年第1期22卷 101-127页

作者： Medhi, Deepankar Computer Science Telecommunications Program University of Missouri-Kansas City Kansas City 64110 MO 5100 Rockhill Road United States

In this paper, we present parallel bundle-based decomposition algorithms to solve a class of structured large-scale convex optimization problems. An example in this class of problems is the block-angular linear programming problem. By dualizing, we transform the original problem to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. Further, this dual problem consists of a collection of smaller independent subproblems which give rise to the parallel algorithms. We discuss the implementation on the CRYSTAL multi-computer. Finally, we present computational experience with block-angular linear programming problems and observe that more than 70% efficiency can be obtained using up to eleven processors for one group of test problems, and more than 60% efficiency can be obtained for relatively smaller problems using up to five processors for another group of problems. © 1990 J.C. Baltzer AG, Scientific Publishing Company.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance of redundancy methods in P2P networks under churn

Performance of redundancy methods in P2P networks under chur...

引用

2012 International Conference on Computing, Networking and Communications, ICNC'12

作者： Herrera-Ruiz, Octavio Znati, Taieb Graduate Telecommunications Program School of Information Science United States Computer Science Department School of Arts and Sciences University of Pittsburgh United States

ISBN: (纸本)9781467300094

Peer-to-Peer (P2P) networks organize large amounts of resources distributed across the Internet for user access. However, the availability of these resources is hindered by the participants' transient connectivity. Redundancy can be used to deal with this problem, but the redundancy repair traffic must be controlled to prevent performance degradation. In this paper, we present a comprehensive analytical formulation for erasure code redundancy methods in P2P networks, focused on fragments availability and redundancy repair cost. We use this model to evaluate the effectiveness of a proposed new redundancy scheme (PR) that outperforms other methods. Our results provide important insights for the design and construction of automated content availability mechanisms for P2P overlays under churn. Our evaluation framework allows us to determine at which point substituting a traditional erasure coding method (MDS) with other schemes is viable. For instance, e-MBR network coding performs worst than MDS for average fragment availabilities below 0.52. In addition, our experimental results indicate that adaptive repair strategies with elastic maintenance intervals can produce significant bandwidth savings compared with reactive and periodic redundancy repair strategies. In our experimental evaluation, an adaptive repair strategy consumes up to 49% less bandwidth than its periodic counterpart. © 2012 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Proactive repair redundancy algorithms for distributed storage in P2P networks

Proactive repair redundancy algorithms for distributed stora...

引用

2012 26th Queen's Biennial Symposium on Communications, QBSC 2012

作者： Herrera, Octavio Znati, Taieb Graduate Telecommunications Program School of Information Science United States Computer Science Department School of Arts and Sciences University of Pittsburgh United States

ISBN: (纸本)9781467311137

Distributed storage systems frequently use erasure coding based redundancy or replication to improve availability. Traditional erasure coding based approaches to redundancy are optimal in terms of their storage overhead-reliability tradeoff, but are expensive to repair. In this paper, we propose Proactive Repair (PR), a novel hybrid redundancy scheme. We discuss the implementation of the proposed scheme and discuss an emulated-based experimental study to evaluate PR's performance. The results show that PR outperforms exact-repair Minimum Bandwidth Regenerating (exact-MBR) network coding in terms of complexity and repair traffic overhead. Content availability when the system uses PR exhibits higher ability to dynamically adapt to changing failures rates, caused by nodes leaving the network. © 2012 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

CRYPTANALYSIS OF THE BLIND SIGNATURES BASED ON THE DISCRETE LOGARITHM PROBLEM

引用

ELECTRONICS LETTERS 1995年第14期31卷 1136-1136页

作者： HARN, L Computer Science Telecommunications Program University of Missouri Kansas City USA

Carmenisch et al. proposed a blind signature scheme based on the discrete logarithm during at the rump session of Eurocrypt'94. Horster er al. generalised this approach to design the Meta blind signature schemes. ... 详细信息

关键词： CRYPTOGRAPHY PUBLIC KEY CRYPTOGRAPHY

来源：评论

学校读者我要写书评

暂无评论

Integrated 6G TN and NTN Localization: Challenges, Opportunities, and Advancements

IEEE Communications Standards Magazine

引用

IEEE Communications Standards Magazine 2025年

作者： Saleh, Sharief Zheng, Pinjun Liu, Xing Chen, Hui Keskin, Musa Furkan Priyanto, Basuki Beale, Martin Ettefagh, Yasaman Seco-Granados, Gonzalo Al-Naffouri, Tareq Y. Wymeersch, Henk Chalmers University of Technology Department of Electrical Engineering Sweden King Abdullah University of Science and Technology (KAUST) Electrical and Computer Engineering Program Division of Computer Electrical and Mathematical Sciences and Engineering (CEMSE) Saudi Arabia Sony Europe BV United Kingdom Universitat Autònoma de Barcelona Department of Telecommunications and Systems Engineering Spain

The rapid evolution of cellular networks has introduced groundbreaking technologies, including large and distributed antenna arrays and reconfigurable intelligent surfaces in terrestrial networks (TNs), as well as aerial and space-based nodes in non-terrestrial networks (NTNs). These advancements enable applications beyond traditional communication, such as high-precision localization and sensing. While integrating TN and NTN enablers will lead to unparalleled opportunities for seamless global localization, such integration attempts are expected to face several challenges. To understand these opportunities and challenges, we first examine the distinctive characteristics of the key 6G enablers, evaluating their roles in localization from both technical and practical perspectives. Next, to identify developments driving TN-NTN localization, we review the latest standardization and industrial innovation progress. Finally, we discuss the opportunities and challenges of TN-NTN integration, illustrating its potential through two numerical case studies. © 2017 IEEE.

关键词： 6G localization low-Earth-orbit (LEO) satellites non-terrestrial network (NTN) reconfigurable intelligent surface (RIS) terrestrial network (TN)

来源：评论

学校读者我要写书评

暂无评论

Authentication protocols for personal communication systems 95

Authentication protocols for personal communication systems

引用

1995 Conference on Applications, Technologies, Architectures, and Protocols for computer Communication, SIGCOMM 1995

作者： Lin, Hung-Yu Ham, Lein Computer Science Telecommunications Program University of Missouri-Kansas City 4747 Troost Kansas CityMO64110 United States

ISBN: (纸本)0897917111

Masquerading and eavesdropping are major threats to the security of wireless communications. To provide proper protection for the communication of the wireless link, contents of the communication should be enciphered and mutual authentication should be conducted between the subscriber and the serving network. Several protocols have been proposed by standards bodies and independent researchers in recent years to counteract these threats. However, the strength of these protocols is usually weakened in the roaming environment where the security breach of a visited network could lead to persistent damages to subscribers who visit. The subscriber's identity is not well protected in most protocols, and appropriate mechanisms solving disputes on roaming bills are not supported either. To solve these problems, new authentication protocols are proposed in this paper with new security features that have not been fully explored before. © 1995 ACM.

关键词： Personal communication systems

来源：评论

学校读者我要写书评

暂无评论

Permutation routing in all-optical product networks 13th

引用

13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999

作者： Liang, Weifa Shen, Xiaojun Department of Computer Science Australian National University CanberraACT0200 Australia Computer Science Telecommunications Program University of Missouri-Kansas City Kansas CityMO64110 United States

ISBN: (纸本)3540658319

In this paper we study permutation routing techniques for all-optical networks. Firstly, we show some lower bounds on the number of wavelengths needed for implementing any permutation on an alloptical network in terms of bisection of the network. Secondly, we study permutation routing on product networks by giving a lower bound on the number of wavelengths needed, and presenting permutation routing algorithms for the wavelength non-conversion and conversion models, respectively. Finally, we investigate permutation routing on a cube-connectedcycles network by showing that the number of wavelengths needed for implementing any permutation in one round is [2 log nJ, which improves on a previously known general result for bounded degree graphs by a factor of O(log3 n) for this special case. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Open systems interconnection abstract syntax notation: *** 7th

引用

7th Annual Workshop on Conceptual Graphs, 1992

作者： Hines, Timothy R. Computer Science Telecommunications Program University of Missouri-Kansas City 4747 Troost Kansas CityMO64110-2499 United States

ISBN: (纸本)9783540574545

Open Systems Interconnection (OSI) enables communication between computers using a common set of protocols (rules) and structured data [5,9]. ASN.1 (Abstract Syntax Notation One) is a formal notation allowing communication between two different (or same) computer systems;each system agrees on what the data will mean when transmitted even though each system can choose its own local representation of the exchanged information [3]. ASN.1 has several drawbacks including usability of the language and its macro facility. A new notation *** (Abstract Syntax Notation using Conceptual Graphs) using conceptual graphs for representing abstract syntaxes is proposed. *** enhances usability and eliminates the macro facility. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

A bandwidth adaptation scheme to support QoS requirements of mobile users in wireless environments 9

A bandwidth adaptation scheme to support QoS requirements of...

引用

9th International Conference on computer Communications and Networks, ICCCN 2000

作者： Aljadhai, AbdulRahman Znati, Taieb F. Computer Technology Department Riyadh College of Technology Riyadh Saudi Arabia Department of Computer Science Telecommunications Program University of Pittsburgh PittsburghPA15260 United States

ISBN: (纸本)0780364945

- This paper presents an adaptive QoS management scheme to accommodate dynamic variations in network resources, due to the mobility of the users and location-dependent errors. The scheme ensures that satisfactory level of QoS guarantees are met regardless of the user mobility. QoS adaptation is achieved based on the use of application specific quality satisfaction curves, while enforcing a fair allocation of bandwidth among the competing flows. The performance of the proposed scheme is evaluated and results indicate that the scheme yields fair adaptation under heavy loads. © 2000 IEEE

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：