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

An IP packet forwarding technique based on a new structure of lookup table

International Journal of computers and Applications 2006年第2期28卷 112-121页

作者： Arafat Ali, H. El-Desouky, A.I. Ared, M.F. Computers and Systems Dept. Faculty of Engineering Mansoura University Mansoura Egypt Deptartment of Computer Science University of Connecticut Storrs United States University of Mansoura Faculty of Computer Science Computer and Control Department Mansoura University Computer Engineering and Systems Department Faculty of Engineering Mansoura University Mansoura Egypt

In computer networks nowadays, high-speed routers are compulsory to deliver the incoming packet to its destination. There are two parameters that exist in all lookup techniques that directly affect performance results: data structure size and number of lookup table accesses. With these remarks in mind, the specific goals of this paper are: (i) Design a data structure for storing an IP lookup table that enhances the lookup process, (ii) Produce an IP lookup algorithm that has a bounded worst-case number of accesses lower than contemporary techniques, and (iii) Improve updating and deletion operations that do not create a bottleneck to efficient forwarding. This paper investigates a suitable data structure of the routing table in order to minimize the total routing time. The investigated structure of the routing table is based on RapidBase technique. It contains all the information necessary to forward an IP data packet toward its destination. The properties of the created routing table facilitate searching for the best matching prefix quicker than when using the current routing table where packets do not have to be queued before lookup. Additionally, the proposed algorithm's effectiveness is deliberated via simulation. A comparative study with recently published algorithms shows that our proposed scheme has a great impact on shortening the route lookup and update operations. For more enhancements, combinations of the proposed algorithm with the most popular algorithms are also studied.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

Protecting an asynchronous NoC against transient channel faults

Protecting an asynchronous NoC against transient channel fau...

引用

15th Euromicro Conference on Digital System Design, DSD 2012

作者： Naqvi, Syed Rameez Veeravalli, Varadan Savulimedu Steininger, Andreas Embedded Computing Systems Deptartment of Computer Engineering Vienna University of Technology Vienna Austria

ISBN: (纸本)9780769547985

Considering the increasing rates of transient faults predicted for future technology nodes, we investigate options for protecting the communication channels within an NoC from those. Our target is an asynchronous NoC, as its data-driven activity emanates from a more energy aware communication concept. We compare different redundancy schemes with the aim of providing a reliable communication service where error detection and correction is transparent to the higher system levels, and we also propose a new scheme. Our comparison is supported by results from simulation and synthesis. While all solutions are designed to withstand at least one transient fault, they largely differ in their area and delay penalty as well as potential extra coverage that some of them offer. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A convolutional state-space framework for wind turbine fault diagnosis using hierarchical feature extraction and dynamic state modeling on SCADA system

引用

Nondestructive Testing and Evaluation 2025年

作者： Irfan, Muhammad Ahmed Khan, Nabeel Mushtaq, Zohaib Abbas, Ghulam Shaher, Abdullah Rahman, Saifur Electrical Engineering Department College of Engineering Najran University Najran Saudi Arabia Center for AI & Big Data Namal University Mianwali Pakistan Deptartment of Electrical Electronics and Computer Systems University of Sargodha Sargodha Pakistan Department of Electrical Engineering The University of Lahore Lahore Pakistan

Wind turbines are the backbone of renewable energy production but are often subject to mechanical failure that reduces efficiency and increases maintenance costs, as well as downtime. Traditional non-destructive testing and fault diagnosis approaches such as vibration analysis are inflexible and non-adaptive;on the other hand, deep learning-based methods lack interpretability of their practices. To tackle these issues, we present a fault diagnosis framework that combines 1D-CNN and Dynamic state-space model (DSSM) for 1D vibration signals from faulty turbine states. This novel modelling approach combines both local and temporal dependencies which helps improve interpretability and enables real-time fault detection. The efficacy of our approach is validated on a series of wind turbine fault conditions, showing competitive performance compared to classical machine learning models and deep learning models by achieving an average of 97% accuracy across all conditions, with high fault classification accuracy at different operational conditions as well. © 2025 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Nondestructive examination

来源：评论

学校读者我要写书评

暂无评论

Adaptive keyhole SVD method for dynamic MRI reconstruction

Adaptive keyhole SVD method for dynamic MRI reconstruction

引用

8th International Symposium on Signal Processing and its Applications, ISSPA 2005

作者： Chen, Zhaolin Zhang, Jingxin Pang, Khee K. Deptartment of Electrical and Computer Systems Engineering Monash University Clayton Vic. 3800 Australia

ISBN: (纸本)0780392434

Keyhole Singular Value Decomposition (KSVD) method is known as one of the most commonly used methods for reduced encoding reconstruction of dynamic Magnetic Resonance Imaging (MRI). This paper provides a new enhanced version of this method, called Adaptive KSVD (AKSVD). Instead of original method's direct duplication of unacquired data from the reference frame, the proposed method uses a temporal model based adaptive scheme to update the unacquired data in following frames, which better captures dynamical changes. The experiment results obtained from the simulated as well as real MRI data show that the proposed AKSVD method can produce images with much lower reconstruction error. © 2005 IEEE.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

Scalability and performance experiments using synthetic distributed server systems

引用

Distributed systems engineering 1996年第1期3卷 2-8页

作者： Woodside, C.M. Schramm, C. Deptartment of Systems and Computer Engineering Carleton University Ottawa Ont. K1S 5B6 Canada

The Layered System Generator is used to create synthetic distributed systems of tasks with client-server style (RPC) interactions, representing a wide range of software architectures and workload patterns. A synthetic task system can be used to generate network and workstation traffic which represents the load from a planned software system, so one can observe its probable performance when run on the target network, or its probable impact on other existing applications. It can be used to evaluate the planned software design, or the target network's capability, or both combined. Using LSG, tests were made with systems of up to 39 tasks on a UNIX network, to investigate the performance changes that occur when a small task system is scaled up in size. The performance recorded across the range of experiments was also compared with predictions made by an analytic performance model. The errors were found to be small provided an allowance is made for workstation daemons and similar load components. © 1996 The British computer Society,.

关键词： Workstations allowance Software design distributed server Scalability Software systems Religious Missions Network SYNTHETICS LOAD server systems

来源：评论

学校读者我要写书评

暂无评论

Exploiting web document structure to improve storage management in proxy caches 1

引用

9th International Conference on High Performance Computing, HiPC 2002

作者： Abhari, Abdolreza Dandamudi, Sivarama P. Majumdar, Shikharesh Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada Deptartment of Systems and Computer Engineering Carleton University Ottawa Canada

ISBN: (数字)9783540362654

ISBN: (纸本)3540003037

Proxy caches are essential to improve the performance of World Wide Web and to enhance user perceived latency. In this paper, we propose a new Web object based policy to manage the storage system of a proxy cache. We propose two techniques to improve the storage system performance. The first technique is concerned with prefetching the related files belonging to a Web object, from the disk to main memory. This prefetching improves performance as most of the files can be provided from the main memory instead of proxy disk. The second technique stores the Web object members in contiguous disk blocks in order to reduce the disk access time. This in turn reduces the disk response time. We have used trace-driven simulations to study the performance improvements one can obtain with these two techniques. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Proxy caches

来源：评论

学校读者我要写书评

暂无评论

Asynchronous gossip algorithms for stochastic optimization

Asynchronous gossip algorithms for stochastic optimization

引用

2009 International Conference on Game Theory for Networks, GameNets '09

作者： Sundhar Ram, S. Nedic, A. Veeravalli, V.V. Electrical and Computer Engineering Deptartment University of Ilinois Urbana IL 61801 United States Industrial and Enterprise Systems Engineering University of Ilinois Urbana IL 61801 United States

ISBN: (纸本)9781424441778

We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of which is known (with stochastic errors) to a specific network agent. We propose an asynchronous algorithm that is motivated by a random gossip scheme where each agent has a local Poisson clock. At each tick of its local clock, the agent averages its estimate with a randomly chosen neighbor and adjusts the average using the gradient of its local function that is computed with stochastic errors. We investigate the convergence properties of the algorithm for two different classes of functions: differentiable but not necessarily convex and convex but not necessarily differentiable. ©2009 IEEE.

关键词： Clocks

来源：评论

学校读者我要写书评

暂无评论

Efficient and reliable template set matching for 3D object recognition 2

Efficient and reliable template set matching for 3D object r...

引用

2nd International Conference on 3-D Digital Imaging and Modeling, 3DIM 1999

作者： Greenspan, Michael Boulanger, Pierre Deptartment of Systems and Computer Engineering Carleton University Ottawa Canada Visual Information Technology Group Institute for Information Technology National Research Council Canada Canada

ISBN: (纸本)0769500625

Object recognition in range image data is formulated as template set matching. The object model is represented as a set of voxel templates, one for each possible pose. The set of all templates is composed into a binary decision tree. Each leaf node references a small number of templates. Each internal node references a single voxel, and has two branches, T and F. The subtree branching from the T branch contains the subset of templates which contain the node voxel. Conversely, the subtree branching from F branch contains the subset of templates which do not contain the node voxel. Traversing the tree at any image location executes a point probe strategy. It efficiently determines a good match with the template set by interrogating only those elements which discriminate between the remaining possible interpretations. The method has been implemented for a number of different heuristic tree design and traversal methods. Results are presented of extensive tests for two objects under isolated, cluttered, and occluded scene conditions. It is shown that there exist traversal/design combinations which are both efficient and reliable, and that the method is robust. © 1999 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Interactive platform for Project-Based Learning based on web technologies 30

Interactive platform for Project-Based Learning based on web...

引用

30th International Scientific Conference Electronics, ET 2021

作者： Chikurteva, A. Spasova, N. Bogdanov, S. Institute of Information and Communication Technologies Bulgarian Academy of Sciences Sofia1113 Bulgaria Faculty of Electronic Engineering and Technologies Department of Microelectronics Technical University of Sofia Faculty of Computer Systems and Technologies Deptartment of Computer Systems Sofia1000 Bulgaria

ISBN: (纸本)9781665445184

The article presents software architecture on a specialized platform designed for teaching through Project-Based Learning. This platform is designed to facilitate and assist teachers by offering interactive features for creating project-based lessons and tracking the implementation of these lessons. Web technologies that are used to create the platform are described. The software architecture through which the platform will be built is presented. © 2021 IEEE.

关键词： Software architecture

来源：评论

学校读者我要写书评

暂无评论

Partial data reuse for nested loop computations: Design space exploration for FPGA implementations

Partial data reuse for nested loop computations: Design spac...

引用

作者： Park, Joonseok Diniz, Pedro C. Deptartment of Computer Science and Engineering In-ha University Hitech Center 1012 Nam gu Yonghyun 4 dong Inchon 402-751 Korea Republic of Department of Information Systems and Computer Engineering and INESC-ID Instituto Superior Técnico Technical University of Lisbon Porto Salvo 2780-990 Portugal

Automated compiler analyses and transformation techniques aim at improving design productivity of the mapping process of applications expressed in high-level programming languages to FPGAs. These transformations allow a compiler tool to reduce the number of design cycles and eliminate tedious and error-prone low-level transformations required in this mapping process, while still leading to good designs. Scalar replacement, also known as register promotion, is a very important data-oriented transformation that leads to designs that reduce the number of external memory accesses, and thus reduce execution time, at the expense of storage resource's. In this article we present a combination of loop transformation techniques, namely loop unrolling, loop splitting, and loop interchange with scalar replacement to enable partial data reuse on computations expressed by tightly nested loops pervasive in image processing algorithms. We describe a performance modelling in the presence of partial data reuse. Our experimental results reveal that our model accurately captures the non-trivial execution effects of pipelined implementations in the presence of partial data reuse due to the need to fill-up data buffers. The model thus allows a compiler to explore a large design space with high accuracy, ultimately allowing quickly it to find better designs than designs with limited manual search or brute-force approaches. © 2008 Taylor & Francis.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：