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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

62 篇 会议
8 册 图书
2 篇 期刊文献

馆藏范围

71 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

45 篇 工学
- 39 篇 计算机科学与技术...
- 21 篇 软件工程
- 6 篇 信息与通信工程
- 5 篇 电气工程
- 3 篇 控制科学与工程
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 2 篇 网络空间安全
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 交通运输工程
22 篇 理学
- 12 篇 数学
- 5 篇 物理学
- 4 篇 化学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 大气科学
- 1 篇 生物学
11 篇 管理学
- 9 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 公共管理
3 篇 法学
- 3 篇 社会学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...
- 1 篇 护理学（可授医学、...
1 篇 经济学
- 1 篇 应用经济学
1 篇 文学
- 1 篇 新闻传播学

主题

4 篇 computer communi...
4 篇 discrete mathema...
3 篇 theory of comput...
3 篇 software enginee...
3 篇 software enginee...
3 篇 database managem...
3 篇 computers
3 篇 artificial intel...
3 篇 algorithm analys...
2 篇 data storage rep...
2 篇 graph theory
2 篇 automata theory
2 篇 quantum theory
2 篇 information stor...
1 篇 surveys
1 篇 information syst...
1 篇 learning systems
1 篇 theory-building
1 篇 digital innovati...
1 篇 计算理论

机构

2 篇 department of co...
2 篇 department of in...
1 篇 department of so...
1 篇 institute of inf...
1 篇 faculty of infor...
1 篇 school of applie...
1 篇 certicon shareho...
1 篇 institute of inf...
1 篇 us ctr dis contr...
1 篇 department of in...
1 篇 university of el...
1 篇 institute of che...
1 篇 robotics and cyb...
1 篇 dept. of compute...
1 篇 univ minnesota m...
1 篇 university of th...
1 篇 bundesamt fur ei...
1 篇 department of cy...
1 篇 dept. of informa...
1 篇 shanghai jiao to...

作者

3 篇 šimko marián
2 篇 kutrib martin
2 篇 leszek pacholski
2 篇 löwe jan-thomas
1 篇 petr kadera
1 篇 ronquillo charle...
1 篇 laryea samuel
1 篇 afsarmanesh hami...
1 篇 beňňušková ľubic...
1 篇 breton vincent
1 篇 chukwunonso fran...
1 篇 nørager1 sofie
1 篇 wielemaker jan
1 篇 geusebroek jan-m...
1 篇 frans c. a. groe...
1 篇 peter ružička (e...
1 篇 pennec xavier
1 篇 de vaujany franç...
1 篇 petr novák
1 篇 herveg jean a.m.

语言

69 篇 英文
3 篇 中文

检索条件"任意字段=29th Conference on Current Trends in Theory and Practice of Informatics"

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

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

详细简洁

排序：

Rendering multi-perspective images with trilinear projection

Rendering multi-perspective images with trilinear projection

引用

29th Australasian Computer Science conference, ACSC 2006

作者： Vallance, Scott Calder, Paul School of Informatics and Engineering Flinders University of South Australia PO Box 2100 Adelaide SA 5001 Australia

ISBN: (纸本)1920682309

Non-linear projections of 3D graphical scenes can be used to compute reflections and refractions in curved surfaces, draw artistic images in the style of Escher or Picasso, and produce visualizations of complex data. Previously, most non-linear projections were rendered by ray tracing. this paper presents trilinear projection, a technique for rendering non-linear projections in a manner that achieves significant performance benefits by taking advantage of current rendering hardware and software. Trilinear projections are geometrically similar to Phong-shaded triangular patches, and like Phong patches they can be joined to represent more complicated shapes. the paper details how a single trilinear projection projects a scene point, how projections of scene triangles can be built up by considering the connectivity of projected points, and how multiple trilinear projections can be combined. Finally, it outlines a method for using trilinear projection to approximate reflections and refractions on curved surfaces. Copyright © 2006, Australian Computer Society, Inc.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium 46th

Two-Player Competitive Diffusion Game: Graph Classes and the...

引用

46th International conference on current trends in theory and practice of informatics (SOFSEM)

作者： Fukuzono, Naoka Hanaka, Tesshu Kiya, Hironori Ono, Hirotaka Yamaguchi, Ryogo Nagoya Univ Grad Sch Informat Chikusa Ku Furo Cho Nagoya Aichi Japan Chuo Univ Dept Informat & Syst Engn Bunkyo Ku 1-13-27Kasuga Tokyo Japan Dev Bank Japan Tokyo Japan

ISBN: (纸本)9783030389192;9783030389185

the competitive diffusion game is a game-theoretic model of information spreading on a graph proposed by Alon et al. (2010). In the model, a player chooses an initial vertex of the graph, from which information by the player spreads through the edges connected with the initial vertex. If a vertex that is not yet influenced by any information receives information by a player, it is influenced by the information and it diffuses it to adjacent vertices. A vertex that simultaneously receives two or more types of information does not diffuse any type of information from then on. the objective of a player is to maximize the number of vertices influenced by the player's information. In this paper, we investigate the existence of a pure Nash equilibrium of the two-player competitive diffusion game on chordal and its related graphs. We show that a pure Nash equilibrium always exists on block graphs, split graphs and interval graphs, all of which are well-known subclasses of chordal graphs. On the other hand, we show that there is an instance with no pure Nash equilibrium on (strongly) chordal graphs;the boundary of the existence of a pure Nash equilibrium is found.

关键词： Nash equilibrium Competitive diffusion game Algorithmic game theory Chordal graph

来源：评论

学校读者我要写书评

暂无评论

On majority voting games in trees 28th

引用

28th International conference on current trends in theory and practice of informatics, SOFSEM 2001

作者： Kràlovič, Rastislav Department of Computer Science Physics and Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9783540429128

We consider the following synchronous colouring game played on a simple connected graph with vertices coloured black or white. During one step of the game, each vertex is recoloured accordingto the majority of its neighbours. the variants of the model differ by the choice of a particular tie-breaking rule and possible rule for enforcing monotonicity. Two tie-breaking rules we consider are simple majority and strong majority, the first in case of a tie recolours the vertex black and the latter does not change the colour. the monotonicity-enforcing rule allows the voting only in white vertices, thus leavin gall black vertices intact. this model is called irreversible. these synchronous dynamic systems have been extensively studied and have many applications in molecular biology, distributed systems modelling, etc. In this paper we give two results describing the behaviour of these systems on trees. First we count the number of fix points of strong majority rule on complete binary trees to be asymptotically 4N ・ (2α)N where N is the number of vertices and 0.7685 ≤ α ≤ 0.7686. the second result is an algorithm for testing whether a given configuration on an arbitrary tree evolves into an all-black state under irreversible simple majority rule. the algorithm works in time O(t log t) where t is the number of black vertices and uses labels of length O(logN). © Springer-Verlag Berlin Heidelberg 2001.

关键词： Molecular biology

来源：评论

学校读者我要写书评

暂无评论

Recent advances in wavelength routing 28th

引用

28th International conference on current trends in theory and practice of informatics, SOFSEM 2001

作者： Kaklamanis, Christos Computer Technology Institute Dept. of Computer Engineering and Informatics University of Patras Rio26500 Greece

ISBN: (纸本)9783540429128

We study the problem of allocating optical bandwidth to sets of communication requests in all–optical networks that utilize Wavelength Division Multiplexing (WDM). WDM technology establishes communication between pairs of network nodes by establishing transmitter– receiver paths and assigning wavelengths to each path so that no two paths going through the same fiber link use the same wavelength. Optical bandwidth is the number of distinct wavelengths. Since state–of–the–art technology allows for a limited number of wavelengths, the engineering problem to be solved is to establish communication between pairs of nodes so that the total number of wavelengths used is minimized;this is known as the wavelength routing problem. In this paper we survey recent advances in bandwidth allocation in tree– shaped WDM all–optical networks. We present hardness results and lower bounds for the general problem and the special case of symmetric communication. We also survey various techniques that have been developed recently, and explain how they can be used to attack the problem. First, we give the main ideas of deterministic greedy algorithms and study their limitations. then, we show how to use various ways and models of wavelength conversion in order to achieve almost optimal bandwidth utilization. Finally, we show that randomization can help to improve the deterministic upper bounds. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2013: theory and practice of Computer Science 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Peter Emde Boas Frans C. A. Groen Giuseppe F. Italiano Jerzy Nawrocki Harald Sack

ISBN: (数字)9783642358432

ISBN: (纸本)9783642358425

this book constitutes the refereed proceedings of the 39th International conference on current trends in theory and practice of Computer Science, SOFSEM 2013, held in Špindlerův Mlýn, Czech Republic, in January 2013. the 37 revised full papers presented in this volume were carefully reviewed and selected from 98 submissions. the book also contains 10 invited talks, 5 of which are in full-paper length. the contributions are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and social computing and human factors.

关键词： Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Information Storage and Retrieval Software Engineering Artificial Intelligence Data Structures

来源：评论

学校读者我要写书评

暂无评论

Particularities of Relationship Marketing In Optometric practice 29

Particularities of Relationship Marketing In Optometric Prac...

引用

29th International-Business-Information-Management-Association conference

作者： Aurora, Roman (Parescura) Polixenia Bucharest Univ Econ Studies Fac Mkt Bucharest Romania

ISBN: (纸本)9780986041976

the current conditions of the optical and optometric services market pose to marketers the challenge of permanently updating their marketing strategies. Aligned to the rapid development of the information technology, the customer relationships must become more interactive, more anticipative. more in tune with their needs and preferences. this study seeks to analyse the particularities of the relationship marketing (regarded either as a succession of relationships, networks and interactions between market players, or as a synthesis between customer relationship management and quality management) and the way in which they integrate in the organisations' policies, contributing to the profit maximisation, the implementation of the relationship marketing principles consolidate the relationship capital of the organisation, determining the identification of the competitive advantages based on customer retention, on long term, from the loyal customer segment, by increasing their trust in the optical and optometric services provider. the study wilt use the conceptual framework of the relationship marketing, emphasizing the three theoretical perspectives: behavioural, network theory and managerial. Applied to the optics and optometry field, the relationship capital embodies important aspects of all parties involved in this exchange, factors that this sector could not continue without and form future strong connections. the journey of the six "I"s of relationship marketing ends with the intention of a unique relationship, an aspiration that translates into return, revisit and repurchase. AR the actions of a specialized eye care services provider are designed to convey to the consumer a relevant competitive advantage: the professional management of the eyesight capital.

关键词： relationship marketing optics and optometry field relationship capital

来源：评论

学校读者我要写书评

暂无评论

Leveraging microblogs for resource ranking

Leveraging microblogs for resource ranking

引用

38th conference on current trends in theory and practice of Computer Science, SOFSEM 2012

作者： Majer, Tomáš Šimko, Marián Faculty of Informatics and Information Technologies Slovak University of Technology Ilkovičova 3 842 16 Bratislava 4 Slovakia

ISBN: (纸本)9783642276590

In order to compute page rankings, search algorithms primarily utilize information related to page content and link structure. Microblog as a phenomenon of today provides additional, potentially relevant, information - short messages often containing hypertext links to web resources. Such source is particularly valuable when considering a temporal aspect of information, which is being published every second. In this paper we present a method for resource ranking based on Twitter data structure processing. We apply various graph algorithms leveraging the notion of a node centrality in order to deduce microblog-based resource ranking. Our method ranks a microblog user based on his followers count with respect to a number of (re)posts and reflects it into resource ranking. the evaluation of the method showed that micro-based resource ranking a) can not be substituted by a common form of an explicit user rating, and b) has the great potential for search improvement. © 2012 Springer-Verlag.

关键词： Hypertext systems

来源：评论

学校读者我要写书评

暂无评论

Cyclic cutwidth of the mesh 26th

Cyclic cutwidth of the mesh

引用

26th conference on current trends in theory and practice of informatics, SOFSEM 1999

作者： Schröder, Heiko Sýkora, Ondrej Vrfo, Imrich School of Applied Science Nanyang Technological University Nanyang Avenue 639798 Singapore Department of Computer Science Loughborough University Loughborough LeicestershireLE11 3TU United Kingdom Department of Informatics Institute for Mathematics Slovak Academy of Sciences P. O. Box 56 Bratislava840 00 Slovakia

ISBN: (纸本)354066694X

the cutwidth problem is to find a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. the main question is to compare both measures cw and ccw for specific networks, whether adding an edge to a path and forming a cycle reduces the cutwidth essentially. We prove exact values for the cyclic cutwidths of the 2-dimensional ordinary and cylindrical meshes Pm× Pnand Pm× Cn, respectively. Especially, if m > n + 3, then ccw(Pm× Pn) = cw(Pm× Pn) = n + 1 and if n is even then ccw(Pn× Pn) = n - 1 and cw(pn× Pn) = n + 1 and if m≥ 2,n≥ 3, then ccw(Pm× Cn) = min{m + 1,n + 2}. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

What Appears Suboptimal May Surprise You: A Fixed-Rate Scheduling Policy for Geo-Distributed CoFlows 29

What Appears Suboptimal May Surprise You: A Fixed-Rate Sched...

引用

29th IEEE International conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Haoyu Ding, Feiyan Wang, Yao Xiang, Qiao Shu, Jiwu Du, Haizhou Kong, Linghe Liu, Xue Xiamen University School of Informatics Xiamen China University of Electric Power of Shanghai School of Computer Science and Technology Shanghai China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China McGill University School of Computer Science Montreal Canada

ISBN: (纸本)9798350330717

All existing coflow scheduling algorithms compute dynamic-rate schedules that change the rates of flows during transmission. In this paper, we make a crucial finding: although dynamically adjusting the rates of flows could lead to a better coflow completion time (CCT) in theory, it would introduce additional pressures on the congestion control mechanism in the underlying network, which result in poor CCT in practice. this difference between theoretical CCT and practical CCT is further exacerbated in wide-area networks, where the topology does not provide any bisection guarantee as data center networks do. To this end, we designed a fixed-rate coflow scheduling policy called FSCO. Although in theory, the best fixed-rate schedule is usually suboptimal, it keeps the in-flight traffic relatively steady, reducing the risk of triggering congestion control. the core of FSCO is an efficient scheduling algorithm based on the classic network utilization maximization (NUM) framework. We implement a prototype of FSCO and evaluate its performance extensively using real-world topologies and coflow traces. Experimental results show that the total CCT reduces up to 30% compared to baselines while yielding up to 12× speedups compared to the solver. © 2023 IEEE.

关键词： Coflow Scheduling Dual decomposition Network Utility Maximization

来源：评论

学校读者我要写书评

暂无评论

Commissioning Random Matrix theory and Synthetic Minority Oversampling Technique for Power System Faults Detection and Classification 29th

Commissioning Random Matrix Theory and Synthetic Minority Ov...

引用

29th International conference on Neural Information Processing

作者： Sinha, Ayush Dwivedi, Shubham Shukla, Sandeep Kumar Vyas, O. P. Indian Inst Informat Technol Allahabad Prayagraj India Univ Hildesheim Hildesheim Germany Indian Inst Technol Kanpur Kanpur Uttar Pradesh India

ISBN: (纸本)9789819916474;9789819916481

the fast paced innovation in communication and computation capabilities has laid the foundation of sophisticated transformation from legacy power systems to smart grid (SG) infrastructure. So, Providing the effective protection to the distribution lines against the power system faults is crucial for smart grid stability, however it totally depends upon the accurate detection and classification of line fault category. In recent years, Data driven perspective evolved on machine learning classification models are in practice for cyber attack detection. though the classification accuracy suffers since contingency or anomalous data transcends rarely than normal data in the power flow analysis. this paper presents a complete approach starting from the contingency data generation using Random Matrix theory (RMT) and Synthetic Minority Oversampling Technique (SMOTE) and ending with the power fault detection and classification. the proposed method uses power flow analysis of the current signals and applied Objective cost sensitive support vector machine (OCSSVM) for the detection and applies decision tree for the correct faults classification in the smart grid infrastructure. Faults investigated in the paper include line to ground (LG) fault, double line (LL) fault, three phase fault with ground (LLLG) and double line to ground (LLG) fault. To support the effectiveness, the proposed method is applied to IEEE-9 and IEEE-14 node test feeder. Finally, we juxtapose the results in terms of accuracy with the state of the art models and established the efficacy of proposed method.

关键词： Decision tree Power system fault Fault Data Line Fault classification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：