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

Eurasip Journal on Advances in Signal Processing 2007年 2007卷

作者： Qu, Wei Schonfeld, Dan Mohamed, Magdi Multimedia Communications Laboratory Department of Electrical and Computer Engineering University of Illinois Chicago IL 60607-7053 United States Visual Communication and Display Technologies Lab. Physical Realization Research COE Motorola Labs. Schaumburg IL 60196 United States

Multiple-target tracking has received tremendous attention due to its wide practical applicability in video processing and analysis applications. Most existing techniques, however, suffer from the well-known "multitarget occlusion" problem and/or immense computational cost due to its use of high-dimensional joint-state representations. In this paper, we present a distributed Bayesian framework using multiple collaborative cameras for robust and efficient multiple-target tracking in crowded environments with significant and persistent *** the targets are in close proximity or present multitarget occlusions in a particular camera view, camera collaboration between different views is activated in order to handle the multitarget occlusion problem in an innovative way. Specifically,we propose to model the camera collaboration likelihood density by using epipolar geometry with sequential Monte Carlo implementation. Experimental results have been demonstrated for both synthetic and real-world video data. Copyright © 2007 Hindawi Publishing Corporation. All rights reserved.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

A secure quorum based membership mechanism for p2p systems

A secure quorum based membership mechanism for p2p systems

引用

12th Americas Conference on Information Systems, AMCIS 2006

作者： Liebau, Nicolas C. Heckmann, Oliver Kovacevic, Aleksandra Tafreschi, Omid Fidler, Markus Mauthe, Andreas Steinmetz, Ralf Multimedia Communications Lab Technische Universität Darmstadt Germany IT-Security Group Technische Universität Darmstadt Germany Department of Electrical and Computer Engineering University of Toronto Canada Computing Department Lancaster University United Kingdom Technische Universität Darmstadt Germany

ISBN: (纸本)9781604236262

Closed user group based on a Peer-to-Peer system require a membership mechanism that is fully decentralized. Several suggestions have been made in the literature. However, the proposed mechanisms have some significant drawbacks since any peer can easily bypass the proposed membership mechanism. In this paper we present a new fully decentralized and secure membership mechanism for Peer-to-Peer systems. A quorum of peers decides about membership requests from new peers. In order to prevent the requesting peer from manipulating the membership decision two mechanisms are applied: (1) The quorum peers must make there membership decision unanimously. This is sufficient to guarantee a correct membership decision, if a fraction of the peers in the P2P system is honest and if the quorum peers are selected in a random manner. (2) In order to ensure a random selection of the quorum peer a random value is created in a distributed way that is used to select the quorum. It can be verified, that the quorum was correctly selected. The presented mechanism is evaluated in terms of the offered security and the created traffic overhead.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

InfoShield: a security architecture for protecting information usage in memory

InfoShield: a security architecture for protecting informati...

引用

IEEE Symposium on High-Performance computer Architecture

作者： W. Shi J.B. Fryman G. Gu H.-H.S. Lee Y. Zhang J. Yang School of Electrical and Computer Engineering Georgia Tech College of Computing Georgia Institute of Technology Programming System Lab Corporate Technology Intel Corporation USA Department of Computer Science University of Pittsburgh USA Department of Computer Science and Engineering University of California Riverside USA

Cyber theft is a serious threat to Internet security. It is one of the major security concerns by both network service providers and Internet users. Though sensitive information can be encrypted when stored in non-volatile memory such as hard disks, for many e-commerce and network applications, sensitive information is often stored as plaintext in main memory. Documented and reported exploits facilitate an adversary stealing sensitive information from an application's memory. These exploits include illegitimate memory scan, information theft oriented buffer overflow, invalid pointer manipulation, integer overflow, password stealing Trojans and so forth. Today's computing system and its hardware cannot address these exploits effectively in a coherent way. This paper presents a unified and lightweight solution, called InfoShield that can strengthen application protection against theft of sensitive information such as passwords, encryption keys, and other private data with a minimal performance impact. Unlike prior whole memory encryption and information flow based efforts, InfoShield protects the usage of information. InfoShield ensures that sensitive data are used only as defined by application semantics, preventing misuse of information. Comparing with prior art, InfoShield handles a broader range of information theft scenarios in a unified framework with less overhead. Evaluation using popular network client-server applications shows that InfoShield is sound for practical use and incurs little performance loss because InfoShield only protects absolute, critical sensitive information. Based on the profiling results, only 0.3% of memory accesses and 0.2% of executed codes are affected by InfoShield.

关键词： Information security Protection Cryptography computer security IP networks Web and internet services Nonvolatile memory Hard disks Buffer overflow Hardware

来源：评论

学校读者我要写书评

暂无评论

Random beamforming in MIMO systems exploiting efficient multiuser diversity

Random beamforming in MIMO systems exploiting efficient mult...

引用

2005 IEEE 61st Vehicular Technology Conference -VTC 2005 - Spring Stockholm: Paving the Path for a Wireless Future

作者： Kim, Eun Yong Chun, Joohwan Scientific Computing Lab. Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon Korea Republic of

We propose a new random beamforming technique in forward link multiuser MIMO systems that exploits efficient multiuser diversity and spatial multiplexing gain. The common channels are allocated to more than one user simultaneously and multiple antennas at the receivers are used for interference nulling, resulting in higher throughput and reduced average waiting time. We show that the throughput of the proposed scheme outperforms the upper bound of the conventional scheme. © 2005 IEEE.

关键词： Communication channels (information theory)

来源：评论

学校读者我要写书评

暂无评论

An 8 GHz ultra wideband transceiver prototyping testbed

An 8 GHz ultra wideband transceiver prototyping testbed

引用

16th Intetrnational Workshop on Rapid System Prototyping, RSP 2005

作者： Agarwal, Deepak Anderson, Christopher R. Athanas, Peter M. Configurable Computing Lab. Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA 24061 United States Mobile and Portable Radio Research Group Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA 24061 United States

ISBN: (纸本)0769523617

Software defined radios have the potential of changing the fundamental usage model of wireless communications devices, but the capabilities of these transceivers are often limited by the speed of the underlying processors and FPGAs. This paper presents a testbed for the design of an impulse-based ultra wideband communication system. The transceiver is being developed using software/reconfigurable radio concepts and will be implemented using commercially available off-the-shelf components. The receiver uses eight 1 GHz ADCs to perform time interleaved sampling at an aggregate rate of 8 Gsamples/s. The high sampling rates present extraordinary demands on the down-conversion resources. The output of each ADC is in a different clock domain, with clocks offset in increments of 125ps. Samples are captured by the high-speed ADC and processed using a Xilinx Virtex-II Pro (XC2VP70) FPGA. The testbed has two components: a non-real time part for data capture and signal acquisition, and a real-time part for data demodulation and signal processing. The non-real time component uses the internal Block RAMs to store a set of samples and one of the PowerPC cores to process the data offline, to minimize logic resource usage. The real-time part uses distributed memory to store incoming data and processes it using hardwired multipliers and FPGA logic cells. The overall objective is to demonstrate a testbed that will allow researchers to evaluate different UWB modulation, multiple access, and coding schemes, and will support raw data rates of up to 100 MB/s. © 2005 IEEE.

关键词： Rapid prototyping

来源：评论

学校读者我要写书评

暂无评论

Owl: Next generation system monitoring

Owl: Next generation system monitoring

引用

2005 computing Frontiers Conference

作者： Schulz, Martin Lee, Hsien-Hsin S. White, Brian S. McKee, Sally A. Jeitner, Jürgen Center for Applied Scientific Computing Lawrence Livermore National Laboratory School of Electrical and Computer Engineering Georgia Institute of Technology Computer Systems Lab. Cornell University Department of Informatics Technische Universität München

ISBN: (纸本)1595930183

As microarchitectural and system complexity grows, comprehending system behavior becomes increasingly difficult, and often requires obtaining and sifting through voluminous event traces or coordinating results from multiple, non-localized sources. Owl is a proposed framework that overcomes limitations faced by traditional performance counters and monitoring facilities in dealing with such complexity by pervasively deploying programmable monitoring elements throughout a system. The design exploits reconfigurable or programmable logic to realize hardware monitors located at event sources, such as memory buses. These monitors run and writeback results autonomously with respect to the CPU, mitigating the system impact of interrupt-driven monitoring or the need to communicate irrelevant events to higher levels of the system. The monitors are designed to snoop any kind of system transaction, e.g., within the core, on a bus, across the wire, or within I/O devices. Copyright 2005 ACM.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

Resource allocation for periodic applications in a shipboard environment

Resource allocation for periodic applications in a shipboard...

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Shestak, Vladimir Chong, Edwin K. P. Maciejewski, Anthony A. Siegel, H.J. Benmohamed, Lotfi Wang, I.-Jeng Daley, Rose Colorado State University Department of Electrical and Computer Engineering Fort Collins CO 80523-1373 Colorado State University Department of Computer Science Fort Collins CO 80523-1373 Johns Hopkins University Applied Physics Laboratory 11100 Johns Hopkins Road Laurel MD 20723-6099 Department of Electrical and Computer Engineering Colorado State University Department of Electrical and Computer Engineering Department of Mathematics Colorado State University IEEE Colorado State University Department of Computer Science ACM Eta Kappa Nu Electrical Engineering Honor Society Sigma Xi Science Honor Society Upsilon Pi Epsilon Computing Sciences Honor Society Johns Hopkins University Applied Physics Laboratory JHU/APL Applied Physics Lab. IR and D

ISBN: (纸本)0769523129

Providing efficient workload management is an important issue for a large-scale heterogeneous distributed computing environment where a set of periodic applications is executed. The considered distributed system is expected to operate in an environment where the input workload is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. The tasks consist of multiple application strings, each made up of an ordered sequence of applications. There are quality of service (QoS) constraints that must be satisfied for each string. This work addresses the problem of finding a robust initial allocation of resources to application strings that is able to absorb some level of unknown input workload increase without rescheduling. An allocation feasibility analysis is presented followed by four heuristics for finding a near-optimal allocation of resources. The performance of the proposed heuristics is evaluated and compared using simulation. The proposed heuristics also are compared to a mathematically derived upper bound. © 2005 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A novel personal authentication system using palmprint technology

引用

1st International Conference on Pattern Recognition and Machine Intelligence, PReMI 2005

作者： Zhang, David Lu, Guangming Kong, Adams Wai-Kin Wong, Michael Biometric Research Centre Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Biocomputing Research Lab School of Computer Science and Engineering Harbin Institute of Technology Harbin China Electrical and Computer Engineering University of Waterloo Ontario N2L 3G1 Canada

ISBN: (纸本)3540305068

In recent times, an increasing, worldwide effort has been devoted to the development of automatic personal identification systems that can be effective in a wide variety of security contexts. Palmprints have a number of unique advantages: they are rich in features such as principal lines, wrinkles, and textures and these provide stable and distinctive information sufficient for separating an individual from a large population. In this paper, we present a novel biometric authentication system to identify a person's identity by his/her palmprint. Being a robust and reliable system, it was tested by more than 8,000 palmprint images with very low false acceptance rate (0.02%), and a relative high genuine acceptance rate (98.83%). The whole authentication process is less than 1 second. Finally, some possible applications are discussed which could be benefited by using palmprint technology. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Processor allocation for tasks that is robust against errors in computation time estimates

Processor allocation for tasks that is robust against errors...

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Sugavanam, Prasanna V. Siegel, H.J. Maciejewski, Anthony A. Ali, Syed Amjad Al-Otaibi, Mohammad Aydin, Mahir Guru, Kumara Horiuchi, Aaron Krishnamurthy, Yogish G. Lee, Panho Mehta, Ashish Oltikar, Mohana Pichel, Ron Pippin, Alan J. Raskey, Michael Shestak, Vladimir Zhang, Junxing Colorado State University Department of Electrical and Computer Engineering Fort Collins CO 80523-1373 Colorado State University Department of Computer Science Fort Collins CO 80523-1373 Hewlett-Packard Company Systems and VLSI Technology Division Fort Collins CO 80528 Hewlett-Packard Company Linux and Open Source Lab. Fort Collins CO 80528 University of Utah School of Computing Salt Lake City UT 84112 Colorado State University IEEE Department of Computer Science ACM Eta Kappa Nu Electrical Engineering Honor Society Sigma Xi Science Honor Society Upsilon Pi Epsilon Computing Sciences Honor Society Department of Electrical and Computer Engineering IBM Department of Computer Science New Mexico Institute of Mining and Technology Premiere Systems Fairfax VA CSU Hewlett Packard Hewlett-Packard Company Systems-VLSI Lab. Hewlett-Packard Fort Collins CO Hewlett-Packard Company Fort Collins CO School of Computing University of Utah

ISBN: (纸本)0769523129

Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters, Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Exception handling in distributed workflow systems using mobile agents

Exception handling in distributed workflow systems using mob...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Jiannong Cao Jin Yang Wai Ting Chan C. Xu Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China Cluster and Internet Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

Workflow management systems (WfMSs) are software systems used to automate, coordinate and streamline business processes of organizations. Most existing research on WfMSs has been focused on workflows based on well-structured and well-behaved business processes. Although its importance has been recognized, only recently, modeling and handling of workflow exceptions has been tackled by the workflow community. In this paper, we propose a mobile agent based approach to handling exceptions in distributed workflow management systems. Mobile agents are dispatched to find out the status of running processes in the system to keep track and troubleshoot them when necessary. We describe the classification of workflow exceptions into hierarchical levels and the corresponding design of different types of exception-handling mobile agents and their cooperation. A prototype of the mobile agent-based workflow exception handling mechanism has been implemented using the IBM Aglet platform

关键词： Mobile agents Workflow management software Humans Internet Software systems Application software Mobile computing Prototypes Technology management Office automation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：