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

arXiv 2019年

作者： Horsch, Martin Thomas Niethammer, Christoph Boccardo, Gianluca Carbone, Paola Chiacchiera, Silvia Chiricotto, Mara Elliott, Joshua D. Lobaskin, Vladimir Neumann, Philipp Schiffels, Peter Seaton, Michael A. Todorov, Ilian T. Vrabec, Jadran Cavalcanti, Welchy Leite STFC Daresbury Laboratory UK Research and Innovation Keckwick Ln Daresbury CheshireWA4 4AD United Kingdom High Performance Computing Center Stuttgart Nobelstr. 19 Stuttgart70569 Germany Department of Applied Science and Technology Institute of Chemical Engineering Politecnico di Torino Corso Duca degli Abruzzi 24 Torino10129 Italy School of Chemical Engineering and Analytical Science University of Manchester Oxford Rd ManchesterM13 9PL United Kingdom School of Physics University College Dublin Dublin 4 Ireland Department of Informatics Universität Hamburg Bundesstr. 45a Hamburg20146 Germany Fraunhofer Institute for Manufacturing Technology and Advanced Materials Wiener Str. 12 Bremen28359 Germany Thermodynamics and Process Engineering Technische Universität Berlin Ernst-Reuter-Platz 1 Berlin10587 Germany

By introducing a common representational system for metadata that describe the employed simulation workflows, diverse sources of data and platforms in computational molecular engineering, such as workflow management systems, can become interoperable at the semantic level. To achieve semantic interoperability, the present work introduces two ontologies that provide a formal specification of the entities occurring in a simulation workflow and the relations between them: The software ontology VISO is developed to represent software packages and their features, and OSMO, an ontology for simulation, modelling, and optimization, is introduced on the basis of MODA, a previously developed semi-intuitive graph notation for workflows in materials modelling. As a proof of concept, OSMO is employed to describe a leading-edge application scenario of the TaLPas workflow management system. Copyright © 2019, The Authors. All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A comparison ofweak supervision methods for knowledge base construction 5

A comparison ofweak supervision methods for knowledge base c...

引用

5th Workshop on Automated Knowledge Base Construction, AKBC 2016 at the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2016

作者： Soni, Ameet Viswanathan, Dileep Pachaiyappan, Niranjan Natarajan, Sriraam Department of Computer Science Swarthmore College United States School of Informatics and Computing Indiana University United States

ISBN: (纸本)9781941643532

We present a comparison of weak and distant supervision methods for producing proxy examples for supervised relation extraction. We find that knowledge-based weak supervision tends to outperform popular distance supervision techniques, providing a higher yield of positive examples and more accurate models. © Proceedings of the 5th Workshop on Automated Knowledge Base Construction, AKBC 2016 at the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2016. All rights reserved.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Fake it till you make it: Fishing for catfishes

arXiv

引用

arXiv 2017年

作者： Magdy, Walid Elkhatib, Yehia Tyson, Gareth Joglekar, Sagar Sastry, Nishanth School of Informatics University of Edinburgh United Kingdom School of Computing and Communications Lancaster University United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom Department of Informatics King's College London United Kingdom

Many adult content websites incorporate social networking features. Although these are popular, they raise significant challenges, including the potential for users to "catfish", i.e., to create fake profiles to deceive other users. This paper takes an initial step towards automated catfish detection. We explore the characteristics of the different age and gender groups, identifying a number of distinctions. Through this, we train models based on user profiles and comments, via the ground truth of specially verified profiles. When applying our models for age and gender estimation to unverified profiles, 38% of profiles are classified as lying about their age, and 25% are predicted to be lying about their gender. The results suggest that women have a greater propensity to catfish than men. Our preliminary work has notable implications on operators of such online social networks, as well as users who may worry about interacting with catfishes. Copyright © 2017, The Authors. All rights reserved.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

State of the art metrics for aspect oriented programming

引用

AIP Conference Proceedings 2018年第1期1952卷

作者： Mazen Ismaeel Ghareb Gary Allen 1Computer Science Department. College of Science and Technology University of Human Development Sulaimani Iraq 2Department of Informatics School of Computing and Engineering University of Huddersfield Huddersfield England

The quality evaluation of software, e.g., defect measurement, gains significance with higher use of software applications. Metric measurements are considered as the primary indicator of imperfection prediction and software maintenance in various empirical studies of software products. However, there is no agreement on which metrics are compelling quality indicators for novel development approaches such as Aspect Oriented Programming (AOP). AOP intends to enhance programming quality, by providing new and novel constructs for the development of systems, for example, point cuts, advice and inter-type relationships. Hence, it is not evident if quality pointers for AOP can be derived from direct expansions of traditional OO measurements. Then again, investigations of AOP do regularly depend on established coupling measurements. Notwithstanding the late reception of AOP in empirical studies, coupling measurements have been adopted as useful markers of flaw inclination in this context. In this paper we will investigate the state of the art metrics for measurement of Aspect Oriented systems development.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient sequential pattern mining with wildcards for keyphrase extraction

引用

Knowledge-Based Systems 2017年 115卷 27-39页

作者： Xie, Fei Wu, Xindong Zhu, Xingquan School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 China Department of Computer Science and Technology Hefei Normal University Hefei 230601 China School of Computing and Informatics University of Louisiana at Lafayette LA 70503 United States Dept. of Computer & Electrical Eng. and Computer Science Florida Atlantic Univ. Boca Raton FL 33431 United States

A keyphrase (a multi-word unit) in a document denotes one or multiple keywords capturing a main topic of the underlying document. Finding good keyphrases of a document can quickly summarize knowledge for efficient decision making and benefit domains involving intensive text information. To date, existing keyphrase extraction methods cannot be customized to each specific document, mainly because their patterns used to form paraphrases are too restrictive and may not capture flexible keyword relationships inside the text. In this paper, we propose a sequential pattern mining based document-specific keyphrase extraction method. Our key innovation is to use wildcards (or gap constraints) to help extract sequential patterns, so the flexible wildcard constraints within a pattern can capture semantic relationships between words, and the system will have full flexibility to discover different types of sequential patterns as candidates for keyphrase extraction. To achieve the goal, we regard each single document as a sequential dataset, and propose an efficient algorithm to mine sequential patterns with wildcard and one-off conditions that allows important keyphrases to be captured during the mining process. For each extracted keyphrase candidate, we use some statistical pattern features to characterize it, and further collect all keyphrases from the document to form a training set. A supervised learning classifier is trained to identify keyphrases from a test document. Because our pattern mining and pattern characterization processes are customized to each single document, keyphases extracted from our method are highly specific for each document. Experimental results demonstrate that the proposed sequential pattern mining method outperforms existing pattern mining methods in both runtime performance and completeness. Comparisons on keyphrase benchmark datasets also confirm that the proposed document-specific keyphrase extraction method is effective in improving the quality

关键词： Classification Document summarization Keyphrase extraction Sequential pattern mining Wildcards

来源：评论

学校读者我要写书评

暂无评论

Longest alignment with edits in data streams

arXiv

引用

arXiv 2017年

作者： Grigorescu, Elena Azer, Erfan Sadeqi Zhou, Samson Department of Computer Science Purdue University West LafayetteIN United States School of Informatics and Computing Indiana University BloomingtonIN United States Department of Computer Science Purdue University West LafayetteIN United States

Analyzing patterns in data streams generated by network traffic, sensor networks, or satellite feeds is a challenge for systems in which the available storage is limited. In addition, real data is noisy, which makes designing data stream algorithms even more challenging. Motivated by such challenges, we study algorithms for detecting the similarity of two data streams that can be read in sync. Two strings S, T ϵΣn form a d-near-alignment if the distance between them in some given metric is at most d. We study the problem of identifying a longest substring of S and T that forms a d-near-alignment under the edit distance, in the simultaneous streaming model. In this model, symbols of strings S and T are streamed at the same time, and the amount of available processing space is sublinear in the length of the strings. We give several algorithms, including an exact one-pass algorithm that uses O(d2 + d log n) bits of space. We couple these results with comparable lower bounds. Copyright © 2017, The Authors. All rights reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Learning social affordance grammar from videos: Transferring human interactions to human-robot interactions

Learning social affordance grammar from videos: Transferring...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Tianmin Shu Xiaofeng Gao Michael S. Ryoo Song-Chun Zhu Center for Vision Cogntion Learning and Autonomy University of California Los Angeles USA Department of Electronic Engineering Fudan University China School of Informatics and Computing Indiana University Bloomington USA

In this paper, we present a general framework for learning social affordance grammar as a spatiotemporal AND-OR graph (ST-AOG) from RGB-D videos of human interactions, and transfer the grammar to humanoids to enable a real-time motion inference for human-robot interaction (HRI). Based on Gibbs sampling, our weakly supervised grammar learning can automatically construct a hierarchical representation of an interaction with long-term joint sub-tasks of both agents and short term atomic actions of individual agents. Based on a new RGB-D video dataset with rich instances of human interactions, our experiments of Baxter simulation, human evaluation, and real Baxter test demonstrate that the model learned from limited training data successfully generates human-like behaviors in unseen scenarios and outperforms both baselines.

关键词： Grammar Robots Videos Human-robot interaction Spatiotemporal phenomena Grounding Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Surjective H-Colouring: New hardness results

arXiv

引用

arXiv 2017年

作者： Golovach, Petr A. Johnson, Matthew Martin, Barnaby Paulusma, Daniël Stewart, Anthony Department of Informatics University of Bergen Bergen Norway School of Engineering and Computing Sciences Durham University South Road DurhamDH1 3LE United Kingdom

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide if a graph G allows a homomorphism to a fixed graph H. We continue a study on a variant of this problem, namely the Surjective H-Colouring problem, which imposes the homomorphism to be vertex-surjective. We build upon previous results and show that this problem is NP-complete for every connected graph H that has exactly two vertices with a self-loop as long as these two vertices are not adjacent. As a result, we can classify the computational complexity of Surjective H-Colouring for every graph H on at most four vertices. Copyright © 2017, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Eliciting Strategies for the GQM+Strategies Approach in IT Service Measurement Initiatives 11

Eliciting Strategies for the GQM+Strategies Approach in IT S...

引用

11th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement, ESEM 2017

作者： Trinkenreich, Bianca Santos, Gleison Barcellos, Monalessa Perini Conte, Tayana IT Infrastructure Services Vale S/A Rio de Janeiro Brazil Department of Applied Informatics Federal University of the State of Rio de Janeiro Rio de Janeiro Brazil NEMO Ontology and Conceptual Modeling Research Group Federal University of EspIrito Santo Vitória Brazil USES Research Group Institute of Computing Federal University of Amazonas Manaus Brazil

ISBN: (纸本)9781509040391

GQM+Strategies is a goal-oriented measurement approach that supports organizations in identifying goals, strategies to achieve goals, and measures to monitor strategies and goals. However, identifying proper strategies is not an easy task. This paper presents two studies performed to investigate how strategies can be established to achieve IT service goals. First, we carried out a qualitative study involving three IT service-related departments of a large company to find out how they have been defining strategies and problems faced. We noted that strategies were defined by leaders, in a top-down approach, or by teams, in a bottom-up approach, and causal analysis techniques have been used to investigate aspects which can impact goals achievement. We also found the relation between the IT service strategies and goals was not clear for the teams. Considering these findings, we performed an empirical study in another IT-service related department applying an approach combining GQM+Strategies plus some instruments (checklists, templates and examples) and causal analysis to support IT strategies identification. As a result, we noticed that by using that approach the team was able to derive IT strategies based on goals, define measures to monitor goals and strategies, and better understand the alignment between the goals to be achieved and the strategies to be performed. Moreover, results showed that causal analysis is useful to define strategies and that supporting instruments facilitate using the approach and building GQM+Strategies grid. © 2017 IEEE.

关键词： IEC Standards Software engineering Software measurement

来源：评论

学校读者我要写书评

暂无评论

Automated synthesis of safe and robust PID controllers for stochastic hybrid systems

arXiv

引用

arXiv 2017年

作者： Shmarov, Fedor Paoletti, Nicola Bartocci, Ezio Lin, Shan Smolka, Scott A. Zuliani, Paolo School of Computing Newcastle University Department of Computer Science Stony Brook University NY United States Faculty of Informatics Tu Wien Department of Electrical and Computer Engineering Stony Brook University NY United States

We present a new method for the automated synthesis of safe and robust Proportional-Integral-Derivative (PID) controllers for stochastic hybrid systems. Despite their widespread use in industry, no automated method currently exists for deriving a PID controller (or any other type of controller, for that matter) with safety and performance guarantees for such a general class of systems. In particular, we consider hybrid systems with nonlinear dynamics (Lipschitz-continuous ordinary differential equations) and random parameters, and we synthesize PID controllers such that the resulting closed-loop systems satisfy safety and performance constraints given as probabilistic bounded reachability properties. Our technique leverages SMT solvers over the reals and nonlinear differential equations to provide formal guarantees that the synthesized controllers satisfy such properties. These controllers are also robust by design since they minimize the probability of reaching an unsafe state in the presence of random disturbances. We apply our approach to the problem of insulin regulation for type 1 diabetes, synthesizing controllers with robust responses to large random meal disturbances, thereby enabling them to maintain blood glucose levels within healthy, safe ranges. Copyright © 2017, The Authors. All rights reserved.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：