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

10th international workshop on Combinatorial Image Analysis, IWCIA 2004

10th international workshop on Combinatorial Image Analysis, IWCIA 2004

ISBN: (纸本)9783540239420

the proceedings contain 58 papers. the special focus in this conference is on Combinatorial Image Analysis. the topics include: Binary matrices under the microscope;on the reconstruction of crystals through discrete tomography;binary tomography by iterating linear programs from noisy projections;hexagonal pattern languages;a combinatorial transparent surface modeling from polarization images;integral trees: subtree depth and diameter;supercover of non-square and non-cubic grids;calculating distance with neighborhood sequences in the hexagonal grid;z-tilings of polyominoes and standard basis;curve tracking by hypothesis propagation and voting-based verification;3D topological thinning by identifying non-simple voxels;convex hulls in a 3-dimensional space;on recognizable infinite array languages;on the number of digitizations of a disc depending on its position;on the language of standard discrete planes and surfaces;characterization of bijective discretized rotations;magnification in digital topology;simple points and generic axiomatized digital surface-structures;jordan surfaces in discrete antimatroid topologies;algorithms in digital geometry based on cellular topology;an efficient euclidean distance transform;two-dimensional discrete morphing;a comparison of property estimators in stereology and digital geometry;thinning by curvature flow;convex functions on discrete sets;discrete surface segmentation into discrete planes;corner detection and curve partitioning using arc-chord distance;shape preserving sampling and reconstruction of grayscale images;junction and corner detection through the extraction and analysis of line segments tree species recognition with fuzzy texture parameters and joint non-rigid motion estimation and segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Large-scale time-resolved digital particle image velocimetry (TR-DPIV) for measurement of high subsonic hot coaxial jet exhaust of a gas turbine engine

引用

MEASUREMENT SCIENCE AND TECHNOLOGY 2009年第7期20卷 074002 (15-074002 (15页

作者： Timmerman, B. H. Skeen, A. J. Bryanston-Cross, P. J. Graves, M. J. Univ Warwick Opt Engn Lab Sch Engn Coventry CV4 7AL W Midlands England

the development of a highly configurable triple digital particle image velocimetry (DPIV) system is described, which is capable of acquiring both continuous, statistically independent measurements at up to 14 Hz and time-resolved PIV data at MHz rates. the system was used at QinetiQ's Noise Test Facility (NTF) as part of the EU-funded CoJeN programme to obtain measurements from high subsonic (Mach <= 0.9), hot (similar to 500 degrees C), large (1/10th) scale coaxial jet flows at a standoff distance of similar to 1 m. High-resolution time-averaged velocity and turbulence data were obtained for complete coaxial engine exhaust plumes down to 4 m (20 jet diameters) from the nozzle exit in less than 1 h. In addition, the system allowed volumetric data to be obtained, enabling fast assessment of spatial alignment of nozzle configurations. Furthermore, novel six-frame time-series data-capture is demonstrated up to 330 kHz, used to calculate time-space correlations within the exhaust, allowing for study of spatio-temporal developments in the jet, associated with jet-noise production. the highly automated system provides synchronization triggers for simultaneous acquisition from different measurement systems (e.g. LDA) and is shown to be versatile, rugged, reliable and portable, operating remotely in a hostile environment. data are presented for three operating conditions and two nozzle geometries, providing a database to be used to validate CFD models of coaxial jet flow.

关键词： digital particle image velocimetry coaxial jet noise Noise Test Facility aero-acoustics space-time correlations coherent structures high subsonic

来源：评论

学校读者我要写书评

暂无评论

Structural inference for semistructured data 01

Structural inference for semistructured data

引用

Proceedings of the 2001 ACM CIKM: 10th international Conference on Information and Knowledge Management

作者： Sankey, Jason Wong, Raymond K. Basser Dept. of Computer Science University of Sydney Sydney NSW 2006 Australia

ISBN: (纸本)9781581134360

Semistructured data presents many challenges, mainly due to its lack of a strict schema. these challenges are further magnified when large amounts of data are gathered from heterogeneous sources. We address this by investigation and development of methods to automatically infer structural information from example data. Using XML as a reference format, we approach the schema generation problem by application of inductive inference theory. In doing so, we review and extend results relating to the search spaces of grammatical inferences. We then adapt a method for evaluating the result of an inference process from computational linguistics. Further, we combine several inference algorithms, including both new techniques introduced by us and those from previous work. Comprehensive experimentation reveals our new hybrid method, based upon recently developed optimisation techniques, to be the most effective.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

General Preference Structure with Uncertainty data Present by Interval-Valued Fuzzy Relation and Used in Decision Making Model 4th

引用

10th Conference of the European-Society-for-Fuzzy-Logic-and-Technology (EUSFLAT) / 16th international workshop on Intuitionistic Fuzzy Sets and Generalized Nets (IWIFSGN)

作者： Pekala, Barbara Univ Rzeszow Fac Math & Nat Sci Interdisciplinary Ctr Computat Modelling Pigonia 1A PL-35310 Rzeszow Poland

ISBN: (纸本)9783319668277;9783319668260

Interval-valued fuzzy relations can be interpreted as a tool that may help to model in a better way imperfect information, especially under imperfectly defined facts and imprecise knowledge. Preference structures are of great interest nowadays because of their applications. From a weak preference relation derive the following relations: strict preference, indifference and incomparability, which by aggregations and negations are created and examined in this paper. Moreover, we propose the algorithm of decision making by using new preference structure.

关键词： Interval-valued fuzzy relations Preference relations Reciprocity property

来源：评论

学校读者我要写书评

暂无评论

Trace-based automatic padding for locality improvement with correlative data visualization interface

Trace-based automatic padding for locality improvement with ...

引用

10th workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing Symposium

作者： Hoebbel, Marco Rauber, thomas Scholtes, Carsten Univ Bayreuth Fachgrp Informat D-95440 Bayreuth Germany

ISBN: (纸本)9781424416936

the efficient use of the cache hierarchy of an execution platform often has a major impact on the performance of an application. It is often difficult for the application programmer or the compiler to determine a suitable memory layout for the application data, since the interactions between the memory accesses cannot be fully anticipated before the program execution. this paper introduces an approach to improve the cache efficiency by dynamically padding memory allocations by a post-compilation tool. data structures like histograms are used to evaluate cache simulations of memory traces of the application considered and to compute optimized pad sets. these can then be used for later runs of the application with different data sets. the accumulated representation of the references' memory accesses additionally offers a visualization interface to the algorithm-specific memory access pattern of each reference captured. As implied above, the advantage of the method is that it also allows for an improvement of the cache usage of binary only applications for which no source code is available. Post optimization cache behavior analyses as well as run-time measurements show that the cache hit rates of the runtime-modified applications are considerably increased by applying the generated pad set.

关键词： cache optimization automated dynamic padding memory traces performance visualization

来源：评论

学校读者我要写书评

暂无评论

A Learnable-by-Design (LEAD) Model for Designing Experiments for Computer Science Labs 10

A Learnable-by-Design (LEAD) Model for Designing Experiments...

引用

10th IEEE international Conference on Technology for Education, T4E 2019

作者： Kumar, Mrityunjay Choppella, Venkatesh Sunil, Sanjana Syed, Sumaid IIIT Hyderabad Hyderabad India

ISBN: (纸本)9781728142272

India graduates 1.5 million engineering students every year, majority of them from its Tier 2 and Tier 3 colleges where there is severe shortage of qualified faculty and lab infrastructure, and where English is second or third language for most students. To provide affordable virtual laboratories to these engineering colleges, Government of India runs the Virtual Labs project with a select set of participating institutions to create virtual labs required for entire engineering student population of India. the program suffers from two problems: 1) lack of focus on pedagogy and learnability of labs being created, and 2) little ability to scale to more teachers and subject matter experts to produce labs aligned to local contexts. this paper presents a model (LEAD model) for the design of virtual labs for a data structures and algorithms course in computer science and is intended to address the problems stated above. the model encodes the principles of learning in the design and structure of an experiment so that labs can be learnable by design. the model is based on constructivist theory of learning. It uses Bloom's Taxonomy for defining learning objectives and applies Merrill's first principles and Gagne's 9 events of instruction as instructional design methodologies. To ensure tasks in an experiment indeed aid learning, the model requires a mapping between tasks and learning principles to be created and published along with the experiment. the model uses a pedagogy that lays strong emphasis on conceptual understanding without the use of code or program. To demonstrate the efficacy of this model, we present the data analysis of the feedback from early users of one the experiments. Even though limited in scope, data shows that experiments built using LEAD model can aid understanding for the students. © 2019 IEEE.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Intellectual analysis and basic modeling of complex threats 10

Intellectual analysis and basic modeling of complex threats

引用

10th Anniversary international Scientific and Technical Conference on Secure Information Technologies, BIT 2019

作者： Korneev, Nikolai Merkulov, Vyacheslav Faculty of Integrated Security of Fuel and Energy Complex Gubkin Russian State University of Oil and Gas National Research University Moscow Russia Department of Data Analysis Decision-Making and Financial Technology Financial University under the Government of the Russian Federation Moscow Russia

the paper describes the basic principles of complex threats modeling, and the task of complex threats detection is formalized. the proposed modeling principles are based on the idea of identifying the links between elementary threats as part of a complex one. As an example, the process of constructing a complex threat model based on the proposed modeling rules is given. Based on the examples presented in the work, the paper includes the description of tasks while working with complex threats: the tasks of complex threats detection, the identification of their inner structure and purposes of the implementation. Based on the formulated principles of basic modeling, the paper also gives a formal statement of complex threats detection problem, which explains the possibility for applying data mining algorithms and big data processing technologies in the construction of protection systems against complex threats and developing the neurographic theory of complex security. Copyright © 2019 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 international (CC BY 4.0)

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Visualization of Graph structures with Magnetic-Spring Model and Color-Coded Interaction

Visualization of Graph Structures with Magnetic-Spring Model...

引用

10th international Baltic Conference on databases and Information Systems (DB and IS)

作者： Zabiniako, Vitaly Riga Tech Univ Riga Latvia

ISBN: (纸本)9781614991618;9781614991601

In this paper author provides description of the original approach for visual analysis of data represented with general graphs, based on modification of magnetic-spring model and color-coded cognitive manipulation with graph elements. the theoretical background of magnetic fields in application to graph drawing is presented along with discussion of appropriate visualization techniques for improved information analysis and comprehension. Usage of other existing graph layout strategies (e. g. hierarchical, circular) in conjunction with magnetic-spring approach are also considered for improved data representation capabilities. A concept of integrated virtual workshop for graph visualization is introduced which relies on aforementioned model and can be used in GVS (Graph Visualization Systems). A case study of application of proposed approach is presented along with conclusions of its usability and potential future work in this field.

关键词： Graph analysis magnetic-spring model color-coded interaction

来源：评论

学校读者我要写书评

暂无评论

Automated digital geological mapping based on 3D photogrammetry 10

Automated digital geological mapping based on 3D photogramme...

引用

10th Asian Rock Mechanics Symposium, ARMS 2018

作者： Zhang, Peng Tannant, Dwayne D. Zhu, Hehua Nanjing Tech University Nanjing210009 China University of British Columbia KelownaV1V 1V7 Canada Tongji University Shanghai200009 China

ISBN: (纸本)9789811190032

this paper briefly introduces a series of workflows for automated digital geological mapping based on 3D photogrammetry. the 3D photogrammetry technique can produce a detailed 3D digital model of the area of interest including point cloud data to characterize the geometric features of geological structures in the scene and image data to characterize the visual features in the scene. the proposed workflow uses double-nested mean-shift clustering and region growth to extract discontinuity surfaces from point clouds. Discontinuities traces can be extracted from image data using a hybrid global and local threshold method and integrating a series of image-processing algorithms. the trace’s corresponding coordinates are acquired by linking the pixel locations corresponding to the identified traces in an image to the 3D coordinates in the point cloud based on fusing the point cloud data and image data. Finally, geological analysis can be performed to accurately measure the spatial geometry characteristics of the mapped discontinuities. © 2018 ISRM & SRMEG (Singapore)

关键词： data fusion

来源：评论

学校读者我要写书评

暂无评论

A verified algebra for linked data 10

A verified algebra for linked data

引用

10th international workshop on the Foundations of Coordination Languages and Software Architectures, FOCLASA 2011

作者： Horne, Ross Sassone, Vladimiro Electronics and Computer Science University of Southampton United Kingdom

A foundation is investigated for the application of loosely structured data on the Web. this area is often referred to as Linked data, due to the use of URIs in data to establish links. this work focuses on emerging W3C standards which specify query languages for Linked data. the approach is to provide an abstract syntax to capture Linked data structures and queries, which are then internalised in a process calculus. An operational semantics for the calculus specifies how queries, data and processes interact. A labelled transition system is shown to be sound with respect to the operational semantics. Bisimulation over the labelled transition system is used to verify an algebra over queries. the derived algebra is a contribution to the application domain. For instance, the algebra may be used to rewrite a query to optimise its distribution across a cluster of servers. the framework used to provide the operational semantics is powerful enough to model related calculi for the Web.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：