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

On the performance of up✶/down✶ routing 4th

4th International Workshop on Communication, architecture and Applications for Network-based Parallel Computing, CANPC 2000

作者： Alfaro, Francisco J. BermÚdez, Aurelio Casado, Rafael Duato, José Quiles, Francisco J. Sanchez, José L. Department of Computer Engineering and Technology University of Murcia Murcia30071 Spain Department of Computer Science University of Castilla-La Mancha Albacete02071 Spain Department of Information Systems Computer Architecture Technical University of Valencia Valencia46071 Spain

ISBN: (纸本)3540678794

Networks of Workstations (NOWs) are usually arranged as a set of interconnected switches with hosts connected to switch ports through interface cards. Several commercial interconnects for high-speed NOWs use up✶/down✶ routing. Every time the network is powered on or the topology is changed, a configuration algorithm is executed, which provides information about the topology and generates a directed graph. Routing tables are computed from this directed graph. There are several ways to obtain the directed graph. The most frequent way is by means of algorithms based on minimum-depth spanning-trees (MDST) or propagation-order spanning-trees (POST). This paper shows that, for most networks, graphs obtained by means of these methods can be improved in order to achieve higher network performance. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Efficient optimization of the parameters of LS-SVM for regression versus cross-validation error

Efficient optimization of the parameters of LS-SVM for regre...

引用

19th International Conference on Artificial Neural Networks, ICANN 2009

作者： Rubio, Ginés Pomares, Héctor Rojas, Ignacio Herrera, Luis Javier Guillén, Alberto Department of Computer Architecture and Technology University of Granada C/ Periodista Daniel Saucedo sn Granada 18071 Spain

ISBN: (纸本)3642042767

Least Squares Support Vector Machines (LS-SVM) are the state of the art in kernel methods for regression and function approximation. In the last few years, these models have been successfully applied to time series modelling and prediction. A key issue for the good performance of a LS-SVM model are the values chosen for both the kernel parameters and its hyperparameters in order to avoid overfitting the underlying system to be modelled. In this paper an efficient method for the evaluation of the cross validation error for LS-SVM is revised. The expressions for its partial derivatives are presented in order to improve the procedure for parameter optimization. Some initial guesses to set the values of both kernel parameters and the regularization factor are also presented. We finally conduct some experiments on a time series data example using a number of methods for parameter optimization for LS-SVM models. The results show that the proposed partial derivatives and heuristics can improve the performance with respect to both execution time and the optimized model obtained. © 2009 Springer Berlin Heidelberg.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant middleware based on multistream pipeline for private storage services

Fault-tolerant middleware based on multistream pipeline for ...

引用

7th International Conference for Internet technology and Secured Transactions, ICITST 2012

作者： Gonzalez, J.L. Sosa-Sosa, Victor Bergua, Borja Sanchez, Luis Miguel Carretero, Jesus Cd. Valles Institute of Technology Information Technology Laboratory Center of Research CINVESTAV Ciudad Victoria Mexico Computer Architecture and Technology Area Computer Science Department Universidad Carlos III Madrid Spain

ISBN: (纸本)9781908320087

This paper presents a fault-tolerant middleware for private storage services based on a client-server model. A client-side API split files into redundant chunks, which are encoded/decoded, anonymized, and distributed to different storage locations in parallel by using multistream pipeline. A chunk placement engine on the server-side API receives/delivers chunks from/to the client side API. In this model, the user preserves her files in-house and achieves data availability anytime from anywhere even in site failure scenarios while the organizations preserves the control of their storage resources. The experimental evaluation reveals the middleware can compensate the overhead produced on the client side by taking advantage of multiple cores commonly found in user's devices. The users observe that the middleware produces similar performance to the private and public file hosting systems tested in the evaluation. The organizations observe a significant reduction of work in their servers. In site disaster scenarios, the middleware yields even better performance than fault-tolerant online distributed solutions tested in the evaluation. © 2012 Infonomics Society.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Annotating words using wordnet semantic glosses

Annotating words using wordnet semantic glosses

引用

19th International Conference on Neural Information Processing, ICONIP 2012

作者： Szymański, Julian Duch, Wlodzislaw Department of Computer Systems Architecture Gdańsk University of Technology Poland Department of Informatics Nicolaus Copernicus University Toruń Poland School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9783642344770

An approach to the word sense disambiguation (WSD) relaying on the WordNet synsets is proposed. The method uses semantically tagged glosses to perform a process similar to the spreading activation in semantic network, creating ranking of the most probable meanings for word annotation. Preliminary evaluation shows quite promising results. Comparison with the state-of-the-art WSD methods indicates that the use of WordNet relations and semantically tagged glosses should enhance accuracy of word disambiguation methods. © 2012 Springer-Verlag.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Deceptive answer prediction with user preference graph

Deceptive answer prediction with user preference graph

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Li, Fangtao Gao, Yang Zhou, Shuchang Si, Xiance Dai, Decheng Google Research Mountain View Institute of Computing Technology CAS China State Key Laboratory of Computer Architecture Institute of Computing Technology CAS China Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)9781937284503

In Community question answering (QA) sites, malicious users may provide deceptive answers to promote their products or services. It is important to identify and filter out these deceptive answers. In this paper, we first solve this problem with the traditional supervised learning methods. Two kinds of features, including textual and contextual features, are investigated for this task. We further propose to exploit the user relationships to identify the deceptive answers, based on the hypothesis that similar users will have similar behaviors to post deceptive or authentic answers. To measure the user similarity, we propose a new user preference graph based on the answer preference expressed by users, such as "helpful" voting and "best answer" selection. The user preference graph is incorporated into traditional supervised learning framework with the graph regularization technique. The experiment results demonstrate that the user preference graph can indeed help improve the performance of deceptive answer prediction. © 2013 Association for Computational Linguistics.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

An enhanced scheme for mutual authentication for healthcare services

引用

Digital Communications and Networks 2022年第2期8卷 150-161页

作者： Salman Shamshad Muhammad Faizan Ayub Khalid Mahmood Saru Kumari Shehzad Ashraf Chaudhry Chien-Ming Chen Department of Computer Science COMSATS University IslamabadSahiwal Campus57000Pakistan Department of Mathematics Ch.Charan Singh UniversityMeerutUttar Pradesh250004India Department of Computer Engineering Faculty of Engineering and ArchitectureIstanbul Gelisim UniversityIstanbulTurkey College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China Riphah School of Computing&Innovation(RSCI) Riphah International UniversityLahore CampusLahore 55150Pakistan Department of Mathematics University of Padua35131 PaduaItaly

With the advent of state-of-art technologies,the Telecare Medicine Information System(TMIS)now offers fast and convenient healthcare services to patients at their ***,this architecture engenders new risks and challenges to patients'and the server's confidentiality,integrity and *** order to avoid any resource abuse and malicious attack,employing an authentication scheme is widely considered as the most effective approach for the TMIS to verify the legitimacy of patients and the ***,several authentication protocols have been proposed to this *** recently,Chaudhry et *** that there are vulnerabilities of impersonation attacks in Islam et al.'s ***,they introduced an improved protocol to mitigate those security ***,Qiu et *** that these schemes are vulnerable to the man-in-the-middle,impersonation and offline password guessing ***,they introduced an improved scheme based on the fuzzy verifier techniques,which overcome all the security flaws of Chaudhry et al.'s ***,there are still some security flaws in Qiu et al.'s *** this article,we prove that Qiu et al.'s protocol has an incorrect notion of perfect user anonymity and is vulnerable to user impersonation ***,we introduce an improved protocol for authentication,which reduces all the security flaws of Qiu et al.'s *** also make a comparison of our protocol with related protocols,which shows that our introduced protocol is more secure and efficient than previous protocols.

关键词： Authentication protocol Security protocol Anonymous protocol Impersonation attack TMIS

来源：评论

学校读者我要写书评

暂无评论

Advanced computer architecture 1

引用

丛书名： Communications in computer and Information Science

1000年

作者： Junjie Wu Lian Li

来源：评论

学校读者我要写书评

暂无评论

Persistent B+-Trees in non-volatile main memory 41st

Persistent B+-Trees in non-volatile main memory

引用

41st International Conference on Very Large Data Bases, VLDB 2015

作者： Chen, Shimin Jin, Qin State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Computer Science Department School of Information Renmin University of China China

computer systems in the near future are expected to have Non- Volatile Main Memory (NVMM), enabled by a new generation of Non-Volatile Memory (NVM) technologies, such as Phase Change Memory (PCM), STT-MRAM, and Memristor. The non-volatility property has the promise to persist in-memory data structures for instantaneous failure recovery. However, realizing such promise requires a careful design to ensure that in-memory data structures are in known consistent states after failures. This paper studies persistent in-memory B+-Trees as B+-Trees are widely used in database and data-intensive systems. While traditional techniques, such as undo-redo logging and shadowing, support persistent B+-Trees, we find that they incur drastic performance overhead because of extensive NVM writes and CPU cache flush operations. PCM-friendly B+-Trees with unsorted leaf nodes help mediate this issue, but the remaining overhead is still large. In this paper, we propose write atomic B+-Trees (wB+-Trees), a new type of main-memory B+-Trees, that aim to reduce such overhead as much as possible. wB+-Tree nodes employ a small indirect slot array and/or a bitmap so that most insertions and deletions do not require the movement of index entries. In this way, wB+- Trees can achieve node consistency either through atomic writes in the nodes or by redo-only logging. We model fast NVM using DRAM on a real machine and model PCM using a cycle-accurate simulator. Experimental results show that compared with previous persistent B+-Tree solutions, wB+-Trees achieve up to 8.8x speedups on DRAM-like fast NVM and up to 27.1x speedups on PCM for insertions and deletions while maintaining good search performance. Moreover, we replaced Memcached's internal hash index with tree indices. Our real machine Memcached experiments show that wB+-Trees achieve up to 3.8X improvements over previous persistent tree structures with undo-redo logging or shadowing. © 2015 VLDB Endowment 21508097/15/03.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Mapping Quantum Circuits to 2-Dimensional Quantum architectures

Mapping Quantum Circuits to 2-Dimensional Quantum Architectu...

引用

2022 Informatik in den Naturwissenschaften, INFORMATIK 2022 - 2022 computer Science in the Natural Sciences, INFORMATIK 2022

作者： Datta, Kamalika Kole, Abhoy Sengupta, Indranil Drechsler, Rolf Cyber Physical System Bremen Germany JIS University Department of Computer Science and Engineering Kolkata India Indian Institute of Technology Kharagpur Department of Computer Science and Engineering India University of Bremen Group of Computer Architecture Bremen Germany

ISBN: (纸本)9783885797203

We have been witnessing a rapid growth in quantum computing research over the years, with the emergence of demonstrable quantum computers of moderate size. The major issues that are faced to run a quantum algorithm reliably on these systems are: (i) lower qubit coherence period, (ii) noisy primitive gate operations, (iii) limited number of available physical qubits, and (iv) support of restricted set of 2-qubit operations. Overcoming these issues mandates physical resources that exceeds the capabilities of these noisy intermediate scale quantum (NISQ) systems. On the other hand, computation using bare qubits get further disturbed due to the inclusion of additional gates to mitigate the nearest neighbor constraints. In the present work, the 2-dimensional square, heavy-hex and fully hexagonal qubit coupling lattices are considered for mapping quantum circuits. The benefits are assessed in terms of minimal additional gates needed to satisfy the nearest neighbor (NN) constraint and the compilation complexity of mapping circuits on these architectures. From the experiments by mapping benchmark circuits on 16-qubit square and 65-qubit heavy-hex architectures from IBM as well as on a 64-qubit fully hexagonal architecture, it is observed that none of the square or heavy-hex lattice architecture provides uniform compilation advantage compared to the fully hexagonal architecture. It is expected that beyond the NISQ era, strongly connected lattices like hexagonal will become practically feasible. © 2022 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Towards a novel method for Architectural Design through μ-concepts and computational intelligence 1

Towards a novel method for Architectural Design through μ-c...

引用

1st Workshop on Artificial Intelligence and Design, AIDE 2015 - A Workshop of the 14th International Conference of the Italian Association for Artificial Intelligence, AI*IA 2015

作者： Vlavianos, Nikolaos Vassos, Stavros Nagakura, Takehiko Department of Architecture Massachusetts Institute of Technology United States Department of Computer Control and Management Engineering Sapienza University of Rome Italy

Architects typically tell stories about their design intentions and then translate the verbal descriptions into action-based commands in computer Aided Design tools. In other words, during the creative process the designer works in a "concepts space" that is different than the "properties space" available in the software virtual world of CAD tools. In this paper we propose to study the vocabulary of concepts used in architectural design by employing machine learning methods over large data-sets of architectural drawings and their storytelling descriptions. The intention is to computationally characterize the meaning of a set of high-level concepts in architectural design, which we call them as μ-concepts, in terms of a set of low-level properties of drawings. With such a correlation, new opportunities can be explored for radically different design tools that allow architects to design by operating over such high-level architectural concepts. Eventually, this will can also provide a novel way of understanding the mental process of architectural design through verbal concepts. Copyright ©2015 for the individual papers by the papers' authors.

关键词： Architectural design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：