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

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： He, Chen Lv, Xudong Wang, Z. Jane Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9781424423538

Electroencephalogram (EEG) recordings of brain waves have been shown to have unique pattern for each individual and thus have potential for biometric applications. In this paper, we propose an EEG feature extraction and hashing approach for person authentication. Multi-variate autoregressive (mAR) coefficients are extracted as features from multiple EEG channels and then hashed by using our recently proposed Fast Johnson-Lindenstrauss Transform (FJLT)-based hashing algorithm to obtain compact hash vectors. Based on the EEG hash vectors, a Naive Bayes probabilistic model is employed for person authentication. Our EEG hashing approach presents a fundamental departure from existing methods in EEG-biometry study. The promising results suggest that hashing may open new research directions and applications in the emerging EEG-based biometry area.

关键词： biometrics electroencephalogram (EEG) hashing dimension reduction probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

Behavior Analysis Modulus for harbor security

Behavior Analysis Modulus for harbor security

引用

MTS/IEEE Oceans Conference

作者： Zouaoui, Salma Roy, Valerie Maizi, Nadia MINES ParisTech Paris France

ISBN: (纸本)9781467308298;9781467308304

This paper focuses on protecting harbor by monitoring the behavior of ships moving in the harbor. In particular, we propose to combine a probabilistic Hidden Markov Model approach with a formal language approach to model and recognize usual and unusual ship behavior. The probabilistic approach was mainly used to recognize usual ship behavior. However, the reactive approach was used to recognize abnormal ship behavior and classify it into aggressive and transgressive. By combining probabilistic and reactive approaches, we conceived a Behavior Analysis Modulus that we called BAM. It is a decision support system for port team security that aims to generate security advice on ships as they enter into the harbor.

关键词： Markov process probabilistic algorithm synchronous reactive language decision support

来源：评论

学校读者我要写书评

暂无评论

GCD of random linear combinations

GCD of random linear combinations

引用

15th Annual International Symposium on algorithms and Computation

作者： von zur Gathen, Joachim Shparlinski, Igor E. Univ Bonn BIT Comp Secur D-53113 Bonn Germany Macquarie Univ Dept Comp Sydney NSW 2109 Australia

We show that for arbitrary positive integers a(1),..., a(m), with probability 6/pi(2) + o(1), the gcd of two linear combinations of these integers with rather small random integer coefficients coincides with gcd(a(1),..., a(m)). This naturally leads to a probabilistic algorithm for computing the gcd of several integers, with probability 6/pi(2) + o(1), via just one gcd of two numbers with about the same size as the initial data ( namely the above linear combinations). This algorithm can be repeated to achieve any desired confidence level.

关键词： GCD probabilistic algorithm Euler function linear combinations

来源：评论

学校读者我要写书评

暂无评论

Smartphone Strategic Sampling in Defending Enterprise Network Security

Smartphone Strategic Sampling in Defending Enterprise Networ...

引用

IEEE International Conference on Communications (ICC)

作者： Li, Feng Peng, Wei Huang, Chin-Tser Zou, Xukai Indiana Univ Purdue Univ Dept Comp Informat & Graph Technol Indianapolis IN 46204 USA Indiana Univ Purdue Univ Dept Comp & Informat Sci Indianapolis IN 46204 USA Univ S Carolina Dept Comp Sci & Engn Columbia SC 29208 USA

ISBN: (纸本)9781467331227

Smartphones have made their inroads in enterprise environment, manifested in the Bring Your Own Device (BYOD) policy: More employees are bringing their own smartphones to work and are using them to access enterprise information assets. The dilemma between responsiveness to security incidents and convenience/cost-effectiveness demands BYOD security solutions beyond the straightforward all-inclusive full-scanning or uniformly random sampling approaches. In this paper, we propose a carefully planned but otherwise random, or strategic, sampling approach out of this dilemma. Strategic sampling provides a balance between security responsiveness and cost effectiveness by identifying and periodically sampling those representative smartphones (security-wise). We validate the efficiency and effectiveness of the proposed strategic sampling via simulations driven by publicly available, real-world collected traces.

关键词： Enterprise network lottery tree smartphone security social network strategic sampling probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

The entropy source of pseudo random number generators: from low entropy to high entropy 17

The entropy source of pseudo random number generators: from ...

引用

17th IEEE Annual International Conference on Intelligence and Security Informatics (ISI)

作者： Wang, Jizhi Pan, Jingshan Wu, Xueli Chinese Acad Sci Inst Informat Engn Beijing Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing Peoples R China Shandong Acad Sci Natl Supercomp Ctr Jinan Shandong Comp Sci Ctr Shandong Prov Key Lab Comp Networks Jinan Peoples R China Qilu Univ Technol Sch Cyber Secur Jinan Peoples R China Ocean Univ China Coll Informat Sci & Engn Qingdao Peoples R China China United Network Commun Grp Co Ltd Jinan Branch Informat Serv Ctr Jinan Peoples R China

ISBN: (纸本)9781728125046

The pseudo random number generators (PRNG) is one type of deterministic functions. The information entropy of the output sequences depends on the entropy of the input seeds. The output sequences can be predicted if attackers could know or control the input seeds of PRNGs. Against that, it is necessary that the input seeds is unpredictable, that is to say, the information entropy of the seeds is high enough. However, if there is no high enough entropy sources in environment, how to generate the seeds of PRNG? In other words, how to increase the entropy of the input seeds? Many approaches for extracting entropy from physical environment have been proposed, which lack of theoretical analysis. The condition of entropy's increasing is given. A model is built to verify the condition based on the functional programming language F*. An example of entropy's increasing is proposed utilizing execution time randomness of arbitrary codes. Then an algorithm is described, which can generate the seed when the entropy value is given.

关键词： Pseudo Random Number Generator Information Entropy Seed F* Language probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

Several Remarks on Index Generation Functions

Several Remarks on Index Generation Functions

引用

42nd IEEE International Symposium on Multiple-Valued Logic (ISMVL)

作者： Simovici, Dan A. Zimand, Marius Pletea, Dan Univ Massachusetts Dept Comp Sci Harbor Campus Boston MA 02125 USA Towson Univ Dept Comp & Informat Sci Towson MD USA

We propose a probabilistic greedy algorithm for decomposing partially specified index generation functions. These functions have numerous applications in a variety of circuit design problems. We show that finding an o... 详细信息

ISBN: (纸本)9780769546735

关键词： index generation function NP-complete probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

Simulated simulated annealing

引用

American Journal of Mathematical and Management Sciences 1988年第3-4期8卷 389-461页

作者： Tovey, Craig A. School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta 30332 Georgia

The principal shortcoming of simulated annealing (SA) is that it takes too much computer time. We present a few “swindling” ideas for speeding up SA by simulating its action on a problem. The increase in speed is attained at the cost of decreasing generality — the methods all require the use of problem-specific information. We illustrate the ideas with examples, and discuss our computational experience. We conclude with remarks on the usefulness of simulated annealing. © 1988 by American Sciences Press, Inc.

关键词： probabilistic algorithm Ramsey numbers Simulated annealing Swindle

来源：评论

学校读者我要写书评

暂无评论

A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem

引用

Journal of Combinatorial Optimization 1998年第4期2卷 399-412页

作者： Pardalos, Panos M. Qian, Tianbing Resende, Mauricio G.C. Center for Applied Optimization Department of ISE University of Florida Gainesville FL 32611 United States Department of Management Sciences University of Iowa Iowa City IA 52242 United States Information Sciences Research Center AT and T Labs. Research Florham Park NJ 07932 United States

A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization problems. The NP-complete Feedback Vertex Set (FVS) Problem is to find the minimum number of vertices that need to be removed from a directed graph so that the resulting graph has no directed cycle. The FVS problem has found applications in many fields, including VLSI design, program verification, and statistical inference. In this paper, we develop a GRASP for the FVS problem. We describe GRASP construction mechanisms and local search, as well as some efficient problem reduction techniques. We report computational experience on a set of test problems using three variants of GRASP.

关键词： Combinatorial optimization Computer implementation Feedback vertex set GRASP Heuristics Integer programming Local search probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

On Practical Aspects of the Miller-Rabin Primality Test

引用

LOBACHEVSKII JOURNAL OF MATHEMATICS 2013年第4期34卷 304-312页

作者： Ishmukhametov, S. Mubarakov, B. Kazan State Tech Univ ul K Marksa 10 Kazan RU-420111 Russia

The well-known Miller-Rabin Primality Test MRPT is used to check naturals to be prime or composite. We study the dependence between the length of testing numbers and the number of rounds of MRPT sufficient to give the correct answer and give some recommendations how to choose a suitable set of bases at which MRPT runs more efficiently. Concluding the paper we state a number of theoretical problems which decision allows to improve an implementation of MRPT.

关键词： Primality proving Miller-Rabin test probabilistic algorithm pseudo-primes

来源：评论

学校读者我要写书评

暂无评论

The Feasibility of the Ancillary Services for Vehicle-to-Grid Technology

The Feasibility of the Ancillary Services for Vehicle-to-Gri...

引用

11th International Conference on European Energy Market (EEM)

作者： Sarabi, Siyamak Bouallaga, Anouar Davigny, Arnaud Robyns, Benoit Courtecuisse, Vincent Riffonneau, Yann Regner, Martin L2EP HEI 13 Rue Toul F-59046 Lille France ADEME F-49004 Angers France SEOLIS F-79000 Niort France GEREDIS Deux SSvres F-79000 Niort France SNCF Innovat & Res F-75611 Paris France

ISBN: (纸本)9781479960958

This paper explores the feasibility of electric vehicle contribution to the grid ancillary services. Thanks to a probabilistic approach, the technical possibilities of Vehicle-to-grid ancillary services are assessed. Different scenarios with respect to the number of EVs fleet and commuting behavior have been generated to assess the possibility of grid service support in sense of power, energy and appropriate time interval. Each scenario is dedicated to proper ancillary service, where the economic interest for each service has been discussed.

关键词： Ancillary services Distribution Network Electric Vehicle probabilistic algorithm Vehicle-to-grid (V2G)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：