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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

982 篇 会议
37 篇 期刊文献
24 册 图书

馆藏范围

1,041 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

702 篇 工学
- 583 篇 计算机科学与技术...
- 365 篇 软件工程
- 146 篇 电气工程
- 57 篇 控制科学与工程
- 30 篇 信息与通信工程
- 27 篇 材料科学与工程（可...
- 19 篇 电子科学与技术（可...
- 16 篇 机械工程
- 11 篇 动力工程及工程热...
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 7 篇 仪器科学与技术
- 7 篇 石油与天然气工程
- 6 篇 城乡规划学
- 4 篇 核科学与技术
- 4 篇 农业工程
191 篇 理学
- 158 篇 数学
- 19 篇 系统科学
- 17 篇 物理学
- 12 篇 统计学（可授理学、...
- 10 篇 生物学
69 篇 管理学
- 53 篇 管理科学与工程(可...
- 22 篇 工商管理
- 19 篇 图书情报与档案管...
16 篇 教育学
- 16 篇 教育学
11 篇 文学
- 11 篇 新闻传播学
9 篇 法学
- 8 篇 社会学
6 篇 医学
- 4 篇 基础医学(可授医学...
4 篇 农学
- 4 篇 作物学
3 篇 经济学
- 3 篇 应用经济学
1 篇 军事学

主题

96 篇 logic gates
77 篇 programming
63 篇 logic programmin...
40 篇 fuzzy logic
35 篇 application soft...
30 篇 linear programmi...
30 篇 probabilistic lo...
27 篇 programming prof...
27 篇 computer archite...
26 篇 computer science
26 篇 dynamic programm...
23 篇 software enginee...
23 篇 protocols
21 篇 uncertainty
20 篇 object oriented ...
20 篇 java
20 篇 semantics
19 篇 computer circuit...
18 篇 costs
17 篇 software systems

机构

4 篇 univ potsdam pot...
4 篇 vienna univ tech...
4 篇 imdea software i...
4 篇 institute for lo...
3 篇 tu wien austria
3 篇 graduate school ...
3 篇 univ calabria de...
3 篇 carnegie mellon ...
3 篇 univ freiburg fr...
3 篇 univ british col...
3 篇 imperial coll lo...
3 篇 department of in...
2 篇 univ tecn federi...
2 篇 ist austria klos...
2 篇 univ savoie savo...
2 篇 tel aviv univers...
2 篇 zhongguancun lab...
2 篇 univ ferrara dip...
2 篇 south china univ...
2 篇 univ neuchatel i...

作者

8 篇 alviano mario
6 篇 lamma evelina
5 篇 schaub torsten
4 篇 riguzzi fabrizio
3 篇 lin yu
3 篇 vardi moshe y.
3 篇 gebser martin
3 篇 bellodi elena
3 篇 costa vitor sant...
3 篇 shinji sakamoto
3 篇 lakemeyer gerhar...
3 篇 ikeda markus
3 篇 zhou neng-fa
3 篇 xu hongxiang
3 篇 sabuncu orkunt
3 篇 leonard barolli
3 篇 schockaert steve...
3 篇 pichler andreas
3 篇 wang bin
3 篇 de givry simon

语言

1,015 篇 英文
21 篇 其他
8 篇 中文
1 篇 法文

检索条件"任意字段=30th International Conference on Logic Programming"

共 1043 条记录，以下是981-990 订阅

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

详细简洁

排序：

Maximizing crosstalk-induced slowdown during path delay test

Maximizing crosstalk-induced slowdown during path delay test

引用

IEEE international conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Dibakar Gope D. M. H. Walker Department of Electrical and Computer Engineering University of Wisconsin-Madison Madison WI USA Department of Computer Science Texas A and M University College Station TX USA

In this paper, we present a timing-driven test generator to sensitize multiple aligned aggressors coupled to a delay-sensitive victim path to detect the combination of a delay spot defect and crosstalk-induced slowdown. the framework uses parasitic capacitance information, timing windows and crosstalk-induced delay estimates to screen out unaligned or ineffective aggressors coupled to a victim path, speeding up crosstalk pattern generation. In order to induce maximum crosstalk slowdown along a path, aggressors are prioritized based on their potential delay increase and timing alignment. the test generation engine introduces the concept of alignment-driven path sensitization to generate paths from inputs to coupled aggressor nets that meet timing alignment and direction requirements. In addition, two new crosstalk-driven dynamic test compaction algorithms are developed to control the increase in test pattern count. the proposed test generation algorithm is applied to ISCAS85 and ISCAS89 benchmark circuits. SPICE simulation results demonstrate the ability of the alignment-driven test generator to increase crosstalk-induced delays along victim paths.

关键词： Delay Crosstalk Couplings Compaction Automatic test pattern generation logic gates

来源：评论

学校读者我要写书评

暂无评论

Inhomogeneity compensation for MR brain image segmentation using a multi-stage FCM-based approach

Inhomogeneity compensation for MR brain image segmentation u...

引用

Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： László Szilágyi Sándor M. Szilágyi László Dávid Zoltán Benyó Budapest University슠of슠Technology슠and슠Economics Hungary Sapientia Hungarian Science University of Transylvania Targu Mures Romania

Intensity inhomogeneity or intensity non-uniformity (INU) is an undesired phenomenon that represents the main obstacle for MR image segmentation and registration methods. Various techniques have been proposed to eliminate or compensate the INU, most of which are embedded into clustering algorithms. this paper proposes a multiple stage fuzzy c-means (FCM) based algorithm for the estimation and compensation of the slowly varying additive or multiplicative noise, supported by a pre-filtering technique for Gaussian and impulse noise elimination. the slowly varying behavior of the bias or gain field is assured by a smoothening filter that performs a context dependent averaging, based on a morphological criterion. the experiments using 2-D synthetic phantoms and real MR images show, that the proposed method provides accurate segmentation. the produced segmentation and fuzzy membership values can serve as excellent support for 3-D registration and segmentation techniques.

关键词： Image segmentation Estimation Clustering algorithms Nonhomogeneous media Linear programming Optimization Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

Automatic registration of retina images based on genetic techniques

Automatic registration of retina images based on genetic tec...

引用

Annual international conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： G. Troglio J.A. Benediktsson S.B. Serpico G. Moser R.A. Karlsson G.H. Halldorsson E. Stefansson Department of Electrical and Computer Engineering and Department of Ophthalmology University of Iceland Reykjavik Iceland Department of Biophysical and Electronic Engineering (DIBE) University of Genoa Genoa Italy

the aim of this paper is to develop an automatic method for the registration of multitemporal digital images of the fundus of the human retina. the images are acquired from the same patient at different times by a color fundus camera. the proposed approach is based on the application of global optimization techniques to previously extracted maps of curvilinear structures in the images to be registered (such structures being represented by the vessels in the human retina): in particular, a genetic algorithm is used, in order to estimate the optimum transformation between the input and the base image. the algorithm is tested on two different types of data, gray scale and color images, and for both types, images with small changes and with large changes are used. the comparison between the registered images using the implemented method and a manual one points out that the proposed algorithm provides an accurate registration. the convergence to a solution is not possible only when dealing with images taken from very different view-points.

关键词： Retina Kernel Optimization Linear programming Genetic algorithms Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

Development of Analytical Model for Data Trustworthiness in Sensor Networks

Development of Analytical Model for Data Trustworthiness in ...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： Sami J. Habib Paulvanna N. Marimuthu Computer Engineering Department Kuwait University Safat Kuwait

ISBN: (纸本)9781509018598

the security and trustworthiness of data transmitted by sensors within the wireless sensor networks (WSN) are highly crucial, since the sensors' data can be easily accessed and manipulated by intruders or malfunctions. Data security within WSN can be viewed as how the data is protected during transmission, whereas the data trustworthiness represents the confidence of the sensed data. the unfriendly operational environment, insufficient energy, and hardware malfunction may be the cause of sensors' erratic behaviors, thereby making the sensed and collected data unreliable. thus, data trustworthiness should ensure the confidence of the sensed data. In this work, we have developed an analytical model to represent the data trustworthiness of WSN, which is a first-order polynomial combining two trust factors. the trust factors are derived based on the average value of the previously transmitted data from the sensor, and the average value of the similar sensing data reported by its neighboring sensors. We have developed an algorithm to find the sensible subspace to operate on ensuring the maximum trust, where Simulated Annealing is utilized as a search tool to select the best weighted combination of trust factors. the experimental outcomes with varying deviation of sensing parameters reveal that 67% of the estimated trust-scores are in acceptable region.

关键词： Wireless sensor networks Mathematical model Analytical models logic gates Security Sensors Data models

来源：评论

学校读者我要写书评

暂无评论

A Continuous Improvement Model in ImPProS

A Continuous Improvement Model in ImPProS

引用

IEEE Annual international Computer Software and Applications conference (COMPSAC)

作者： Sandro Ronaldo Bezerra Oliveira Alexandre Marcos Lins De Vasconcel Centro de Ciências Exatas e Tecnologia Universidade da Amazônia (UNAMA) Belém PA Brazil Universidade Federal de Pernambuco (UFPE) Brazil

the goal of this work is analyzing each one of the phases that composes the structure of the IDEAL (Initiating, Diagnosing, Establishing, Acting and Learning) model, as well as its activities and principles, and adapting for the characteristics that the software process implementation environment must have about the continuous software process improvement. this environment helps an organization in the gradual software process implementation, it is useful to supply automated support by means of an environment (ImPProS - gradual software process implementation environment) capable to support the phases that the specialized literature considers as necessary: software process definition, simulation, execution and evaluation (Oliveira et al., 2005). the ImPProS is a project of initiative the Center of Informatic at UFPE - Federal University of Pernambuco with the partnership at UNAMA - University of Amazonia, financed by CNPq - National Advice of Scientific and Technological Development, which aims the creation of an environment of support to the implementation a software process in an organization of gradual way. the "gradual" term denotes the fact that the process implementation is performed with the experiences learned in its previous phases. thus, it is composed of a cooperative environment, formed for nine main tools: ProDefiner; ProSimulator; ProEnacter; ProEvaluator; ProImprove; ProAnalyser; ProReuse; ProKnowledge; and ProConverter.

关键词： Continuous improvement Software quality Software tools Capability maturity model Context modeling Application software Process design programming Software standards Standards development

来源：评论

学校读者我要写书评

暂无评论

PPAC: A Versatile In-Memory Accelerator for Matrix-Vector-Product-Like Operations

PPAC: A Versatile In-Memory Accelerator for Matrix-Vector-Pr...

引用

international conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Oscar Castañeda Maria Bobbett Alexandra Gallyas-Sanhueza Christoph Studer School of Electrical and Computer Engineering Cornell University Ithaca NY

Processing in memory (PIM) moves computation into memories with the goal of improving throughput and energy-efficiency compared to traditional von Neumann-based architectures. Most existing PIM architectures are either general-purpose but only support atomistic operations, or are specialized to accelerate a single task. We propose the Parallel Processor in Associative Content-addressable memory (PPAC), a novel in-memory accelerator that supports a range of matrix-vector-product (MVP)-like operations that find use in traditional and emerging applications. PPAC is, for example, able to accelerate low-precision neural networks, exact/approximate hash lookups, cryptography, and forward error correction. the fully-digital nature of PPAC enables its implementation with standard-cell-based CMOS, which facilitates automated design and portability among technology nodes. To demonstrate the efficacy of PPAC, we provide post-layout implementation results in 28nm CMOS for different array sizes. A comparison with recent digital and mixed-signal PIM accelerators reveals that PPAC is competitive in terms of throughput and energy-efficiency, while accelerating a wide range of applications and simplifying development.

关键词： Computer architecture throughput Sociology Statistics logic gates Program processors Task analysis

来源：评论

学校读者我要写书评

暂无评论

Subgraph pattern matching over uncertain graphs with identity linkage uncertainty

Subgraph pattern matching over uncertain graphs with identit...

引用

international conference on Data Engineering

作者： Walaa Eldin Moustafa Angelika Kimmig Amol Deshpande Lise Getoor Department of Computer Science University of Maryland USA Department of Computer Science KU Leuven Belgium

ISBN: (纸本)9781479925568

there is a growing need for methods that can represent and query uncertain graphs. these uncertain graphs are often the result of an information extraction and integration system that attempts to extract an entity graph or a knowledge graph from multiple unstructured sources [25], [7]. Such an integration typically leads to identity uncertainty, as different data sources may use different references to the same underlying real-world entities. Integration usually also introduces additional uncertainty on node attributes and edge existence. In this paper, we propose the notion of a probabilistic entity graph (PEG), a formal model that uniformly and systematically addresses these three types of uncertainty. A PEG is a probabilistic graph model that defines a distribution over possible graphs at the entity level. We introduce a general framework for constructing a PEG given uncertain data at the reference level and develop efficient algorithms to answer subgraph pattern matching queries in this setting. Our algorithms are based on two novel ideas: context-aware path indexing and reduction by join-candidates, which drastically reduce the query search space. A comprehensive experimental evaluation shows that our approach outperforms baseline implementations by orders of magnitude.

关键词： Uncertainty Probabilistic logic Random variables Probability distribution Pattern matching Markov random fields Equations

来源：评论

学校读者我要写书评

暂无评论

A Combining Classifiers Approach for Detecting Email Spams

A Combining Classifiers Approach for Detecting Email Spams

引用

international conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Shrawan Kumar Trivedi Shubhamoy Dey Information Systems BML Munjal University School of Management Gurgaon Haryana India Information Systems Indian Institute of Management Rau Indore India

Email is a rapid and cheap communication medium for sending and receiving information where spam is becoming a nuisance for such communication. A good spam filtering cannot only be achieved by high performance accuracy but low false positive is also necessary. this paper presents a combining classifiers approach with committee selection mechanism where the main objective is to combine individual decisions of the good classifiers for utmost classification outcome in spam classification domain. In this context, three different classifiers have been selected i.e. "Boosted Bayesian", "Boosted Naïve Bayes and Support Vector Machine (SVM). For combining classifiers, boosted bayesian and boosted naïve bayes are chosen as members of committee and SVM is taken as the president. the member of committee have been selected from our previous study where we have identified boosting with adaboost improves the performance of probabilistic classifier. Results show the best results of novel combining classifier approach in compression with individual classifiers compared in terms of good performance accuracy and low false positives. In addition, greedy step wise feature search method is found to be good in this study.

关键词： Electronic mail Support vector machines Bayes methods Training Boosting Decision trees Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Strain Elastogram Improvement through Dynamic programming Refinement using Multi-objective Optimization Technique

Strain Elastogram Improvement through Dynamic Programming Re...

引用

Iranian conference of Biomedical Engineering (ICBME)

作者： Mohammadhosein Kalani Ali Fallah Saeid Rashidi Maryam Mehdizadeh Dastjerdi Faculty of Biomedical Engineering Amirkabir University of Technology Tehran Iran Faculty of Medical Sciences and Technologies Science and Research Branch Islamic Azad University Tehran Iran

Elastograms suffer from noise and undesirable artifacts, making it necessary to enhance their signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) for accurate detection of tissue deformations, determination of its displacement fields, and representation of tissue characteristics to medical professionals. this research aims to improve the quality of elastograms. Among various displacement estimation methods, the dynamic programming (DP) approach is chosen due to its superior speed, accuracy, and lower computational complexity and cost. the research objectives are defined as enhancing the SNR and CNR metrics and evaluating the resulting improvement in the elastogram quality. To achieve DP refinement, a perturbation is employed. the variables of the DP cost function are evaluated, and finally, the adjustment weight (w) is selected as a suitable criterion for optimization. After assessing different multi-objective optimization algorithms, the Electric Fish optimization algorithm with Non-dominated Sorting (NS-EFO) is chosen. In the designed optimization process, the DP cost function is considered as the objective function, SNR and CNR as objectives, and w as the design variable. To evaluate the improved performance of DP, two RF samples are used, recorded from a CIRS phantom and a Polyvinyl alcohol (PVA) single-layer mammary gland phantom. Following determining the optimal w, the SNR and CNR values are computed for both one-dimensional (ID) and two-dimensional (2D) models under different conditions. the results indicate that the SNR and CNR values for the CIRS phantom, on average, increased respectively by 556.74% and 853.72% in the ID model and by 83.56% and 127.91% in the 2D model, compared to the primitive values. For the single-layer glandular phantom, the SNR and CNR values, on average, increased respectively by 66.98% and 33.03% in the ID model and by 102.67% and 2178.99% in the 2D model, compared to the primary values.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimization of Secrecy Rate in Cooperative Device to Device Communications

Optimization of Secrecy Rate in Cooperative Device to Device...

引用

IEEE Canadian conference on Electrical and Computer Engineering

作者： Maryam Alibeigi Abbas Taherpour Saeed Gazor Department of Electrical Engineering Imam Khomeini International University Qazvin Iran Department of Electrical and Computer Engineering Queens University Kingston ON Canada

In this paper, a cooperative device to device (D2D) communication system is studied while two transmitting devices communicate with one destination device in the presence of a passive eavesdropper. the second transmitting device cooperates with the first transmitting device and hence the transmission takes place is two phases. In the first phase, the first device transmits its signal to the second transmitting device. In the second phase, the second transmitting device transmits its own message along with the relaying signal from the first device simultaneously to the receiver. Our goal is to optimize this cooperation through maximizing the secrecy rate while the signal-to-noise ratio (SNR) at the destination is guaranteed to be above certain predefined threshold. We show that this optimization problem yields to polynomial fractional programming and propose an efficient numerical algorithm by using Gloptiploy and SeDuMi software packages. Simulation results show that this optimum cooperation achieves superior secrecy rate compared with fixed or maximum cooperation methods.

关键词： D2D SNR optimum

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 95 96 97 98 99 100 101 102 103 104 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：