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

IEEE International Conference on computer Design: VLSI in computers and Processors, (ICCD)

作者： John S. Seng Dean M. Tullsen George Z. N. Cai Computer Science Department California Polytechnic State University San Louis Obispo CA USA Department of Computer Science and Engineering University of California San Diego La Jolla CA USA Intel Corporation Hillsboro OR USA

This article provides a retrospective look at the research that went into the 2000 ICCD paper “Power-Sensitive Multithreaded Architecture”. At the time, simultaneous multithreading processors were soon to be commercially available and power consumption was proving to be a challenging design constraint. That research introduced optimizations that increased power and energy efficiency through multithreading, while maintaining performance. This article discusses the optimizations in the paper and discusses how processor designs have changed since its publication.

关键词： Multithreading Optimization computer architecture Energy efficiency Instruction sets Power demand

来源：评论

学校读者我要写书评

暂无评论

Tracking of a tagged leopard shark with an AUV: Sensor calibration and state estimation

Tracking of a tagged leopard shark with an AUV: Sensor calib...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： C. Forney E. Manii M. Farris M.A. Moline C.G. Lowe C.M. Clark Department of Computer Science California Polytechnic State University San Luis Obispo CA USA Department of Biological Sciences California State University Long Beach CA USA Faculty of Biological Sciences California Polytechnic State University San Luis Obispo CA USA Faculty of Biological Sciences California State University Long Beach CA USA Faculty of Computer Engineering California Polytechnic State University San Luis Obispo CA USA

Presented is a method for estimating the 2D planar position, velocity, and orientation states of a tagged shark. The method is designed for implementation on an Autonomous Underwater Vehicle (AUV) equipped with a stereo-hydrophone and receiver system that detects acoustic signals transmitted by a tag. The particular hydrophone system used here provides a measurement of relative bearing angle to the tag, but does not provide the sign (+ or -) of the bearing angle. A Particle Filter was used for fusing these measurements over time to produce a state estimate of the tag location. The Particle Filter combined with an active control system allowed the system to overcome the ambiguity in the sign of the bearing angle. This state estimator was validated by tracking both a stationary tag and moving tag with known positions. These experiments revealed state estimate errors were on par with those obtained by manually driven boat based tracking systems, the current method used for tracking fish and sharks over long distances. Final experiments involved the catching, releasing, and an autonomous AUV tracking of a 1 meter Leopard Shark (Triakis semifasciata) in SeaPlane Lagoon, Los Angeles, california.

关键词： Receivers Acoustics Tracking Sonar equipment Particle filters Robots Global Positioning System

来源：评论

学校读者我要写书评

暂无评论

Finding Time and Buffer Preserving Routes in Gaussian Intermittent Networks

Finding Time and Buffer Preserving Routes in Gaussian Interm...

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Omar Y. Tahboub Javed I. Khan Software Engineering Applications PayPal San Jose California Media Communications and Networking Department of Math & Computer Science Kent State University Kent OH

Intermittent networks (IntNET) are networks where all the links in a path may not be available concurrently. Finding routes on such a network is hard. No trivial extension of classical routing protocols is known to provide a correct solution. In this paper, we present a constraint resource planning (CRP) based advanced route computation and scheduling algorithm for IntNET. The algorithm computes routes achieving near minimum delay and also achieve the bound on minimum intermediate buffer requirements. It was difficult previously to deploy such advanced routing. However, this design is suitable for the new IETF traffic engineering extensions that now enable such advanced externally computed route to be injected into a MPLS infrastructure.

关键词： Routing Delay Routing protocols Schedules Network topology Topology Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Multi-document extractive summarization using event semantic relation graph clustering

引用

International Journal of Advancements in Computing Technology 2012年第22期4卷 721-730页

作者： Liu, Maofu Hu, Huijun Li, Wenjie College of Computer Science and Technology Wuhan University of Science and Technology Wuhan 430065 China State Key Lab of Software Engineering Wuhan University Wuhan 430072 China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

Multi-document summarization aims to extract information from the original multiple unstructured text documents or other types of multimedia about the same topic and this paper will focus on eventbased multi-document summarization. Event-based extractive summarization attempts to extract sentences and re-organize them in a summary according to the important events that the sentences describe. Events are defined by the event terms and the associated entities at the sentence level. In this paper, we emphasize on the event semantic relations derived from external linguistic resource. Firstly, the graph based on the event semantic relations is constructed and the events in the graph are grouped into clusters using the revised DBSCAN clustering algorithm. Then, we select one event as the representative event for each cluster or one cluster to present the main topic of the documents. Lastly, we generate the summary by extracting the sentences which contain more informative representative events from the documents. The evaluation on the DUC 2001 document sets shows it is necessary to take the semantic relations among the events into consideration and our summarization approach based on event semantic relation graph clustering is effective.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

The Tile Assembly Model is Intrinsically Universal

The Tile Assembly Model is Intrinsically Universal

引用

Annual IEEE Symposium on Foundations of computer science

作者： David Doty Jack H. Lutz Matthew J. Patitz Robert T. Schweller Scott M. Summers Damien Woods Computing and Mathematical Sciences California Institute of Technology Pasadena CA USA Computer Science Iowa State University Ames IA USA Computer Science and Computer Engineering University of Arkansas Fayetteville AR USA Computer Science University of Texas Pan-American Edinburg TX USA Computer Science and Software Engineering University of Wisconsin Platteville Platteville WI USA Computer Science California Institute of Technology Pasadena CA USA

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T. The simulation is "intrinsic" in the sense that the self-assembly process carried out by U is exactly that carried out by T, with each tile of T represented by an m × m "super tile" of U. Our construction works for the full aTAM at any temperature, and it faithfully simulates the deterministic or nondeterministic behavior of each T. Our construction succeeds by solving an analog of the cell differentiation problem in developmental biology: Each super tile of U, starting with those in the seed assembly, carries the "genome" of the simulated system T. At each location of a potential super tile in the self-assembly of U, a decision is made whether and how to express this genome, i.e., whether to generate a super tile and, if so, which tile of T it will represent. This decision must be achieved using asynchronous communication under incomplete information, but it achieves the correct global outcome(s).

关键词： Tiles Assembly Self-assembly Assembly systems Genomics Bioinformatics Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Improving student learning using finite element learning modules: An update in research findings

Improving student learning using finite element learning mod...

引用

119th ASEE Annual Conference and Exposition

作者： Brown, Ashland O. Jensen, Daniel D. Rencis, Joseph J. Wood, Kristin L. Watson, Kyle A. Chen, Chuan-Chiang Labay, Vladimir A. Orabi, Ismail I. Akasheh, Firas Wood, John J. Hackett, Rachelle Kisst Jackson, Kathy Schmidt Liu, Jiancheng Schimpf, Paul Henry Pham, Alexis Zimowski, Krystian Taylor, Kristin Department of Mechanical Engineering University of the Pacific School of Engineering and Computer Science United States Department of Engineering Mechanics United States Air Force Academy United States Department of Mechanical Engineering Tennessee Technological University United States Singapore Department of Mechanical Engineering California State Polytechnic University Pomona United States Department of Electrical and Computer Engineering Gonzaga University in Spokane Washington United States Department of Mechanical Engineering University of New Haven United States Department of Mechanical Engineering Tuskegee University United States Benerd School of Education Educational and School Psychology Department United States Pennsylvania State University's Schreyer Institute for Teaching Excellence United States University of Texas Austin United States

ISBN: (纸本)9780878232413

The landscape of contemporary engineering education is ever changing, adapting and evolving. We are indeed living in interesting and exciting times. At the focal point of these times is the concept of active learning methods. This poster session and paper describes a novel approach to improving student learning using active learning finite element learning modules. This poster session summarizes the improved student learning over the past six years at nine engineering schools and colleges. These active learning finite element modules were originally developed using MSC Nastran, followed by development efforts in SolidWorks® Simulation, ANSOFT, ANSYS©, and other commercial FEA software packages. Researchers, with National science Foundation support, have created over twenty-eight active finite element learning modules which continue to improve student understanding of difficult engineering concepts across engineering disciplines. Finite element theory and application has often been the focus of graduate-level courses in engineering programs;however, industry needs B.S. engineering graduates to have skills in applying this essential analysis and design technique. We have used the Kolb Learning Cycle as a foundation element to improve student learning of difficult engineering concepts, along with gaining essential knowledge of finite element analysis and design content knowledge. We discuss the implementation, improved student knowledge, impact, and assessment across demographics, learning styles and personality preference types. These learning modules are incorporated into undergraduate machine design, mechanical vibrations, heat transfer, bioelectrical engineering, electromagnetic field analysis, structural fatigue analysis, computational fluid dynamics, rocket design, chip formation during manufacturing, and large scale deformation in machining. Key assessment results show improvements in student knowledge of difficult engineering concepts measured with performance

关键词： engineering education

来源：评论

学校读者我要写书评

暂无评论

QoM: An effective querying method for time series database

QoM: An effective querying method for time series database

引用

IEEE International Conference on Granular Computing (GRC)

作者： Yucai Feng Lianhua Chi Hehua Chi Chuanlu Liu Zhuo Liu School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China QCIS Centre FEIT University of Technology Sydney NSW Australia State Key Laboratory of Software Engineering Computer School Wuhan University Wuhan China School of Information Shandong Polytechnic University Jinan China China Construction bank hubei branch Wuhan China

A very promising idea for fast searching in time series databases is to map the time series into a representative space. In this paper, we propose an effective querying algorithm QoM (Querying on Motif) based on time series motifs. First, we map the time series into representative motifs by motif discovery algorithm. Second, we look for a time series data based on these motifs by QoM. The QoM can effectively locate the position of time series by comparing the distance between the time series and central time series of each motif. Meanwhile, in the process of searching time series, we also can further understand the specific time series by the motif which represents a characteristic pattern in the time series database. Furthermore, experiments show that our querying method on databases from diverse domains is feasible and improves efficiency of time series data querying.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PolySat's next generation avionics design

PolySat's next generation avionics design

引用

IEEE International Conference on Space Mission Challenges for Information Technology

作者： Manyak, Greg Bellardo, John M. Electrical Engineering Department California Polytechnic State University San Luis Obispo United States Computer Science Department California Polytechnic State University San Luis Obispo United States

ISBN: (纸本)9780769544465

The CubeSat platform provides a unique challenge for flight software design due to the incredible size and power constraints. A number of tradeoffs must be made to balance effectiveness, fault tolerance, and cost. These basic requirements have been combined with the lessons learned from Cal Poly's past 8-bit avionics system to design a significant revision based around a 32-bit microprocessor running Linux. This work analyzes both generations of avionics design, including a discussion of major design principles that are relevant to other CubeSat missions. © 2011 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A comparative study and analysis on K-view based algorithms for image texture classification 11

A comparative study and analysis on K-view based algorithms ...

引用

Proceedings of the 2011 ACM Symposium on Applied Computing

作者： Lan, Yihua Liu, Hong Song, Enmin Hung, Chih-Cheng School of Computer Science Huazhong University of Science and Technology Wuhan China School of Computing and Software Engineering Southern Polytechnic State University GA United States

ISBN: (纸本)9781450301138

Several K-View based algorithms have been made for developing image texture classification. These are K-View-Template algorithm (K-View-T), K-View-Datagram algorithm (K-View-D), Fast Weighted K-View-Voting algorithm (K-View-V), and K-View Using Rotation-Invariant Feature algorithm (K-View-R). In this paper, we review those K-View based algorithms and perform an empirical study for comparison by using classification accuracy, efficiency and stability. In addition, we propose a new K-View algorithm Using Gray Level Co-Occurrence Matrix algorithm (K-View-G) which also is compared with other K-View algorithms to demonstrate its effectiveness in image texture classification. © 2011 Authors.

关键词： Image texture

来源：评论

学校读者我要写书评

暂无评论

Synthesizing tiled matrix decomposition on FPGAs

Synthesizing tiled matrix decomposition on FPGAs

引用

21st International Conference on Field Programmable Logic and Applications, FPL 2011

作者： Tai, Yi-Gang Psarris, Kleanthis Dan Lo, Chia-Tien Department of Computer Science University of Texas at San Antonio San Antonio TX 78249 United States Computer Science and Software Engineering Southern Polytechnic State University Marietta GA 30060 United States

ISBN: (纸本)9780769545295

Hardware accelerators such as FPGAs and GPUs in heterogeneous systems are being increasingly important for many applications. For high performance computing, the flexibility and efficiency of FPGA makes it an attractive alternative to other approaches. However, for applications that have to decompose large matrices, not many scalable solutions can be found on FPGAs. In this paper, we propose a scalable QR matrix decomposer on FPGAs based on the latest advances in tiled matrix decomposition algorithms for high performance linear algebra. The proposed design can decompose a matrix of size limited only by off-chip memory and has the potential to achieve high performance. © 2011 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：