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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

180 篇 会议
18 篇 期刊文献
3 册 图书

馆藏范围

201 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

148 篇 工学
- 133 篇 计算机科学与技术...
- 94 篇 软件工程
- 7 篇 电气工程
- 7 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 机械工程
- 3 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 交通运输工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
- 1 篇 城乡规划学
- 1 篇 生物工程
- 1 篇 安全科学与工程
27 篇 理学
- 24 篇 数学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 物理学
12 篇 管理学
- 6 篇 管理科学与工程(可...
- 6 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
- 1 篇 作物学

主题

32 篇 logic programmin...
23 篇 functional progr...
9 篇 logic
8 篇 programming
6 篇 computer science
6 篇 parallel program...
6 篇 answer set progr...
5 篇 computer circuit...
5 篇 application soft...
5 篇 optimization
5 篇 semantics
5 篇 computer program...
5 篇 probabilistic lo...
5 篇 hardware
4 篇 programming prof...
4 篇 computer archite...
4 篇 model checking
4 篇 logic gates
4 篇 linear programmi...
4 篇 yarn

机构

2 篇 univ london impe...
2 篇 vienna universit...
2 篇 university of ca...
2 篇 department of co...
2 篇 imdea software
2 篇 texas tech univ ...
2 篇 free univ bolzan...
2 篇 queen mary univ ...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 tech univ madrid...
2 篇 tech univ madrid...
2 篇 univ roma la sap...
2 篇 national ict aus...
2 篇 univ calabria di...
2 篇 vienna univ tech...
1 篇 philipps univ ma...
1 篇 univ nottingham ...
1 篇 dept of comput u...
1 篇 univ porto cracs...

作者

3 篇 yoshida nobuko
3 篇 woltran stefan
3 篇 saenz-perez fern...
2 篇 stuckey peter j.
2 篇 mellarkod veena ...
2 篇 lópez-garcía p
2 篇 mukaidono masao
2 篇 kiselyov oleg
2 篇 hafiz rahmatulla...
2 篇 krennwallner tho...
2 篇 costa vitor sant...
2 篇 lenzerini mauriz...
2 篇 cozman fabio g.
2 篇 caballero rafael
2 篇 carro manuel
2 篇 eiter thomas
2 篇 rosati riccardo
2 篇 rodríguez-artale...
2 篇 frost richard a.
2 篇 ianni giovambatt...

语言

193 篇 英文
7 篇 其他
1 篇 西班牙文

检索条件"任意字段=10th International Symposium on Functional and Logic Programming"

共 201 条记录，以下是51-60 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Neuronal network structural connectivity estimation by probabilistic features and graph heat kernels

Neuronal network structural connectivity estimation by proba...

引用

IEEE international symposium on Biomedical Imaging

作者： S. Ullo U. Castellani D. Sona A. Del Bue A. Maccione L. Berdondini V. Murino Pattern Analysis and Computer Vision (PAVIS) Istituto Italiano di Tecnologia Genova Italy Department of Computer Science University of Verona Verona Italy Neuroscience and Brain Technologies (NBT) Istituto Italiano di Tecnologia Genova Italy

ISBN: (纸本)9781467364560

It is well proven that the functional electrophysiological behavior of in-vitro neuronal networks is influenced by the structural connectivity. thus, the automatic extraction of the topology in large assemblies of interconnected neurons can be a valuable tool for investigating the basic mechanisms underlying high-level cognitive functions. In this paper we propose a method for estimating the structural connectivity of neuronal networks from multimodal datasets combining high-resolution Multi-Electrode Arrays (MEA) and fluorescence microscopy. Probabilistic directional features are used in a graph heat kernel framework to identify the structural connectivity of the neuronal network. Electrode connectivity maps are computed as weighted graphs in which the edge weights represent the strength of the structural connection.

关键词： Electrodes Heating Biological neural networks Kernel Probabilistic logic Feature extraction Neurons

来源：评论

学校读者我要写书评

暂无评论

A graph theoretical regression model for brain connectivity learning of Alzheimer'S disease

A graph theoretical regression model for brain connectivity ...

引用

IEEE international symposium on Biomedical Imaging

作者： Chenhui Hu Lin Cheng Jorge Sepulcre Georges El Fakhri Yue M. Lu Quanzheng Li Center for Advanced Medical Imaging Science Massachusetts General Hospital Boston MA USA School of Engineering and Applied Sciences Harvard University Cambridge MA USA Department of Engineering Trinity College Hartford CT USA

ISBN: (纸本)9781467364560

Learning functional brain connectivity is essential to the understanding of neurodegenerative diseases. In this paper, we introduce a novel graph regression model (GRM) which regards the imaging data as signals defined on a graph and optimizes the fitness between the graph and the data, with a sparsity level regularization. the proposed framework features a nice interpretation in terms of low-pass signals on graphs, and is more generic compared with the previous statistical models. Results based on the simulated data illustrates that our approach can obtain a very close reconstruction of the true network. We then apply the GRM to learn the brain connectivity of Alzheimer's disease (AD). Evaluations performed upon PET imaging data of 30 AD patients demonstrate that the connectivity patterns discovered are easy to interpret and consistent with known pathology.

关键词： Laplace equations Covariance matrices Brain modeling Alzheimer's disease Imaging Linear programming Neuroimaging

来源：评论

学校读者我要写书评

暂无评论

Clinically desired segmentation method for vertebral bodies

Clinically desired segmentation method for vertebral bodies

引用

IEEE international symposium on Biomedical Imaging

作者： Melih S. Aslan Ahmed Shalaby Aly A. Farag Computer Vision and Image Processing Laboratory University of Louisville Louisville KY USA

ISBN: (纸本)9781467364560

In this paper, we propose a clinically desired segmentation method for vertebral bodies (VBs) in computed tomography (CT) images. three pieces of information (intensity, spatial interaction, and shape) are modeled to optimize a new probabilistic energy functional; and hence to obtain the optimum segmentation. the information of the intensity and spatial interaction are modeled using the Gaussian and Gibbs distribution, respectively. A shape model is proposed using a new probabilistic function to enhance the segmentation results. this model is a generic shape information which is obtained using the cervical, lumbar, and thoracic spinal regions. We propose a semiautomated segmentation algorithm which uses limited interventions only in the VB separation process. the overall segmentation process completes the task in very low execution time which is one of the most important contribution of this paper. the proposed method is validated with clinical CT images and on a phantom with various Gaussian noise levels. this study reveals that the proposed method is robust under various noise levels, less variant to the initialization, and quite faster than alternative methods. One of the most important contributions of our paper is to offer a segmentation framework which can be suitable to the clinical works with acceptable results.

关键词： Image segmentation Shape Computed tomography Probabilistic logic Object segmentation Level set Training

来源：评论

学校读者我要写书评

暂无评论

Automated Technology for Verification and Analysis - 10th international symposium, ATVA 2012, Proceedings

Automated Technology for Verification and Analysis - 10th In...

引用

10th international symposium on Automated Technology for Verification and Analysis, ATVA 2012

ISBN: (纸本)9783642333859

the proceedings contain 31 papers. the topics discussed include: verification of computer switching networks: an overview;dynamic Bayesian networks: a factored model of probabilistic dynamics;interpolant automata;approximating deterministic lattice automata;a succinct canonical register automaton model for data domains with binary relations;the unary fragments of metric interval temporal logic: bounded versus lower bound constraints;on temporal logic and signal processing;improved single pass algorithms for resolution proof reduction;model checking systems and specifications with parameterized atomic propositions;reachability analysis of polynomial systems using linear programming relaxations;linear-time model-checking for multithreaded programs under scope-bounding;accurate invariant checking for programs manipulating lists and arrays with infinite data;and a verifier for functional properties of sequence-manipulating programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving the Performance of FD Constraint Solving in a CFLP System 12

Improving the Performance of FD Constraint Solving in a CFLP...

引用

11th international symposium on functional and logic programming (FLOPS)

作者： Castineiras, Ignacio Saenz-Perez, Fernando Univ Complutense Madrid Dept Sistemas Informat & Computac Madrid Spain Univ Complutense Madrid Dept Ingn Software & Inteligencia Artificial Madrid Spain

ISBN: (纸本)9783642298226

Constraint functional logic programming (CFLP) integrates lazy narrowing with constraint solving. It provides a high modeling abstraction, but its solving performance can be penalized by lazy narrowing and solver interface surcharges. As for real-world problems most of the solving time is carried out by solver computations, the system performance can be improved by interfacing state-of-the-art external solvers with proven performance. In this work we depart from the CFLP system TOY(FD), implemented in SICStus Prolog and supporting Finite Domain (FD) constraints by using its underlying Prolog FD solver. We present a scheme describing how to interface an external CP(FD) solver to TOY(FD), and easily adaptable to other Prolog CLP or CFLP systems. We prove the scheme to be generic enough by interfacing Gecode and ILOG solvers, and we analyze the new performance achieved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Extending the TOY System with the ECLⁱPS^e Solver over Sets of Integers 12

Extending the TOY System with the ECL<i><SUP>i</SUP></i>PS<i...

引用

11th international symposium on functional and logic programming (FLOPS)

作者： Estevez-Martin, Sonia Correas Fernandez, Jesus Saenz-Perez, Fernando Univ Complutense Madrid DSIC Madrid Spain Univ Complutense Madrid DISIA Madrid Spain

ISBN: (纸本)9783642298226

Starting from a computational model for the cooperation of constraint domains in the CFLP context (with lazy evaluation and higher-order functions), we present the theoretical basis for the coordination domain C tailored to the cooperation of three pure domains: the domain of finite sets of integers (FS), the finite domain of integers (FD) and the Herbrand domain (H). We also present the adaptation of the goal-solving calculus CCLNC(C) (Cooperative Constraint Lazy Narrowing Calculus over C) to this particular case, as well as soundness and limited completeness results. An implementation of this cooperation in the CFLP system TOY is presented. Our implementation is based on inter-process communication between TOY and the external solvers for sets of integers and finite domain of (ECLPSe)-P-i.

关键词： Constraint functional logic programming Constrained Lazy Narrowing Implementation Domain Cooperation

来源：评论

学校读者我要写书评

暂无评论

Indexed realizability for bounded-time programming with references and type fixpoints 1

引用

10th Asian symposium on programming Languages and Systems, APLAS 2012

作者： Brunel, Aloïs Madet, Antoine Laboratoire d'Informatique de Paris-Nord Université Paris 13 France Univ. Paris Diderot UMR 7126 CNRS F-75205 Paris France

ISBN: (数字)9783642351822

ISBN: (纸本)9783642351815

the field of implicit complexity has recently produced several bounded-complexity programming languages. this kind of language allows to implement exactly the functions belonging to a certain complexity class. We present a realizability semantics for a higher-order functional language based on a fragment of linear logic called LAL which characterizes the complexity class PTIME. this language features recursive types and higher-order store. Our realizability is based on biorthogonality, indexing and is quantitative. this last feature enables us not only to derive a semantical proof of termination, but also to give bounds on the number of computational steps of typed programs. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Joint Interface Placement and Channel Assignment in Multi-channel Wireless Mesh Networks

Joint Interface Placement and Channel Assignment in Multi-ch...

引用

international symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Wenjia Wu Junzhou Luo Ming Yang Laurence T. Yang School of Computer Science and Engineering Southeast University Nanjing China Department of Computer Science Saint Francis Xavier University Antigonish NS Canada

In multi-channel wireless mesh networks (WMNs), it is significantly important to achieve efficient channel utilization. the channel assignment problem, which investigates how to seek a proper mapping between available channels and network interface cards (NICs) on mesh routers (MRs), is attracting more and more attention from the research community. However, most proposed channel assignment approaches assume that NICs are evenly placed on the MRs, and its amount is also pre-determined. Due to the non-uniform distribution of WMN traffic, the equal interface placement will inevitably cause that the bottleneck MRs suffer from NIC shortage, and MRs with less load only have a low utilization of NICs. Hence, in order to improve network performance and reduce network cost, interface placement should be considered carefully in the process of planning a WMN. In this paper, we investigate the joint interface placement and channel assignment problem, i.e., how to appropriately place NICs on MRs and assign channels to them. We first formulate the problem as a mixed integer linear programming (MILP) model, which aims to minimize the total number of NICs while satisfying logical link, link bandwidth, link interference and traffic demand constraints. then, we propose an MILP-based heuristic algorithm, using iterated local search to obtain sub-optimal solutions efficiently. Finally, we conduct simulation experiments to compare the heuristic solutions with the optimal solutions, and the results show that our proposed heuristic algorithm can achieve good sub-optimal solutions. Moreover, the simulation results also demonstrate that the algorithm can be well applied in large-scale WMNs where the optimal solutions cannot be obtained, and can perform well under different traffic demands.

关键词： Interference Joints logic gates Heuristic algorithms Wireless communication Bandwidth Optimization

来源：评论

学校读者我要写书评

暂无评论

Using Aspect-Orientation to Simplify Concurrent programming 11

Using Aspect-Orientation to Simplify Concurrent Programming

引用

10th international Conference on Aspect-Oriented Software Development (AOSD)

作者： Hohenstein, Uwe Gleim, Urs Siemens AG CT T DE IT 1 Otto Hahn Ring 6 D-81730 Munich Germany

ISBN: (纸本)9781450305563

the Java programming language offers several basic constructs for concurrent programming. Despite covering everything needed from a functional point of view, the constructs are difficult to use since they require a lot of infrastructural statements besides the real logic. this makes concurrent programming error-prone and difficult to reuse. It seems that abstractions are needed to ease the pain and to better support reusability. this paper explores how to use and benefit from aspect-orientation (AO), particularly the AspectJ language, in this respect. AO promises a high potential for reuse due to a higher level of modularization since crosscutting concerns can better be modularized in aspects. this paper confirms higher reuse by presenting a collection of reusable aspects for solving specific problems in concurrent programming. Having AspectJ-based implementations for recurring problems, this paper also summarizes some interesting experiences and takes the chance to present an industrial view on some criticisms of aspect-orientation.

关键词： Aspect-Orientation AspectJ Crosscutting Concern Case Study Concurrent programming Modularity

来源：评论

学校读者我要写书评

暂无评论

An Elementary Affine λ-Calculus with Multithreading and Side Effects

引用

10th international Conference on Typed Lambda Calculi and Applications (TLCA)

作者： Madet, Antoine Amadio, Roberto M. Univ Paris Diderot Lab PPS Paris France

ISBN: (纸本)9783642216916

Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main contributions are as follows. First, we introduce a modal call-by-value lambda-calculus with multithreading and side effects. Second, we provide a combinatorial proof of termination in elementary time for the language. third, we introduce an elementary affine type system that guarantees the standard subject reduction and progress properties. Finally, we illustrate the programming of iterative functions with side effects in the presented formalism.

关键词： Elementary Linear logic Resource Bounds Lambda Calculus Regions Side Effects

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共21页 << < 2 3 4 5 6 7 8 9 10 11 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：