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

12th international workshop on Biological Knowledge Discovery from Data, BIOKDD 2021, 5th international workshop on Cyber-Security and Functional Safety in Cyber-Physical Systems, IWCFS 2021, 3rd international workshop on Machine Learning and Knowledge graphs, MLKgraphs 2021, 1st international workshop on Artificial Intelligence for Clean, Affordable and Reliable Energy Supply, AI-CARES 2021, 1st international workshop on Time Ordered Data, ProTime2021 and 1st international workshop on AI System Engineering: Math, Modelling and Software, AISys2021 held at 32nd international Conference on Database and Expert Systems Applications, DEXA 2021

12th International Workshop on Biological Knowledge Discover...

引用

12th international workshop on Biological Knowledge Discovery from Data, BIOKDD 2021, 5th international workshop on Cyber-Security and Functional Safety in Cyber-Physical Systems, IWCFS 2021, 3rd international workshop on Machine Learning and Knowledge graphs, MLKgraphs 2021, 1st international workshop on Artificial Intelligence for Clean, Affordable and Reliable Energy Supply, AI-CARES 2021, 1st international workshop on Time Ordered Data, ProTime2021 and 1st international workshop on AI System Engineering: Math, Modelling and Software, AISys2021 held at 32nd international Conference on Database and Expert Systems Applications, DEXA 2021

ISBN: (纸本)9783030871000

the proceedings contain 23 papers. the special focus in this conference is on Database and Expert Systems Applications. the topics include: Semantic Influence Score: Tracing Beautiful Minds through Knowledge Diffusion and Derivative Works;robust and Efficient Bio-Inspired Data-Sampling Prototype for Time-Series Analysis;membership-Mappings for Data Representation Learning: Measure theoretic Conceptualization;membership-Mappings for Data Representation Learning: A Bregman Divergence based Conditionally Deep Autoencoder;data Catalogs: A Systematic Literature Review and Guidelines to Implementation;task-Specific Automation in Deep Learning Processes;approximate Fault Tolerance for Edge Stream Processing;deep Learning Rule for Efficient Changepoint Detection in the Presence of Non-Linear Trends;time Series pattern Discovery by Deep Learning and graph Mining;a Conceptual Model for Mitigation of Root Causes of Uncertainty in Cyber-Physical Systems;integrating Gene Ontology based Grouping and Ranking into the Machine Learning Algorithm for Gene Expression Data Analysis;SVM-RCE-R-OPT: Optimization of Scoring Function for SVM-RCE-R;short-Term Renewable Energy Forecasting in Greece Using Prophet Decomposition and Tree-based Ensembles;a Comparative Study of Deep Learning Approaches for Day-Ahead Load Forecasting of an Electric Car Fleet;Security-based Safety Hazard Analysis Using FMEA: A DAM Case Study;Privacy Preserving Machine Learning for Malicious URL Detection;remote Attestation of Bare-Metal Microprocessor Software: A Formally Verified Security Monitor;Provenance and Privacy in ProSA: A Guided Interview on Privacy-Aware Provenance;placeholder Constraint Evaluation in Simulation graphs;Walk Extraction Strategies for Node Embeddings with RDF2Vec in Knowledge graphs;bridging Semantic Web and Machine Learning: First Results of a Systematic Mapping Study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reified literals: A best practice candidate design pattern for increased expressivity in the Intelligence Community

Reified literals: A best practice candidate design pattern f...

引用

5th international Conference on Semantic Technologies for Intelligence, Defense, and Security, STIDS 2010

作者： Peterson, Eric Global Infotek 1920 Association Drive Reston VA 20191 United States

Reifying literals clearly increases expressivity. But reified literals appear to waste memory, slow queries, and complicate graph-based models. We show where this practice can be comparable to unreified literals in these respects and we characterize the cost where it is not. We offer examples of how reification allows literals to participate in a variety of relations enabling a marked increase in expressivity. We begin with a case study in reified person names, and then extend this analysis to reified dates and simple reified scalar values. We show benefits for name matching and temporal analysis such as would be of interest to the Intelligence Community (IC). We then show how these same sorts of analyses can drive or inform any decision as to whether to reify literals.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Automatic detection of facial feature points and contours

Automatic detection of facial feature points and contours

引用

5th IEEE international workshop on Robot and Human Communication (RO-MAN 96)

作者： Yokoyama, T Wu, HY Yachida, M Osaka Univ Osaka Japan

ISBN: (纸本)0780332539

this paper presents a method for automatic processing of a human faces from color images. We describe a new system, which works hierarchically from detecting the position of human faces and their features (such as eyes, nose, mouth, etc.) and then to extract their contours and feature points. the position of human faces and their parts are detected from the image by applying the integral projection method, which uses both color information (skin and hair color) and edge information (intensity and sign).we use a multiple active contour model to extract the contour-lines of facial features. In order to this work, we use color information in their energy terms. Facial feature paints are decided based on the optimized contours. Constructed 3D facial model using these points can be used to generate its facial expression or change its view. the proposed system is confirmed to be very effective and robust when dealing with images effaces with complex backgrounds.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

10th international workshop on Computer Science Logic, CSL 1996 held with Annual Conference of the European Association for Computer Science Logic, EACSL 1996

引用

10th international workshop on Computer Science Logic, CSL 1996, 5th Annual Conference of the European Association for Computer Science Logic, EACSL 1996

ISBN: (纸本)3540631720

the proceedings contain 28 papers. the special focus in this conference is on Computer Science Logic. the topics include: Four-valued diagnoses for stratified knowledge-bases;on the subject reduction property for algebraic type systems;bounded-variable fixpoint queries are PSPACE-complete;graph rewriting semantics for functional programming languages;an extension of models of axiomatic domain theory to models of synthetic domain theory;relative undecidability in term rewriting;extending models of second order predicate logic to models of second order dependent type theory;cut-free display calculi for relation algebras;computational aspects of arity hierarchies;weak semantics based on lighted button pressing experiments;monadic NP and built-in trees;optimization problems with approximation schemes;computational representations of herbrand models using grammars;social confluence in client-server systems;a type-free resource-aware a-calculus;inductive definitions with decidable atomic formulas;new intuitionistic logical constants and undecidability of the conservativeness problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Group based graph transformations and hierarchical representations of graphs 5th

Group based graph transformations and hierarchical represent...

引用

Proceedings o the 1994 5th international workshop on graph Grammars and their Application to Computer Science

作者： Ehrenfeucht, A. Harju, T. Rozenberg, G. Depaxtment of Computer Science University of Colorado at Boulder Boulder 80309 CO United States Department of Mathematics University of Turku Turku FIN-20500 Finland Department of Computer Science Leiden University P.O.Box 9512 Leiden 2300 RA Netherlands

ISBN: (纸本)3540612289

A labeled 2-structure, ℓ2s for short, is a complete edgelabeled directed graph without loops or multiple edges. An importaxtt result of the theory of 2-structures is the existence of a hierarchical representation of each ℓ2s. ∆ δ -reversible labeled 2-structure g will be identiffed with its labeling function that maps each edge (z, y), z ≠y, of the domain D into a group ∆ so that g(y, z) = δ(g(x, y)) for an involution b of ∆. For each mapping (selector) σ: D →, ∆ a b-reversible 2-structure g is obtained from g by g^σ (z, y) =σ (z)g(z, y)8(σ (y)). A dynamic δ-reversible 2-structure G = [g] generated by g is the set {g^σ [σ a selector}. We define the plane trees of G to capture the hierarchical representation of G as seen by individual elements of the domain. We show that all the plane trees axe strongly related to each other. Indeed, they are all obtainable from one simple unrooted undirected tree - the form of G. thus, quite surprisingly, all hierarchical representations of ℓ2s's belonging to one dynamic ℓ2s G can be combined into one hierarchical representation of G. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

A Robust Approach to Extraction of Texts from Camera Captured Images

A Robust Approach to Extraction of Texts from Camera Capture...

引用

5th international workshop on Camera-based Document Analysis and recognition (CBDAR)

作者： Banerjee, Sudipto Mullick, Koustav Bhattacharya, Ujjwal Indian Stat Inst Comp Vis & Pattern Recognit Unit Kolkata India Heritage Inst Technol Dept Comp Sci & Engn Kolkata India

ISBN: (纸本)9783319051673;9783319051666

Here, we present our recent study of a robust but simple approach to extraction of texts from camera-captured images. In the proposed approach, we first identify pixels which are highly specular. Connected components of this set of specular pixels are obtained. Pixels belonging to each such component are separately binarized using the well-known Otsu's approach. We next apply smoothing on the whole image before obtaining its Canny edge representation. Bounding rectangle of each connected component of the Canny edge image is obtained and multiple components with pairwise overlapping bounding boxes are merged. Otsu's thresholding technique is applied separately on different parts of input image defined by the resulting bounding boxes. Although Otsu's thresholding approach does not generally provide acceptable performance on camera captured images, we observed its suitability when applied severally as in the above. the binarized specular components obtained at the initial stage replace the corresponding regions of the latter binarized image. Finally, a set of postprocessing operations is used to remove certain non-text components of the binarized image.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Structured (de)composable representations trained with neural networks 9th

Structured (de)composable representations trained with neura...

引用

9th IAPR TC3 international workshop on Artificial Neural Networks in pattern recognition, ANNPR 2020

作者： Spinks, Graham Moens, Marie-Francine Department of Computer Science KU Leuven Leuven Belgium

ISBN: (纸本)9783030583088

the paper proposes a novel technique for representing templates and instances of concept classes. A template representation refers to the generic representation that captures the characteristics of an entire class. the proposed technique uses end-to-end deep learning to learn structured and composable representations from input images and discrete labels. the obtained representations are based on distance estimates between the distributions given by the class label and those given by contextual information, which are modeled as environments. We prove that the representations have a clear structure allowing to decompose the representation into factors that represent classes and environments. We evaluate our novel technique on classification and retrieval tasks involving different modalities (visual and language data). © 2020, the Author(s).

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Speeding up graph edit distance computation through fast bipartite matching

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6658 LNCS卷 102-111页

作者： Fankhauser, Stefan Riesen, Kaspar Bunke, Horst Institute of Computer Science and Applied Mathematics University of Bern Neubrückstrasse 10 CH-3012 Bern Switzerland

ISBN: (纸本)9783642208430

In the field of structural pattern recognition graphs constitute a very common and powerful way of representing objects. the main drawback of graph representations is that the computation of various graph similarity measures is exponential in the number of involved nodes. Hence, such computations are feasible for rather small graphs only. One of the most flexible graph similarity measures is graph edit distance. In this paper we propose a novel approach for the efficient computation of graph edit distance based on bipartite graph matching by means of the Volgenant-Jonker assignment algorithm. Our proposed algorithm provides only suboptimal edit distances, but runs in polynomial time. the reason for its sub-optimality is that edge information is taken into account only in a limited fashion during the process of finding the optimal node assignment between two graphs. In experiments on diverse graph representations we demonstrate a high speed up of our proposed method over a traditional algorithm for graph edit distance computation and over two other sub-optimal approaches that use the Hungarian and Munkres algorithm. Also, we show that classification accuracy remains nearly unaffected by the suboptimal nature of the algorithm. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

5th international workshop, workshop on Algorithms and Data Structures, WADS 1997

5th International Workshop, Workshop on Algorithms and Data ...

引用

5th international workshop on Algorithms and Data Structures, WADS 1997

ISBN: (纸本)3540633073

the proceedings contain 42 papers. the special focus in this conference is on Algorithms and Data Structures, Invited Lecture the topics include: Discrepancy theory and Computational Geometry;Dynamic Motion Planning in Low Obstacle Density Environments;Visibility-based Pursuit-Evasion in a Polygonal Environment;Maintaining the Extent of a Moving Point Set;Finding Cores of Limited Length;On Bipartite Crossings, Largest Biptanar Subgraphs, and the Linear Arrangement Problem;Approximation Algorithms for a Genetic Diagnostics Problem;Cartographic Line Simplification and Polygon CSG Formulae in O(n Log'n) Time;Constrained TSP and Low-Power Computing;On-Line Load Balancing for Related Machines;A Linear-Time Algorithm for the 1-Mismatch Problem;On Some Geometric Optimization Problems in Layered Manufacturing;New TSP Construction Heuristics and their Relationships To the 2-Opt;pattern Matching in Hypertext;Multiple Approximate String Matching;Applied Computational Geometry;Checking the Convexity of Polytopes and the Planarity of Subdivisions;Voronoi Diagrams for Polygon-Offset Distance Functions;Randomized Algorithms for that Ancient Scheduling Problem;Optimal Parallel Algorithms for Proximate Points, with Applications;An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments;On Geometric Path Query Problems;On-Line Scheduling with Hard Deadlines;Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access;Parallel vs. Parametric Complexity;Position-Independent Near Optimal Searching and On-Line recognition in Star Polygons;Dynamic Data Structures for Fat Objects and their Applications and Intractability of Assembly Sequencing: Unit Disks in the Plane.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exchange pattern mining in the bitcoin transaction directed hypergraph 21st

Exchange pattern mining in the bitcoin transaction directed ...

引用

21st international workshops on Financial Cryptography and Data Security, FC 2017 held in conjuction with 5th workshop on Encrypted Computing and Applied Homomorphic Cryptography, WAHC 2017, 4th workshop on Bitcoin and Blockchain Research, BITCOIN 2017, 2nd workshop on Advances in Secure Electronic Voting Schemes, VOTING 2017, 1st workshop on Trusted Smart Contracts, WTSC 2017 and 1st workshop on Targeted Attacks, TA 2017

作者： Ranshous, Stephen Joslyn, Cliff A. Kreyling, Sean Nowak, Kathleen Samatova, Nagiza F. West, Curtis L. Winters, Samuel North Carolina State University Raleigh United States Pacific Northwest National Laboratory SeattleWA United States Oak Ridge National Laboratory Oak Ridge United States Pacific Northwest National Laboratory Richland United States

ISBN: (纸本)9783319702773

Bitcoin exchanges operate between digital and fiat currency networks, thus providing an opportunity to connect real-world identities to pseudonymous addresses, an important task for anti-money laundering efforts. We seek to characterize, understand, and identify patterns centered around exchanges in the context of a directed hypergraph model for Bitcoin transactions. We introduce the idea of motifs in directed hypergraphs, considering a particular 2-motif as a potential laundering pattern. We identify distinct statistical properties of exchange addresses related to the acquisition and spending of bitcoin. We then leverage this to build classification models to learn a set of discriminating features, and are able to predict if an address is owned by an exchange with > 80 % accuracy using purely structural features of the graph. Applying this classifier to the 2-motif patterns reveals a preponderance of inter-exchange activity, while not necessarily significant laundering patterns. © international Financial Cryptography Association 2017.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：