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

Knowledge graph embedding translation based on constraints

Journal of Information Hiding and Multimedia Signal Processing 2017年第5期8卷 1119-1131页

作者： Wu, Yunbing Pan, Jengshyang Lu, Ping Lin, Kaibiao Yu, Xiaoyan College of Mathematics and Computer Science Fuzhou University No.2. Xueyuan Road University Town Minhou Fuzhou CityFujian Province350116 China Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology No.3. Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China Department of Business Xiamen University of Technology No.600 Ligong Road Jimei District XiamenFujian Province361024 China School of Computer and Information Engineering Xiamen University of Technology No.600 Ligong Road Jimei District XiamenFujian Province361024 China

Knowledge graph reasoning is discovering new entity relations by computing and inference from existing relations. However, most reasoning models of translation embedding-based knowledge graphs have not considered the semantic-type constraints of relations in the construction of corrupted triplets. Hence, the constructed corrupted triplets may not conform to the actual semantic information and may, thus, significantly affect the prediction accuracy of the model. Therefore, we propose a constraint-based embedding model in this paper. First, the model establishes the head and tail entity set for each relationship. Then, it ensures that both the replacing head and tail entities in the corrupted triplet belong to the respective entity set so that the corrupted triplets that do not conform to the responding semantic relations are excluded. To evaluate the proposed model, we conduct link prediction and triple classification on WordNet and Freebase databases. The experimental results show that our method remarkably improves the performance compared to several state-of-the-art baselines. © 2017, Ubiquitous International. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Utilizing Cat Swarm Optimization in Allocating the Sink Node in the Wireless Sensor Network Environment 3

Utilizing Cat Swarm Optimization in Allocating the Sink Node...

引用

3rd International Conference on Computing Measurement Control and Sensor Network, CMCSN 2016

作者： Tsai, Pei-Wei Kong, Lingping Vaclav, Snasel Pan, Jeng-Shyang Istanda, Vaci Hu, Zhi-Yong College of Information Science and Engineering Fujian University of Technology Fuzhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China Innovative Information Industry Research Center Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Department of Computer Science VSB Technical University of Ostrava Ostrava Czech Republic Council of Indigenous Peoples Executive Yuan New Taipei City Taiwan

ISBN: (纸本)9781509010936

A general wireless sensor network (WSN) is a system composed of a large number of sensor nodes. In the WSN system, all sensor nodes are responsible for sensing the interested events and transmitting the related information back to the sink node. The sink node acts like the brain of the whole WSN system for processing the collected data and giving control commands. The position of the sink node directly affects the data transmission efficiency and the distance from the terminal sensor node to the sink node. Thus, choosing the correct place to place the sink node in the whole network is a delicate work. In this paper, we propose a sink node placement method by proposing a newly designed object function and utilizing Cat Swarm Optimization (CSO) to find out the near best location for placing the sink node. The simulation results indicate that our proposed method presents good performance compared with the conventional Particle Swarm Optimization (PSO) algorithm in reducing the overall energy consumption and prolongs the lifetime of network in an efficient way. © 2016 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A Competitive QUasi-Affine TRansformation Evolutionary (C-QUATRE) Algorithm for Global Optimization

A Competitive QUasi-Affine TRansformation Evolutionary (C-QU...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Zhenyu Meng Jeng-Shyang Pan Department of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen China 518055 Department of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen China 518055 Fujian Provincial Key Laboratory of Data Mining and Applications Fujian University of Technology Fuzhou China 350000

ISBN: (纸本)9781509018987

In this paper, we proposed a Competitive QUasi-Affine TRansformation Evolutionary (C-QUATRE) algorithm. This algorithm is an advancement of a preciously proposed QUATRE algorithm. The QUATRE algorithm is arguably a very powerful stochastic optimization algorithm, and it will appear in CEC2016 conference proceedings with the paper title "QUasi-Affine TRansformation Evolutionary (QUATRE) Algorithm: A Parameter-reduced Differential Evolution Algorithm for Optimization Problem". It conquers some weaknesses of Differential Evolution (DE) algorithm and it has excellent performance even on multi-modal optimization problem. Here in the paper, we advance a C-QUATRE algorithm which uses a pairwise competition mechanism to enhance the performance of the former proposed QUATRE algorithm. The C-QUATRE algorithm is verified both on CEC2013 test suite for realparameter optimization and BBOB2009 framework for blackbox optimization, and experiment results show that the pairwise competition mechanism is very useful for the enhancement of the QUATRE performance over all these benchmarks.

关键词： mechanism enhancement advancement Global optimization algorithms Evolutionary Refractive surgery enhancement BENCHMARKS Optimization algorithms paper Pairwise

来源：评论

学校读者我要写书评

暂无评论

A DECAM SEARCH FOR EXPLOSIVE OPTICAL TRANSIENTS ASSOCIATED WITH ICECUBE NEUTRINOS

arXiv

引用

arXiv 2019年

作者： Morgan, Robert Bechtol, Keith Kessler, R. Sako, M. Herner, K. Doctor, Z. Scolnic, D. Sevilla-Noarbe, I. Franckowiak, A. Neilson, K.N. Kowalski, M. Palmese, A. Swann, E. Thomas, B.P. Vivas, A.K. Drlica-Wagner, A. Garcia, A. Brout, D. Paz-Chinchón, F. Neilsen, E. Diehl, H.T. Soares-Santos, M. Abbott, T.M.C. Avila, S. Bertin, E. Brooks, D. Buckley-Geer, E. Carnero Rosell, A. Carrasco Kind, M. Carretero, J. Cawthon, R. Costanzi, M. De Vicente, J. Desai, S. Doel, P. Flaugher, B. Fosalba, P. Frieman, J. García-Bellido, J. Gaztanaga, E. Gerdes, D.W. Gruen, D. Gruendl, R.A. Gschwend, J. Gutierrez, G. Hollowood, D.L. Honscheid, K. James, D.J. Kuropatkin, N. Lima, M. Maia, M.A.G. Marshall, J.L. Menanteau, F. Miller, C.J. Miquel, R. Plazas, A.A. Sanchez, E. Scarpine, V. Schubnell, M. Serrano, S. Smith, M. Sobreira, F. Suchyta, E. Swanson, M.E.C. Tarle, G. Vikram, V. Walker, A.R. Weller, J. Physics Department University of Wisconsin-Madison 1150 University Avenue MadisonWI53706 United States Large Synoptic Survey Telescope Corporation Data Science Fellowship Program United States Large Synoptic Survey Telescope 933 North Cherry Avenue TucsonAZ85721 United States Department of Astronomy and Astrophysics University of Chicago ChicagoIL60637 United States Kavli Institute for Cosmological Physics University of Chicago ChicagoIL60637 United States Department of Physics and Astronomy University of Pennsylvania PhiladelphiaPA19104 United States Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States Madrid Spain Deutsches Elektronen Synchrotron DESY Zeuthen D-15738 Germany Department of Physics Drexel University 3141 Chestnut St PhiladelphiaPA19104 United States Institute of Physics Humboldt-Universität zu Berlin Newtonstr. 15 Berlin12489 Germany Deutsches Elektronen-Synchrotron Zeuthen D-15735 Germany Institute of Cosmology and Gravitation University of Portsmouth PortsmouthPO1 3FX United Kingdom Cerro Tololo Inter-American Observatory National Optical Astronomy Observatory Casilla 603 La Serena Chile Brandeis University Physics Department 415 South Street WalthamMA02453 United States National Center for Supercomputing Applications 1205 West Clark St. UrbanaIL61801 United States Instituto de Fisica Teorica UAM CSIC Universidad Autonoma de Madrid Madrid28049 Spain CNRS UMR 7095 Institut d’Astrophysique de Paris ParisF-75014 France Sorbonne Universités UPMC Univ Paris 06 UMR 7095 Institut d’Astrophysique de Paris ParisF-75014 France Department of Physics & Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Laboratório Interinstitucional de e-Astronomia - LIneA Rua Gal. José Cristino 77 RJ Rio de Janeiro20921-400 Brazil Department of Astronomy University of Illinois at Urbana-Champaign 1002 W. Green Street UrbanaIL61801 United States The Barcelona Insti

In this work, we investigate the likelihood of association between realtime, TeV-PeV energy neutrino alerts from IceCube and optical counterparts in the form of core-collapse supernovae (CC SNe). The optical follow-up of IceCube alerts requires two main instrumental capabilities: (1) deep imaging, since 73% of neutrinos would come from CC SNe at redshifts z > 0.3, and (2) a large field of view (FoV), since typical IceCube muon neutrino pointing accuracy is on the order of ∼ 1 deg. With Blanco/DECam (gri to 24th magnitude and 2.2 deg diameter FoV), we performed a triggered optical follow-up observation of two IceCube alerts, IC170922A and IC171106A on ∼ 6 nights during the ∼ 3 weeks following each alert. For the IC170922A (IC171106A) follow-up observations, we expect that 12.1% (9.5%) of coincident CC SNe at z 0.3 are detectable, and that on average, 0.23 (0.07) unassociated SNe in the neutrino 90% containment regions also pass our selection criteria. We find two candidate CC SNe that are temporally coincident with the neutrino alerts in the FoV, but none in the 90% containment regions, which is statistically consistent with expected rates of background CC SNe for these observations. If CC SNe are the dominant source of TeV-PeV neutrinos, we would expect an excess of coincident CC SNe to be detectable at the 3σ confidence level using DECam observations similar to those of this work for ∼ 60 (∼ 200) neutrino alerts with (without) redshift information for all candidates. Copyright © 2019, The Authors. All rights reserved.

关键词： Neutrons

来源：评论

学校读者我要写书评

暂无评论

The Middle of the Specified Node Set of Shortest Path Algorithm

The Middle of the Specified Node Set of Shortest Path Algori...

引用

2016 IEEE 13th International Conference on Signal Processing（ICSP2016）

作者： Jie Jia Jeng-Shyang Pan Hua-Rong Xu Innovative Information Industry Research Center Shenzhen Graduate SchoolHarbin Institute of Technology IIIRCHITSZ Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology Innovative Information Industry Research Center Shenzhen Graduate SchoolHarbin Institute of Technology Department of Computer Science and Technology Xiamen University of Technology CSTXMUT

the vast majority of researches about the shortest path algorithm, nowadays, focus just on the case starting from the beginning point and ending at the ending point. If additional condition that the shortest path must go through some given nodes of which number is uncertain must be met, then most of the existing classic algorithms are not applicable. A general method based on the Virus Co-Evolutionary Genetic algorithm and greedy algorithm is presented to solve this kind of problem. The time complexity of the algorithm is given by theoretical analysis and the effectiveness of the algorithm is verified by programming calculation. Furthermore, this algorithm in HUAWEI Code Craft 2016 makes 17 th score in preliminary to the semi-finals.

关键词： shortest path algorithm VEGA greedy algorithm path planning

来源：评论

学校读者我要写书评

暂无评论

Optimizing multiple ontology alignments through hybrid evolutionary algorithm based on a new elitist strategy

引用

ICIC Express Letters, Part B: applications 2016年第6期7卷 1241-1248页

作者： Jiang, Li Tsai, Pei-Wei Xue, Xingsi Computer Department Fuzhou Polytechnic No. 8 Lianrong Road University Town Minhou Fuzhou350108 China College of Information Science and Engineering Fujian University of Technology No. 3 Xueyuan Road University Town Minhou Fuzhou350118 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No. 3 Xueyuan Road University Town Minhou Fuzhou350118 China

In this paper, we propose a hybrid evolutionary algorithm based on a new elitist strategy to address the problem of optimizing the multiple ontology alignments simultaneously. Comparing with the conventional approach, our method is able to deal with multiple pair of ontologies at a time, and through a new elitist strategy, avoid the bias improvement caused by f-measure. Experimental results show that our approach is effective. © 2016 ICIC International.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Improving latent factor models via personalized feature projection for one class recommendation 15

Improving latent factor models via personalized feature proj...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhao, Tong McAuley, Julian King, Irwin Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications Shenzhen Research Institute Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong Department of Computer Science and Engineering UC San Diego San DiegoCA United States

ISBN: (纸本)9781450337946

Latent Factor models, which transform both users and items into the same latent feature space, are one of the most successful and ubiquitous models in recommender systems. Most existing models in this paradigm define both users' and items' latent factors to be of the same size and use an inner product to represent a user's 'compatibility' with an item. Intuitively, users' factors encode 'preferences' while item factors encode 'properties', so that the inner product encodes how well an item matches a user's preferences. However, a user's opinion of an item may be more complex, for example each dimension of each user's opinion may depend on a combination of multiple item factors simultaneously. Thus it may be better to view each dimension of a user's preference as a personalized projection of an item's properties so that the preference model can capture complex relationships between items' properties and users' preferences. Therefore, in this paper we propose a novel personalized feature projection method to model users' preferences over items. Specifically, for each user, we define a personalized projection matrix, which takes the place of user-specific factors from existing models. This matrix describes a mapping between items' factors and users' preferences in order to build personalized preference models for each user and item. The proposed personalized feature projection method is quite general and existing latent factor models, for example, can be cast as a special case. We present three objective functions to optimize predictions in the form of ranked lists of users' preferences over items, and demonstrate how each can be used to improve one-class recommendation performance. Experiments are conducted on four real-world datasets and our results show that our personalized feature projection method outperforms several state-of-the-art methods on various evaluation metrics. © 2015 ACM.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Exploiting game theoretic analysis for link recommendation in social networks 15

Exploiting game theoretic analysis for link recommendation i...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhao, Tong Zhao, H. Vicky King, Irwin Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications Shenzhen Research Institute Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong Electrical and Computer Engineering Department University of Alberta EdmontonAB Canada

ISBN: (纸本)9781450337946

The popularity of Online Social Networks (OSNs) has attracted great research interests in different fields. In Economics, researchers use game theory to analyze the mechanism of network formation, which is called Network Formation Game. While in computer science, much effort has been done in building machine learning models to predict future or missing links. However, there are few works considering how to combine game theoretic analysis and machine learning models. Therefore, in this paper, we study the problem of Exploiting Game Theoretic Analysis for Link Recommendation in Social Networks. Our goal is to improve link recommendation accuracy via leveraging the power of Network Formation Games into machine learning models. We present two different approaches to solve this problem. First, we propose a three-phase method that straightforwardly combines game theoretic analysis with machine learning models. Second, we develop a unified model, BPRLGT, that incorporates Network Formation Game into a Bayesian ranking framework for link recommendation. Specifically, BPRLGT takes advantage of network topology and we design a game theoretic sampling approach to improve its training process. The experiments are conducted on four real world datasets and the results on all datasets demonstrate that both our proposed three-phase method and the unified ranking model outperform the baseline methods. © 2015 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Virtual machines of high availability using hardware-assisted failure detection

Virtual machines of high availability using hardware-assiste...

引用

International Carnahan Conference on Security Technology

作者： Wei-Jen Wang Hung-Lin Huang Shan-Hao Chuang Shao-Jui Chen Chia Hung Kao Deron Liang Department of Computer Science and Information Engineering National Central University Taiwan Data Analytics Technology and Applications Institute Institute for Information Industry Taiwan

The virtualization technology has been widely used in today's doud computing datacenters. With the virtualization technology, each physical machine in a datacenter can be logically divided into several virtual machines, on which different types of software services can host. However, many reasons may decrease the availability of the whole system. For example, a failed physical machine automatically fails all virtual machines on the physical machine, and consequently fails every software service on the virtual machines. It is difficult to detect failures efficiently in a general-purpose computer architecture because the hardware cannot provide enough information for fast failure detection. On the contrary, the ATCA (Advanced Telecommunications Computing Architecture) physical machines provide high hardware availability, and support IPMI (Intelligent Platform Management Interface) that can quickly detect the hardware status. In this paper, we developed a novel failure model and designed a symmetric fault-tolerant mechanism using ATCA physical machines and KVM to provide a solution for high system availability. The proposed fault-tolerant mechanism divides ATCA physical machines into pairs, such that each machine of a pair supports fault tolerance for each other. Once a failure is detected in the physical machine layer or the virtualization layer, the failed virtual machines are then recovered on the other physical machine. We have compared the proposed fault-tolerance mechanism with another prior VM-based fault-tolerance tool. The results show that the proposed mechanism significantly reduces the service downtime. That is, it provides better system availability for software services running on the virtual machines.

关键词： Servers Blades Virtual machining Hardware Monitoring Software Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

pNFS-Based Software-Defined Storage for Information Lifecycle Management

pNFS-Based Software-Defined Storage for Information Lifecycl...

引用

International Conference on Cloud Computing and Big data (CCBD)

作者： Kuo Sheng Deng Chin Feng Lee Jerry Chou Yi Chen Shih Shang Hao Chuang Po Hsuan Wu Department of Computer Science National Tsing Hua University Hsinchu Taiwan Data Analytics Technology & Applications Research Institute Institute for Information Industry Taipei Taiwan

The data explosion brings several difficult challenges. One of critical and fundamental challenges is to have a storage infrastructure that can store and manage such voluminous information to meet business goals, such as cost, performance, reliability, and availability. To reduce the storage cost and improve data access performance, it is typically required a storage management solution based on Information Lifecycle Management (ILM). In this work, we propose a design of ILM system for managing a tiered storage using pNFS(Parallel NFS) file system. pNFS is an emerging NFSv4 extension that bypasses the server bottleneck by enabling direct access to storage by NFSv4 clients. Furthermore, because pNFS separates control and data flows, it enables a software-defined storage architecture. This paper describes our system design and shows the preliminary performance results in this work as a future roadmap to achieve our goal.

关键词： Layout Servers Protocols Performance evaluation Metadata Cost accounting Interoperability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：