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

International Conference on Distributed Computing systems

作者： Kazuya Sakai Min-Te Sun Wei-Shinn Ku Jie Wu Faisal S. Alanazi Dept. of Info. and Commun. Systems Tokyo Metropolitan University Hino Tokyo Japan Department of Computer Science and Information Engineering National Central University Taoyuan 320 Taiwan Department of Computer Science and Software Engineering Auburn University Auburn Alabama Department of Computer and Information Sciences Temple University Philadelphia PA Department of Electrical and Computer Engineering The Ohio State University Columbus Ohio

Delay tolerant network (DTN) routing provides a communication primitive in intermittently disconnected networks, such as battlefield communications and human-contact networks. In these applications, the anonymity preserving mechanism, which hides the identities of communicating parties, plays an important role as a defense against cyber and physical attacks. While anonymous routing protocols for DTNs have been proposed in the past, to the best of our knowledge, there is no work that emphasizes the theoretical aspects. In this paper, we first design an abstract of anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.

关键词： Routing Routing protocols Mathematical model Encryption Simulation

来源：评论

学校读者我要写书评

暂无评论

Mining revision histories to detect cross-language clones without intermediates

Mining revision histories to detect cross-language clones wi...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Xiao Cheng Zhiming Peng Lingxiao Jiang Hao Zhong Haibo Yu Jianjun Zhao Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Information Systems Singapore Management University Singapore School of Software Shanghai Jiao Tong University China Department of Advanced Information Technology Kyushu University Japan

ISBN: (纸本)9781509055715

To attract more users on different platforms, many projects release their versions in multiple programming languages (e.g., Java and C#). They typically have many code snippets that implement similar functionalities, i.e., cross-language clones. Programmers often need to track and modify cross-language clones consistently to maintain similar functionalities across different language implementations. In literature, researchers have proposed approaches to detect cross-language clones, mostly for languages that share a common intermediate language (such as the .NET language family) so that techniques for detecting single-language clones can be applied. As a result, those approaches cannot detect cross-language clones for many projects that are not implemented in a .NET language. To overcome the limitation, in this paper, we propose a novel approach, CLCMiner, that detects cross-language clones automatically without the need of an intermediate language. Our approach mines such clones from revision histories, which reflect how programmers maintain cross-language clones in practice. We have implemented a prototype tool for our approach and conducted an evaluation on five open source projects that have versions in Java and C#. The results show that CLCMiner achieves high accuracy and point to promising future work.

关键词： Cloning Java C# languages History Grammar software

来源：评论

学校读者我要写书评

暂无评论

Overview of KAGRA : Data transfer and management

引用

Progress of Theoretical and Experimental Physics 2023年第10期2023卷

作者： Akutsu, T Ando, M Arai, K Arai, Y Araki, S Araya, A Aritomi, N Asada, H Aso, Y Bae, S Bae, Y Baiotti, L Bajpai, R Barton, M A Cannon, K Cao, Z Capocasa, E Chan, M Chen, C Chen, K Chen, Y Chiang, C-Y Chu, H Chu, Y-K Eguchi, S Enomoto, Y Flaminio, R Fujii, Y Fujikawa, Y Fukunaga, M Fukushima, M Gao, D Ge, G Ha, S Hagiwara, A Haino, S Han, W-B Hasegawa, K Hattori, K Hayakawa, H Hayama, K Himemoto, Y Hiranuma, Y Hirata, N Hirose, E Hong, Z Hsieh, B Huang, G-Z Huang, H-Y Huang, P Huang, Y-C Huang, Y Hui, D C Y Ide, S Ikenoue, B Imam, S Inayoshi, K Inoue, Y Ioka, K Ito, K Itoh, Y Izumi, K Jeon, C Jin, H-B Jung, K Jung, P Kaihotsu, K Kajita, T Kakizaki, M Kamiizumi, M Kanda, N Kang, G Kawaguchi, K Kawai, N Kawasaki, T Kim, C Kim, J Kim, J C Kim, W S Kim, Y-M Kimura, N Kita, N Kitazawa, H Kobayashi, Y Kojima, Y Kokeyama, K Komori, K Kong, A K H Kotake, K Kozakai, C Kozu, R Kumar, R Kume, J Kuo, C Kuo, H-S Kuromiya, Y Kuroyanagi, S Kusayanagi, K Kwak, K Lee, H K Lee, H W Lee, R Leonardi, M Li, K L Lin, L C-C Lin, C-Y Lin, F-K Lin, F-L Lin, H L Liu, G C Luo, L-W Majorana, E Marchio, M Michimura, Y Mio, N Miyakawa, O Miyamoto, A Miyazaki, Y Miyo, K Miyoki, S Mori, Y Morisaki, S Moriwaki, Y Nagano, K Nagano, S Nakamura, K Nakano, H Nakano, M Nakashima, R Nakayama, Y Narikawa, T Naticchioni, L Negishi, R Quynh, L Nguyen Ni, W-T Nishizawa, A Nozaki, S Obuchi, Y Ogaki, W Oh, J J Oh, K Oh, S H Ohashi, M Ohashi, T Ohishi, N Ohkawa, M Ohta, H Okutani, Y Okutomi, K Oohara, K Ooi, C Oshino, S Otabe, S Pan, K Pang, H Parisi, A Park, J Arellano, F E Peña Pinto, I Sago, N Saito, S Saito, Y Sakai, K Sakai, Y Sakuno, Y Sasaki, Y Sato, S Sato, T Sawada, T Sekiguchi, T Sekiguchi, Y Shao, L Shibagaki, S Shimizu, R Shimoda, T Shimode, K Shinkai, H Shishido, T Shoda, A Somiya, K Son, E J Sotani, H Sugimoto, R Suresh, J Suzuki, T Tagoshi, H Takahashi, H Takahashi, R Takamori, A Takano, S Takeda, H Takeda, M Tanaka, H Tanaka, K Tanaka, T Tanioka, S Martin, E N Tapia San Telada, S Tomaru, T Tomigami, Y Tomura, T Travasso, F Trozzo, L Tsang, T Ts Gravitational Wave Science Project National Astronomical Observatory of Japan (NAOJ) 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Department of Physics The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Research Center for the Early Universe (RESCEU) The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Institute for Cosmic Ray Research (ICRR) KAGRA Observatory The University of Tokyo 5-1-5 Kashiwa-no-Ha Kashiwa City Chiba 277-8582 Japan Accelerator Laboratory High Energy Accelerator Research Organization (KEK) 1-1 Oho Tsukuba City Ibaraki 305-0801 Japan Earthquake Research Institute The University of Tokyo 1-1-1 Yayoi Bunkyo-ku Tokyo 113-0032 Japan Department of Mathematics and Physics Hirosaki University 3 Bunkyo-cho Hirosaki City Aomori 036-8561 Japan Kamioka Branch National Astronomical Observatory of Japan (NAOJ) 238 Higashi-Mozumi Kamioka-cho Hida City Gifu 506-1205 Japan The Graduate University for Advanced Studies (SOKENDAI) 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Korea Institute of Science and Technology Information (KISTI) 245 Daehak-ro Yuseong-gu Daejeon 34141 Korea National Institute for Mathematical Sciences 70 Yuseong-daero 1689 Beon-gil Yuseong-gu Daejeon 34047 Korea International College Osaka University 1-1 Machikaneyama-cho Toyonaka City Osaka 560-0043 Japan School of High Energy Accelerator Science The Graduate University for Advanced Studies (SOKENDAI) 1-1 Oho Tsukuba City Ibaraki 305-0801 Japan Department of Astronomy Beijing Normal University No. 19 Xinjiekou Street Beijing 100875 China Department of Applied Physics Fukuoka University 8-19-1 Nanakuma Jonan Fukuoka City Fukuoka 814-0180 Japan Department of Physics Tamkang University No. 151 Yingzhuan Rd. Danshui Dist. New Taipei City 25137 Taiwan Department of Physics and Institute of Astronomy Nation

KAGRA is a newly built gravitational wave observatory, a laser interferometer with a 3 km arm length, located in Kamioka, Gifu prefecture, Japan. In this article, we describe the KAGRA data management system, i.e., recording of data, transfer from the KAGRA experiment site to computing resources, as well as data distribution to tier sites, including international sites in Taiwan and Korea. The amount of KAGRA data exceeded 1.0 PiB and increased by about 1.5 TB per day during operation in 2020. Our system has succeeded in data management, and has achieved performance that can withstand observations after 2023, that is, a transfer rate of 20 MB s-1or more and file storage of sufficient capacity for petabyte class. We also discuss the sharing of data between the global gravitational-wave detector network with other experiments, namely LIGO and Virgo. The latency, which consists of calculation of calibrated strain data and transfer time within the global network, is very important from the view of multi-messenger astronomy using gravitational waves. Real-time calbrated data delivered from the KAGRA detector site and other detectors to our computing system arrive with about 4–15 seconds of latency. These latencies are sufficiently short compared to the time taken for gravitational wave event search computations. We also established a high-latency exchange of offline calibrated data that was aggregated with a better accuracy compared with real-time data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A pattern-matching method for extracting personal information in Farsi content

UPB Scientific Bulletin, Series C: Electrical Engineering an...

引用

UPB Scientific Bulletin, Series C: Electrical engineering and computer Science 2016年第1 1期78 78卷 125-138页

作者： Emami, Hojjat Shirazi, Hossein Abdollahzadeh Barforoush, Ahmad Hourali, Maryam Social Network and Intelligent Systems Laboratory Faculty of Artificial Intelligence Malek-Ashtar University of Technology Tehran Iran Intelligent Systems Laboratory Computer Engineering Department Amir Kabir University of Technology Tehran Iran Department of Information Communication and Security Malek-Ashtar University of Technology Tehran Iran

Personal information extraction as a subtask of entity profiling is the process of identifying and extracting useful and structured information of the focus person named-entity from the content related to it. This is a demanding task, so it is of great importance of how to extract the personal information in a given text. In this paper, we present an approach to extract the relevant information of the focus persons in Farsi content. Our approach contains three steps, pre-processing, attribute extraction and cross-document profile fusion. In pre-processing step, we prepare the input text as system's desired format using some existing text processing tools. In attribute extraction phase, we identify and extract all the related attributes of the target persons in a given text. To fulfill this aim, we use a pattern-matching approach. This method contains a set of keyword-based patterns and manually collected pre-compiled attribute-value candidate lists. In cross-document profile fusion phase, we integrate the distributed information of the focus persons from multiple documents and resolve ambiguity between person names. We evaluate our approach on a sample Farsi textual corpus drawn from news Websites and Wikipedia articles. The experimental results show that our approach is capable to extract personal information, thereby laying the foundation for person named-entity profiling in Farsi.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Social role clustering with topic model

Social role clustering with topic model

引用

IEEE International Conference on Intelligence and Security Informatics, ISI

作者： Jie Bai Linjing Li Daniel Zeng Junjie Lin The State Key Laboratory of Management and Control for Complex Systems Institute of Automation China School of Computer and Control Engineering University of Chinese Academy of Sciences China Department of Management of Information Systems The University of Arizona USA

ISBN: (纸本)9781509038664

In this paper, we propose a new role analyzing paradigm for social networks enlightened by topic modeling, which can be adopted as a primitive building block in various security related tasks, such as hidden community finding, important person recognizing and so on. We first present the social network under analyzing as a heterogeneous network constructed by both the users and the subjects discussed among them. We then view this network in a Bag-of-Users schema, which mimics its classical Bag-of-Words counterpart. In this schema, the subjects discussed are treated as “documents” while the users are treated as “words” which construct the “documents”. Based on this novel presentation, we finally apply topic modeling technology to perform the social role clustering. Experiments on a practical security-related social network dataset prove the effectiveness of our approach.

关键词： Social network services Heterogeneous networks Analytical models Computational modeling Finance Security Data models

来源：评论

学校读者我要写书评

暂无评论

A Competitive Intelligence Solution to Predict Competitor Action Using K-modes Algorithm and Rough Set Theory

引用

Procedia computer Science 2016年 96卷 597-606页

作者： Dhekra Ben Sassi Anissa Frini Wahiba Ben Abdessalem Karaa Naoufel Kraiem Department of Information Systems College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al Kharej KSA RIADI laboratory National School of Computer Science La Manouba University Tunisia Department of Management Science University of Quebec at Rimouski Levis Canada

We will focus in this paper on the competitive intelligence problem which deals with the competitive environment of a company. Our purpose is to predict and anticipate the action of its competitor. We are talking here about a context of reasoning under uncertainty. All existed works define the concept of competitive intelligence and propose a scheme for the competitive intelligence process and its stages, but there is no work, at the best of our knowledge, that touched the practical aspect of the field or developed a complete competitive intelligence solution that can be delivered to the decision maker, which makes the originality of our work. To motivate the research, we will address a competitive practical case in the field of telecommunications. In this paper we propose a competitive intelligence solution composed by two steps: actions association using k-modes algorithm which has the capability to deal with nominal data, and actions generation using rough set theory which has the capability to deal with inexact data and drive rules from it.

关键词： Competitive intelligence intelligente method for prediction reasonning under uncertainty rough set theory rules generation and action prediction

来源：评论

学校读者我要写书评

暂无评论

Attitude synchronization of multiple rigid bodies in SE(3) over proximity networks

Attitude synchronization of multiple rigid bodies in SE(3) o...

引用

第35届中国控制会议

作者： Juan Deng Zhixin Liu Lin Wang John S.Baras Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceCAS Department of Automation Shanghai Jiao Tong Universityand the Key Laboratory of System Control and Information ProcessingMinistry of Education Department of Electrical and Computer Engineering and the Institute for Systems Research University of MarylandCollege Park

ISBN: (纸本)9781509009107

This paper investigates the attitude synchronization of a group of moving rigid bodies whose states including positions and rotation matrices evolve in the Lie group SE(3).The commonly used circular neighborhood is adopted,and the neighbor graphs are described by proximity *** order to avoid introducing discussions on the abrupt changes of neighbor graphs,a dwell time is *** distributed sampled-data control law for the angular velocity is *** the assumptions on the initial states,we provide sufficient conditions for the attitude synchronization of multiple rigid body *** with the existing results,our condition depends only on the neighborhood radius,the moving velocity and the dwell time.

关键词： rigid body SE(3) attitude synchronization sampled-data control proximity network

来源：评论

学校读者我要写书评

暂无评论

Towards Dual-functional Radar-Communication systems: Optimal Waveform Design

arXiv

引用

arXiv 2017年

作者： Student, Fan Liu Zhou, Longfei Masouros, Christos Li, Ang Luo, Wu Petropulu, Athina IEEE School of Information and Electronics Beijing Institute of Technology Beijing100081 China Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom State Key Laboratory of Advanced Optical Communication Systems and Networks Peking University Beijing100871 China Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom Department of Electrical and Computer Engineering Rutgers State University of New Jersey 94 Brett Road PiscatawayNJ08854 United States

We focus on a dual-functional multi-input-multioutput (MIMO) radar-communication (RadCom) system, where a single transmitter communicates with downlink cellular users and detects radar targets simultaneously. Several design criteria are considered for minimizing the downlink multi-user interference. First, we consider both the omnidirectional and directional beampattern design problems, where the closed-form globally optimal solutions are obtained. Based on these waveforms, we further consider a weighted optimization to enable a flexible trade-off between radar and communications performance and introduce a low-complexity algorithm. The computational costs of the above three designs are shown to be similar to the conventional zero-forcing (ZF) precoding. Moreover, to address the more practical constant modulus waveform design problem, we propose a branch-and-bound algorithm that obtains a globally optimal solution and derive its worst-case complexity as a function of the maximum iteration number. Finally, we assess the effectiveness of the proposed waveform design approaches by numerical results. Copyright © 2017, The Authors. All rights reserved.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

A packet loss tolerated method for data integrity protection in wireless sensor networks

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous engineering 2016年第7期11卷 1-12页

作者： Wang, Baowei Yan, Jingzhou Li, Tao Sun, Xingming Ma, Li School of Computer and Software Nanjing University of Information Science & Technology Nanjing210044 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science & Technology Nanjing210044 China Key Laboratory of Meteorological Disaster of Ministry of Education Nanjing University of Information Science & Technology Nanjing210044 China

Among existing watermarking methods for data integrity protection in wireless sensor networks (WSNs), the problem of packet loss has not been considered. Most of methods treat packet loss as anomaly attacks, hardly being used in real network. The paper proposes a packet loss tolerated method for data integrity protection in wireless sensor networks based on double-level watermarking and threshold control. Sensory data collected by nodes generate digital watermarking for integrity detection. Watermarking will be stored in sensory data. The network will have watermarking verification and packet loss rate analysis in the sink to ensure data integrity. Through the experiment in real sensor network, this method can effectively protect data integrity with low power. © 2016 SERSC.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An efficient intra block size decision for H.264/AVC encoding optimization

An efficient intra block size decision for H.264/AVC encodin...

引用

ACS/IEEE International Conference on computer systems and Applications

作者： Abderrahmane Elyousfi Hamza Hamout Asma El Hachimi Department of Computer Science National Engineering School of Applied Sciences Ibn-Zohr University Agadir-Morocco Laboratory of Computer Systems and Vision Faculty of Sciences Ibn-Zohr University Agadir-Morocco Laboratory of Information Modeling and Communication Systems Faculty of Sciences Ibn-Tofail University Kenitra-Morocco

The video coding standard, H.264/MPEG-4 AVC, uses variable block sizes in intra coding. This feature has achieved significant coding gain compared to coding a macroblock (MB) using fixed block size. However, this feature results in extremely high computational complexity when brute force rate distortion optimization (RDO) algorithm is used. In this paper, we propose an Efficient Intra Block Size Decision for H.264/AVC Encoding Optimization. It makes use of the spatial homogeneity characteristics of the macroblock. Specifically, spatial homogeneity of a MB is decided based on the amplitude value of the proposed MB vector. Based on the homogeneity of the macroblock, only a small number of intra prediction modes are selected in the RDO process. Different video sequences are used to test the performance of proposed method. Experimental results reveal the significant computational savings achieved with slight Peak Signal-to-Noise Ratio (PSNR) degradation and bit-rate increase.

关键词： Encoding Video coding Prediction algorithms Complexity theory Signal processing algorithms Standards software algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：