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

Compact routing schemes for dynamic ring networks

THEORY OF COMPUTING SYSTEMS 2004年第5期37卷 585-607页

作者： Krizanc, D Luccio, FL Raman, R Wesleyan Univ Dept Math Middletown CT 06459 USA Univ Trieste Dipartimento Sci Matemat I-34127 Trieste Italy Univ Leicester Dept Math & Comp Sci Leicester LE1 7RH Leics England

We consider the problem of routing in an asynchronous dynamically changing ring of processors using schemes that minimize the storage space for the routing information. In general, applying static techniques to a dynamic network would require significant re-computation. Moreover, the known dynamic techniques applied to the ring lead to inefficient schemes. In this paper we introduce a new technique, Dynamic Interval Routing, and we show tradeoffs between the stretch factor, the adaptation cost, and the size of the update messages used by routing schemes based upon it. We give three algorithms for rings of maximum size N: the first two are deterministic, one with adaptation cost zero but worst case stretch factor [N/2], the other with worst case adaptation cost O (N) update messages of 0 (log N) bits and stretch factor 1. The third algorithm is randomized, uses update messages of size O (k log N), has adaptation cost O (k), and expected stretch factor 1+1/k, for any integer kgreater than or equal to3. All schemes require O (log N) bits per node for the routing information and all messages headers are of O (log N) bits.

关键词： computer algorithms computer programming algorithms computer systems ROUTING-machines ELECTRONIC systems

来源：评论

学校读者我要写书评

暂无评论

Improved phase unwrapping algorithm based on NVIDIA CUDA

引用

PROGRAMMING AND computer SOFTWARE 2017年第1期43卷 24-36页

作者： Popov, S. E. Russian Acad Sci Inst Computat Technol Siberian Branch Leninskie Gory 1 Moscow 119991 Russia

The paper presents an improved version of the region-growing algorithm for the interferometric phase unwrapping of the radar images. A method for packing/unpacking indices of points in a photograph that is based on bitwise operations is developed. A fast algorithm for generating a growth ring of target pixels and an algorithm for merging regions are created. Software implementation of the algorithm can be run on platforms using graphics devices that support the NVIDIA CUDA technology.

关键词： CUDA (computer architecture) computer algorithms computer software computer engineering STATISTICAL matching

来源：评论

学校读者我要写书评

暂无评论

Discrete-State-Based Vision Navigation Control Algorithm for One Bipedal Robot

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-12页

作者： Wei, Dunwen Northwestern Polytech Univ Sch Mech Engn Xian 710072 Shaanxi Peoples R China

Navigation with the specific objective can be defined by specifying desired timed trajectory. The concept of desired direction field is proposed to deal with such navigation problem. To lay down a principled discussion of the accuracy and efficiency of navigation algorithms, strictly quantitative definitions of tracking error, actuator effect, and time efficiency are established. In this paper, one vision navigation control method based on desired direction field is proposed. This proposed method uses discrete image sequences to form discrete state space, which is especially suitable for bipedal walking robots with single camera walking on a free-barrier plane surface to track the specific objective without overshoot. The shortest path method (SPM) is proposed to design such direction field with the highest time efficiency. However, one improved control method called canonical piecewise-linear function (PLF) is proposed. In order to restrain the noise disturbance from the camera sensor, the band width control method is presented to significantly decrease the error influence. The robustness and efficiency of the proposed algorithm are illustrated through a number of computer simulations considering the error from camera sensor. Simulation results show that the robustness and efficiency can be balanced by choosing the proper controlling value of band width.

关键词： computer mathematics computer algorithms BIPEDALISM computer simulation computer research

来源：评论

学校读者我要写书评

暂无评论

New Statistical Randomness Tests Based on Length of Runs

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-14页

作者： Doganaksoy, Ali Sulak, Fatih Uguz, Muhiddin Seker, Okan Akcengiz, Ziya Middle E Tech Univ Inst Appl Math TR-06800 Ankara Turkey Atilim Univ Dept Math TR-06836 Ankara Turkey

Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic protocols depend on random values. Randomness is measured by statistical tests and hence security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this work we focus on statistical distributions of runs of lengths one, two, and three. Using these distributions we state three new statistical randomness tests. New tests use chi(2) distribution and, therefore, exact values of probabilities are needed. Probabilities associated runs of lengths one, two, and three are stated. Corresponding probabilities are divided into five subintervals of equal probabilities. Accordingly, three new statistical tests are defined and pseudocodes for these new statistical tests are given. New statistical tests are designed to detect the deviations in the number of runs of various lengths from a random sequence. Together with some other statistical tests, we analyse our tests' results on outputs of well-known encryption algorithms and on binary expansions of e, pi, and root 2. Experimental results show the performance and sensitivity of our tests.

关键词： STATISTICAL reliability RANDOM numbers SEQUENCES (Mathematics) CRYPTOGRAPHY computer algorithms DISTRIBUTION (Probability theory)

来源：评论

学校读者我要写书评

暂无评论

ART2 Clustering of Multiple Web Objects for Qualitative Web Prefetching

引用

APPLIED ARTIFICIAL INTELLIGENCE 2016年第5期30卷 475-493页

作者： Gracia, Chithra D. Sudha, S. Natl Inst Technol Dept Comp Sci & Engn Tiruchirappalli Tamil Nadu India Natl Inst Technol Dept Elect & Elect Engn Tiruchirappalli 620015 Tamil Nadu India

The web resources in the World Wide Web are rising, to large extent due to the services and applications provided by it. Because web traffic is large, gaining access to these resources incurs user-perceived latency. Although the latency can never be avoided, it can be minimized to a larger extent. Web prefetching is identified as a technique that anticipates the user's future requests and fetches them into the cache prior to an explicit request made. Because web objects are of various types, a new algorithm is proposed that concentrates on prefetching embedded objects, including audio and video files. Further, clustering is employed using adaptive resonance theory (ART) 2 in order to prefetch embedded objects as clusters. For comparative study, the web objects are clustered using ART2, ART1, and other statistical techniques. The clustering results confirm the supremacy of ART2 and, thereby, prefetching web objects in clusters is observed to produce a high hit rate.

关键词： World Wide Web Neural networks (computer science) computer algorithms Internet traffic Browsers (computer programs) Document clustering Cache memory

来源：评论

学校读者我要写书评

暂无评论

The Many Meanings of Live Coding

引用

computer MUSIC JOURNAL 2014年第1期38卷 65-76页

作者： Sorensen, Andrew Swift, Ben Riddell, Alistair Queensland Univ Technol Inst Future Environm Brisbane Qld 4001 Australia Australian Natl Univ Sch Comp Sci Canberra ACT 0200 Australia Australian Natl Univ Sch Art Canberra ACT 0200 Australia

The ten-year anniversary of TOPLAP presents a unique opportunity for reflection and introspection. In this essay we ask the question, what is the meaning of live coding? Our goal is not to answer this question, in absolute terms, but rather to attempt to unpack some of live coding's many meanings. Our hope is that by exploring some of the formal, embodied, and cultural meanings surrounding live-coding practice, we may help to stimulate a conversation that will resonate within the live-coding community for the next ten years.

关键词： computer music computer composition computer programming computer algorithms PROGRAMMING languages (Electronic computers)

来源：评论

学校读者我要写书评

暂无评论

Framework for Intelligent Service Adaptation to User's Context in Next Generation Networks

引用

IEEE COMMUNICATIONS MAGAZINE 2012年第3期50卷 18-25页

作者： Baladron, Carlos Aguiar, Javier M. Carro, Belen Calavia, Lorena Cadenas, Alejandro Sanchez-Esguevillas, Antonio Univ Valladolid E-47002 Valladolid Spain

Context-aware applications aim at providing personalized services to end users. Sensors and context sources are able to provide enormous amounts of valuable information about individuals that can be used to drive the behavior of services and applications, and adapt them to the specific conditions and preferences of each user. Thanks to advances in mobility, convergence and integration, increasingly larger amounts of these data are available in the Internet. However, this context information is usually fragmented, and traditionally applications have had to take care of context management themselves. This work presents a solution for a converged context management framework and how it can be employed in a future Internet to integrate data from all context sources and serve it to client applications in a seamless and transparent manner. This framework takes advantage of the intelligent and convergent features of next-generation networks, allowing seamless integration, monitoring, and control of heterogeneous sensors and devices under a single context-aware service layer. This layer is centered on a context intelligence module, capable of combining clustering algorithms and semantics to learn from user usage history and take advantage of that information to infer missing or high-level context data.

关键词： INTERNET INTERNET searching PRODUCT usage computer algorithms ELECTRONIC information resources CONVERGENCE (Telecommunication)

来源：评论

学校读者我要写书评

暂无评论

A dynamic global and local combined particle swarm optimization algorithm

引用

CHAOS SOLITONS & FRACTALS 2009年第5期42卷 2688-2695页

作者： Jiao, Bin Lian, Zhigang Chen, Qunxian Shanghai Dianji Univ Shanghai 200240 Peoples R China

Particle swarm optimization (PSO) algorithm has been developing rapidly and many results have been reported. PSO algorithm has shown some important advantages by providing high speed of convergence in specific problems. but it has a tendency to get stuck in a near optimal solution and one may find it difficult to improve solution accuracy by fine tuning. This paper presents a dynamic global and local combined particle swarm optimization (DGLCPSO) algorithm to improve the performance of original PSO, in which all particles dynamically share the best information of the local particle, global particle and group particles. It is tested with a set of eight benchmark functions with different dimensions and compared with original PSO. Experimental results indicate that the DGLCPSO algorithm improves the search performance on the benchmark functions significantly, and shows the effectiveness of the algorithm to solve optimization problems. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： computer algorithms PARTICLE swarm optimization DYNAMICS STOCHASTIC convergence PROBLEM solving PERFORMANCE evaluation computer science -- Mathematics SCIENTIFIC experimentation

来源：评论

学校读者我要写书评

暂无评论

Crowdsourced analysis of clinical trial data to predict amyotrophic lateral sclerosis progression

引用

NATURE BIOTECHNOLOGY 2015年第1期33卷 51-U292页

作者： Kueffner, Robert Zach, Neta Norel, Raquel Hawe, Johann Schoenfeld, David Wang, Liuxia Li, Guang Fang, Lilly Mackey, Lester Hardiman, Orla Cudkowicz, Merit Sherman, Alexander Ertaylan, Gokhan Grosse-Wentrup, Moritz Hothorn, Torsten van Ligtenberg, Jules Macke, Jakob H. Meyer, Timm Schoelkopf, Bernhard Tran, Linh Vaughan, Rubio Stolovitzky, Gustavo Leitner, Melanie L. German Res Ctr Environm Hlth Inst Bioinformat & Syst Biol Munich Germany Univ Munich Dept Informat Munich Germany Prize4Life Tel Aviv Israel Prize4Life Cambridge MA USA IBM TJ Watson Res Ctr Yorktown Hts NY USA Massachusetts Gen Hosp MGH Biostat Ctr Boston MA 02114 USA Harvard Univ Sch Med Charlestown MA USA Sentrana Inc Washington DC USA Latham&Watkins LLP Silicon Valley CA USA Stanford Univ Dept Stat Stanford CA 94305 USA Beaumont Hosp Dept Neurosci Dublin 9 Ireland Trinity Coll Dublin Dublin Ireland Massachusetts Gen Hosp Neurol Clin Res Inst Charlestown MA USA Univ Luxembourg Esch Alzette Luxembourg Ctr Syst Biomed Luxembourg Luxembourg Max Planck Inst Intelligent Syst Tubingen Germany Univ Zurich Inst Social & Prevent Med Zurich Switzerland Orca XL Problem Solvers Amsterdam Netherlands Max Planck Inst Biol Cybernet Tubingen Germany Bernstein Ctr Computat Neurosci Tubingen Germany Univ Calif Berkeley Berkeley Sch Publ Hlth Berkeley CA USA Biogen Idec Inc ALS Innovat Hub Cambridge MA USA

Amyotrophic lateral sclerosis (ALS) is a fatal neurodegenerative disease with substantial heterogeneity in its clinical presentation. This makes diagnosis and effective treatment difficult, so better tools for estimating disease progression are needed. Here, we report results from the DREAM-Phil Bowen ALS Prediction Prize4Life challenge. In this crowdsourcing competition, competitors developed algorithms for the prediction of disease progression of 1,822 ALS patients from standardized, anonymized phase 2/3 clinical trials. The two best algorithms outperformed a method designed by the challenge organizers as well as predictions by ALS clinicians. We estimate that using both winning algorithms in future trial designs could reduce the required number of patients by at least 20%. The DREAM-Phil Bowen ALS Prediction Prize4Life challenge also identified several potential nonstandard predictors of disease progression including uric acid, creatinine and surprisingly, blood pressure, shedding light on ALS pathobiology. This analysis reveals the potential of a crowdsourcing competition that uses clinical trial data for accelerating ALS research and development.

关键词： AMYOTROPHIC lateral sclerosis PROGNOSIS DISEASE progression BLOOD pressure CLINICAL trials CREATININE CROWDSOURCING computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Progressive Multi Gray-Leveling: A voice spam protection algorithm

引用

IEEE NETWORK 2006年第5期20卷 18-24页

作者： Shin, Dongwook Ahn, Anyoung Shim, Choon Towson State Univ Towson MD USA

As voice over IP gains popularity, it is easy to imagine that Internet hacking and other security problems we currently face with email spam will attack the VoIP environment. In contrast to email protocols represented by SMTP, VoIP does not tolerate any negotiation in its signaling steps or screening content due to the delay limitation. Thus, it is difficult to implement voice spam protection or control algorithms by just mimicking popular email spam protection algorithms. This article proposes a voice spam control algorithm called Progressive Multi Gray-Leveling (PMG) that fits in VoIP settings. PMG progressively calculates the "gray level" of a caller and determines whether the call will be connected or blocked based on previous call patterns. Based on experiments, it turns out that PMG can learn a spammer's calling pattern and block massive spam attacks from them effectively.

关键词： INTERNET telephony computer security VOICE mail systems computer algorithms DATA transmission systems TELEPHONE systems ACCESS control FILTERING software DIGITAL telephone systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：