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

23rd IEEE/ACIS International Conference on computer and Information Science, ICIS 2023

作者： Andrikakis, Efthymios Perikos, Isidoros Paraskevas, Michael Hatzilygeroudis, Ioannis University of Patras Department of Computer Engineering & Informatics Patras Greece University of Patras Computer Technology Institute and Press Diophantus Department of Computer Engineering & Informatics Patras Greece Department of Electrical and Computer Engineering University of Peloponnese Computer Technology Institute and Press Diophantus Patras Greece

ISBN: (纸本)9798350345841

Recognizing the emotional content of Natural Language sentences can improve the way humans communicate with a computer system by enabling them to recognize and imitate emotional expressions. In this paper, deep learning, deep neural networks as well as Transformers were examined. Specifically, we designed and developed deep learning methods and BERT-based implementations for recognizing emotional content in user-generated data. Extensive experiments were conducted using these models on a variety of textual data and all the designed methods were evaluated. The results of the study show that BERT achieved the best overall performance, getting an F1-score of 0.86 on the Twitter Data dataset. Also, the Bi-LSTM with Attention Mechanism and Bi-LSTM using Word2vec performed quite well, achieving F1-scores of 0.83 and 0.82, respectively. © 2023 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Competitive analysis of on-line randomized call control in cellular networks 15

Competitive analysis of on-line randomized call control in c...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Caragiaannis, I. Kaklamanis, C. Papaioannou, E. Computer Technology Institute Department of Computer Engineering and Informatics University of Patras Rio26500 Greece

ISBN: (纸本)0769509908

In this paper we address an important communication issue arising in cellular (mobile) networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the same geographical region can communicate simultaneously with other users of the network using distinct frequencies. The spectrum of the available frequencies is limited;thus, efficient solutions to the call control problem are essential. The objective of the call control problem is, given a spectrum of available frequencies and users that wish to communicate, to maximize the number of users that communicate without signal interference. Using competitive analysis, we study the performance of algorithm p-RANDOM;an intuitive on-line randomized call control algorithm proposed previously for cellular networks. We give upper and lower bounds of its competitive ratio against oblivious adversaries as a function of the parameter p. Optimizing the upper bound function, we prove that there exists a 2.651-competitive randomized call control algorithm. In this way, we significantly improve the best known upper bound on the competitiveness of on-line randomized call control which was 2.934. © 2001 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Analysis and experimental evaluation of an innovative and efficient routing protocol for ad-hoc mobile networks

引用

4th International Workshop on Algorithm engineering, WAE 2000

作者： Chatzigiannakis, I. Nikoletseas, S. Spirakis, P. Computer Technology Institute Patras Greece Computer Engineering and Informatics Department Patras University Greece

ISBN: (纸本)3540425128

An ad-hoc mobile network is a collection of mobile hosts, with wireless communication capability, forming a temporary network without the aid of any established fixed infrastructure. In such a (dynamically changing) network it is not at all easy to avoid broadcasting (and flooding). In this paper we propose, theoretically analyse and experimentally validate a new and efficient protocol for pairwise communication. The protocol exploits the co-ordinated motion of a small part of the network (*** is a semi-compulsory protocol) in order to provide to various sendersand receivers an efficient support for message passing. Our implementation platform is the LEDA system and we have tested the protocol forthree classes of graphs (grids, random graphs and bipartite multi-stagegraphs) each abstracting a different "motion topology". Our theoretical analysis (based on properties of random walks) and our experimental measurements indicate that only a small fraction of themobile stations are enough to be exploited by the support in order toachieve very fast communication between any pair of mobile stations. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

An ontology-based approach for user modelling and personalization in E-Learning systems 18

An ontology-based approach for user modelling and personaliz...

引用

18th IEEE/ACIS International Conference on computer and Information Science, ICIS 2019

作者： Grivokostopoulou, Foteini Perikos, Isidoros Paraskevas, Michael Hatzilygeroudis, Ioannis Computer Engineering and Informatics Department University of Patras and Computer Technology Institute and Press "Diophantus" Patras Greece Department of Electrical and Computer Engineering University of Peloponnese and Computer Technology Institute and Press "Diophantus" Patras Greece Computer Engineering and Informatics Department University of Patras Patras Greece

ISBN: (纸本)9781728108018

Intelligent tutoring systems are becoming an important mean of education delivery and have changed the ways of teaching and learning. One of their most important aspects concerns the personalization and the adaptation of the learning procedures to learners’ characteristics. This is mainly achieved with the use of student modelling which is employed to record user context and to enhance the learning experience of the students. In this work, we present a generic ontology that incorporates concepts and properties used to model user profiles in order to formulate concrete, complete and extensible user modelling in e-learning systems. The ontology consists of learners’ personal, cognitive and social information as well as information about their performance and skills. In order to keep the student model updated, semantic rules are utilized to analyse student learning and to extract knowledge regarding their performance. The ontological approach is domain independent and can be utilized as a reference model for learner representation in intelligent tutoring systems in higher and distance education. © 2019 IEEE

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

An efficient routing protocol for hierarchical ad-hoc mobile networks 15

An efficient routing protocol for hierarchical ad-hoc mobile...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Chatzigiannakis, I. Nikoletseas, S. Spirakis, P. Computer Technology Institute Patras Greece Computer Engineering and Informatics Department Patras University Greece

ISBN: (纸本)0769509908

We introduce a new model of ad-hoc mobile networks, which we call hierarchical, that are comprised of dense subnetworks of mobile users (corresponding to highly populated geographical areas, such as cities), interconnected across access ports by sparse but frequently used connections (such as highways). For such networks, we present an efficient routing protocol which extends the idea (introduced in [4]) of exploiting the co-ordinated motion of a small part of an ad-hoc mobile network (the "support") to achieve very fast communication between any two mobile users of the network. The basic idea of the new protocol presented here is, instead of using a unique (large) support for the whole network, to employ a hierarchy of (small) supports (one for each city) and also take advantage of the regular traffic of mobile users across the interconnection highways to communicate between cities. We combine here theoretical analysis (average case estimations based on random walk properties) and experimental implementations (carried out using the LEDA platform) to claim and validate results showing that such a hierarchical routing approach is, for this class of ad-hoc mobile networks, significantly more efficient than a simple extension of the basic "support" idea presented in [4]. © 2001 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Knowledge-based adaptive assessment in a web-based intelligent educational system

Knowledge-based adaptive assessment in a web-based intellige...

引用

6th International Conference on Advanced Learning Technologies, ICALT 2006

作者： Hatzilygeroudis, Ioannis Koutsojannis, Constantinos Papavlasopoulos, Constantinos Prentzas, Jim Department of Computer Engineering and Informatics School of Engineering University of Patras Greece Department of Informatics and Computer Technology Technological Educational Institute of Lamia Greece

ISBN: (纸本)0769526322

In this paper, we present an adaptive and intelligent web-based educational system that uses AI techniques for personalized assessment of the learners. More specifically, we focus on a mechanism for on-line creation of a user-adapted test, which can be used alongside the predetermined test. The user can ask for such a test any time he/she is willing to do so, even if he/she has not studied all predetermined concepts of a learning goal. A small rule base is used by an expert system inference engine for making decisions on the difficulty level of the exercises to be included in the test. This is based on the evaluation of the learner during concept studying. Adaptive assessment of the learner can be repeatedly used until there is no further need. Another small rule-base is used for deciding on whether a new test is suggested or not. This is based on the learner's previous test assessment results. Preliminary experimental results show that the users need less time to study a learning goal when using the adaptive assessment capability of the system. © 2006 IEEE.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

Integrating GIS, GPS and GSM technologies for the effective management of ambulances

引用

computers, Environment and Urban Systems 2001年第3期25卷 267-278页

作者： Derekenaris, G. Garofalakis, J. Makris, C. Prentzas, J. Sioutas, S. Tsakalidis, A. Department of Computer Engineering and Informatics School of Engineering University of Patras 26500 Rion Patras Greece Computer Technology Institute Research Unit 5 PO Box 1122 26110 Patras Greece

In this paper, we describe a system offering a solution to the problem of ambulance management and emergency incident handling in the prefecture of Attica in Greece. It is based on the integration of geographic information system (GIS), global positioning system (GPS) and global system for mobile communication (GSM) technologies. The design of the system was the result of a project funded by the Greek Secretariat of Research and technology. A significant operation for the handling of emergency incidents is the routing of ambulances to incident sites and then to the closest appropriate hospitals. The response time of a real-time system like ours to such queries is of vital significance. By using efficient data structures for the implementation of the graph representing the road network, the time performance of the shortest-path algorithm can be enhanced. Incorporating the efficient algorithm within the GIS will increase our system's viability. © 2001 Elsevier Science Ltd. All rights reserved.

关键词： computer applications

来源：评论

学校读者我要写书评

暂无评论

Enforcing efficient equilibria in network design games via subsidies 12

Enforcing efficient equilibria in network design games via s...

引用

24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12

作者： Augustine, John Caragiannis, Ioannis Fanelli, Angelo Kalaitzis, Christos Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India Department of Computer Engineering and Informatics University of Patras CTI Greece School of Physical and Mathematical Sciences Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781450312134

The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example. In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to share the cost of the network to be established according to a well-defined rule. The design proposed by the network designer should now be consistent not only with the connectivity requirements but also with the selfishness of the users. Essentially, the users are players in a so-called network design game and the network designer has to propose a design that is an equilibrium for this game. As it is usually the case when selfishness comes into play, such equilibria may be suboptimal. In this paper, we consider the following question: can the network designer enforce particular designs as equilibria or guarantee that efficient designs are consistent with users' selfishness by appropriately subsidizing some of the network links? In an attempt to understand this question, we formulate corresponding optimization problems and present positive and negative results. Copyright 2012 ACM.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Introduction to Heterogeneous Robotic Systems in 5G and Beyond Networks

引用

IEEE WIRELESS COMMUNICATIONS 2023年第2期30卷 64-65页

作者： Lu, Huimin Ho, Pin-Han Khalfi, Bassem Verikoukis, Christos Kyushu Institute of Technology Japan Department of Electrical and Computer Engineering The University of Waterloo Canada Oregon State University CorvallisOR United States University of Patras Department of Computer Engineering & Informatics Greece

Remote intelligence in the application of robotics and the autonomous system relies heavily on seamless wireless connections. The 5G mobile network technology meets traditional manufacturing enterprises' application requirements for wireless networks based on robot transformation and upgrading, robot interconnection, and remote interactive applications in production. However, there exists many challenging 5G communication issues, such as different communication protocols in the system varies with different robots and no dis-ruptive changes to the physical layer.

关键词： Special issues and sections Robots 5G mobile communication Physical layer Autonomous systems Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Time-dependent alternative route planning 20

Time-dependent alternative route planning

引用

20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2020

作者： Kontogiannis, Spyros Paraskevopoulos, Andreas Zaroliagis, Christos D. Department of Computer Science and Engineering University of Ioannina Greece Computer Technology Institute and Press "Diophantus" Patras Greece Department of Computer Engineering and Informatics University of Patras Greece Department of Computer Engineering and Informatics University of Patras Greece Computer Technology Institute and Press "Diophantus" Patras Greece

ISBN: (纸本)9783959771702

We present a new method for computing a set of alternative origin-to-destination routes in road networks with an underlying time-dependent metric. The resulting set is aggregated in the form of a time-dependent alternative graph and is characterized by minimum route overlap, small stretch factor, small size and low complexity. To our knowledge, this is the first work that deals with the time-dependent setting in the framework of alternative routes. Based on preprocessed minimum travel-time information between a small set of nodes and all other nodes in the graph, our algorithm carries out a collection phase for candidate alternative routes, followed by a pruning phase that cautiously discards uninteresting or low-quality routes from the candidate set. Our experimental evaluation on real time-dependent road networks demonstrates that the new algorithm performs much better (by one or two orders of magnitude) than existing baseline approaches. In particular, the entire alternative graph can be computed in less than 0.384sec for the road network of Germany, and in less than 1.24sec for that of Europe. Our approach provides also "quick-and-dirty" results of decent quality, in about 1/300 of the above mentioned query times for continental-size instances. © Spyros Kontogiannis, Andreas Paraskevopoulos, and Christos D. Zaroliagis

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：