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

arXiv 2023年

作者： Nakazono, Sho Uchiyama, Hiroyuki Fujiwara, Yasuhiro Kawashima, Hideyuki NTT Computer and Data Science Laboratories Tokyo Japan Recruit Co. Ltd. Tokyo Japan NTT Communication Science Laboratories Kanagawa Japan Faculty of Environment and Information Studies Keio University Kanagawa Japan

With the continuing advances of sensing devices and IoT applications, database systems needs to process data ingestion queries that update the sensor data frequently. To process data ingestion queries with transactional correctness, we propose a novel protocol extension method, scheduling space expander (SSE). The key idea of SSE is that we can safely omit an update if the update becomes outdated and unnecessary. SSE adds another control flow to conventional protocols to test the transactional correctness of an erasing version order, which assumes that a transactions' updates are all outdated and unnecessary. In addition, we present an optimization of SSE called epoch-based SSE (ESSE), which generates, tests, and maintains the erasing version order more efficiently than SSE. Our approach makes the performance of data ingestion queries more efficient. Experimental results demonstrate that our ESSE extensions of Silo and MVTO improve 2.7× and 2.5× performance on the TATP benchmark on a 144-core machine, and the extensions achieved performance comparable to that of the original protocol for the TPC-C benchmark. © 2023, CC BY.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Computing Link-Based Similarity in Real World Networks

Efficient Algorithm for Computing Link-Based Similarity in R...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuanzhe Cai Gao Cong Xu Jia Hongyan Liu Jun He Jiaheng Lu Xiaoyong Du Key Laboratories of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Computer Science University of Aalborg Denmark Department of Management Science and Engineering Tsinghua University China

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.

关键词： computer networks Collaboration data engineering Knowledge engineering computer science Iterative algorithms Filtering data mining Helium computer science education

来源：评论

学校读者我要写书评

暂无评论

Exploring choice overload in related-article recommendations in digital libraries 5

Exploring choice overload in related-article recommendations...

引用

5th Workshop on Bibliometric-Enhanced Information Retrieval, BIR 2017

作者： Beierle, Felix Aizawa, Akiko Beel, Joeran Service-centric Networking Technische Universität Berlin Telekom Innovation Laboratories Berlin Germany Digital Content and Media Sciences Research Division Tokyo Japan Trinity College Dublin School of Computer Science and Statistics Intelligent Systems Discipline Knowledge and Data Engineering Group ADAPT Centre Dublin Ireland

We investigate the problem of choice overload - the difficulty of making a decision when faced with many options - when displaying related-article recommendations in digital libraries. So far, research regarding to how many items should be displayed has mostly been done in the fields of media recommendations and search engines. We analyze the number of recommendations in current digital libraries. When browsing fullscreen with a laptop or desktop PC, all display a fixed number of recommendations. 72% display three, four, or five recommendations, none display more than ten. We provide results from an empirical evaluation conducted with GESIS' digital library Sowiport, with recommendations delivered by recommendations-as-a-service provider Mr. DLib. We use click-through rate as a measure of recommendation effectiveness based on 3.4 million delivered recommendations. Our results show lower click-through rates for higher numbers of recommendations and twice as many clicked recommendations when displaying ten instead of one related-articles. Our results indicate that users might quickly feel overloaded by choice. © 2017, CEUR-WS. All rights reserved.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Quantum Circuit Fragments: Efficient and Verifiable Format for Quantum Circuits

Quantum Circuit Fragments: Efficient and Verifiable Format f...

引用

Quantum Computing and Engineering (QCE), IEEE International Conference on

作者： Rei Tokami Yasunari Suzuki Yuuki Tokunaga Department of Applied Physics Graduate School of Engineering The University of Tokyo Tokyo Japan Computer and Data Science Laboratories Nippon Telegraph and Telephone Tokyo Japan

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

An efficient and intuitive format of quantum programs is an indispensable component to handle large-scale quantum computers. Representing and manipulating a sequence of quantum instructions as a network of quantum gates, i.e., quantum circuits, is one of the most successful approaches. Quantum circuits are intuitive since there are similar representations in classical engineering, such as electric or digital circuits. However, due to their differences from these classical circuits, naively automated manipulation and optimization for quantum circuit networks easily tend to an ill-defined format. To avoid this problem, a flexible and verifiable network format of quantum circuits is strongly demanded. In this extended poster abstract, we propose a representation with these properties, named quantum circuit fragments. In our representation, the connectivity of several types of wires in quantum circuits, qubit, control, and measurement-feedback wiring, are kept as three sets. We also provide a linear time algorithm to validate that our format can be converted to quantum circuits. Using our preliminary software to treat quantum circuit fragments, Q-Divide, we demonstrated that code complexity can be halved in practical cases. Thus, our work improves the efficiency of quantum computer development and motivates further exploration for efficient representation and manipulation of large-scale quantum programs.

关键词： computers Wiring Quantum computing Codes Systematics Wires Logic gates Software Complexity theory Quantum circuit

来源：评论

学校读者我要写书评

暂无评论

Standardization Trends Related to Application- and Service-related Technologies

引用

NTT Technical Review 2024年第1期22卷 43-49页

作者： Sugimoto, Shiori Nagao, Jiro Yasuda, Kan Kikuchi, Ryo Ichikawa, Atsunori NTT Computer and Data Science Laboratories Japan Research and Development Planning Department Research and Development Market Strategy Division NTT Corporation Japan Cryptography Research Group Information Security Technology Project NTT Social Informatics Laboratories Japan NTT Social Informatics Laboratories Japan

This article describes the standardization trends in the International Organization for Standardization/ International Electrotechnical Commission Joint Technical Committee 1 (ISO/IEC JTC 1)/Subcommit-tee 29 (SC 29), and International Telecommunication Union - Telecommunication Standardization Sector (ITU-T) Study Group 16 (SG16) as well as ISO/IEC JTC 1/SC 27 and ITU-T SG17. Both SC 29 and SG16 deal with multimedia coding and transmission and are shaping the future of entertainment and business communication. Both SC 27 and SG17 work on standardization related to information security and communication security and are helping to strengthen the reliability and privacy protection of the rapidly evolving digital society. © 2024 Nippon Telegraph and Telephone Corp.. All rights reserved.

关键词： Standardization

来源：评论

学校读者我要写书评

暂无评论

StyleAdv: Meta Style Adversarial Training for Cross-Domain Few-Shot Learning

arXiv

引用

arXiv 2023年

作者： Fu, Yuqian Xie, Yu Fu, Yanwei Jiang, Yu-Gang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University China Purple Mountain Laboratories Nanjing China School of Data Science Fudan University China

Cross-Domain Few-Shot Learning (CD-FSL) is a recently emerging task that tackles few-shot learning across different domains. It aims at transferring prior knowledge learned on the source dataset to novel target datasets. The CD-FSL task is especially challenged by the huge domain gap between different datasets. Critically, such a domain gap actually comes from the changes of visual styles, and wave-SAN [10] empirically shows that spanning the style distribution of the source data helps alleviate this issue. However, wave-SAN simply swaps styles of two images. Such a vanilla operation makes the generated styles "real" and "easy", which still fall into the original set of the source styles. Thus, inspired by vanilla adversarial learning, a novel model-agnostic meta Style Adversarial training (StyleAdv) method together with a novel style adversarial attack method is proposed for CD-FSL. Particularly, our style attack method synthesizes both "virtual" and "hard" adversarial styles for model training. This is achieved by perturbing the original style with the signed style gradients. By continually attacking styles and forcing the model to recognize these challenging adversarial styles, our model is gradually robust to the visual styles, thus boosting the generalization ability for novel target datasets. Besides the typical CNN-based backbone, we also employ our StyleAdv method on large-scale pretrained vision transformer. Extensive experiments conducted on eight various target datasets show the effectiveness of our method. Whether built upon ResNet or ViT, we achieve the new state of the art for CD-FSL. Code is available at https://***/lovelyqian/StyleAdv-CDFSL. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Local Methods for Estimating SimRank Score

Local Methods for Estimating SimRank Score

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xu Jia Hongyan Liu Li Zou Jun He Xiaoyong Du Yuanzhe Cai Ministry of Education Key Laboratories of Data Engineering and Knowledge Engineering China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China Department of Computer Science University of Texas Arlington TX USA

SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm “Local-SimRank”. The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically.

关键词： computer science Application software Web pages data engineering Knowledge engineering Algorithm design and analysis Large-scale systems computer science education Conference management Knowledge management

来源：评论

学校读者我要写书评

暂无评论

The ANBESS Test Payload

The ANBESS Test Payload

引用

OCEANS

作者： D. Baker R. Canada G. Prine NSTL Engineering Laboratory Computer Science Corporation MS USA National Space Technology Laboratories Data Buoy National Oceanic and Atmospheric Administration MS USA

A low-power (36 Wh/day), microprocessor-controlled weather data telemetry system was developed to test the concept of using U.S. Coast Guard Aids-to-Navigation buoys as platforms for measuring nearshore weather. The μP, interfaced to a hardware arithmetic processor chip, reduces 128 samples of time series data to a short ASCII-coded engineering unit message. The message is transmitted hourly via a GOES satellite link in a format suitable for nearly direct transmission over the National Weather Service computer net. About 100 days of raw and processed data can be stored on a high-density cartridge tape recorder for evaluation of the satellite link, buoy motion effects and μP performance.

关键词： Batteries Ocean temperature Payloads Testing Wind speed Navigation Electronics packaging Surges Voltage Sampling methods

来源：评论

学校读者我要写书评

暂无评论

An Implicit data Structure For The Dictionary Problem That Runs In Polylog Time

An Implicit Data Structure For The Dictionary Problem That R...

引用

Annual IEEE Symposium on Foundations of computer science

作者： J.I. Munro AT and T Bell Laboratories Inc. Murray Hill NJ USA Data Structuring Group Department of Computer Science University of Waterloo Waterloo ONT Canada

We introduce a data structure that requires only one pointer for every k data values and permits the operations search, insert and delete to be performed in 0 (k log n) time. This structure is used to develop another ... 详细信息

关键词： data structures Dictionaries Costs computer science Queueing analysis Counting circuits

来源：评论

学校读者我要写书评

暂无评论

A practical guide to machine learning interatomic potentials – Status and future

arXiv

引用

arXiv 2025年

作者： Jacobs, Ryan Morgan, Dane Attarian, Siamak Meng, Jun Shen, Chen Wu, Zhenghao Xie, Clare Yijia Yang, Julia H. Artrith, Nongnuch Blaiszik, Ben Ceder, Gerbrand Choudhary, Kamal Csanyi, Gabor Cubuk, Ekin Dogus Deng, Bowen Drautz, Ralf Fu, Xiang Godwin, Jonathan Honavar, Vasant Isayev, Olexandr Johansson, Anders Kozinsky, Boris Martiniani, Stefano Ong, Shyue Ping Poltavsky, Igor Schmidt, K.J. Takamoto, So Thompson, Aidan Westermayr, Julia Wood, Brandon M. Department of Materials Science and Engineering University of Wisconsin-Madison MadisonWI55705 United States Harvard University Center for the Environment Harvard University CambridgeMA02138 United States John A. Paulson School of Engineering and Applied Sciences Harvard University CambridgeMA02138 United States Materials Chemistry and Catalysis Debye Institute for Nanomaterials Science Utrecht University Utrecht3584 CG Netherlands Globus University of Chicago ChicagoIL United States Data Science and Learning Division Argonne National Laboratory LemontIL United States Department of Materials Science and Engineering University of California BerkeleyCA94720 United States Materials Sciences Division Lawrence Berkeley National Laboratory CA94720 United States Material Measurement Laboratory National Institute of Standards and Technology GaithersburgMD20899 United States Department of Engineering University of Cambridge CambridgeCB2 1PZ United Kingdom Google DeepMind Mountain ViewCA United States Ruhr-Universität Bochum Bochum44780 Germany Meta United States Orbital Materials London United Kingdom Department of Computer Science and Engineering The Pennsylvania State University University ParkPA United States College of Information Sciences and Technology The Pennsylvania State University University ParkPA United States Artificial Intelligence Research Laboratory The Pennsylvania State University University ParkPA United States Center for Artificial Intelligence Foundations and Scientific Applications The Pennsylvania State University University ParkPA United States Department of Chemistry Mellon College of Science Carnegie Mellon University PittsburghPA15213 United States Computational Biology Department School of Computer Science Carnegie Mellon University PittsburghPA15213 United States Courant Institute of Mathematical Sciences New York University New YorkNY10003 United States Center for Soft Matter Research Department of P

The rapid development and large body of literature on machine learning interatomic potentials (MLIPs) can make it difficult to know how to proceed for researchers who are not experts but wish to use these tools. The spirit of this review is to help such researchers by serving as a practical, accessible guide to the state-of-the-art in MLIPs. This review paper covers a broad range of topics related to MLIPs, including (i) central aspects of how and why MLIPs are enablers of many exciting advancements in molecular modeling, (ii) the main underpinnings of different types of MLIPs, including their basic structure and formalism, (iii) the potentially transformative impact of universal MLIPs for both organic and inorganic systems, including an overview of the most recent advances, capabilities, downsides, and potential applications of this nascent class of MLIPs, (iv) a practical guide for estimating and understanding the execution speed of MLIPs, including guidance for users based on hardware availability, type of MLIP used, and prospective simulation size and time, (v) a manual for what MLIP a user should choose for a given application by considering hardware resources, speed requirements, energy and force accuracy requirements, as well as guidance for choosing pre-trained potentials or fitting a new potential from scratch, (vi) discussion around MLIP infrastructure, including sources of training data, pre-trained potentials, and hardware resources for training, (vii) summary of some key limitations of present MLIPs and current approaches to mitigate such limitations, including methods of including long-range interactions, handling magnetic systems, and treatment of excited states, and finally (viii) we finish with some more speculative thoughts on what the future holds for the development and application of MLIPs over the next 3-10+ years. © 2025, CC BY.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：