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

Proceedings of the ACM Symposium on Applied Computing 2007年 1557-1564页

作者： Moreira, Orlando Mol, Jacob Jan-David Bekooij, Marco High Tech Campus 31/3.13 5600 JA Eindhoven Netherlands Dpt. of Computer Science Delft University of Technology PO Box 9000 2600 GA Delf High Tech Campus 31 5600 JA Eindhoven Netherlands

ISBN: (纸本)1595934804;9781595934802

We propose an online resource allocation solution for multiprocessor systems-on-chip, that executes several real-time, streaming media jobs simultaneously. The system consists of up to 24 processors connected by an -thereal [7] Network-on-Chip (NoC) of 4 to 12 routers. A job is a set of processing tasks connected by FIFO channels. Each job can be independently started or stopped by the user. Each job is annotated with resource budgets per computation task and communication channel which have been computed at compile-time. When a job is requested to start, resources that meet the required resource budgets have to be found. Because it is done online, allocation must be done with low-complexity algorithms. We do the allocation in two-steps. First, tasks are assigned to virtual tiles (VTs), while trying to minimise the total number of VTs and the total bandwidth used. In the second step, these VTs are mapped to real tiles, and network bandwidth allocation and routing are performed simultaneously. We show with simulations that introducing randomisation in the processing order yields a signicant improvement in the percentage of mapping succdesses. In combination these techniques allow 95% of the processor resources to be allocated while handling a large number of job arrivals and departures. Copyright 2007 ACM.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Understanding pervasive games through gameplay design patterns

Understanding pervasive games through gameplay design patter...

引用

3rd Digital Games Research Association International Conference: "Situated Play", DiGRA 2007

作者： Björk, Staffan Peitz, Johan Game Studio Interactive Institite SE-412 96 Göteborg Sweden IDC / Interaction Design Collegium Dpt. of Computer Science and Eng. Chalmers University of Technology / Göteborg University SE-412 96 Göteborg Sweden

This paper reports on a cluster analysis of pervasive games through a bottom-up approach based upon 120 game examples. The basis for the clustering algorithm relies on the identification of pervasive gameplay design patterns for each game from a set of 75 possible patterns. The resulting hierarchy presents a view of the design space of pervasive games, and details of clusters and novel gameplay features are described. The paper concludes with a view over how the clusters relate to existing genres and models of pervasive games. © 2007 Authors & Digital Games Research Association (DiGRA).

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Insectopia: Exploring pervasive games through technology already pervasively available

Insectopia: Exploring pervasive games through technology alr...

引用

4th International Conference on Advances in computer Entertainment technology, ACE 2007

作者： Peitz, Johan Saarenpää, Hannamari Björk, Staffan Game Studio Interactive Institite SE-412 96 Godieteborg Sweden Dpt. of Computer Science and Eng. Chalmers University of Technology Göteborg University SE-412 96 Göteborg Sweden Hypermedia Laboratory Fi-33014 Tampereen Yliopisto

ISBN: (纸本)1595936408

We present the pervasive game Insectopia, which have been designed by the approach of utilizing commercially available mobile phones to provide context-dependent gameplay. The design and evaluation of the game is described together with a discussion on how this approach can speed up making pervasive games a viable game genre for the general public. Copyright 2007 ACM.

关键词： Interactive computer graphics

来源：评论

学校读者我要写书评

暂无评论

Thermal Characterization and Thermal Management in Processor-Based Systems

Thermal Characterization and Thermal Management in Processor...

引用

Power-Aware Computing Systems 2007

作者： Ayala, José L. Apavatjrut, Anya Atienza, David López-Vallejo, Marisa López-Barrio, Carlos A. Universidad Politécnica de Madrid Departamento de Ingeniería Electrónica Ciudad Universitaria s/n Madrid28040 Spain Department of Telecommunication Services and Usage INSA Albert Einstein VilleurbanneCedex 69621 France Complutense University of Madrid Dpt. of Computer Architecture and Systems Prof José García Santesmases s/n Madrid28040 Spain

The register file is one of the hottest devices in processor-based systems. Leakage reduction techniques and DTM mechanisms require a thermal characterization of the hardware. This paper presents a thermal model to analyze the temperature evolution in the shared register files found on VLIW systems. The use of this model allows the analysis of several factors that have an strong impact on the heat transfer. The results obtained can be used in the design of temperature-aware compilers and place&route tools. © 2007 Dagstuhl Seminar Proceedings.

关键词： Heat transfer

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL LOGIC SYNTHESIS OF COMBINATIONAL CIRCUITS USING K-LUT FPGA

引用

IFAC Proceedings Volumes 2007年第18期40卷 661-666页

作者： Ion I. Bucur Alexandru E. şuşu University Politehnica of Bucharest Computer Science and Engineering Dpt. bucurb@cs.pub.ro Swiss Federal Institute of Technology Lausanne (EPFL) IC/STI Department alex.susu@epfl.ch

Determining if a given arbitrary, wide function can be implemented by a programmable logic block, is unfortunately, in general, a very difficult problem, called the Boolean matching problem. We introduce a novel implemented algorithm able to map for performance combinational networks using k -LUT based FPGAs. We consider in this paper delay optimum and area optimal k-LUT FPGA mapping algorithms and compare them against a newly developed and recently improved algorithm.

关键词： k-LUT based FPGA algorithms for delay optimal mapping k-feasible cones

来源：评论

学校读者我要写书评

暂无评论

Multi-label image segmentation via max-sum solver

Multi-label image segmentation via max-sum solver

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Banislav Micusik Tomas Pajdla Pattern Recognition and Image Processing Group Inst. of Computer Aided Automation University of Technology Vienna Austria Center for Machine Perception Dpt. of Cybernetics Czech Technical University Czech Republic

We formulate single-image multi-label segmentation into regions coherent in texture and color as a MAX-SUM problem for which efficient linear programming based solvers have recently appeared. By handling more than two labels, we go beyond widespread binary segmentation methods, e.g., MIN-CUT or normalized cut based approaches. We show that the MAX-SUM solver is a very powerful tool for obtaining the MAP estimate of a Markov random field (MRF). We build the MRF on superpixels to speed up the segmentation while preserving color and texture. We propose new quality functions for setting the MRF, exploiting priors from small representative image seeds, provided either manually or automatically. We show that the proposed automatic segmentation method outperforms previous techniques in terms of the global consistency error evaluated on the Berkeley segmentation database.

关键词： Image segmentation Image databases Belief propagation Pattern recognition Image processing Automation Cybernetics Color Linear programming Markov random fields

来源：评论

学校读者我要写书评

暂无评论

The MPEG-7 query format: a new standard in progress for multimedia query by content

The MPEG-7 query format: a new standard in progress for mult...

引用

International Symposium on Communications and Information Technologies (ISCIT)

作者： Kevin Adistambha Mario Doeller Ruben Tous Matthias Gruhne Masanori Sano Chrisa Tsinaraki Stavros Christodoulakis Kyoungro Yoon Christian H. Ritz Ian S. Burnett School of Electrical Computer and Telecommunications Engineering University of Wollongong Australia Department Distributed Information Technology University of Passau Passau Germany Dpt. d'Arquitectura de Computadors Universitat Poliltècnica de Catalunya Barcelona Spain Department Metadata Fraunhofer IDMT Germany NHK Science and Technology Research Laboratories Japan Laboratory of Distributed Multimedia Information Systems & Applications Technical University of Crete Greece School of Computer Science and Engineering Konkuk University Seoul South Korea

In recent years, the amount of Internet accessible digital audiovisual media files has vastly increased. Therefore the need to describe the media (by way of metadata) has also increased significantly. MPEG-7 (finalized in 2001) provides a comprehensive and rich metadata standard for the description of multimedia content. Unfortunately, a standardized query format does not exist for MPEG-7, or other multimedia metadata. Such a standard would provide for communications between querying clients and databases, supporting cross-modal and cross-media retrieval. The lSO/lEC SC29WG11 committee decided therefore to contribute to this application space by adding such functionality as a new part of the MPEG-7 series of standards. In response to a Call for Proposals, six proposals were submitted. This paper describes the strengths of each proposal as well as the resulting draft standard for the MPEG-7 query format.

关键词： MPEG 7 Standard Multimedia databases Electronic mail Proposals Database languages Multimedia systems Telecommunication computing Identity-based encryption ISO IEC

来源：评论

学校读者我要写书评

暂无评论

Noise subspace fuzzy C-means clustering for robust speech recognition

Noise subspace fuzzy C-means clustering for robust speech re...

引用

ICCSA 2006: International Conference on Computational Science and Its Applications

作者： Gárriz, J.M. Ramárez, J. Segura, J.C. Puntonet, G.G. Gonzalez, J.J. Dpt. Signal Theory Networking and Communications University of Granada Spain Dpt. Computer Architecture and Technology University of Granada Spain

ISBN: (纸本)3540340793

In this paper a fuzzy C-means (FCM) based approach for speech/non-speech discrimination is developed to build an effective voice activity detection (VAD) algorithm. The proposed VAD method is based on a soft-decision clustering approach built over a ratio of subband energies that improves recognition performance in noisy environments. The accuracy of the FCM-VAD algorithm lies in the use of a decision function defined over a multiple-observation (MO) window of averaged subband energy ratio and the modeling of noise subspace into fuzzy prototypes. In addition, time efficiency is also reached due to the clustering approach which is fundamental in VAD real time applications, i.e. speech recognition. An exhaustive analysis on the Spanish SpeechDat-Car databases is conducted in order to assess the performance of the proposed method and to compare it to existing standard VAD methods. The results show improvements in detection accuracy over standard VADs and a representative set of recently reported VAD algorithms. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Interval parallel global optimization with charm++

引用

7th International Conference on Applied Parallel Computing, PARA 2004

作者： Martínez, José A. Casado, Leocadio G. Alvarez, José A. García, Inmaculada Computer Architecture and Electronics Dpt. University of Almería 04120 Almería Spain

ISBN: (纸本)3540290672

Interval Global Optimization based on Branch and Bound (B&B) technique is a standard for searching an optimal solution in the scope of continuous and discrete Global Optimization. It iteratively creates a search tree where each node represents a problem which is decomposed in several subproblems provided that a feasible solution can be found by solving this set of subproblems. The enormous computational power needed to solved most of the B&B Global Optimization problems and their high degree of parallelism make them suitable candidates to be solved in a multiprocessing environment. This work evaluates a parallel version of AMIGO (Advanced Multidimensional Interval Analysis Global Optimization) algorithm. AMIGO makes an efficient use of all the available information in continuous differentiable problems to reduce the search domain and to accelerate the search. Our parallel version takes advantage of the capabilities offered by Charm++. Preliminary results show our proposal as a good candidate to solve very hard global optimization problems. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of data-flow systems using a high level codesign tool. Application to vision processors

Automatic synthesis of data-flow systems using a high level ...

引用

2006 IEEE Mediterranean Electrotechnical Conference, MELECON 2006

作者： Álvarez, Antonio Martínez Reyneri, Leonardo Maria Pelayo Valle, Francisco J. Polytechnic University College Dpt. Computing Technology and Computation University of Alicante Alicante Spain Polytechnic of Turin Dpt. of Electronics Torino Italy University of Granada Dpt. of Computer Architecture and Technology Granada Spain

ISBN: (纸本)1424400872

In this paper, we present a tool devised for the automatic design and optimization of bioinspired visual processing models using reconfigurable hardware. We have focused on the simulation and optimization characteristics of our system. We also present a retina-like processing system based on a PCI-based FPGA board as an example. The whole system is intended for the design and analysis of real-time vision processing schemes. The top-down design path of our system involves a high level synthesis scheme while allowing different strategies for optimizing the system via the CodeSimulink codesign tool. © 2006 IEEE.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：