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

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： D. Oikonomopoulou M. Rigou S. Sirmakessis A. Tsakalidis Computer Engineering and Informatics Department University of Patras Greece Research Academic Computer Technology Institute Patras Greece

ISBN: (纸本)9780769521008

Understanding and modeling user online behavior, as well as predicting future requests remain an open challenge for researchers, analysts and marketers. In this paper, we propose an efficient prediction schema based on the extraction of sequential navigation patterns from server log files, combined with web site topology. Traversed paths are monitored, internally recorded and cleaned before being completed with cashed page views. After session and episode identification follows the construction of n-grams. Prediction is based upon a 5 + n-gram schema with all lower level n-grams participating, a procedure that resembles the construction of an All 5th-order Markov Model. The schema achieves full coverage while maintaining competitive prediction precision.

关键词： Topology Predictive models Data mining Navigation Association rules Prefetching Accuracy informatics File servers Monitoring

来源：评论

学校读者我要写书评

暂无评论

Web page fragmentation for personalized portal construction

Web page fragmentation for personalized portal construction

引用

International Conference on Information technology: Coding and Computing (ITCC)

作者： B. Christos K. Vaggelis M. Ioannis Computer Engineering and Informatics Department University of Patras Greece Research Academic Computer Technology Institute Patras Greece

Web portals offer many services and wealth of content to Web users. However, most users do not find interest in all the content present in these sites. Most of them visit some specific sites and browse in specific thematic areas of them. In this paper, a software technique is presented that allows the viewers of Web sites to build their own personalized portals, using specific thematic areas of their preferred sites. This transcoding technique is based on an algorithm, which fragments a Web page in discrete fragments using the page's internal structure. A training and update procedure is used for identifying the different instances of thematic areas in different time points.

关键词： Web pages Portals HTML Algorithm design and analysis Transcoding Buildings informatics Software tools Web server Optical wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for handling Molecular Weighted Sequences

Efficient algorithms for handling Molecular Weighted Sequenc...

引用

IFIP 18th World computer Congress, TC1 and 3rd International Conference on Theoretical computer Science, TCS 2004

作者： Iliopoulos, Costas S. Makris, Christos Panagis, Yannis Perdikuri, Katerina Theodoridis, Evangelos Tsakalidis, Athanasios Department of Computer Science King's College London Strand London WC2R2LS United Kingdom Department of Computer Engineering and Informatics University of Patras 26500 Patras Greece Research Academic Computer Technology Institute 61 Riga Feraiou Str. 26221 Patras Greece

ISBN: (纸本)1402081405

In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Weighted Sequences can model important biological processes such as the DNA Assembly Process or the DNA-Protein Binding Process. Thus pattern matching or identification of repeated patterns, in biological weighted sequences is a very important procedure in the translation of gene expression and regulation. We present time and space efficient algorithms for constructing the weighted suffix tree and some applications of the proposed data structure to problems taken from the Molecular Biology area such as pattern matching, repeats discovery, discovery of the longest common subsequence of two weighted sequences and computation of covers. © 2004 Springer Science + Business Media, Inc.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Scan cell ordering for low power BIST

Scan cell ordering for low power BIST

引用

IEEE computer Society Annual Symposium on VLSI

作者： M. Bellos D. Bakalis D. Nikolos Computer Engineering & Informatics Department University of Patras Patras Greece Research Academic Computer Technology Institute Patras Greece

Power dissipation during scan-based testing has gained significant importance in the past few years. In this work we examine the use of transition frequency based on scan cell ordering techniques in pseudorandom scan based BIST in order to reduce average power dissipation. We also propose the resetting of the input register of the circuit together with ordering of its elements to further reduce average power dissipation. Experimental results indicate that the proposed techniques can reduce average power dissipation up to 57.7%.

关键词： Built-in self-test Very large scale integration computer Society

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of an IPv6-capable H323 application

Performance evaluation of an IPv6-capable H323 application

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： C. Bouras A. Gkamas D. Primpas K. Stamos Computer Engineering and Informatics Department University of Patras Patras Greece Research Academic Computer Technology Institute Patras Greece

OpenH323 is an open source H.323 implementation that has been ported to IPv6. In this paper we briefly introduce the library architecture and the performance criteria with which the ported version should be evaluated. We then present a variety of experiments that we conducted in order to comparatively evaluate the IPv4 and IPv6 protocol stacks. We also present the results of some initial experiments comparing IPv4 and IPv6 performance under congested network links and the conclusions that they lead us to.

关键词： Protocols Libraries Internet Network address translation Quality of service Programming profession Application software informatics computer architecture Shape

来源：评论

学校读者我要写书评

暂无评论

An adaptive admission control algorithm for bandwidth brokers

An adaptive admission control algorithm for bandwidth broker...

引用

IEEE International Symposium on Network Computing and Applications

作者： Ch. Bouras K. Stamos Computer Engineering and Informatics Department University of Patras Patras Greece Research Academic Computer Technology Institute Patras Greece

This work focuses on the operation of the bandwidth broker, an entity that is responsible for managing the bandwidth within a network domain and for the communication with bandwidth brokers of neighboring domains. A very important aspect of the bandwidth broker is its admission control module that determines whether the bandwidth reservation requests are going to be accepted or not. We summarize the status of the current research in this field and propose architecture for the admission control module that aims at achieving a satisfactory balance between maximizing the resource utilization for the network provider and minimizing the overhead of the module. This is achieved by gathering and examining sets of book-ahead requests and by adapting the size of the set to be examined so that the network utilization and the computation overhead are appropriately balanced.

关键词： Programmable control Adaptive control Admission control Bandwidth Resource management computer networks Diffserv networks computer architecture informatics Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Fast implementation of morphological operations using binary image block decomposition

引用

International Journal of Image and Graphics 2004年第2期4卷 183-202页

作者： Gatos, Basilios Perantonis, Stavros J. Papamarkos, Nikos Andreadis, Ioannis Computational Intelligence Laboratory Institute of Informatics and Telecommunications National Research Center Demokritos Athens153 10 Greece Department of Electrical and Computer Engineering Democritus University of Thrace Xanthi67 100 Greece

Morphological transformations are commonly used to perform a variety of image processing tasks. However, morphological operations are time-consuming procedures since they involve ordering and min/max computation of numbers resulting from image interaction with structuring elements. This paper presents a new method that can be used to speed up basic morphological operations for binary images. To achieve this, the binary images are first decomposed in a set of non-overlapping rectangular blocks of foreground pixels that have predefined maximum dimensions. Then off-line dilation and erosion of all rectangular blocks are arbitrary obtained and stored into suitable look-up array tables. By using the look up tables, the results of the morphological operations to the rectangular blocks are directly obtained. Thus, first all image blocks are replaced by their look-up array tables. Then the morphological operations are applied only to the limited number of the remaining pixels. Experimental results reveal that starting from a block represented binary image morphological operations can be executed with different types of structuring elements in significantly less CPU time. Using the block representation, we are able to perform dilation 16 times faster than non-fast implementations and 10 times faster than an alternative fast implementation based on contour processing. Significant acceleration is also recorded when using this approach for repeated application of dilation (for 10 iterations, dilation using the block representation is over 20 times faster than non-fast implementations and over four times faster than using the fast contour based approach). © 2004 World Scientific Publishing Company.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

Towards a unifying framework for complex query processing over structured peer-to-peer data networks

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 2944卷 169-183页

作者： Triantafillou, Peter Pitoura, Theoni Computer Technology Institute Department of Computer Engineering and Informatics University of Patras Greece

ISBN: (纸本)3540209689

In this work we study how to process complex queries in DHT-based Peer-to-Peer (P2P) data networks. Queries are made over tuples and relations and are expressed in a query language, such as SQL. We describe existing research approaches for query processing in P2P systems, we suggest improvements and enhancements, and propose a unifying framework that consists of a modified DHT architecture, data placement and search algorithms, and provides efficient support for processing a variety of query types, including queries with one or more attributes, queries with selection operators (involving equality and range queries), and queries with join operators. To our knowledge, this is the first work that puts forth a framework providing support for all these query types. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Transmission systems prototyping based on stateflow/simulink models

Transmission systems prototyping based on stateflow/simulink...

引用

Proceedings - 15th IEEE International Workshop on Rapid Systems Prototyping

作者： Papandreou, Nikolaos Varsamou, Maria Antonakopoulos, Theodore Research Academic Computer Technology Institute RACTI 61 Riga Feraiou Str. 26100 Patras Greece University of Patras Department of Electrical Engineering 26500 Rio - Patras Greece

In this paper we describe an efficient methodology for rapid prototyping of data transmission systems based on Stateflow/Simulink models using a multi-level system development and testing approach. Transmission systems incorporate multi-domain functions and algorithms, i.e. physical layer circuits and communication protocol controllers. The Stateflow/Simulink environment enables the development of precise simulation models that include signal and protocol processing units. The proposed prototyping methodology is based on the progressive translation of high-level model blocks into hardware/software modules of the prototype architecture using custom and/or automated code generation tools. A custom data exchange and synchronization interface between the Stateflow/Simulink workspace and the circuit modules enables the integration of the simulation model and the prototyping platform into a complete functional system. The application of the proposed methodology in the development of an ADSL modem in a custom prototyping platform is also described.

关键词： Carrier communication

来源：评论

学校读者我要写书评

暂无评论

Low power testing by test vector ordering with vector repetition

Low power testing by test vector ordering with vector repeti...

引用

IEEE International Symposium on Quality Electronic Design

作者： M. Bellos D. Bakalis D. Nikolos X. Kavousianos Computer Engineering & Informatics Department University of Patras Patras Greece Research Academic Computer Technology Institute Patras Greece Computer Science Department University of Ioannina (UoI) Ioannina Greece

Test vector ordering with vector repetition has been presented as a method to reduce the average as well as the peak power dissipation of a circuit during testing. Based on this method, in this paper we present some techniques that can be used to further reduce the average power dissipation. Experimental results validate that the proposed techniques achieve considerable savings in energy and average power dissipation while reducing the length of the resulting test sequences compared to the original method.

关键词： Circuit testing Power dissipation Switching circuits Energy dissipation TV Scholarships Delay System testing Power system reliability Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：