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

Congress on Evolutionary Computation

作者： Fabian Fränz Jan Paredis Rico Möckel Department of Data Science and Knowledge Engineering Maastricht University Maastricht The Netherlands Universiteit Maastricht Maastricht Limburg NL

This paper develops a new method for coevolution, named Fitness-Diversity Driven Coevolution (FDDC). This approach builds on existing methods by a combination of a (predator-prey) Coevolutionary Genetic Algorithm (CGA) and novelty search. The innovation lies in replacing the absolute novelty measure with a relative one, called Fitness-Diversity. FDDC overcomes problems common in both CGAs (premature convergence and unbalanced coevolution) and in novelty search (construction of an archive). As a proof of principle, Spring Loaded Inverted Pendulums (SLIPs) are coevolved with 2D-terrains the SLIPs must learn to traverse.

关键词： Sociology Statistics Springs Linear programming Genetic algorithms Optimization Search problems

来源：评论

学校读者我要写书评

暂无评论

Trust Service Discovery by Opinions Classification on Virtual Communities

Trust Service Discovery by Opinions Classification on Virtua...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC

作者： Qing Zhu Department of Computer Science Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

ISBN: (纸本)9781424465972;9780769540115

Internet has become an excellent ecommerce platform for bringing together large numbers of buyers and sellers across wide geographic regions. Trust and reputation systems represent a. significant trend in decision support for Internet mediated service provision. However, most existing work assumes that all users have the same trust metrics, but in real life different users often have different preference of product attributes. This paper proposes trusted query navigation model by analyzing online customer reviews of trustworthiness of websites. The first step analyzes counting history feedback in the system offline and generates dynamic trust model by opinion classification. The second step presents trust evaluation ranking to help the user can easily discovery trust service of matching his needs. The experimental evaluation shows that the trusted query evaluation ranking has high trading efficiency, quick learning ability and satisfactory performance.

关键词： Business Feedback Portals History Web services Computer security data security Information security Wireless communication Computer networks

来源：评论

学校读者我要写书评

暂无评论

It’s Time to Consider ‘Time’ when Evaluating Recommender-System Algorithms [Proposal]

arXiv

引用

arXiv 2017年

作者： Beel, Joeran Trinity College Dublin Department of Computer Science and Statistics Knowledge and Data Engineering Group ADAPT Centre Ireland

In this position paper, we question the current practice of calculating evaluation metrics for recommender systems as single numbers (e.g. precision p=.28 or mean absolute error MAE = 1.21). We argue that single numbers express only average effectiveness over usually a rather long period (e.g. a year or even longer). This practice provides only a vague and static view of the data. We propose that recommender-system researchers should instead calculate metrics for time-series such as weeks or months, and plot the results in e.g. a line chart. This way, results show how algorithms’ effectiveness develops over time, and hence the results allow drawing more meaningful conclusions about how an algorithm will perform in the future. In this paper, we explain our reasoning, provide an example to illustrate our reasoning and present suggestions for what the community should do next. Copyright © 2017, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

A unified model of pollution in P2P networks

A unified model of pollution in P2P networks

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Cong Shi Dingyi Han Xinyao Hu Yong Yu Apex Data and Knowledge Management Laboratory Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

Nowadays many popular Peer-to-Peer (P2P) systems suffer from the simultaneous attacks of various pollution, including file-targeted attack and index-targeted attack. However, to our knowledge, there is no model that takes both of them into consideration. In fact, the two attacks impact the effect of each other. It makes the models considering either kind of pollution only fail to accurately illustrate the actual pollution. In this paper, we develop a unified model to remedy the defect. Through the analysis from the perspective of user behavior, the two attacks are integrated into the unified model as two factors impacting users' choice of the files to download. The modeled file proliferation processes are consistent to those measured in real P2P systems. Moreover, the co-effect of the two attacks is also analyzed. The extremum point of co-effect is found, which corresponds to the most efficient attack of pollution. Further analysis of the model's accuracy requires the quantitative comparison between the modeled effects of pollution and the measured ones. Nonetheless, no such metric has ever been proposed, which also causes a lot of problems in evaluating the effect of pollution and anti-pollution techniques. To fix the deficiency, we propose several metrics to assess the effect of pollution, including abort ratio, average download time of unpolluted files, etc. These metrics estimate the effect of pollution from different aspects. They are applied to the analysis of pollution emulated by our unified model. The co-effect of pollution is captured by these metrics. Furthermore, the difference between our model and the previously developed ones is also reflected by them.

关键词： Pollution measurement Peer to peer computing Internet Marketing and sales Mathematical model knowledge management Computer science data engineering knowledge engineering Traffic control

来源：评论

学校读者我要写书评

暂无评论

Cuckoo Ring: BalancingWorkload for Locality Sensitive Hash

Cuckoo Ring: BalancingWorkload for Locality Sensitive Hash

引用

International Conference on Peer-to-Peer Computing

作者： Dingyi Han Ting Shen Shicong Meng Yong Yu Apex Data & Knowledge Management Laboratory Department of Computer Science & Engineering Shanghai Jiaotong University Shanghai China

Locality sensitive hash (LSH) is widely used in peer-to-peer (P2P) systems. Although it can support range or similarity queries, it breaks the load balance mechanism of traditional distributed hash table (DHT) based system by replacing consistent hash with LSH. To solve the imbalance problem, current systems either weaken the locality preserve ability from similarity preserved to order preserved or adopt load aware peer join mechanism. The first method does not support similarity query as it loses the similarity information and the second method is greatly affected by the dynamic nature of P2P networks. In this paper, we propose a novel system, cuckoo ring, which can preserve similarity information while load balanced. It does not guide the newly joining peer to the hot areas but move the items in the hot areas to cold areas so that the short life time peers are distributed uniformly across the network instead of being guided to the hot areas. Compared to traditional DHT systems, cuckoo ring only maintains a little more information about the global light load peers and the moved indexed items

关键词： Indexing Load management knowledge management Computer science data engineering knowledge engineering Nearest neighbor searches Q measurement

来源：评论

学校读者我要写书评

暂无评论

A study in the expressiveness of semantically different policy modelling schemes

A study in the expressiveness of semantically different poli...

引用

IFIP/IEEE International Symposium on Integrated Network Management

作者： Christos Tsarouchis Declan O'Sullivan David Lewis Knowledge & Data Engineering Group (KDEG) Department of Computer Science & Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424492190

Policy engineering is the process of authoring IT management policies, detecting and resolving policy conflicts and revising existing policies to accommodate changing IT resources, business goals and business processes. Policy authoring is often followed by policy enforcement where the actions specified by subjects are performed on targets (resources). In this paper, we study the use of semantically enhanced techniques, such as ontologies, to model resources and their corresponding actions, coupled with a mechanism that can accommodate frequent organizational change, to model policy subjects. For the modeling of policy subjects, the rule-based Community-based Policy management will be used. This integration falls into the category of combining Description Logics (DL) and Logic Programs (LP). We aim to study this integration primarily from the scope of overall system expressivity, but also from the scope of minimizing the cognitive load perceived by policy authors. Such an evaluation can help determine shortfalls in the design of the software system or of the policy model used. To study the balance in modeling with DL and LP techniques, the encoding of part of the Trinity College Dublin statutes will be performed, which is a sufficiently complex real-world example.

关键词： OWL Load modeling Ontologies Welding Analytical models Security Fires

来源：评论

学校读者我要写书评

暂无评论

Capability description and discovery of Internetware entity

引用

science China(Information sciences) 2010年第4期53卷 685-703页

作者： WANG PuWei1*, JIN Zhi2,3* & LIU HongYan4 1Key Laboratory of data engineering and knowledge engineering of the Ministry of Education, Renmin University of China, Beijing 100872, China 2Key Laboratory of High Confidence Software Technologies of the Ministry of Education, Peking University, Beijing 100871, China 3Academy of Mathematics and System sciences, Chinese Academy of sciences, Beijing 100190, China 4department of Management science and engineering, Tsinghua University, Beijing 100084, China 1. Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing 100872 China2. Key Laboratory of High Confidence Software Technologies of the Ministry of Education Peking University Beijing 100871 China3. Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing 100190 China4. Department of Management Science and Engineering Tsinghua University Beijing 100084 China

Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This paper proposes a capability description of Internetware entity based on environment ontology. The environment ontology includes environment entities and possible interactions with the environment entities in a particular domain. Tree-like hierarchical state machines are also included in the ontology to describe domain life-cycle of the environment entities. On the basis of the ideas, the capability of Internetware entity is embodied by interacting with environment entities and the changes of the environment entities during the interactions. Finally, this paper describes the matchmaking between capability descriptions of Internetware entities to support the discovery of Internetware entity. An example of online education course is given to illustrate the ideas.

关键词： Internetware capability description domain environment ontology tree-like hierarchical state machine

来源：评论

学校读者我要写书评

暂无评论

Twelve-Dimensional Vectorcardiography - Is More Better?

Twelve-Dimensional Vectorcardiography - Is More Better?

引用

Computers in Cardiology (CinC)

作者： Alfonso Aranda Joël Karel Pietro Bonizzi Ralf Peeters Medtronic Bakken Research Center Maastricht The Netherlands Department of Data Science and Knowledge Engineering Maastricht University The Netherlands

ISBN: (纸本)9781728109244

Vectorcardiography (VCG) is generated by projecting signals from several leads onto three main orthogonal axes. There is evidence that by doing this projection, some relevant diagnostic information may be lost. We investigated a new way to reduce this information loss. For that, we computed VCG features from the standard 12-lead ECG system and compared its performance in diagnosing myocardial infarction with the standard Frank's VCG, a VCG derived from the 12-lead ECG using the Dower's inverse transform and with a 3-dimensional projection of the 12-lead ECG obtained with principal component analysis. Although the results are not conclusive, they suggest that the proposed 12-dimensional VCG may reduce the information loss by preserving all the ECG leads without the need of any projection.

关键词： Electrocardiography Standards Logistics Feature extraction Principal component analysis Myocardium Training

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of T-Wave-Offset Detection Algorithms on Patients with Cardiac Diseases

Performance Analysis of T-Wave-Offset Detection Algorithms o...

引用

Computers in Cardiology (CinC)

作者： Deborah Nairn Pietro Bonizzi Joël Karel Alfonso Aranda Medtronic Bakken Research Center Maastricht The Netherlands Department of Data Science and Knowledge Engineering Maastricht University The Netherlands

ISBN: (纸本)9781728109244

Cardiovascular diseases are the number one cause of death in the world. The application of automatic processing algorithms can provide important information about these heart diseases. However, the design of these algorithms can be challenging due to the morphological variations in ECG signals, specifically in the T-wave-offset. This study proposes a comparison of several T-offset detection algorithms on healthy subjects and patients suffering from cardiac diseases. Seven state of the art algorithms were selected for implementation and were evaluated using the same dataset and benchmark to provide a fair comparison. Although no algorithm performs with 100% accuracy for all patients, most can perform well with regards to the healthy patients, with two algorithms having a high performance, above 70% accuracy, on all patients.

关键词： databases Electrocardiography Morphology Cardiac disease Heart Standards Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

GCN-FFNN: A Two-Stream Deep Model for Learning Solution to Partial Differential Equations

arXiv

引用

arXiv 2022年

作者： Bilgin, Onur Vergutz, Thomas Mehrkanoon, Siamak Department of Data Science and Knowledge Engineering Maastricht University Netherlands Mathematics Centre Maastricht Maastricht University Netherlands

This paper introduces a novel two-stream deep model based on graph convolutional network (GCN) architecture and feedforward neural networks (FFNN) for learning the solution of nonlinear partial differential equations (PDEs). The model aims at incorporating both graph and grid input representations using two streams corresponding to GCN and FFNN models, respectively. Each stream layer receives and processes its own input representation. As opposed to FFNN which receives a grid-like structure, the GCN stream layer operates on graph input data where the neighborhood information is incorporated through the adjacency matrix of the graph. In this way, the proposed GCN-FFNN model learns from two types of input representations, i.e. grid and graph data, obtained via the discretization of the PDE domain. The GCN-FFNN model is trained in two phases. In the first phase, the model parameters of each stream are trained separately. Both streams employ the same error function to adjust their parameters by enforcing the models to satisfy the given PDE as well as its initial and boundary conditions on grid or graph collocation (training) data. In the second phase, the learned parameters of two-stream layers are frozen and their learned representation solutions are fed to fully connected layers whose parameters are learned using the previously used error function. The learned GCN-FFNN model is tested on test data located both inside and outside the PDE domain. The obtained numerical results demonstrate the applicability and efficiency of the proposed GCN-FFNN model over individual GCN and FFNN models on 1D-Burgers, 1D-Schrödinger, 2D-Burgers and 2D-Schrödinger equations. © 2022, CC BY-SA.

关键词： Partial differential equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：