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

15th International Conference on Human-computer Interaction, HCI International 2013

作者： Cheng, Yun-Maw Chen, Wei-Ju Wu, Tong-Ying Sandnes, Frode Eika Johnson, Chris Yang, Chao-Yang Institute of Design Science Tatung University Taipei Taiwan Department of Computer Science and Engineering Tatung University Taipei Taiwan Institite of Information Technology Oslo and Akershus University College of Applied Science Oslo Norway School of Computing Science University of Glasgow United Kingdom Department of Industrial Design Chang Gung University Tao-Yuan Taiwan

ISBN: (纸本)9783642392610

There has been much UbiComp research into motivating people to live more active and healthy lifestyle with sports. The idea behind these approaches is centered on social and peer effects in enhancing exercise adherence. While research of this kind has been prolific, there has very little work been done to identify factors that embody comfortable and informed accompanied exercise experience. This paper takes an increasingly attractive cycling theme as a testbed and proposes an unobtrusive and intuitive interface arrangement based on light. It can create a sense of being together with each other for distant apart cyclists. The initial results yield a good level of comprehension and motivation towards the use of the interface. The hope is that the elicited recommendations can guide the design of UbiComp technologies for social motivational physical exercises. © 2013 Springer-Verlag.

关键词： Motivation

来源：评论

学校读者我要写书评

暂无评论

High-resolution contrast enhanced multi-phase hepatic Computed Tomography data fromaporcine Radio-Frequency Ablation study

High-resolution contrast enhanced multi-phase hepatic Comput...

引用

IEEE International Symposium on Biomedical Imaging

作者： Bernhard Kainz Philip Voglreiter Michael Sereinigg Iris Wiederstein-Grasser Ursula Mayrhauser Sonja Köstenbauer Mika Pollari Rostislav Khlebnikov Matthias Seise Tuomas Alhonnoro Yrjö Häme Daniel Seider Ronan Flanagan Claire Bost Judith Mühl David O'Neill Tingying Peng Stephen Payne Daniel Rueckert Dieter Schmalstieg Michael Moche Marina Kolesnik Philipp Stiegler Rupert H. Portugaller Department of Computing Imperial College London UK Institute for Computer Graphics and Vision (ICG) Graz University of Technology AUT Department for Surgery Medical University Graz AUT Division of Biomedical Research and Section for Surgical Research Medical University Graz AUT Medizinische Universitat Graz Graz Steiermark AT Department of Biomedical Engineering and Computational Science Aalto University FI Schloss Birlinghoven Fraunhofer Institute for Applied Information Technology GER Department of Diagnostic and Interventional Radiology Leipzig University Hospital Leipzig GER NUMA Engineering Services Ltd. Dundalk Co. Louth IRE Department of Engineering Science Keble College Oxford UK University Clinic of Radiology Medical University Graz AUT

Data below 1 mm voxel size is getting more and more common in the clinical practice but it is still hard to obtain a consistent collection of such datasets for medical image processing research. With this paper we provide a large collection of Contrast Enhanced (CE) Computed Tomography (CT) data from porcine animal experiments and describe their acquisition procedure and peculiarities. We have acquired three CE-CT phases at the highest available scanner resolution of 57 porcine livers during induced respiratory arrest. These phases capture contrast enhanced hepatic arteries, portal venous veins and hepatic veins. Therefore, we provide scan data that allows for a highly accurate reconstruction of hepatic vessel trees. Several datasets have been acquired during Radio-Frequency Ablation (RFA) experiments. Hence, many datasets show also artificially induced hepatic lesions, which can be used for the evaluation of structure detection methods.

关键词： Lesions Computed tomography Veins Biomedical imaging Animals Liver Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A block-diagonal algebraic multigrid preconditioner for the brinkman problem

A block-diagonal algebraic multigrid preconditioner for the ...

引用

作者： Vassilevski, Panayot S. Villa, Umberto Lawrence Livermore National Laboratory Center for Applied Scientific Computing P.O. Box 808 L-561 Livermore CA 94551 United States Department of Mathematics and Computer Science Emory University Atlanta GA 30322 United States

The Brinkman model is a unified law governing the flow of a viscous fluid in cavity (Stokes equations) and porous media (Darcy equations). In this work, we explore a novel mixed formulation of the Brinkman problem by introducing the flow's vorticity as an additional unknown. This formulation allows for a uniformly stable and conforming discretization by standard finite element (Ńed´elec, Raviart-Thomas, discontinuous piecewise polynomials). Based on the stability analysis of the problem in the H(curl)-H(div)-L 2 norms [P. S. Vassilevski and U. Villa, A mixed formulation for the Brinkman problem, SIAM J. Numer. Anal., submitted], we study a scalable block-diagonal preconditioner which is provably optimal in the constant coefficient case. Such a preconditioner takes advantage of the parallel auxiliary space AMG solvers for H(curl) and H(div) problems available in HYPRE [hypre: High Performance Preconditioners, http://***/CASC/hypre/]. The theoretical results are illustrated by numerical experiments. Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.

关键词： Porous materials

来源：评论

学校读者我要写书评

暂无评论

Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence

Common Due-Date Problem: Exact Polynomial Algorithms for a G...

引用

International Symposium on Symbolic and Numeric Algorithms for Scientific computing (SYNASC)

作者： Abhishek Awasthi Jörg Lässig Oliver Kramer Department of Computer Science University of Applied Sciences Görlitz Germany Department of Computing Science Carl von Ossietzky University of Oldenburg Oldenburg Germany

This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence for single and parallel machines with the run-time complexities of O(n log n) and O(mn 2 log n) respectively, where n is the number of jobs and m the number of machines. The algorithms take a sequence consisting of all the jobs (J i , i = 1,2,...,n) as input and distribute the jobs to machines (for m>1) along with their best completion times so as to get the least possible total penalty for this sequence. We prove the optimality for the single machine case and the runtime complexities of both. Henceforth, we present the results for the benchmark problems and compare with previous work for both single and parallel machine cases, up to 200 jobs.

关键词： Complexity theory Parallel machines Linear programming Benchmark testing Heuristic algorithms Polynomials

来源：评论

学校读者我要写书评

暂无评论

Aircraft Landing Problem: An Efficient Algorithm for a Given Landing Sequence

Aircraft Landing Problem: An Efficient Algorithm for a Given...

引用

IEEE International Conference on Computational science and Engineering, CSE

作者： Abhishek Awasthi Oliver Kramer Jörg Lässig Department of Computer Science University of Applied Sciences Görlitz Germany Department of Computing Science Carl von Ossietzky University of Oldenburg Oldenburg Germany

In this paper, we investigate a special case of the static aircraft landing problem (ALP) with the objective to optimize landing sequences and landing times for a set of air planes. The problem is to land the planes on one or multiple runways within a time window as close as possible to the preferable target landing time, maintaining a safety distance constraint. The objective of this well-known NP-hard optimization problem is to minimize the sum of the total penalty incurred by all the aircraft for arriving earlier or later than their preferred landing times. For a problem variant that optimizes a given feasible landing sequence for the single runway case, we present an exact polynomial algorithm and prove the run-time complexity to lie in O(N^3), where N is the number of aircraft. The proposed algorithm returns the optimal solution for the ALP for a given feasible landing sequence on a single runway for a common practical case of the ALP described in the paper. Furthermore, we propose a strategy for the ALP with multiple runways and present our results for all the benchmark instances with single and multiple runways, while comparing them to previous results in the literature.

关键词： Aircraft Safety Equations Airports Heuristic algorithms Linear programming Silicon

来源：评论

学校读者我要写书评

暂无评论

Systematic reduction of data movement in algebraic multigrid solvers

Systematic reduction of data movement in algebraic multigrid...

引用

2013 IEEE 37th Annual computer Software and Applications Conference, COMPSAC 2013

作者： Gahvari, Hormozd Gropp, William Jordan, Kirk E. Schulz, Martin Yang, Ulrike Meier Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 United States Computational Science Center IBM TJ Watson Research Center Cambridge MA 02142 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)9780769549798

Algebraic Multigrid (AMG) solvers find wide use in scientific simulation codes. Their ideal computational complexity makes them especially attractive for solving large problems on parallel machines. However, they also involve a substantial amount of data movement, posing challenges to performance and scalability. In this paper, we present an algorithm that provides a systematic means of reducing data movement in AMG. The algorithm operates by gathering and redistributing the problem data to reduce the need to move it on the communication-intensive coarse grid portion of AMG. The data is gathered in a way that ensures data locality by keeping data movement confined to specific regions of the machine. Any decision to gather data is made systematically through the means of a performance model. This approach results in substantial speedups on a multicore cluster when using AMG to solve a variety of test problems. © 2013 IEEE.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Optimizing radio resource management in energy-efficient cognitive radio networks

Optimizing radio resource management in energy-efficient cog...

引用

2nd ACM Workshop on High Performance Mobile Opportunistic Systems, HP-MOSys 2013, Held in Conjunction with the 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2013

作者： Mastorakis, George Mavromoustakis, Constandinos X. Bourdena, Athina Pallis, Evangelos Sismanidis, Giorgio Department of Applied Informatics and Multimedia Technological Educational Institute of Crete Heraklion Crete Greece Department of Computer Science University of Nicosia 46 Makedonitissas Avenue 1700 Nicosia Cyprus Department of Information and Communication Systems Engineering University of the Aegean Samos Greece School of Engineering of Computing Systems Politecnico of Milano Milano Italy

ISBN: (纸本)9781450323727

This paper elaborates on two radio resource management (RRM) algorithms exploited to optimally allocate radio spectrum and maintain maximum energy in cognitive radio (CR) network nodes of a centralized system architecture. Both RRM algorithms allow for effective TV White Spaces (TVWS) exploitation, using a radio spectrum broker. This broker orchestrates TVWS trading, between several secondary systems, based on an energy-efficient process, as well as the real time secondary spectrum market policy. The proposed TVWS allocation process follows, either a fixed-price or an auction-based trading approach. The efficiency of both algorithms is validated through a number of experimental tests, conducted under controlled simulation conditions. More specifically, their performance was evaluated, in terms of spectrum broker benefit, energy consumption level and throughput response, during TVWS allocation process. © 2013 ACM.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Teaching introductory programming to IS students: The impact of teaching approaches on learning performance

引用

Journal of Information Systems Education 2013年第2期24卷 147-155页

作者： Zhang, Xihui Zhang, Chi Stafford, Thomas F. Zhang, Ping Department of Computer Science and Information Systems College of Business University of North Alabama Florence AL 35632 United States Department of Information Technology School of Computing and Software Engineering Southern Polytechnic State University Marietta GA 30060 United States Department of Management Information Systems Fogelman College of Business and Economics University of Memphis Memphis TN 38152 United States Department of Mathematical Sciences College of Basic and Applied Sciences Middle Tennessee State University Murfreesboro TN 37132 United States

Introductory programming courses are typically required for undergraduate students majoring in Information Systems. Instructors use different approaches to teaching this course: some lecturing and assigning programming exercises, others only assigning programming exercises without lectures. This research compares the effects of these two teaching approaches on learning performance by collecting data from two sections of an introductory programming course in an urban public university. One section used lectures and assignments while the other used assignments only. Data analysis included tests within each dataset, tests across the two datasets, and tests of a simple model over the combined dataset. Results indicated that both approaches are effective, but the exercises-only approach is more effective than lectures combined with exercises. Further analysis indicated that students' current programming skills, prior programming experience, and grade expectations are significant antecedents of learning performance in the course. Results support the conclusion suggesting that when teaching introductory programming courses, instructors may want to consider choosing the student-centered active learning over the traditional lecture format in order to improve students' learning performance. This study contributes to the improvement of teaching and learning effectiveness as well as efficiency of introductory programming classes to the benefit of instructors and students, alike.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Interactive Visualization of Large Scale Atomistic and Cosmological Particle Simulations

Interactive Visualization of Large Scale Atomistic and Cosmo...

引用

IEEE Aerospace Conference

作者： Jason Kimball Mark Duchaineau Falko Kuester Department of Computer Science and Engineering University of California Center for Applied Scientific Computing Lawrence Livermore National Laboratory Department of Structural Engineering University of California

ISBN: (纸本)9781467318129

In this paper we present a method for interactive high-quality visualization of large and time-varying 3D unstructured data from particle simulations. To help design next-generation materials for aerospace systems, understanding the physics of material structures at the atomic scale is achieved through molecular dynamics simulations run on tens to hundreds of millions of atoms. Similarly, to understand the formation of the cosmos, galaxy formation simulations are run using tens to hundreds of millions of particles. From the atomically small to the astronomically large, these simulations produce immense amounts of data. While these simulations have been shown to produce excellent results matching real-world observations, the daunting Big Data that they produce can be difficult to work with. Numerical analysis is useful for processing this large quantity of data, but visual analysis is also important in the search for identifying interesting results and formulating new hypotheses to explore. Though many level-of-detail techniques exist for structured and geometric data, allowing scalable interactive visualization, unstructured particle data is not suitable for these techniques. Therefore, we have developed a new technique for scalable visualization of massive particle datasets. The technique is different from previous level-of-detail techniques which create progressive approximations of the data itself. Instead, the technique creates a volumetric representation of the data first and then creates a hierarchy of progressive approximations of the volumetric representation. An adaptive volume rendering technique is also presented that progressively refines the volume hierarchy depending on the view of the data and the time available to load data. The technique provides a scalable framework, allowing various levels of detail to be loaded while maintaining interactivity. This paper describes the rendering techniques used to produce the 3D volume hierarchy as well as the ada

关键词： Visualization Interactive simulating Social Hierarchy Particle scattering aerospace systems Molecular Dynamics Simulation particles Scalability Information retrieval systems-Teletext and videotex

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2013年 8271 LNAI卷 V-VI页

作者： Ramanna, Sheela Lingras, Pawan Sombattheera, Chattrakul Krishna, Aneesh University of Winnipeg Applied Computer Science Department Winnipeg MB Canada Saint Mary's University Mathematics and Computing Science Halifax NS Canada Mahasarakham University Faculty of Informatics Khamreang Kantarawichai Mahasarakham Thailand Curtin University Department of Computing PerthWA Australia

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：