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

16th Saint Petersburg International Conference on Integrated Navigation Systems, ICINS 2009

作者： Behar, V. Kabakchiev, Ch. Gaydadjiev, G. Kuzmanov, G. Ganchosov, P. Institute for Parallel Processing Bulgarian Academy of Sciences Acad. G. Bonchev St. 25-A Sofia1113 Bulgaria Department of Software Technologies Sofia University St. Clement of Ohrid J. Boucher Blvd. 5 Sofia1164 Bulgaria Department of Computer Engineering Delft University of Technology Mekelweg 4 Delft2628 CD Netherlands

ISBN: (纸本)9785900780696

This paper analyzes the influence of the space-time signal processing technique on the performance of GPS signal acquisition in conditions of strong broadband interference (jamming) and multipath. The space-time processing method used for effective mitigation of GPS interference before processing by a conventional acquisition algorithm is the Minimum Variance Distortionless Response beamforming method with QR factorization (MVDR QR). The numerical results obtained by simulations demonstrate that many factors such as array configuration, number of array elements, and sampling rate of the incoming data have a considerable effect on the effectiveness of both beamforming and acquisition algorithms.

关键词： Space time adaptive processing

来源：评论

学校读者我要写书评

暂无评论

Boosted incremental nelder-mead simplex algorithm: Distributed regression in wireless sensor networks

IFIP Advances in Information and Communication Technology

引用

IFIP Advances in Information and Communication Technology 2008年 284卷 199-212页

作者： Marandi, Parisa Jalili Charkari, Nasrollah Moghadam Parallel Processing Lab Electrical and Computer Engineering Department Tarbiat Modares University Tehran Iran

ISBN: (纸本)9780387848389

Wireless sensor networks (WSNs) have been of great interest among academia and industry due to their diverse applications in recent years. The main goal of a WSN is data collection. As the amount of the collected data increases, it would be essential to develop some techniques to analyze them. In this paper, we propose an in-network optimization algorithm based on Nelder-Mead simplex to incrementally do regression analysis over distributed data. Then, we improve the resulted regressor by the application of boosting concept from machine learning theory. Simulation results show that the proposed algorithm not only increases accuracy but is also more efficient in terms of communication compared to its gradient based counterparts. © 2008, IFIP International Federation for Information processing. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Boosting incremental Nelder-Mead simplex for distributed regression over wireless sensor networks

Boosting incremental Nelder-Mead simplex for distributed reg...

引用

International Symposium on Telecommunications, IST

作者： Parisa Jalili Marandi Nasrollah Moghadam Charkari Parallel Processing Laboratory Computer Department Faculty of Engineering Tarbiat Moalem University Tehran Iran

Wireless sensor networks (WSNs) have attracted much interest in recent years. The main goal of a WSN is data collection. As the amount of the collected data increases, it would be essential to analyze them. However, restricted power supply of small sensors makes it a serious problem to transmit all the data to a fusion center for a centralized analysis. This is why the role of in-network processing seems crucial. In this paper, we propose an in-network optimization algorithm based on Nelder-Mead simplex to incrementally do regression analysis over distributed data. Then, we improve the resulted regressor by the application of boosting concept. Simulation results show that the proposed algorithm increases accuracy and is more efficient in terms of communication compared to its counterparts.

关键词： Boosting Algorithm design and analysis Wireless sensor networks Optimization Accuracy Data models Supervised learning

来源：评论

学校读者我要写书评

暂无评论

From Speculation to Security: Practical and Efficient Information Flow Tracking Using Speculative Hardware

From Speculation to Security: Practical and Efficient Inform...

引用

Annual International Symposium on computer Architecture, ISCA

作者： Haibo Chen Xi Wu Liwei Yuan Binyu Zang Pen-chung Yew Frederic T. Chong Parallel Processing Institute Fudan University China Department of Computer Science and Engineering University of Minnesota Twin-Cities USA Department of Computer Science University of California슠Santa Barbara USA

Dynamic information flow tracking (also known as taint tracking) is an appealing approach to combat various security attacks. However, the performance of applications can severely degrade without hardware support for tracking taints. This paper observes that information flow tracking can be efficiently emulated using deferred exception tracking in microprocessors supporting speculative execution. Based on this observation, we propose SHIFT, a low-overhead, software-based dynamic information flow tracking system to detect a wide range of attacks. The key idea is to treat tainted state (describing untrusted data) as speculative state (describing deferred exceptions). SHIFT leverages existing architectural support for speculative execution to track tainted state in registers and needs to instrument only load and store instructions to track tainted state in memory using a bitmap, which results in significant performance advantages. Moreover, by decoupling mechanisms for taint tracking from security policies, SHIFT can detect a wide range of exploits, including high-level semantic attacks. We have implemented SHIFT using the Itanium processor, which has support for deferred exceptions, and by modifying GCC to instrument loads and stores. A security assessment shows that SHIFT can detect both low-level memory corruption exploits as well as high-level semantic attacks with no false positives. Performance measurements show that SHIFT incurs about 1% overhead for server applications. The performance slowdown for SPEC-INT2000 is 2.81X and 2.27X for tracking at byte-level and wordlevel respectively. Minor architectural improvements to the Itanium processor (adding three simple instructions) can reduce the performance slowdown down to 2.32X and 1.8X for byte-level and word-level tracking, respectively.

关键词： Information security Hardware Instruments Prototypes Application software Software prototyping computer security computer science Registers Measurement

来源：评论

学校读者我要写书评

暂无评论

POLUS: A POwerful Live Updating System

POLUS: A POwerful Live Updating System

引用

International Conference on Software engineering (ICSE)

作者： Haibo Chen Jie Yu Rong Chen Binyu Zang Pen-Chung Yew Parallel Processing Institute Fudan University Shanghai China Department of Computer Science and Engineering University of Minnesota Twin-Cities Minneapolis MN USA

This paper presents POLUS, a software maintenance tool capable of iteratively evolving running software into newer versions. POLUS's primary goal is to increase the dependability of contemporary server software, which is frequently disrupted either by external attacks or by scheduled upgrades. To render POLUS both practical and powerful, we design and implement POLUS aiming to retain backward binary compatibility, support for multithreaded software and recover already tainted state of running software, yet with good usability and very low runtime overhead. To demonstrate the applicability of POLUS, we report our experience in using POLUS to dynamically update three prevalent server applications: vsftpd, sshd and apache HTTP server. Performance measurements show that POLUS incurs negligible runtime overhead: a less than 1% performance degradation (but 5% for one case). The time to apply an update is also minimal.

关键词： Application software Software maintenance Web server Software tools Usability Runtime Measurement Degradation computer bugs Software engineering

来源：评论

学校读者我要写书评

暂无评论

Live updating operating systems using virtualization 06

Live updating operating systems using virtualization

引用

VEE 2006 - 2nd International Conference on Virtual Execution Environments

作者： Chen, Haibo Chen, Rong Zhang, Fengzhe Zang, Binyu Yew, Pen-Chung Parallel Processing Institute Fudan University China Department of Computer Science and Engineering University of Minnesota Twin-Cities United States

ISBN: (纸本)9781595933324

Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, in order to close vulnerabilities, add new features and enhance performance. To mitigate the loss of availability, such operating systems need to provide features such as live update through which patches and upgrades can be applied without having to stop and reboot the operating system. Unfortunately, most current live updating approaches cannot be easily applied to existing operating systems: some are tightly bound to specific design approaches (e.g. object-oriented);others can only be used under particular circumstances (e.g. quiescence states). In this paper, we propose using virtualization to provide the live update capability. The proposed approach allows a broad range of patches and upgrades to be applied at any time without the requirement of a quiescence state. Moreover, such approach shares good portability for its OS-transparency and is suitable for inclusion in general virtualization systems. We present a working prototype, LUCOS, which supports live update capability on Linux running on Xen virtual machine monitor. To demonstrate the applicability of our approach, we use real-life kernel patches from Linux kernel 2.6.10 to Linux kernel 2.6.11, and apply some of those kernel patches on the fly. Performance measurements show that our implementation incurs negligible performance overhead: a less than 1 % performance degradation compared to a Xen-Linux. The time to apply a patch is also very minimal. Copyright © 2006 ACM.

关键词： computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Tsai, Shu-Tzu Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

In this paper, we present our Grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, we show that, based on the scope and model of data mining applied in the Grid environment as well as user equivalent perspective, Grid roles can be categorized into three types. It is our goal, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To, fulfill our architecture, we first apply an existing parallel decision tree algorithm (the SPRINT algorithm) to the Grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

An enhanced parallel loop self-scheduling scheme for cluster environments

An enhanced parallel loop self-scheduling scheme for cluster...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Cheng, Kuan-Wei Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance. © 2005 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A recursive-adjustment co-allocation scheme in data grid environments 1

引用

6th International Conference on Algorithms and Architectures for parallel processing, ICA3PP

作者： Yang, Chao-Tung Yang, I.-Hsien Li, Kuan-Ching Hsu, Ching-Hsien High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (数字)9783540320715

ISBN: (纸本)3540292357

The co-allocation architecture was developed in order to enable parallel downloads of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finish time among replica servers. In this paper, we propose a dynamic co-allocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time. © Springer-Verlag Berlin Heidelberg 2005.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A high-performance computational resource broker for Grid Computing environments

A high-performance computational resource broker for Grid Co...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Shih, Po-Chi Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. As Grid Computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, ax well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user's needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user's credentials. The resource broker runs on top of the Globus Toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the Grid. © 2005 IEEE.

关键词： computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：