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

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

作者： Jameel, Shoaib Lam, Wai Schockaert, Steven Bing, Lidong School of Computer Science and Informatics Cardiff University United Kingdom Dept. of Systems Engineering and Engineering Management Chinese University of Hong Kong Hong Kong Machine Learning Department Carnegie Mellon University United States

ISBN: (纸本)9781450337946

While most methods for learning-to-rank documents only consider relevance scores as features, better results can often be obtained by taking into account the latent topic structure of the document collection. Existing approaches that consider latent topics follow a two-stage approach, in which topics are discovered in an unsupervised way, as usual, and then used as features for the learning-to-rank task. In contrast, we propose a learning-to-rank framework which integrates the supervised learning of a maximum margin classifier with the discovery of a suitable probabilistic topic model. In this way, the labelled data that is available for the learning-to-rank task can be exploited to identify the most appropriate topics. To this end, we use a unified constrained optimization framework, which can dynamically compute the latent topic similarity score between the query and the document. Our experimental results show a consistent improvement over the state-of-the-art learning-to-rank models. © 2015 ACM.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms: 5th International Workshop, WDAG '91 Delphi, Greece, October 7-9, 1991 Proceedings 5th

引用

5th International Workshop on Distributed Algorithms, WDAG 1991

作者： Toueg, Sam Spirakis, Paul G. Kirousis, Lefteris Dept. of Computer Science Cornell University 4106 Upson Hall IthacaNY14853 United States Dept. of Computer Science and Engineering and Computer Technology Institute Patras University P. O. Box 1122 Patras26110 Greece Dept. of Computer Engineering and Informatics Patras University P. O. Box 1045 Patras26110 Greece

来源：评论

学校读者我要写书评

暂无评论

Area bounds of rectilinear polygons realized by angle sequences

Area bounds of rectilinear polygons realized by angle sequen...

引用

23rd International Symposium on Algorithms and Computation, ISAAC 2012

作者： Bae, Sang Won Okamoto, Yoshio Shin, Chan-Su Dept. of Computer Science Kyonggi University Korea Republic of Dept. of Communication Engineering and Informatics University of Electro-Communications Japan Dept. of Digital Information Engineering Hankuk University of Foreign Studies Korea Republic of

ISBN: (纸本)9783642352607

Given a sequence S of angles at n vertices of a rectilinear polygon, S directly defines (or realizes) a set of rectilinear polygons in the integer grid. Among such realizations, we consider the one P(S) with minimum area. Let δ(n) be the minimum of the area of P(S) over all angle sequences S of length n, and Δ(n) be the maximum. In this paper, we provide the explicit formula for δ(n) and Δ(n). © Springer-Verlag 2012.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

LogMap family participation in the OAEI2018 13

LogMap family participation in the OAEI2018

引用

13th International Workshop on Ontology Matching, OM 2018

作者： Jiménez-Ruiz, E. Cuenca Grau, B. Cross, V. Alan Turing Institute London United Kingdom Department of Informatics University of Oslo Oslo Norway Department of Computer Science University of Oxford Oxford United Kingdom Computer Science and Software Engineering Miami University OxfordOH United States

We present the participation of LogMap and its variants in the OAEI 2018 campaign. The LogMap project started in January 2011 with the objective of developing a scalable and logic-based ontology matching system. This is our eight participation in the OAEI and the experience has so far been very positive. LogMap is one of the few systems that participates in (almost) all OAEI tracks. © 2018 CEUR-WS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hand-Woven Fabric Motif Recognition Methods: A Systematic Literature Review 3

Hand-Woven Fabric Motif Recognition Methods: A Systematic Li...

引用

3rd International Conference on informatics, Multimedia, Cyber, and Information System, ICIMCIS 2021

作者： Noprisson, Handrie Ermatita, Ermatita Abdiansah, Abdiansah Ayumi, Vina Purba, Mariana Utami, Marissa Universitas Sriwijaya Doctoral Program in Engineering Palembang Indonesia Universitas Sriwijaya Faculty of Computer Science Palembang Indonesia Program of Informatics Management Politeknik Anika Palembang Indonesia Muhammadiyah University of Bengkulu Faculty of Engineering Bengkulu Indonesia

ISBN: (纸本)9781665427333

Knowledge of hand-woven motif recognition is only owned by the older generation, which has not been passed down to the younger generation. Moreover, computer technology can be used to support the recognition of traditional woven fabric motifs. The aim of this research is to conduct a literature review on hand-woven fabric motif recognition, with an emphasis on performance accuracy, techniques, and datasets utilized. This research included three distinct stages of systematic literature review (SLR): planning, execution, and reporting of findings. We found several datasets between 924,845 data and the number of classes between 3-25 class. Based on research result, we obtained several methods for hand-woven fabric motif recognition focused on performance examination. We recommended image pre-processing method, including Adaptive Filtering Denoising, Adaptive Wiener Filtering, Histogram Equalization, Gradient Pyramid (GP) Decomposition. Moreover, we suggested five feature extraction methods, including Radon Transform, Wavelet Transform, Locally Rotation Invariance Measure (LBP-ROR), Transform Invariant Low-Rank Textures (TILT) and Histogram of Oriented Gradients (HOG). For learning method, we recommend Fuzzy C-Mean (FCM), Convolutional neural network (CNN), Deep Neural Network (DNN), MobileNets, Inception-v3 and ResNet-50. © 2021 IEEE.

关键词： Weaving

来源：评论

学校读者我要写书评

暂无评论

Efficiently merging symbolic rules into integrated rules

Efficiently merging symbolic rules into integrated rules

引用

2012 AAAI Workshop

作者： Prentzas, Jim Hatzilygeroudis, Ioannis Democritus University of Thrace School of Education Sciences Department of Education Sciences in Pre-School Age 68100 Nea Chili Alexandroupolis Greece University of Patras School of Engineering Department of Computer Engineering and Informatics 26500 Patras Greece

ISBN: (纸本)9781577355762

Neurules are a type of neuro-symbolic rules integrating neurocomputing and production rules. Each neurule is represented as an adaline unit. Neurules exhibit characteristics such as modularity, naturalness and ability to perform interactive and integrated inferences. One way of producing a neurule base is through conversion of an existing symbolic rule base yielding an equivalent but more compact rule base. The conversion process merges symbolic rules having the same conclusion into one or more neurules. Due to the inability of the adaline unit to handle inseparability, more than one neurule for each conclusion may be produced. In this paper, we define criteria concerning the ability or inability to convert a rule set into a single neurule. Definition of criteria determining whether a set of symbolic rules can (or cannot) be converted into a single, equivalent but more compact rule is of general representational interest. With application of such criteria, the conversion process of symbolic rules into neurules becomes more time- and space-efficient by omitting useless trainings. Experimental results are promising. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Providing a labeled statements dataset to enhance the trans-compilation-based tools 4

Providing a labeled statements dataset to enhance the trans-...

引用

4th Novel Intelligent and Leading Emerging Sciences Conference, NILES 2022

作者： Soliman, Abdelrahman M. Radwan, Moataz-Bellah A. Eida, Hussain E. Mahmoud, Amira T. Mohammed, Youmna E. Asal, Walaa M. Yousef, Ahmed H. School of Information Technology and Computer Science Nile University Giza Egypt Center for Informatics Science Nile University Giza Egypt Ain Shams University Faculty of Engineering Cairo Egypt Banha University Faculty of Computer and AI Banha Egypt

ISBN: (数字)9781665452410

ISBN: (纸本)9781665452410

Nowadays Mobile Applications are a necessity as everyone is depending on them in their everyday tasks. We use them for communication, entertainment, and utilities. Every day new devices are introduced to the market. The diversity in these devices resulted in many platforms like Android and iOS. These different mobile platforms used by different companies and manufacturers made it challenging for mobile developersto build an application or a system that can be deployed on different platforms. Developers will be required to go through multiple development cycles to develop the application for each of the targeted platforms. To solve these issues, cross-platform frameworks emerged as a solution that would help the developers to write one codebase and deploy it on multiple platforms at the same time. Even though cross-platform frameworks reduced the time and cost needed to develop an application, but they did not provide the native feel and performance of the native applications. It was also challenging for developers to integrate cross-platform applications with a pre-existing system and to maintain the system. Some approaches were introduced to solve these issues by allowing the developer to write one codebase and generate the native code for each platform. One of the recently presented approaches is the trans-compilation approach that depends on the parser code to recognize the source code and generate the corresponding code for it in the target language. Even though the trans-compiler-based approaches were effective in providing an application that combines the advantages of the cross-platform and native development, it faced some problems in dealing with statements that is not expressed in the language's grammar rules, eternal APIs, and APIs that require code definition, like Firebase. In this paper, our aim is to provide a solution that can be integrated with the trans-compilation approach to solve the previously mentioned issues to enhance the conversion success

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

The efficiency of resource allocation mechanisms for budget-constrained users

arXiv

引用

arXiv 2017年

作者： Caragiannis, Ioannis Voudouris, Alexandros A. Department of Computer Engineering and Informatics University of Patras Rion26504 Greece

We study the efficiency of mechanisms for allocating a divisible resource. Given scalar signals submitted by all users, such a mechanism decides the fraction of the resource that each user will receive and a payment that will be collected from her. Users are self-interested and aim to maximize their utility (defined as their value for the resource fraction they receive minus their payment). Starting with the seminal work of Johari and Tsitsiklis [8], a long list of papers studied the price of anarchy (in terms of the social welfare-the total users' value) of resource allocation mechanisms for a variety of allocation and payment rules. Here, we further assume that each user has a budget constraint that invalidates strategies that yield a payment that is higher than the user's budget. This subtle assumption, which is arguably more realistic, constitutes the traditional price of anarchy analysis meaningless as the set of equilibria may change drastically and their social welfare can be arbitrarily far from optimal. Instead, we study the price of anarchy using the liquid welfare benchmark that measures efficiency taking budget constraints into account. We show a tight bound of 2 on the liquid price of anarchy of the well-known Kelly mechanism and prove that this result is essentially best possible among all multi-user resource allocation mechanisms. This comes in sharp contrast to the no-budget setting where there are mechanisms that considerably outperform Kelly in terms of social welfare and even achieve full efficiency. In our proofs, we exploit the particular structure of worst-case games and equilibria, which also allows us to design (nearly) optimal two-player mechanisms by solving simple differential equations. Copyright © 2017, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Kernel-based training of generative networks

arXiv

引用

arXiv 2018年

作者： Basioti, Kalliopi Moustakides, George V. Psarakis, Emmanouil Z. Computer Science Rutgers University United States Computer Engineering and Informatics University of Patras Greece

Generative adversarial networks (GANs) are designed with the help of min-max optimization problems that are solved with stochastic gradient-type algorithms which are known to be non-robust. In this work we revisit a non-adversarial method based on kernels which relies on a pure minimization problem and propose a simple stochastic gradient algorithm for the computation of its solution. Using simplified tools from Stochastic Approximation theory we demonstrate that batch versions of the algorithm or smoothing of the gradient do not improve convergence. These observations allow for the development of a training algorithm that enjoys reduced computational complexity and increased robustness while exhibiting similar synthesis characteristics as classical GANs. Copyright © 2018, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based scalable authentication for IoT: Poster abstract 20

Blockchain-based scalable authentication for IoT: Poster abs...

引用

18th ACM Conference on Embedded Networked Sensor Systems, SenSys 2020

作者： Mukhandi, Munkenyi Andrade, Eduardo Damião, Francisco Granjal, Jorge Vilela, João P. Cisuc Dep. of Informatics Engineering University of Coimbra Portugal Pdmfc Lisbon Portugal CRACS/INESCTEC Cisuc Dep. of Computer Science Faculty of Sciences University of Porto Portugal

ISBN: (纸本)9781450375900

Device identity management and authentication are one of the critical and primary security challenges in IoT. In order to decrease the IoT attack surface and provide protection from security threats such as introduction of fake IoT nodes and identity theft, IoT requires scalable device identity management systems and resilient device authentication mechanisms. Existing mechanisms for device identity management and device authentication were not designed for huge number of devices and therefore are not suitable for IoT environments. This work presents results of a blockchain-based identity management approach with consensus authentication, as a scalable solution for IoT device authentication management. Our identity management approach relies on having a blockchain secure tamper proof registry and lightweight consensus-based identity authentication. © 2020 Owner/Author.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：