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

2nd International Workshop on Multimodal Brain Image Analysis, MBIA 2012, Held in Conjunction with the 15th International Conference on Medical Image computing and Computer Assisted Intervention, MICCAI 2012

作者： Shi, Jie Thompson, Paul M. Wang, Yalin School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85281 United States Laboratory of Neuro Imaging Department of Neurology UCLA School of Medicine Los Angeles CA 90095 United States

ISBN: (纸本)9783642335297

Here we propose a novel method to compute surface hyperbolic parameterization for studying brain morphology with the Ricci flow method. Two surfaces are conformally equivalent if there exists a bijective angle-preserving map between them. The Teichmüller space for surfaces with the same topology is a finite-dimensional manifold, where each point represents a conformal equivalence class, and the conformal map is homotopic to the identity map. A shape index can be defined based on Teichmüller space coordinates, and this shape index is intrinsic and invariant under scaling, translation, rotation, general isometric deformation, and conformal deformation. Using the Ricci flow method, we can conformally map a surface with a negative Euler number to the Poincaré disk and the Teichmüller space coordinates can be computed by geodesic lengths under hyperbolic metric. For lateral ventricular surface registration, we further convert the parameterization to the Klein model where a convex polygon is guaranteed for a multiply connected surface. With the Klein model, diffeomorphisms between lateral ventricular surfaces can be computed with some well known surface registration methods. Compared with prior work, the parameterization does not have any singularities and the intrinsic parameterizations help shape indexing and surface registration. Our preliminary experimental results showed its great promise for analyzing anatomical surface morphology. © 2012 Springer-Verlag.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Reformulating action language C+ in answer set programming

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) 2012年 7265卷 405-421页

作者： Lee, Joohyung School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85287 United States

ISBN: (纸本)9783642307423

Action language C+ is a high level notation of nonmonotonic causal logic for describing properties of actions. The definite fragment of C+ is implemented in Version 2 of the Causal Calculator (CCalc) based on the reduction of nonmonotonic causal logic to propositional logic. On the other hand, here we present two reformulations of the definite fragment of C+ in terms of different versions of the stable model semantics. The first reformulation is in terms of the recently proposed stable model semantics of formulas with intensional functions, and can be encoded in the input language of CSP solvers. The second reformulation is in terms of the stable model semantics of propositional logic programs, which can be encoded in the input language of ASP systems. The second one is obtained from the first one by eliminating intensional functions in favor of intensional predicates. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Strengthening hash families and compressive sensing

Strengthening hash families and compressive sensing

引用

作者： Colbourn, Charles J. Horsley, Daniel Syrotiuk, Violet R. Computing Informatics and Decision Systems Engineering Arizona State University P.O. Box 878809 Tempe AZ 85287 United States School of Mathematical Sciences Monash University VIC 3800 Australia

The deterministic construction of measurement matrices for compressive sensing is a challenging problem, for which a number of combinatorial techniques have been developed. One of them employs a widely used column replacement technique based on hash families. It is effective at producing larger measurement matrices from smaller ones, but it can only preserve the strength (level of sparsity supported), not increase it. Column replacement is extended here to produce measurement matrices with larger strength from ingredient arrays with smaller strength. To do this, a new type of hash family, called a strengthening hash family, is introduced. Using these hash families, column replacement is shown to increase strength under two standard notions of recoverability. Then techniques to construct strengthening hash families, both probabilistically and deterministically, are developed. Using a variant of the Stein-Lovász-Johnson theorem, a deterministic, polynomial time algorithm for constructing a strengthening hash family of fixed strength is derived. © 2012 Elsevier B.V. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Leveraging social media to support collaborative e-learning

Leveraging social media to support collaborative e-learning

引用

International Symposium on Collaborative Technologies and systems

作者： Robert K. Atkinson School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe USA

The advent of social media has spawned a surge of open-source, user-created intelligence available through online media such as blogs, wikis and social networks. This session will outline reflections on and work towards harnessing the power of social media for instructional purposes by incorporating empirically-derived instructional design principles to scaffold their use. It specifically addresses the current and potential uses of social media in a variety of formal and informal learning contexts. The session will include examples for applying “traditional” best practices for implementing instructionally-enhanced social media applications for collaborative e-Learning.

关键词： Media Blogs Videos Modeling Educational institutions Social network services Electronic learning

来源：评论

学校读者我要写书评

暂无评论

Solving the distribution center location problem based on multi-swarm cooperative particle swarm optimizer

Solving the distribution center location problem based on mu...

引用

8th International Conference on Intelligent computing Technology, ICIC 2012

作者： Chu, Xianghua Lu, Qiang Niu, Ben Wu, Teresa Shenzhen Graduate School Harbin Institute of Technology Shenzhen 518055 China College of Management Shenzhen University Shenzhen 518060 China School of Computing Informatics Decision Systems Engineering Arizona State University Tempe AZ United States

ISBN: (纸本)9783642315879

The discrete location of distribution center is a NP-hard issue and has been studying for many years. Inspired by the phenomenon of symbiosis in natural ecosystems, multi-swarm cooperative particle swarm optimizer (MCPSO) is proposed to solve the location problem. In MCPSO, the whole population is divided into several sub-swarms, which keeps a well balance of the exploration and exploitation in MCPSO. By competition and collaboration of the individuals in MCPSO the optimal location solution is obtained. The experimental results demonstrated that the MCPSO achieves rapid convergence rate and better solutions. © 2012 Springer-Verlag.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Prioritization of applications for software-As-A-service migration using total life cycle costs and the analytic network process

Prioritization of applications for software-As-A-service mig...

引用

2012 World Congress on engineering, WCE 2012

作者： Jalao, Eugene Rex L. Shunk, Dan L Wu, Teresa Department of Industrial Engineering from Arizona State University University of the Philippines Industrial Engineering Department Philippines Arizona State University United States Industrial Engineering Program at School of Computing Informatics Decision Systems Engineering of Arizona State University United States

ISBN: (纸本)9789881925220

The current state of the world economy has made Software-As-A-Service (SaaS) an appealing concept for organizations with a small budget for IT infrastructure investment. In a SaaS setup, companies subscribe software applications on a pay-per-use system from external service providers over the internet. However, these companies are looking for a decision framework that can be used to prioritize business software applications for SaaS migration. This paper attempts to fill in this gap by proposing a hybrid methodology which is composed of a total system life cycle (SLC) cost analysis for cost estimation and the analytic network process (ANP) for prioritization. Real test case data is used to validate the decision making capability of the framework. Sensitivity analysis was done to determine the robustness of the recommendations using Monte Carlo simulation. Results show that the proposed methodology could aid managers prioritizes software application projects for SaaS migration. © 2012 Newswood Limited. All rights reserved.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Investigation of AODV Throughput Considering RREQ, RREP and RERR Packets

Investigation of AODV Throughput Considering RREQ, RREP and ...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Elis Kulla Makoto Ikeda Leonard Barolli Fatos Xhafa Muhammad Younas Makoto Takizawa Graduate School of Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Languages and Informatics Systems Technical University of Catalonia Barcelona Spain Department of Computing and Comm Technologies Oxford Brookes University Oxford UK Department of Computers and Information Science Seikei University Musashino Tokyo Japan

As Mobile Ad hoc Networks (MANETs) are attracting attention for their potential use in several fields such as collaborative computing and multimedia communications, there is an increasing need to minimize the overhead introduced by routing protocols in the network. In this paper, we analyze the performance of a MANET by simulations, in terms of RREQ, RREP and RERR, considering Random Waypoint Mobility (RWM) model. We consider the cases when all nodes are moving and source and destination nodes are static. We evaluate the performance by measuring the throughput and AODV control packets.

关键词： Ad hoc networks Mobile computing Throughput Routing protocols Routing Topology

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of OLSR and AODV Protocols in a VANET Crossroad Scenario

Performance Evaluation of OLSR and AODV Protocols in a VANET...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Evjola Spaho Makoto Ikeda Leonard Barolli Faos Xhafa Muhammad Younas Makoto Takizawa Graduate School of Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Languages and Informatics Systems Technical University of Catalonia Barcelona Spain Department of Computing and Communication Technologies Oxford Brookes University Oxford UK Department of Computers and Information Science Seikei University Musashino Tokyo Japan

In this paper, we investigate the performance of OLSR and AODV protocols in a VANET crossroad scenario. The mobility patterns of vehicles are generated by means of CAVENET (Cellular Automaton based Vehicular Network) and as communication protocol simulator, is used NS3(Network Simulator 3). For the simulations, we used IEEE802.11p standard, TwoRayGroundPropagationLossModel and sent multiple CBR flows over UDP between ten pairs source-destination. We use Packet Delivery Ratio (PDR), throughput and delay as evaluation metrics. We compared the performance of both protocols and the simulation results shows that for big values of transmission rates, OLSR performs better than AODV. For small transmission rates, the delay is less than 0.1sec and both protocols can be used for real time applications such as safety applications. For big values of transmission rate, the delay is higher than 1 sec and these protocols can be used for applications that tolerate this delay such as streaming and entertainment.

关键词： Vehicles Delays Routing protocols Ad hoc networks Throughput Simulation

来源：评论

学校读者我要写书评

暂无评论

Approximate solutions for the minimal revision problem of specification automata

Approximate solutions for the minimal revision problem of sp...

引用

2012 IEEE/RSJ International Conference on Intelligent Robots and systems

作者： Kangjin Kim Georgios E. Fainekos School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA

As robots are being integrated into our daily lives, it becomes necessary to provide guarantees of safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as “close” as possible to the initial user intent. Unfortunately, the latter problem, which is referred to as minimal specification revision problem, is NP complete. This paper presents an approximation algorithm that can compute good approximations to the minimal revision problem in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.

关键词： Automata Approximation algorithms Planning Heuristic algorithms Materials requirements planning Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Cost excessive paths in cloud based services

Cost excessive paths in cloud based services

引用

IEEE International Conference on Information Reuse and Integration (IRI)

作者： Kevin Buell James Collofello School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA

The pay-as-you-go economic model of cloud computing leads naturally to an earn-as-you-go profit model for many cloud based services. These applications can benefit from low level analyses for cost optimization and verification. Testing cloud applications to ensure they meet monetary cost objectives has not been well explored in the current literature. We present a static analysis approach for determining which control flow paths in cloud applications can exceed a cost threshold. We build on tools used in Worst Case Execution Time analysis that provide a tight bound on processing time, and we implement provisions for adding bandwidth, storage, and service costs. Our approach determines the magnitude of cost excess for nodes in an application's call graph so that cloud developers can better understand where to focus their efforts to lower costs (or deem some excesses acceptable based on business case analysis).

关键词： Bandwidth Cloud computing Computational modeling Business Weight measurement Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：