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

Conference of the World-Academy-of-Science-Engineering-and-Technology

作者： Tuefeki, Pinar Kilicaslan, Yilmaz Trakya Univ Corlu Fac Engn Elect & Commun Engn Dept Tekirdag Turkey

In this paper we present a computational model for pronominal anaphora resolution in Turkish. The model is based on Hobbs' naive algorithm [4, 5, 6], which exploits only the surface syntax of sentences in a given ... 详细信息

ISBN: (纸本)9759845849

关键词： Anaphora Resolution Pronoun Resolution Syntax-based algorithms naive algorithm

来源：评论

学校读者我要写书评

暂无评论

Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs

引用

FUNDAMENTA INFORMATICAE 2020年第1期174卷 1-13页

作者： Ahmad, Ali Asim, Muhammad Ahsan Assiri, Basem Semanicova-Fenovcikova, Andrea Jazan Univ Coll Comp Sci & Informat Technol Jazan Saudi Arabia Tech Univ Dept Appl Math & Informat Kosice Slovakia

A vertex labeling phi : V (G) -> {1, 2, ..., k} is called an edge irregular k-labeling of a graph G if all edges in G have unique weights. The weight of an edge is defined as the sum of the labels of its incident vertices. The minimum k for which the graph G has an edge irregular k-labeling is called the edge irregularity strength of G, denoted by es(G). In this paper we perform a computer based experiment dealing with the edge irregularity strength of complete bipartite graphs. We also present some bounds on this parameter for wheel related graphs.

关键词： edge irregularity strength bipartite graph wheel graph fan graph friendship graph naive algorithm

来源：评论

学校读者我要写书评

暂无评论

A survey of video encryption algorithms

引用

COMPUTERS & SECURITY 2010年第1期29卷 3-15页

作者： Liu, Fuwen Koenig, Hartmut Brandenburg Tech Univ Cottbus Dept Comp Sci D-03013 Cottbus Germany

The popularity of multimedia applications is rapidly growing nowadays. The confidentiality of video communication is of primary concern for commercial usage, e.g. in video on demand services or business meetings. A variety of video encryption algorithms have been proposed in order to fulfill the specific requirements raised by the peculiarities of video communication. Video encryption algorithms can be classified according to their association with video compression into joint compression and encryption algorithms, and compression-independent encryption algorithms. From this classification perspective, we give a complete survey of the representative video encryption algorithms proposed so far and present their properties and limitations. We show by comparing and assessing the surveyed schemes that each scheme has its own strengths and weaknesses and no scheme can meet all specific requirements. Hence, video applications have to select an appropriate video encryption algorithm that meets their confidentiality requirements. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Security requirements naive algorithm Video encryption Video compression Video encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient ways of prime number generation for ring signatures

引用

IET INFORMATION SECURITY 2016年第1期10卷 33-36页

作者： Luis Salazar, Jose Luis Tornos, Jose Josep Piles, Joan Univ Zaragoza Dept Elect Engn & Commun Zaragoza Spain

The authors describe two different algorithms to perform efficiently the ring signature keys generation. Given an integer size, l, their algorithms find efficiently (memory and time, respectively) two distinct l/2-bit primes (e(1), e(2)) such that e = 2e(1)e(2) + 1 will be a prime integer. With a naive algorithm one only needs to store O(l) bits (more specifically, only one l/2-integer), and need, in average, O(l(4)) basic l-bit operations. With the second algorithm, one not only improves this computational complexity O(l(7/2)), but also needs to use, in average, O(l(3/2)) bits. The authors consider these algorithms useful for implementing ring signatures in mobile devices where there exist strong time and space constraints.

关键词： computational complexity mobile computing digital signatures prime number generation ring signature key generation l 2-bit primes prime integer naive algorithm l 2-integer l-bit operations computational complexity mobile devices space constraints

来源：评论

学校读者我要写书评

暂无评论

RANDOM GRAPH ISOMORPHISM: 收藏
分享
引用; SIAM JOURNAL ON COMPUTING 1980年第3期9卷 628-635页; 作者： BABAI, L ERDOS, P SELKOW, SM; A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but o(2<sp; A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but $o (2^{(\begin{array}{l} n \\ 2 \end{array})})$; 关键词： graph isomorphism testing canonical labeling random graph naive algorithm average-case analysis linear time degree sequence of a graph; 来源：评论; 学校读者我要写书评

暂无评论

An Area-Overhead-Oriented Monitoring-Path Selection algorithm for Suspicious Timing Error Prediction

An Area-Overhead-Oriented Monitoring-Path Selection Algorith...

引用

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)

作者： Yoshida, Shinnosuke Shi, Youhua Yanagisawa, Masao Togawa, Nozomu Waseda Univ Dept Comp Sci & Commun Engn Tokyo Japan Waseda Univ Waseda Inst Adv Study Tokyo Japan

ISBN: (纸本)9781479952304

As process technologies advance, the importance of timing error correction techniques is increasing as well. In this paper, We propose an area-overhead-oriented monitoring-path selection algorithm for suspicious timing error prediction circuits (STEPCs). STEPC predicts timing errors by monitoring the middle points of several speed-paths in a circuit. However, we need many STEPCs with a high area overhead to predict timing errors in an overall circuit. Our proposed method moves the STEPC insertion positions to minimize the number of inserted STEPCs. We apply a max-flow and min-cut approach to determine the optimal positions of inserted STEPCs. Our proposed algorithm reduces the required number of STEPCs to 1/19 and their area to 1/5 compared with a naive algorithm. Furthermore, our algorithm realizes 2.25X overclocking compared with just inserting STEPCs into several speed-paths.

关键词： error correction graph theory timing circuits STEPC insertion positions area-overhead-oriented monitoring-path selection algorithm max-flow approach min-cut approach naive algorithm speed-paths suspicious timing error prediction circuits timing error correction techniques algorithm design and analysis Clocks Delays Logic gates Monitoring Registers algorithm design and analysis timing circuits selection algorithm Registers error forecasting Timing devices Logic gates error correction Graph theory TIMING ERROR Maximum Flow dividing and cutting machine delay

来源：评论

学校读者我要写书评

暂无评论

Time Series Join on Subsequence Correlation 14

Time Series Join on Subsequence Correlation

引用

14th IEEE International Conference on Data Mining (IEEE ICDM)

作者： Mueen, Abdullah Hamooni, Hossein Estrada, Trilce Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA

ISBN: (纸本)9781479943036

We consider the problem of joining two long time series based on their most correlated segments. Two time series can be joined at any locations and for arbitrary length. Such join locations and length provide useful knowledge about the synchrony of the two time series and have applications in many domains including environmental monitoring, patient monitoring and power monitoring. However, join on correlation is a computationally expensive task, specially when the time series are large. The naive algorithm requires O(n(4)) computation where n is the length of the time series. We propose an algorithm, named Jocor, that uses two algorithmic techniques to tackle the complexity. First, the algorithm reuses the computation by caching sufficient statistics and second, the algorithm prunes unnecessary correlation computation by admissible heuristics. The algorithm runs orders of magnitude faster than the naive algorithm and enables us to join long time series as well as many small time series. We propose a variant of Jocor for fast approximation and an extension to a GPU-based parallel method to bring down the running-time to interactive level for analytics applications. We show three independent uses of time series join on correlation which are made possible by our algorithm.

关键词： approximation theory graphics processing units mathematics computing parallel processing statistical analysis time series GPU-based parallel method Jocor approximation arbitrary length environmental monitoring naive algorithm patient monitoring power monitoring statistics subsequence correlation time series joining Computer science Correlation Educational institutions Equations Euclidean distance Standards Time series analysis Alignment Matching Similarity Time Series Time series mathematics computing Patient Monitoring Educational institutions computer science environmental monitoring Approximation Theory time series analysis PARALLEL PROCESSING (COMPUTERS) Euclidean distance approximation

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-656

引用

2016年

[Auto Generated] 1 Introduction 9 1.1 Performance Prediction 11.1 Introduction How do you determine the running time of a program without actually running it? How do you design an ef cient out-of-core iterative algorithm? These are the two questions answered in this thesis. The rst part of the thesis presents a solution to the rst question. The second part of the thesis presents techniques that create locality of reference in iterative numerical algorithms and thus improve their performance. 1.1

关键词： algorithm algorithms conjugate gradient decoupled rowwise linear linear relaxation mit-lcs-tr-656 models naive algorithm performance performance prediction perfsim primary memory program relaxation running time running times runtime runtime system simple linear vector

来源：评论

学校读者我要写书评

暂无评论

Demonstrační program vyhledávání řetězců v textu

Demonstrační program vyhledávání řetězců v textu

引用

作者： Šatka, Petr Brno University of Technology

V mé práci se zabývám problematikou vyhledávacích algoritmů. Cílem bylo vytvořit program pro demonstraci principu algoritmů pro vyhledávání v textu uvedených v op... 详细信息

V mé práci se zabývám problematikou vyhledávacích algoritmů. Cílem bylo vytvořit program pro demonstraci principu algoritmů pro vyhledávání v textu uvedených v opoře pro předmět Algoritmy. Vytvořený program tyto algoritmy názorně demonstruje pomocí animací.

关键词： vyhledávání výukový program naivní algoritmus Knuth-Morris-Prattovův algoritmus Bayer- Mooreovův algoritmus Baeza-Yates-Gonnetův algoritmus algoritmus Quicksearch Karp-Rabinův algoritmus searching demonstration program naive algorithm Knuth-Mor

来源：评论

学校读者我要写书评

暂无评论

Decoding HMMs using the k best paths: algorithms and applications

引用

BMC BIOINFORMATICS 2010年第Sup1期11卷 S28-S28页

作者： Brown, Daniel G. Golod, Daniil Univ Waterloo Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada

Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state. These algorithms provide only a single answer and in practice do not produce good results. Results: We explore an alternative approach, where we efficiently compute the k paths of highest probability to explain a sequence and then either use those paths to explore alternative explanations for a sequence or to combine them into a single explanation. Our procedure uses an online pruning technique to reduce usage of primary memory. Conclusion: Out algorithm uses much less memory than naive approach. For membrane proteins, even simple path combination algorithms give good explanations, and if we look at the paths we are combining, we can give a sense of confidence in the explanation as well. For proteins with two topologies, the k best paths can give insight into both correct explanations of a sequence, a feature lacking from traditional algorithms in this domain.

关键词： Hide Markov Model State Node Good Path Viterbi algorithm naive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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