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

IEEE Conference on Decision and Control

作者： Ugo Boscain Remco Duits Francesco Rossi Yuri Sachkov Center for Applied Mathematics Ecole Polytechnique France Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven Netherlands LSIS Aix-Marseille Universite Marseilles France Program Systems Institute Pereslavl-Zalessky Russia

ISBN: (纸本)9781467320658

We consider the problem of minimizing ∫ 0 ℓ √(ξ 2 +K 2 (s)ds) for a planar curve having fixed initial and final positions and directions. The total length ℓ is free. Here s is the variable of arclength parametrization, K(s) is the curvature of the curve and ξ >; 0 a parameter. This problem comes from a model of geometry of vision due to Petitot, Citti and Sarti. We study existence of local and global minimizers for this problem. We prove that if for a certain choice of boundary conditions there is no global minimizer, then there is neither a local minimizer nor a stationary curve (geodesic). Our main tool is the construction of the optimal synthesis for the Reed and Shepp car with quadratic cost.

关键词： Brain modeling Boundary conditions Visualization Trajectory Aerospace electronics Optimal control Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

ESICM LIVES 2016: part two

引用

Intensive Care Medicine Experimental 2016年第1期4卷 205-404页

作者： S. Sivakumar F. S. Taccone K. A. Desai C. Lazaridis M. Skarzynski M. Sekhon W. Henderson D. Griesdale L. Chapple A. Deane L. Williams R. Strickland K. Lange D. Heyland M. Chapman M. J. Rowland P. Garry J. Westbrook R. Corkill C. A. Antoniades K. T. Pattinson G. Fatania A. J. Strong R. B. Myers C. M. Jermaine C. S. Robertson C. G. Rusin J. Hofmeijer L. Sondag M. C. Tjepkema-Cloostermans A. Beishuizen F. H. Bosch M. J. A. M. van Putten L. Carteron C. Patet D. Solari M. Oddo M. A. Ali C. Dias R. Almeida A. Vaz-Ferreira J. Silva E. Monteiro A. Cerejo A. P. Rocha A. A. Elsayed A. M. Abougabal B. N. Beshey K. M. Alzahaby S. Pozzebon A. Blandino Ortiz S. Cristallini O. Lheureux A. Brasseur J. L. Vincent J. Creteur M. Hravnak K. Yousef Y. Chang E. Crago R. M. Friedlander S. A. Abdelmonem S. A. Tahon T. A. Helmy H. S. Meligy F. Puig I. Dunn-Siegrist J. Pugin S. Gupta D. Govil S. Srinivasan S. J. Patel J. K. N A. Gupta D. S. Tomar M. Shafi R. Harne D. P. Arora N. Talwar S. Mazumdar E. E. Papakrivou D. Makris E. Manoulakas B. Tsolaki B. Karadodas E. Zakynthinos I. Palacios Garcia A. Diaz Martin V. Sanchez Encinares M. Pachón Ibañez J. Garnacho Montero G. Labrador T. Cebrero Cangueiro V. Poulose J. Koh J. W. Kam H. Yeter A. Kara O. Aktepe A. Topeli I. Tsolakoglou G. Intas P. Stergiannis A. A. Kolaros E. Chalari E. Athanasiadou A. Martika G. Fildisis V. Faivre C. Mengelle B. Favier D. Payen A. Poppe M. S. Winkler E. Mudersbach J. Schreiber M. L. Wruck E. Schwedhelm S. Kluge C. Zöllner T. Tavladaki A. M. Spanaki H. Dimitriou E. Kondili C. Choulaki E. Meleti D. Kafetzopoulos D. Georgopoulos G. Briassoulis A. García-de la Torre M. V. de la Torre-Prados T. Tsvetanova-Spasova P. Nuevo-Ortega C. Rueda-Molina A. Fernández-Porcel E. Camara-Sola L. Salido-Díaz A. García-Alcántara D. E. Meleti B. Suberviola J. Riera L. Rellan M. Sanchez J. C. Robles E. Lopez R. Vicente E. Miñambres M. Santibañez M. Le Guen J. Moore N. Mason M. Windpassinger O. Plattner E. Mascha D. I. Sessler Outcomes Research U. Melia J. Fontanet J. P. van den Berg M. Baylor College of Medicine Neurology/Neurocritical Care Houston USA Erasmus Hospital Intensive Care Medicine Brussels Belgium Centre Hospitalier Régional Orléans Réaimation Médicale Orléans France University of British Columbia Vancouver Canada University of Adelaide Discipline of Acute Care Medicine Adelaide Australia Royal Adelaide Hospital Intensive Care Adelaide Australia Griffith University Menzies Health Institute of Queensland Gold Coast Australia University of Adelaide Discipline of Medicine Adelaide Australia Kingston General Hospital Clinical Evaluation Research Unit Kingston Canada University of Oxford Nuffield Department of Clinical Neurosciences Oxford UK Oxford University Hospitals NHS Foundation Trust Neurosciences Intensive Care Unit Oxford UK King’s College Hospital Department of Neurosurgery London UK King’ College London Institute of Psychiatry Psychology and Neuroscience Department of Clinical Neuroscience London UK Rice University Computer Science Houston USA Baylor College of Medicine Neurosurgery Houston USA Baylor College of Medicine Pediatric Cardiology Houston USA University of Twente Clinical Neurophysiology Enschede Netherlands Rijnstate Hospital Neurology Arnhem Netherlands Medical Spectrum Twente Clinical Neurophysiology Enschede Netherlands Medical Spectrum Twente Intensive Care Enschede Netherlands Rijnstate Hospital Intensive Care Arnhem Netherlands CHUV Department of Intensive Care Medicine Neuroscience Critical Care Research Group Lausanne Switzerland Aga Khan University Hospital Anaesthesiology Karachi Pakistan Centro Hospitalar São João Intensive Care Porto Portugal Faculty of Medicine University of Porto Medicine Porto Portugal Faculdade de Ciências Universidade do Porto Departamento de Matemática Porto Portugal Centro de Matemática Universidade do Porto Porto Portugal The Biomedical Research Networking Center in Bioengineering Biomaterials and Nanomedicine Zaragoza Spain Centro Hospitalar

来源：评论

学校读者我要写书评

暂无评论

A multi-criteria model for planning and fine-tuning distributed Scrum projects

A multi-criteria model for planning and fine-tuning distribu...

引用

6th IEEE International Conference on Global Software Engineering, ICGSE 2011

作者： Almeida, Luis Henrique Albuquerque, Adriano Bessa Pinheiro, Plácido Rogério Graduate Program in Applied Computer Science University of Fortaleza Fortaleza 60811-905 Brazil

ISBN: (纸本)9780769545035

Distributed software development is a fact of life for many projects. It is well established that distance makes difficult to interact and to cooperate effectively. Scrum emphasizes communication, reduces coordination and control overhead;therefore it has enormous potential to help the management of distributed projects and has been increasingly used. Successfully managing the combined use of DSD and Scrum is a complex task and it requires carefully planning. Despite the importance and complexity of this type of problem, there seems to be a lack of reports, in the literature, of models that could support project managers dealing with these decision contexts. This paper presents a multi-criteria decision model for planning and finetuning such project plans. This model was developed using cognitive mapping and MACBETH (Measuring Attractiveness by a Categorical Based Evaluation Technique). The application of the model is demonstrated, followed by conclusion and remarks about future work. © 2011 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Improving parallel scalability for edge plasma transport simulations with neutral gas species

引用

Computational science and Discovery 2012年第1期5卷

作者： McCourt, M. Rognlien, T.D. McInnes, L.C. Zhang, H. Center for Applied Mathematics 657 Rhodes Hall Cornell University Ithaca NY 14853 United States Fusion Energy Sciences Program Lawrence Livermore National Laboratory 7000 East Avenue Livermore CA 94550 United States Argonne National Laboratory Mathematics and Computer Science Division 9700 South Cass Avenue Argonne IL 60439 United States

Simulating the transport of multi-species plasma and neutral species in the edge region of a tokamak magnetic fusion energy device is computationally intensive and difficult due to coupling among various components, strong nonlinearities and a broad range of temporal scales. In addition to providing boundary conditions for the core plasma, such models aid in the understanding and control of the associated plasma/material-wall interactions, a topic that is essential for the development of a viable fusion power plant. The governing partial differential equations are discretized to form a large nonlinear system that typically must be evolved in time to obtain steady-state solutions. Fully implicit techniques using preconditioned Jacobian-free Newton-Krylov methods with parallel domain-based preconditioners are shown to be robust and efficient for the plasma components. Inclusion of neutral gas components, however, increases the condition number of the system to the point where improved parallel preconditioning is needed. Standard algebraic preconditioners that provide sufficient coupling throughout the global domain to handle the neutrals are not generally scalable. We present a new preconditioner, termed FieldSplit, which exploits the character of the neutral equations to improve the scalability of the combined plasma/neutral system. © 2012 IOP Publishing Ltd.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A framework for relating neural activity to freely moving behavior

A framework for relating neural activity to freely moving be...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Justin D. Foster Paul Nuyujukian Oren Freifeld Stephen I. Ryu Michael J. Black Krishna V. Shenoy Department of Electrical Engineering University of Stanford Stanford CA USA Bioengineering and Stanford Medical School University of Stanford Stanford CA USA Division of Applied Mathematics Brown University Providence RI USA Department of Neurosurgery Palo Alto Medical Foundation Palo Alto CA USA Department of Computer Science Brown University Providence RI USA Departments of Electrical Engineering Bioengineering and Neurobiology Neurosciences Program Neurosciences Program University of Stanford Stanford CA USA

Two research communities, motor systems neuroscience and motor prosthetics, examine the relationship between neural activity in the motor cortex and movement. The former community aims to understand how the brain controls and generates movement; the latter community focuses on how to decode neural activity as control signals for a prosthetic cursor or limb. Both have made progress toward understanding the relationship between neural activity in the motor cortex and behavior. However, these findings are tested using animal models in an environment that constrains behavior to simple, limited movements. These experiments show that, in constrained settings, simple reaching motions can be decoded from small populations of spiking neurons. It is unclear whether these findings hold for more complex, full-body behaviors in unconstrained settings. Here we present the results of freely-moving behavioral experiments from a monkey with simultaneous intracortical recording. We investigated neural firing rates while the monkey performed various tasks such as walking on a treadmill, reaching for food, and sitting idly. We show that even in such an unconstrained and varied context, neural firing rates are well tuned to behavior, supporting findings of basic neuroscience. Further, we demonstrate that the various behavioral tasks can be reliably classified with over 95% accuracy, illustrating the viability of decoding techniques despite significant variation and environmental distractions associated with unconstrained behavior. Such encouraging results hint at potential utility of the freely-moving experimental paradigm.

关键词： Legged locomotion Maximum likelihood decoding Kinematics Animals Educational institutions Cameras Neuroscience

来源：评论

学校读者我要写书评

暂无评论

Graph sparsification by effective resistances

Graph sparsification by effective resistances

引用

作者： Spielman, Daniel A. Srivastava, Nikhil Program in Applied Mathematics Department of Computer Science Yale University New Haven CT 06520 United States Department of Computer Science Yale University New Haven CT 06520 United States

We present a nearly linear time algorithm that produces high-quality spectral sparsifiers of weighted graphs. Given as input a weighted graph G = (V, E, w) and a parameter ∈ > 0, we produce a weighted subgraph H = (V, E˜, w˜) of G such that |E˜| = O(n logn/∈2) and all x ∈ RV satisfy (1 - ∈) Σuv∈E (x(u) - x(v))2wuv ≤ Σuv∈E˜ (x(u) - x(v))2w˜uv ≤ (1 + ∈) Σuv∈E (x(u) - x(v))2wuv· This improves upon the spectral sparsifiers constructed by Spielman and Teng, which had O(nlogcn) edges for some large constant c, and upon the cut sparsifiers of Benczúr and Karger, which only satisfied these inequalities for x ∈ {0, 1}V. A key ingredient in our algorithm is a subroutine of independent interest: a nearly linear time algorithm that builds a data structure from which we can query the approximate effective resistance between any two vertices in a graph in O(logn) time. © 2011 Society for Industrial and applied Mathematics.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Using asymmetric keys in a certified trust model for multiagent systems

Using asymmetric keys in a certified trust model for multiag...

引用

作者： Botêlho, Vanderson Enembreck, Fabrício Ávila, Bráulio De Azevedo, Hilton Scalabrin, Edson Graduate Program on Applied Computer Science Pontifical Catholic University of Paraná CEP: 80215-901 Curitiba Paraná Brazil Graduate Program on Technology Federal Technological University of Paraná CEP: 80.230-901 Curitiba Paraná Brazil

We present a contribution based on encryption to the model for the certification of trust in multiagent systems. The originality of the proposal remains in the use of asymmetric keys that allow the local storage of testimonies with the service agents that were assessed. The aim is to raise the level of efficiency that client agents have when contracting specialized service agents. To reach this objective we make three hypotheses: (i) client agents are able to measure and inform the quality of a service they receive from a service agent;(ii) distributed certificate control is possible if every service agent stores the certificates it receives from its client agents and, (iii) the content of a certificate can be considered safe as long as the public and private keys used to encrypt the certificate remain safe. This approach reduces some weak points of trust models that rely on the direct interaction between service and client agents (direct trust) or those that rely on testimony obtained from client agents (propagated trust). Simulation showed that encrypted certificates of trust improved the efficiency of client agents when choosing their service provider agents. The reason seems to be that the reputation of a given service provider agent is based on the reputation it has among the totality of client agents that used its services. © 2010 Elsevier Ltd. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Applying multi-criteria decision analysis to global software development with scrum project planning

引用

6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011

作者： Almeida, Luis Henrique Pinheiro, Plácido Rogério Albuquerque, Adriano Bessa CPQi IT Offshore Solutions Av. Washington Soares 909 60.811-341 Fortaleza Brazil University of Fortaleza Graduate Program in Applied Computer Science Av. Washington Soares 1321 60811-905 Fortaleza Brazil

ISBN: (纸本)9783642244247

Distributed Software Development (DSD) projects have become a common reality for many organizations. Scrum is a consolidated Agile methodology and has been increasingly used in a distributed fashion. As distance makes difficult to interact and to cooperate effectively, it is paramount to use methodologies like Scrum that emphasizes communication, reduces coordination and control overhead. Successfully planning and managing the combined use of DSD and Scrum is a complex task and requires carefully planning. Despite the importance and complexity of this type of problem, there seems to be a lack of reports, in the literature, of models that could support managers dealing with such decision context. This paper applies a multi-criteria decision model on the choice of DSD Scrum project plans that have a better chance of success. The model, presented in [1], was developed using cognitive mapping and MACBETH[2]. The application of the model is demonstrated, followed by conclusion and future work. © 2011 Springer-Verlag.

关键词： Project management

来源：评论

学校读者我要写书评

暂无评论

Parsimonious reconstruction of network evolution

Parsimonious reconstruction of network evolution

引用

Lecture Notes in computer science

作者： Patro, Rob Sefer, Emre Malin, Justin Marçais, Guillaume Navlakha, Saket Kingsford, Carl Center for Bioinformatics and Computational Biology University of Maryland College Park MD 20742 United States Department of Computer Science University of Maryland College Park MD 20742 United States Computational Biology Bioinformatics and Genomics Concentration Biological Sciences Graduate Program University of Maryland College Park MD 20742 United States Program in Applied Mathematics Statistics and Scientific Computation University of Maryland College Park MD 20742 United States School of Computer Science Carnegie Mellon University Pittsburgh PA 15213 United States

ISBN: (纸本)9783642230370

We consider the problem of reconstructing a maximally parsimonious history of network evolution under models that support gene duplication and loss and independent interaction gain and loss. We introduce a combinatorial framework for encoding network histories, and we give a fast procedure that, given a set of duplication histories, in practice finds network histories with close to the minimum number of interaction gain or loss events. In contrast to previous studies, our method does not require knowing the relative ordering of unrelated duplication events. Results on simulated histories suggest that common ancestral networks can be accurately reconstructed using this parsimony approach. © 2011 Springer-Verlag.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

MLEA： A Solution for Users of Android in UTPVirtual

引用

computer Technology and Application 2011年第5期2卷 406-412页

作者： Gisela Torres de Clunie Sergio Crespo Coelho da Silva Pinto Aris Linet Castillo Lucas Monteiro Braz Tasia Serrao Norman Rangel Jeanette Riley Olinda de Barraza Kexy Rodriguez Computer Systems Engineering Department Technological University of Panama Panama 0819 Panama Computer Science Research and Graduate Program in Applied Computing University of the Sinos Valley （UNISINOS） RS 93022-000 Brazil CIDITIC Technological University of Panama Panama 0819 Panama

This paper describes a design of an educational platform for a mobile learning architecture, which is a state of the an topic in distance education. The product will allow users to interact in an efficient, flexible, and transparent fashion with a web-based education environment, in this case Module Object-Oriented Dynamic Learning Environment （Moodle）, using Android mobile devices. In order to provide a strong and lasting architecture, the Service Oriented Architecture （SOA） methodology is used given that it allows easy software re-utilization as well as integration of heterogeneous services. The architecture is based on web services implemented with Representational State Transfer （REST）, as it has been demonstrated to be lighter and less consuming than other protocols, for devices with limited resources such as mobile devices. Web services provide the communication means between the server side and the client side of the architecture, whereas agents are used to deliver the services itself. The authors propose the development of an environment that facilitates the integration of various educational resources to support m-learning. An important aspect of the proposal is the offering of a tool to provide customized alerts for students and teachers, enabling them to remain updated about activities taking place in the courses.

关键词： Distance learning virtual education m-learning service oriented architecture （SOA） mobile learning mobile computing interoperability representational state transfer （REST）.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：