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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

282,612 篇 会议
17,616 册 图书

馆藏范围

299,997 篇 电子文献
263 种 纸本馆藏

日期分布

学科分类号

281,825 篇 工学
- 277,760 篇 计算机科学与技术...
- 67,756 篇 软件工程
- 14,904 篇 信息与通信工程
- 8,424 篇 电气工程
- 8,036 篇 控制科学与工程
- 4,694 篇 生物医学工程（可授...
- 985 篇 生物工程
- 839 篇 光学工程
- 610 篇 机械工程
- 572 篇 仪器科学与技术
- 494 篇 测绘科学与技术
- 494 篇 交通运输工程
35,922 篇 理学
- 28,741 篇 数学
- 5,545 篇 生物学
- 1,703 篇 物理学
- 1,138 篇 统计学（可授理学、...
- 524 篇 系统科学
- 486 篇 化学
30,405 篇 医学
- 22,130 篇 临床医学
- 9,245 篇 特种医学
- 3,041 篇 基础医学(可授医学...
- 1,217 篇 医学技术（可授医学...
10,802 篇 管理学
- 6,500 篇 管理科学与工程(可...
- 3,343 篇 图书情报与档案管...
- 1,777 篇 工商管理
- 743 篇 公共管理
4,316 篇 教育学
- 4,043 篇 教育学
2,352 篇 法学
- 2,009 篇 社会学
1,680 篇 文学
- 1,179 篇 新闻传播学
- 526 篇 外国语言文学
467 篇 艺术学
372 篇 经济学
149 篇 农学
98 篇 历史学
65 篇 哲学
24 篇 军事学

主题

10,824 篇 artificial intel...
4,630 篇 computer communi...
3,945 篇 deep learning
3,861 篇 information syst...
3,741 篇 computers
3,636 篇 software enginee...
3,329 篇 machine learning
3,242 篇 algorithm analys...
3,224 篇 semantics
2,287 篇 information stor...
2,189 篇 pattern recognit...
1,834 篇 neural networks
1,820 篇 user interfaces ...
1,820 篇 image processing...
1,803 篇 database managem...
1,791 篇 logics and meani...
1,777 篇 mathematical log...
1,772 篇 cryptography
1,755 篇 software enginee...
1,706 篇 data mining and ...

机构

647 篇 univ chinese aca...
539 篇 carnegie mellon ...
403 篇 univ chinese aca...
358 篇 univ calif berke...
353 篇 shanghai jiao to...
318 篇 stanford univ st...
307 篇 chinese acad sci...
288 篇 shanghai jiao to...
285 篇 inria
244 篇 tech univ munich...
241 篇 tech univ darmst...
225 篇 swiss fed inst t...
212 篇 univ waterloo wa...
207 篇 nanjing univ sta...
203 篇 tsinghua univ pe...
199 篇 ist austria klos...
198 篇 natl univ singap...
186 篇 mit cambridge ma...
185 篇 univ maryland co...
183 篇 chinese acad sci...

作者

212 篇 shen dinggang
104 篇 navab nassir
98 篇 zhang lei
94 篇 wang wei
92 篇 susilo willy
85 篇 liu yang
83 篇 rueckert daniel
81 篇 wang lei
81 篇 wang xin
76 篇 auer soeren
66 篇 golland polina
64 篇 weske mathias
61 篇 zhang yong
54 篇 liu wei
52 篇 zhang li
51 篇 zhou jie
49 篇 jiang xiaoyi
47 篇 zhang tao
47 篇 zhang yu
47 篇 ishai yuval

语言

298,286 篇 英文
1,937 篇 中文
1 篇 加泰罗尼亚文
1 篇 法文

检索条件"丛书名=Lecture Notes in Computer Science"

共 300228 条记录，以下是171-180 订阅

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

详细简洁

排序：

Streams of Consciousness in Interactive Digital Narrative Research Design 17th

Streams of Consciousness in Interactive Digital Narrative Re...

引用

17th International Conference on Interactive Digital Storytelling

作者： Daiute, Colette Wright, Jack Murray, John T. CUNY Grad Ctr New York NY 10036 USA Seton Educ Partners New York NY USA Univ Cent Florida Orlando FL 32816 USA

ISBN: (纸本)9783031784521;9783031784538

Interactive Digital Narrative researchers have used a variety of methodologies to assess players' experiences with IDN processes, systems and artifacts. Interviewing and surveying have been the most prevalent methodology and, less frequently, recording in-process activities. Given the importance of interactivity and immersion, this paper considers how IDN research methods reveal player experience, player engagement, and/or player analysis. Drawing on related principles of IDN theory, sociocultural psychology and neuropsychological research, we present analyses of two phases of research in a real-time online IDN design learning workshop to compare contributions of in-process measures and interview measures of participant engagement. Analyses of data from each method reveal very different participant orientations in-process during an IDN design learning workshop and with an interview after the workshop. The analysis shows that in-process data align with neuropsychological definitions of flow: presence, relation, emotion, and conversational interaction. In contrast, the interview data align with definitions of metacognition: distance (past tense, individual focus), evaluation, analysis, and reflexive cognition. Based on those findings, we discuss howresearch methods affect definitions of fundamental concepts in IDNs, including interactivity and immersion. Implications include the need to clarify methodological labels and align chosen measures precisely with research questions and focal concepts, like interactivity. We also discuss how the complexity of IDN and the technologies embedded in digital systems allow integrating in-process and interview research protocols more centrally into IDN theory.

关键词： Interactive Digital Narrative Research IDN Research Design Research Methods In-process methods Interviews Intersubjectivity

来源：评论

学校读者我要写书评

暂无评论

Experience, Don't Tell! Integration of IDN into Journalistic Narratives 17th

Experience, Don't Tell! Integration of IDN into Journalistic...

引用

17th International Conference on Interactive Digital Storytelling

作者： Silva, Claudia Zamora-Medina, Rocio Suminas, Andrius Univ Lisbon ITI LARSyS IST Lisbon Portugal Univ Murcia La Merced Spain Vilnius Univ Vilnius Lithuania

ISBN: (纸本)9783031784521;9783031784538

This paper presents a qualitative case study of Interactive Digital Narratives (IDNs) in journalism, focusing on three examples produced by news media outlets. The first is the BBC's Syrian Journey, which depicts the pathways and struggles of Syrian refugees migrating to Europe. The second is the Guardian's Refugee Challenge, an interactive experience that immerses users in the difficult choices Syrian refugees might face. The third is ProPublica's Waiting Game, which illustrates the long and uncertain wait for asylum seekers in the U.S. These works were selected to explore the complex societal issue of refugees, reflecting current scholarship that identifies IDN as a powerful tool for addressing such complexity. This paper seeks to contribute to the understanding of how IDN can be applied in journalistic narratives, how journalistic IDN can be defined, and how the selected cases fit within existing IDN literature.

关键词： journalistic IDN innovation journalism narrative digital immersion agency transformation

来源：评论

学校读者我要写书评

暂无评论

Subverting Cryptographic Hardware Used in Blockchain Consensus 28th

Subverting Cryptographic Hardware Used in Blockchain Consens...

引用

28th International Conference on Financial Cryptography and Data Security

作者： Tiwari, Pratyush Ranjan Green, Matthew Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)9783031786754;9783031786761

In this work, we study and formalize security notions for algorithm substitution attacks (ASAs) on cryptographic puzzles (A full version of this work is available at https://***/2022/477). Puzzles are difficult problems that require an investment of computation, memory, or some other related resource. They are heavily used as a building block for the consensus networks used by cryptocurrencies. These include primitives such as proof-of-work, proof-of-space, and verifiable delay functions (VDFs). Due to economies of scale, these networks increasingly rely on a small number of companies to construct opaque hardware or software (e.g., GPU or FPGA images): this dependency raises concerns about cryptographic subversion. We first explore the threat model for these systems and then propose concrete attacks that (1) selectively reduce a victim's solving capability (e.g., hashrate) and (2) exfiltrate puzzle solutions to an attacker. Our findings reveal that these devices could be subverted today, and detecting some attack variants is extremely hard and costly. We then suggest defenses, several of which can be applied to existing cryptocurrency hardware with minimal changes. We also discover that mining devices for many major proof-of-work cryptocurrencies already demonstrate errors exactly how a potentially subverted device would. Given that these attacks are relevant to all proof-of-work cryptocurrencies that have a combined market capitalization of around a few hundred billion dollars (2023), we recommend that all vulnerable mining protocols consider making the suggested adaptations today.

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

Browsing Amazon's Book Bubbles 16th

Browsing Amazon's Book Bubbles

引用

16th International Conference on Social Networks Analysis and Mining

作者： Bouchaud, Paul Ctr Social Anal & Math EHESS Paris France Complex Syst Inst Paris Ile France CNRS Paris France

ISBN: (纸本)9783031785375;9783031785382

This study investigates Amazon's book recommendation system, uncovering cohesive communities of semantically similar books. The confinement within communities is extremely high, a user following Amazon's recommendations needs tens of successive clicks to navigate away. We identify a large community of recommended books endorsing climate denialism, COVID-19 conspiracy theories, and advocating conservative views on social and gender issues. Performing a collaborative filtering analysis, relying on Amazon users reviews, reveals that books reviewed by the same users tend to be co-recommended by Amazon. This study not only contributes to addressing a gap in the literature by examining Amazon's recommender systems, but also highlights that even non-personalized recommender systems may pose systemic risks by suggesting content with foreseeable negative effects on public health and civic discourse.

关键词： Amazon Recommender System Filter Bubble Collaborative Filtering

来源：评论

学校读者我要写书评

暂无评论

Mitigating the Spread of COVID-19 Misinformation Using Agent-Based Modeling and Delays in Information Diffusion 16th

Mitigating the Spread of COVID-19 Misinformation Using Agent...

引用

16th International Conference on Social Networks Analysis and Mining

作者： Alassad, Mustafa Agarwal, Nitin Univ Arkansas Little Rock COSMOS Res Ctr Little Rock AR 72204 USA

ISBN: (纸本)9783031785375;9783031785382

The rapid spread of COVID-19 misinformation on social media poses challenges in detection and analysis. There has been extensive discussion about the roles of online and offline campaigns in spreading misinformation. Recognizing the analytical gap between online and offline behaviors during the COVID-19 pandemic, we propose a systematic and multidisciplinary approach. This approach utilizes agent-based modeling to interpret the spread of misinformation and the actions of users/communities on social media networks. Our model was tested on a Twitter network concerning a demonstration against COVID-19 lockdowns in Michigan in May 2020. We implemented the one-median problem to categorize and simplify the Twitter network, measured the response time to the spread of misinformation, employed a cybernetic organizational method to manage the process of mitigating misinformation spread in the network, and optimized the allocation of agents to reduce the response time to misinformation spread. The study demonstrates the effectiveness of our proposed approach in delaying information diffusion, thereby mitigating the spread of COVID-19 misinformation on social media.

关键词： Systems Thinking Organizational Cybernetics Stochastic One-median Problem Misinformation COVID-19 Information Diffusion Delay

来源：评论

学校读者我要写书评

暂无评论

Efficient Weighting Schemes for Auditing Instant-Runoff Voting Elections 9th

Efficient Weighting Schemes for Auditing Instant-Runoff Voti...

引用

28th International Conference on Financial Cryptography and Data Security

作者： Ek, Alexander Stark, Philip B. Stuckey, Peter J. Vukcevic, Damjan Monash Univ Dept Econometr & Business Stat Clayton Vic Australia Univ Calif Berkeley Dept Stat Berkeley CA USA Monash Univ Dept Data Sci & AI Clayton Vic Australia

ISBN: (纸本)9783031692307;9783031692314

Various risk-limiting audit (RLA) methods have been developed for instant-runoff voting (IRV) elections. A recent method, AWAIRE, is the first efficient approach that can take advantage of, but does not require, cast vote records (CVRs). AWAIRE involves adaptively weighted averages of test statistics, essentially "learning" an effective set of hypotheses to test. However, the initial paper on AWAIRE only examined a few weighting schemes and parameter settings. We explore schemes and settings more extensively, to identify and recommend efficient choices for practice. We focus on the case where CVRs are not available, assessing performance using simulations based on real election data. The most effective schemes are often those that place most or all of the weight on the apparent "best" hypotheses based on already seen data. Conversely, the optimal tuning parameters tended to vary based on the election margin. Nonetheless, we quantify the performance trade-offs for different choices across varying election margins, aiding in selecting the most desirable trade-off if a default option is needed. A limitation of the current AWAIRE implementation is its restriction to a small number of candidates-up to six in previous implementations. One path to a more computationally efficient implementation would be to use lazy evaluation and avoid considering all possible hypotheses. Our findings suggest that such an approach could be done without substantially compromising statistical performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable High-Performance Community Detection Using Label Propagation in Massive Networks 16th

Scalable High-Performance Community Detection Using Label Pr...

引用

16th International Conference on Social Networks Analysis and Mining

作者： Boddu, Sharon Khan, Maleq Texas A&M Univ Dept Elect Engn & Comp Sci Kingsville TX 78363 USA

ISBN: (纸本)9783031785405;9783031785412

Community detection is the problem of finding naturally forming clusters in networks. It is an important problem in mining and analyzing social and other complex networks. Community detection can be used to analyze complex systems in the real world and has applications in many areas, including network science, data mining, and computational biology. Label propagation is a community detection method that is simpler and faster than other methods such as Louvain, InfoMap, and spectral-based approaches. Some real-world networks can be very large and have billions of nodes and edges. Sequential algorithms might not be suitable for dealing with such large networks. This paper presents distributed-memory and hybrid parallel community detection algorithms based on the label propagation method. We incorporated novel optimizations and communication schemes, leading to very efficient and scalable algorithms. We also discuss various load-balancing schemes and present their comparative performances. These algorithms have been implemented and evaluated using large high-performance computing systems. Our hybrid algorithm is scalable to thousands of processors and has the capability to process massive networks. This algorithm was able to detect communities in the Metaclust50 network, a massive network with 282 million nodes and 42 billion edges, in 654 s using 4096 processors.

关键词： Community detection parallel graph algorithms network analysis graph mining

来源：评论

学校读者我要写书评

暂无评论

Threshold Receipt-Free Single-Pass eVoting 9th

Threshold Receipt-Free Single-Pass eVoting

引用

9th International Joint Conference on Electronic Voting (E-Vote-ID)

作者： Thi Van Thao Doan Pereira, Olivier Peters, Thomas Catholic Univ Louvain ICTEAM Crypto Grp B-1348 Louvain La Neuve Belgium Microsoft Res Redmond WA USA

ISBN: (纸本)9783031722431;9783031722448

In 2001, Hirt proposed a receipt-free voting scheme, which prevents malicious voters from proving to anybody how they voted, under the assumption of the availability of a helping server that is trusted for receipt-freeness, and only for that property. This appealing design led to a number of subsequent works that made this approach non-interactive and more efficient. Still, in all of these works, receipt-freeness depends on the honesty of one single server. In order to remove this single point of failure, we design a new model in which multiple helping servers are available and propose a new security definition called threshold receipt-freeness. Our definition requires that receipt-freeness should be guaranteed even if some of the helping servers happen to be fully malicious and ensures that voters can express their votes even if the corrupted servers choose the content of their local view of the ballots. Eventually, we propose a generic construction of a single-pass verifiable voting system achieving threshold receipt freenes with a mixnet-based tallying process. Our ballot submission process relies on the recently designed traceable receipt-free encryption primitive.

关键词： Voting machines

来源：评论

学校读者我要写书评

暂无评论

Transaction Fee Mechanism Design with Active Block Producers 9th

Transaction Fee Mechanism Design with Active Block Producers

引用

28th International Conference on Financial Cryptography and Data Security

作者： Bahrani, Maryam Garimidi, Pranav Roughgarden, Tim A16z Crypto Menlo Pk CA 94025 USA Columbia Univ New York NY USA

ISBN: (纸本)9783031692307;9783031692314

The incentive-compatibility properties of blockchain transaction fee mechanisms have been investigated with passive block producers that are motivated purely by the net rewards earned at the consensus layer. This work introduces a model of active block producers that have their own private valuations for blocks (representing, for example, additional value derived from the application layer). The block producer surplus in our model can be interpreted as one of the more common colloquial meanings of the term "MEV." The main results of this work show that transaction fee mechanism design is fundamentally more difficult with active block producers than with passive ones: with active block producers, no non-trivial or approximately welfare-maximizing transaction fee mechanism can be incentive-compatible for both users and block producers. These results can be interpreted as a mathematical justification for the current interest in augmenting transaction fee mechanisms with additional components such as order flow auctions, block producer competition, trusted hardware, or cryptographic techniques.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

SAVER: SNARK-Compatible Verifiable Encryption 28th

SAVER: SNARK-Compatible Verifiable Encryption

引用

28th International Conference on Financial Cryptography and Data Security

作者： Lee, Jiwon Choi, Jaekyoung Kim, Jihye Oh, Hyunok Samsung Res Seoul South Korea Zkrypto Inc Seoul South Korea Kookmin Univ Seoul South Korea Hanyang Univ Seoul South Korea

ISBN: (纸本)9783031786785;9783031786792

In applications involving zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARK), there often exists a requirement for the proof system to be combined with encryption. As a typical example, a user may want to encrypt his identity, while proving that his identity satisfies a given authorized function (e.g. credit checks). However, depending on the functionalities and message types, including encryption constraints inside the SNARK input may lead to impractically large proving time and CRS sizes. In this paper, we propose a SNARK-compatible verifiable encryption or in short SAVER, which is a novel encrypt-and-prove approach to modularize the encryption apart from SNARK circuits. The SAVER holds many useful properties. It is SNARK-compatible: the encryption scheme is combined with an existing SNARK, in a way that the encryptor can prove pre-defined properties while encrypting the message apart from SNARKs. It is additively-homomorphic: the ciphertext holds a homomorphic property by following an ElGamal-like design. It is a verifiable encryption: one can verify arbitrary properties of encrypted messages by using the combined SNARK. It provides a verifiable decryption: the public can verify that the plaintext claimed by decryptor is equal to the original decryption of ciphertext. It also provides rerandomization: the proof and the ciphertext can be rerandomized as independent objects so that even the encryptor (or prover) herself cannot identify the origin.

关键词： zk-SNARK verifiable encryption encrypt-and-prove

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：