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

IEEE International Performance Computing and Communications Conference

作者： Pouya Ostovari Jie Wu Alireza Jolfaei Dept. of Technology San Jose State University San Jose USA Dept. of Computer & Inf. Sciences Temple University Philadelphia USA School of Science Eng. & Inf. Technology Federation University Australia Mount Helen Australia

ISBN: (纸本)9781538668092;9781538668085

Data transmission in delay tolerant networks (DTNs) is a challenging problem due to the lack of continuous network connectivity and nondeterministic mobility of the nodes. Epidemic routing and spray-and-wait methods are two popular mechanisms that are proposed for DTNs. In order to reduce the transmission delay in DTNs, some previous works combine intra-flow network coding with the routing protocols. In this paper, we propose two routing mechanisms using systematic joint inter-and intra-flow network coding for the purpose of data exchange between the nodes. We discuss the reasons why inter-flow network coding helps to reduce the delivery delay of the packets, and we also analyze the delays related with only using intra-flow coding, and joint inter- and intra-flow coding methods. We empirically show the benefit of joint coding over just intra-flow coding. Based on our simulation, joint coding can reduce the delay up to 40%, compared to only intra-flow coding.

关键词： Data exchange Delay tolerant networks Inter-flow coding Intra-flow coding Random linear network coding

来源：评论

学校读者我要写书评

暂无评论

The (too many) problems of analogical reasoning with word vectors 6

The (too many) problems of analogical reasoning with word ve...

引用

6th Joint Conference on Lexical and Computational Semantics, *SEM 2017

作者： Rogers, Anna Drozd, Aleksandr Li, Bofang Dept. of Computer Science University of Massachusetts Lowell LowellMA United States Global Scient. Inf. and Comput. Center Tokyo Institute of Technology Tokyo Japan School of Information Renmin University of China Beijing China

ISBN: (纸本)9781945626531

This paper explores the possibilities of analogical reasoning with vector space models. Given two pairs of words with the same relation (e.g. man:woman :: king:queen), it was proposed that the offset between one pair of the corresponding word vectors can be used to identify the unknown member of the other pair (king-man + woman = ?queen). We argue against such "linguistic regularities" as a model for linguistic relations in vector space models and as a benchmark, and we show that the vector offset (as well as two other, better-performing methods) suffers from dependence on vector similarity. © 2017 Association for Computational Linguistics.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Towards BPM skill assessment using computerized adaptive testing 17

Towards BPM skill assessment using computerized adaptive tes...

引用

9th International Conference on Subject-Oriented Business Process Management, S-BPM ONE 2017

作者： Graf, David Oppl, Stefan Eckmaier, Alexander Dept. of Business Inf. Systems - Communications Engineering Johannes Kepler University of Linz Altenbergerstr. 69 Linz4040 Austria Department of Software Science Radboud University Nijmegen Toernooiveld 212 Nijmegen6525 EC Netherlands

ISBN: (纸本)9781450348621

The assessment of modeling skills is a topic that has hardly been discussed in literature. Being able to assess a modeler's skill level, however, provides valuable input for planning further educational interventions or allows for upfront estimations of capabilities to successfully perform a real-world modeling task. Literature indicates that skill levels can be estimated based on the capability to identify mistakes in given models. We propose to use the metrics specified in the 3QM framework as a foundation for assessing technical modeling skills. Based on these metrics, we have developed testing items for assessing modeler's capabilities to recognize syntactic, semantic and pragmatic issues in models, which serve as an indicator for their modeling skill level. These items are embedded in a computerized adaptive testing platform, which uses item response theory to estimate skill levels. We introduce the testing platform and finally describe the implementation of our test system prototype, which demonstrated the technical feasibility of the chosen approach. © 2017 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Correction of Partial Volume Effect in 99mTc-TRODAT-1 BRAIN SPECT Images Using an Edge-Preserving Weighted Regularization

Correction of Partial Volume Effect in 99mTc-TRODAT-1 BRAIN ...

引用

International Symposium on Biomedical Imaging

作者： Tang-Kai Yin Nan-Tsing Chiu Dept. of Computer Science and Inf. Eng. National University of Kaohsiung Taiwan Dept. of Nuclear Medicine Natl. Cheng Kung Univ. Hospital College of Medicine Tainan Taiwan

ISBN: (纸本)9781509011735

The partial volume effect (PVE) due to the low resolution of SPECT in brain SPECT volumes can be modeled as a convolution of a three-dimensional point-spread function (PSF) with the underlying true radioactivity. In this paper, a de-convolution guided by the edge locations in the geometric transfer matrix (GTM) method as a weighted regularization, denoted as RGTM, was proposed to take into account both the discrepancy from the convolution and the regional-homogeneity prior inf.rmation in the correction of the PVE (PVC). Two steps were conducted: GTM and then a weighted regularization. Twenty digital phantom simulations were made to compare the performance of RGTM with those of Van-Cittert deconvolution (VC), GTM, and the region-based voxel-wise correction (RBV). Clinical data from eighty-four healthy adults with 99mTc-TRODAT-l SPECT and MRI scans were also tested. Because the proposed RGTM was good in both constant and non-constant ROIs, its robustness is better than other methods if the distribution of the underlying radioactivity is not known exactly.

关键词： Partial volume correction regularization prior anatomical inf.rmation geometric transfer matrix SPECT

来源：评论

学校读者我要写书评

暂无评论

Source-level compiler optimizations for high-level synthesis 16

Source-level compiler optimizations for high-level synthesis

引用

ACM South-East Europe Design Automation, computer engineering, computer Networks and Social Media Conference, SEEDA-CECNSM 2016

作者： Dimitriou, Georgios Chatzianastasiou, Georgios Tsakyridis, Apostolos Stamoulis, Georgios Dossis, Michael Dept. of Electrical and Computer Engineering University of Thessaly Volos Greece Dept. of Inf. Engineering TEI of W. Macedonia Kastoria Greece

ISBN: (纸本)9781450348102

With high-level synthesis becoming the preferred method for hardware design, tools that operate on high-level programming languages and optimize hardware output are crucial for successful synthesis. In high-level synthesis, conventional programming language codes describe hardware behavior. Those codes are translated into RTL-level description by some appropriate tool. Common such tools that not only translate, but also optimize code, are programming language compilers. Compilers can make the transition from software to hardware smooth, allowing programmers to use their software skills on hardware programming, without any language compromises. Nonetheless, compilers also utilize optimization techniques to obtain a better output hardware description. In this paper, we discuss compiler issues for high-level synthesis, and present the results of several compiler transformations that can be implemented on our C language compiler front end of the CCC high-level synthesis tool. The results are taken from experiments conducted on the MPEG2 open-source codes, and prove the importance of such transformations in high-level synthesis. Copyright is held by the owner/author(s).

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

On the parikh-de-bruijn grid

arXiv

引用

arXiv 2017年

作者： Burcsi, Péter Lipták, Zsuzsanna Smyth, W.F. Dept. of Computer Algebra Eötvös Loránd Univ. Budapest Hungary Dip. di Informatica University of Verona Verona Italy Dept. of Computing and Software McMaster University Hamilton Canada School of Engineering and Inf. Techn. Murdoch University Perth Australia

68R15 (Primary), 68W32 (Secondary)We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural insight into the nature of sets of Parikh vectors as well as that of the Parikh set of a given string. We show its utility by proving some results on Parikh-de-Bruijn strings, the abelian analog of de-Bruijn sequences. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection and monitoring in Internet of Things communication

Anomaly detection and monitoring in Internet of Things commu...

引用

International Conference on inf.rmation Technology and Electrical engineering (ICITEE)

作者： Deris Stiawan Mohd. Yazid Idris Reza Firsandaya Malik Siti Nurmaini Rahmat Budiarto Department of Computer Engineering Universitas Sriwijaya Dept. Soft Engineering Universiti Teknologi Malaysia College of Computer Science & Inf. Technology Albaha University Saudi Arabia

ISBN: (纸本)9781509041404

The Internet of Things (IoT) presents unique challenges in detecting anomaly and monitoring all connected devices in a network. Moreover, one of the objectives of anonymity in communication is to protect the data traffic of devices. The summary status visualization is indispensable to depict all devices/sensors that are most indicative of a pending failure and a predictive power/energy. Thus, this paper proposes a multi-platform monitoring and anomaly detection system that supports heterogeneous devices. The proposed system addresses the problems of: (i) how to monitor the network to prevent device failures and (ii) how to design a comprehensive feature for the early anomaly detection of IoT communication.

关键词： Heterogeneous Monitoring Detection Anomaly Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Universal 2-State 24-Neighborhood Asynchronous Cellular Automaton with Inner-Independent Open Rule

Universal 2-State 24-Neighborhood Asynchronous Cellular Auto...

引用

International Symposium on Computing and Networking (CANDAR)

作者： Susumu Adachi Jia Lee Ferdinand Peper Hiroshi Umeo College of Computer Science Chong Qing University China Center for Inf. & Neural Networks Nat. Inst. of Inf. & Commun. Japan Dept. of Computer Science Osaka Electro-Communication University Japan

ISBN: (纸本)9781509026562

This paper proposes a computationally universal two-dimensional square-lattice asynchronous cellular automaton, in which cells have merely two states. The transition rule of a cell is specified by the pattern of the cells or its rotation-symmetric or reflection-symmetric rules included in distances 1 and 2 Moore neighborhood, which does not include its own cell (inner-independent). In a former model, we defined only the rules where the neighboring patterns are taken into account in computation. In the current model, the transition rule is an open rule, which is defined completely in terms of updating 0 or 1. Universality of the model is proven through the construction of a glider and three circuit primitives on the cell space, which are universal for the class of Delay-Insensitive circuits. Correct operation of the circuit is proven through a validity check algorithm which checks all generated patterns from an initial configuration to a final configuration of the operation. As a result, the number of rules to update to 1 is found to be 1618, not including the rotation-symmetric and reflection-symmetric versions of the rules. We show how to determine the open rules of the model, and how to define the energy function to obtain an energy evolution during the operation of the circuit.

关键词： Computational modeling Integrated circuit modeling Automata Delays Radiation detectors computer science Asynchronous circuits

来源：评论

学校读者我要写书评

暂无评论

An unconditionally stable approximation of a circular flexible plate described by a fourth order partial differential equation

An unconditionally stable approximation of a circular flexib...

引用

International Conference on Methods and Models in Automation and Robotics (MMAR)

作者： Petr Augusta Blazej Cichy Krzysztof Gałkowski Eric Rogers Inst. of Inf. Theory and Automation The Czech Academy of Sciences Prague Czech Republic Dept. of Electronics and Computer Science University of Southampton Southampton UK

An unconditionally stable finite difference scheme for systems whose dynamics are described by a second-order partial differential equation is developed with use of regular hexagonal grid. The scheme is motivated by the well-known Crank-Nicolson discretization which was developed for first-order systems. The stability of the finite-difference scheme is analyzed by von Neumann's method. Using the new scheme, a discrete in time and space model of a deformable mirror is derived as the basis for control law design. The convergence of this scheme for various values of the discretization parameters is checked by numerical simulations.

关键词： Mathematical model Numerical stability Stability analysis Numerical models Partial differential equations Power system stability Mirrors

来源：评论

学校读者我要写书评

暂无评论

Dynamic content selection-and-prediction framework applied to reversible data hiding

Dynamic content selection-and-prediction framework applied t...

引用

IEEE International Workshop on inf.rmation Forensics and Security (WIFS)

作者： Han-Zhou Wu Hong-Xia Wang Yun-Qing Shi School of Inf. Science & Technology Southwest Jiaotong University Chengdu P. R. China Dept. of Electrical & Computer Engineering New Jersey Institute of Technology Newark NJ United States

ISBN: (纸本)9781509011391

The existing reversible data hiding (RDH) methods often use a fixed pixel preselection pattern and predictor to generate prediction errors that are then utilized for embedding secret data. According to Kerckhoffs's principle, this deterministic operation may allow an illegal decoder to successfully reconstruct the marked prediction-error histogram from a marked image, which is not desirable in application scenarios. This has prompted us to propose a dynamic content selection-and-prediction framework for the RDH in this paper. The proposed framework aims to auto-preselect the complex pixels out from a given image to predict the rest pixels that are thereafter exploited to carry the secret data. Comparing with some state-of-the-art algorithms, the proposed technique guarantees that, the illegal decoder will hardly locate the whole marked pixels and determine the marked prediction errors, which can ensure the security level. In our designed framework, after pixel selection and prediction, there exists a lot of freedom to design the data embedding procedure, meaning that, the proposed framework can be applied to the design of an RDH scheme. In the experiments, we simply employ an optimized histogram shifting operation for data embedding after applying the proposed framework. Our experimental results have shown that, the data embedding process can benefit from the proposed pixel selection and prediction procedure with relatively low embedding rates, and therefore significantly outperform some related works in terms of the payload-distortion performance, especially for images with more smooth regions.

关键词： Complexity theory Histograms Receivers Prediction algorithms Image edge detection Context Electronic mail

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：