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

7th international conference on Intelligent Control and Information Processing (ICICIP)

作者： Zhang, Kun Zhang, Huaguang Jiang, He Liu, Chong Northeastern Univ Sch Informat Sci & Engn Shenyang 110819 Peoples R China

ISBN: (纸本)9781509021550

this paper is concerned with the optimal control problem for a class of unknown continuous-time nonlinear system. A system identification method by date-driven model is established to reconstruct the unknown system dynamic by the input-output data. then considering the optimal control problem, a novel critic neural networks design is proposed based on the policy iteration (PI), where the updating laws of parameters are designed by the normalized gradient descent algorithm and convex optimization method. And the computational burden of cost error get reduced during the iteration procedure using the new method. Based on this adaptive dynamic programming algorithm, the weight convergence is obtained and stability is guaranteed by Lyapunov theory. Finally, two simulation examples are shown to verify the effectiveness of this novel method.

关键词： optimal control continuous nonlinear system adaptive dynamic programming policy iteration neural network

来源：评论

学校读者我要写书评

暂无评论

Finding Low-Conductance sets with Dense interactions (FLCD) for better protein complex prediction 16

Finding Low-Conductance sets with Dense interactions (FLCD) ...

引用

7th ACM international conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB)

作者： Wang, Yijie Qian, Xiaoning Texas A&M Univ Dept Elect & Comp Engn MS 3128 College Stn TX 77843 USA

ISBN: (纸本)9781450342254

Intuitively, proteins in the same protein complexes should highly interact with each other but rarely interact with the other proteins in protein-protein interaction (PPI) networks. Surprisingly, many existing computational algorithms do not directly detect protein complexes based on both of these topological properties. Most of them, depending on mathematical definitions of either "modularity" or "conductance", have their own limitations: Modularity has the inherent resolution problem ignoring small protein complexes;and conductance characterizes the separability of complexes but fails to capture the interaction density within complexes. We present a two-step algorithm FLCD (Finding Low-Conductance sets with Dense interactions) to predict overlapping protein complexes with the desired topological structure, which is densely connected inside and well separated from the rest of the networks. First, FLCD detects well-separated subnetworks based on approximating a potential low-conductance set through a personalized PageRank vector from each protein and then solving a mixed integer programming (MIP) problem to find the minimum-conductance set within the identified low-conductance set. At the second step, the densely connected parts in those subnetworks are discovered as the protein complexes by solving another MIP problem that aims to find the dense subnetwork in the minimum-conductance set. Experiments on four large-scale yeast PPI networks from different public databases demonstrate that the complexes predicted by FLCD have better correspondence with the yeast protein complex gold standards than other three state-of-the-art algorithms (ClusterONE, LinkComm, and SR-MCL). Additionally, results of FLCD show higher biological relevance with respect to Gene Ontology (GO) terms by GO enrichment analysis.

关键词： Protein complex identification Low conductance set Dense subnetwork Mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Computational thinking: A Tool to Motivate Understanding in Elementary School Teachers 7th

Computational Thinking: A Tool to Motivate Understanding in ...

引用

7th international conference on Computer Supported Education (CSEDU)

作者： Saari, Erni Marlina Blanchfield, Peter Hopkins, Gail Univ Nottingham Sch Comp Sci Jubilee Campus Nottingham NG7 2RD England

ISBN: (纸本)9783319295855;9783319295848

the need for teachers of Elementary School children to learn to program or rather to understand the Computational thinking behind programming has been accelerated in many countries by the mandated teaching of programming in this context. A major problem is that the majority of such teachers have no concept of how to program and naturally are not motivated to learn programming. the need to teach programming will motivate most but to learn through a tool that can be seen to have intrinsic value in their role as teachers have a greater potential. this paper describes the design and early implementation of a tool to use the learning of Flash Action Scripting as a motivational mechanism for trainee teachers. the intrinsic value to them is intended to be the utilisation of the learned Action Scripting skills to produce their own teaching material. Initial results indicate an enhanced engagement and motivation to learn to program and improved confidence in doing so.

关键词： Computational thinking Flash action scripts Trainee teachers

来源：评论

学校读者我要写书评

暂无评论

Optimization and Calculation of Probability Performances of Processes of Storage and Processing of Refrigerator Containerized Cargoes 7

Optimization and Calculation of Probability Performances of ...

引用

7th international Scientific Practical conference on Innovative Technologies in Engineering

作者： Nyrkov, A. P. Sokolov, S. S. Chernyi, S. G. Shnurenko, A. A. Pavlova, L. A. Admiral Makarov State Univ Maritime & Isl Shippin 5-7Dvinskaya St St Petersburg 198035 Russia

In the work the queueing system of the disconnected multi-channel type to which irregular, uniform or not uniform flows of requests with a unlimited latency period arrive is considered. the system is considered on an example of the container terminal having conditional-functional sections with a definite mark-to-space ratio on which the irregular inhomogeneous traffic flow with resultant intensity acts.

关键词： Condensed matter physics

来源：评论

学校读者我要写书评

暂无评论

Applied problems of polyhedron inscribing task solving 7

Applied problems of polyhedron inscribing task solving

引用

7th international conference Distributed Computing and Gridtechnologies in Science and Education, GRID 2016

作者： Kokorev, D.S. Federal State-Financed Institution Institute for Information Transmission Problems Russian Academy of Sciences Kharkevich Institute Bolshoy Karetny per. 19 build. 1 Moscow127051 Russia

the article discusses problem of finding the polyhedrons given shape inside another polyhedrons. this problem is a particular case of the 18th Hilbert problem third part. It has a practical application in the computer simulation of three-dimensional objects, the cutting-stock problems solution, the autonomous robots moving, and the jewelry industry. It is proposed method for finding the inscribed polyhedrons, based on the reduction of the problem to a nonlinear programming problem, in the article. It describes the basic functional limitations that are used for this task, and program resources to work effectively with the nonlinear programming problems. Described method requires a good initial solution. Solutions of other less accurate algorithms can be taken as a starting point. One of the most common algorithm with such goal is a homothetic bloating of object under different angles and with a center of mass in different points until an intersection with an external polyhedron. A separate chapter is devoted to the description and disadvantages of these methods. the main disadvantage is a locality of decision. As well as the need for iterating of rigidly defined forms of a polyhedron. this methods analogue, based on the nonlinear programming problem, is offered. the proposed method is based on representing any possible movement as composition of a rotation, a translation, and a dilation. Rotation matrix represented by quaternions in the described experiment. Invented algorithm works better than the existing analogs, but it is still insufficient fast for practical purposes. Future development plans are written in the conclusion. © 2016 Denis S. Kokorev.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Wind Driven Optimization Method for Solving the Bi-level programming Problem

A Hierarchical Wind Driven Optimization Method for Solving t...

引用

international conference on Logistics, Informatics and Service Sciences (LISS)

作者： Xu, Lan Teng, Wei Jiangsu Univ Sci & Technol Sch Econ & Management Zhenjiang Jiangsu Peoples R China

ISBN: (纸本)9781509011025

A hierarchical wind driven optimization (WDO) method is proposed to solve the bi-level programming problem. Firstly, the WDO method is used to optimize the lower level programming problem after the upper level variables are initialized, and the positions and velocities of air parcels in the lower level are updated. then the solutions of the upper level are optimized by the WDO method with the constrained conditions. Finally, the solutions with the minimum sum of sequences of the two-level results are selected as the final solution from the solution set. the experimental results of the proposed algorithm show the effectiveness of the proposed hierarchical wind driven optimization for solving the bi-level programming problems.

关键词： Wind driven optimization Bi-level programming problem Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

App making for pro-social and environmental change at an equity-oriented makeathon 17

App making for pro-social and environmental change at an equ...

引用

7th Annual conference on Creativity and Making in Education, FabLearn 2017

作者： MacDowell, Paula Ralph, Rachel Ng, David Simon Fraser University 250 - 13450 102 Avenue SurreyBCV3T 0A3 Canada University of British Columbia 2125 Main Mall VancouverBCV6T 1Z4 Canada University of British Columbia 300-2185 East Mall VancouverBCV6T 1Z4 Canada

ISBN: (纸本)9781450363495

the purpose of this paper is to analyze the effectiveness of an equity-oriented Makeathon designed to foster maker mindsets and maker identities in high school girls by engaging them with diverse tools, materials, mentorship, collaborative prototyping, and creative computing. the central theme of the University of British Columbia (UBC) Girls' Makeathon emphasized Tech for Change. Teams were challenged to make a mobile app related to an issue that teen girls face in local or global communities throughout the world. Participants learned how to identify a complex problem, design effective solutions, and change the world for the better by communicating their ideas (via apps and a pitch to a panel of experts). the results from the girls' design experiences, team presentations, surveys, and interviews show gains in their understandings of greening making and pro-social change making. Findings underscore the matter concerning how, why, and where do girls learn to become makers, coders, and inventors of media and technology (thereby overturning traditional gender and generational stereotypes)? the lessons learned in empowering girls to tackle inequality and create the futures they want to be part of will be useful for teachers and researchers who are interested in working with youth to design apps and innovative maker activities for environmental and sustainable education, research, and/or outreach. © 2017 Copyright held by the owner/author(s).

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

the Flowr online platform: Automated programming and computational creativity as a service 7

The Flowr online platform: Automated programming and computa...

引用

7th international conference on Computational Creativity, ICCC 2016

作者： Charnley, John Colton, Simon Llano, Maria Teresa Corneli, Joseph Computational Creativity Group Department of Computing Goldsmiths University of London United Kingdom

ISBN: (纸本)9782746691551

We present recent developments in the Flowchart Writer (FloWr) project, where we have built a framework for implementing creative systems as flowcharts of processing nodes. We describe how the system has been migrated from a desktop application to a web portal and document the various features that the portal provides to support Computational Creativity research and development. this includes a node development package and automated chart development assistants. We detail how we have supplemented the online graphical platform with a web service API to enable developers to remotely access the features of FloWr through a programming language of their choice. this encompasses developing systems as flowcharts, together with running flowcharts remotely and also allows developers to publish flowcharts as web services. Importantly, the API allows Computational Creativity researchers to experiment with the automated development of creative software systems. To encourage this, we have also introduced simple models for automated software development into the FloWr API itself, providing a novel system for unsophisticated users to experiment with. We demonstrate the potential benefits of using FloWr, with case studies showing how the web portal has been used for both node and chart development by novice and expert users. © 2016 Proceedings of the 7th international conference on Computational Creativity, ICCC 2016. All rights reserved.

关键词： Portals

来源：评论

学校读者我要写书评

暂无评论

Kindergarten Cop: Dynamic Nursery Resizing for GHC 2016

Kindergarten Cop: Dynamic Nursery Resizing for GHC

引用

25th international conference on Compiler Construction (CC)

作者： Ferreiro, Henrique Castro, Laura Janjic, Vladimir Hammond, Kevin Univ A Coruna Dept Comp Sci La Coruna Spain Univ St Andrews Sch Comp Sci St Andrews KY16 9AJ Fife Scotland

ISBN: (纸本)9781450342414

Generational garbage collectors are among the most popular garbage collectors used in programming language runtime systems. their performance depends heavily on choosing the appropriate size of the area where new objects are allocated (the nursery). In imperative languages, it is usual to make the nursery as large as possible, within the limits imposed by the heap size. functional languages, however, have quite different memory behaviour. In this paper, we study the effect that the nursery size has on the performance of lazy functional programs, through the interplay between cache locality and the frequency of collections. We demonstrate that, in contrast with imperative programs, having large nurseries is not always the best solution. Based on these results, we propose two novel algorithms for dynamic nursery resizing that aim to achieve a compromise between good cache locality and the frequency of garbage collections. We present an implementation of these algorithms in the state-of-the-art GHC compiler for the functional language Haskell, and evaluate them using an extensive benchmark suite. In the best case, we demonstrate a reduction in total execution times of up to 88.5%, or an 8.7 overall speedup, compared to using the production GHC garbage collector. On average, our technique gives an improvement of 9.3% in overall performance across a standard suite of 63 benchmarks for the production GHC compiler.

关键词： Generational garbage collection Cache locality Allocation area functional programming

来源：评论

学校读者我要写书评

暂无评论

Enabling semantics to improve detection of data races and misuses of lock-free data structures

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第15期29卷

作者： Dolz, Manuel F. Astorga, David Del Rio Fernandez, Javier Torquati, Massimo Garcia, Jose Daniel Garcia-Carballeira, Felix Danelutto, Marco Univ Carlos III Madrid Dept Comp Sci Madrid 28911 Spain Univ Pisa Dept Comp Sci I-56127 Pisa Italy

the rapid progress of multi/many-core architectures has caused data-intensive parallel applications not yet fully optimized to deliver the best performance. In the advent of concurrent programming, frameworks offering structured patterns have alleviated developers' burden adapting such applications to multithreaded architectures. While some of these patterns are implemented using synchronization primitives, others avoid them by means of lock-free data mechanisms. However, lock-free programming is not straightforward, ensuring an appropriate use of their interfaces can be challenging, since different memory models plus instruction reordering at compiler/processor levels can interfere in the occurrence of data races. the benefits of race detectors are formidable in this sense;however, they may emit false positives if are unaware of the underlying lock-free structure semantics. To mitigate this issue, this paper extends threadSanitizer, a race detection tool, with the semantics of 2 lock-free data structures: the single-producer/single-consumer and the multiple-producer/multiple-consumer queues. With it, we are able to drop false positives and detect potential semantic violations. the experimental evaluation, using different queue implementations on a set of benchmarks and real applications, demonstrates that it is possible to reduce, on average, 60% the number of data race warnings and detect wrong uses of these structures.

关键词： data race detectors parallel programming semantics wait- lock-free data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：