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

3rd International Conference on Innovative Network Systems and Applications (iNetSApp) held in conjunction with Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Nowosielski, Artur Kowalski, Piotr A. Kulczycki, Piotr Polish Acad Sci Syst Res Inst PhD Studies Ul Newelska 6 PL-01447 Warsaw Poland Polish Acad Sci Syst Res Inst PL-01447 Warsaw Poland AGH Univ Sci & Technol Fac Phys & Appl Comp Sci Div Informat Technol & Biometr PL-30059 Krakow Poland

ISBN: (纸本)9788360810668

This paper describes the basic components of a research project aimed at the application of natural computing metaheuristics to optimize the horizontal scaling of databases. Column oriented databases were selected for the project because of their unique properties. A mathematical model has been created in order to align the problem of horizontal scalability to the general optimization methods, such as natural computing algorithms.

关键词： database management systems optimisation column-oriented database partitioning optimization general optimization methods horizontal scaling mathematical model natural computing metaheuristics research project Optimization Partitioning algorithms Relational databases Scalability Sociology Statistics Partitioning algorithms Relational databases research project database management systems Sociology Scalability horizontal circle Mathematical Model Database natural algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms from arboreal ants for the shortest path problem

引用

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 2023年第6期120卷 e2207959120-e2207959120页

作者： Garg, Shivam Shiragur, Kirankumar Gordon, Deborah M. Charikar, Moses Stanford Univ Dept Comp Sci Stanford CA 94305 USA Stanford Univ Dept Management Sci & Engn Stanford CA 94305 USA Stanford Univ Dept Biol Stanford CA 94305 USA

Colonies of the arboreal turtle ant create networks of trails that link nests and food sources on the graph formed by branches and vines in the canopy of the tropical forest. Ants put down a volatile pheromone on the edges as they traverse them. At each vertex, the next edge to traverse is chosen using a decision rule based on the current pheromone level. There is a bidirectional flow of ants around the network. In a previous field study, it was observed that the trail networks approximately minimize the number of vertices, thus solving a variant of the popular shortest path problem without any central control and with minimal computational resources. We propose a biologically plausible model, based on a variant of the reinforced random walk on a graph, which explains this observation and suggests surprising algorithms for the shortest path problem and its variants. Through simulations and analysis, we show that when the rate of flow of ants does not change, the dynamics converges to the path with the minimum number of vertices, as observed in the field. The dynamics converges to the shortest path when the rate of flow increases with time, so the colony can solve the shortest path problem merely by increasing the flow rate. We also show that to guarantee convergence to the shortest path, bidirectional flow and a decision rule dividing the flow in proportion to the pheromone level are necessary, but convergence to approximately short paths is possible with other decision rules.

关键词： natural algorithms shortest path problem ant colonies distributed algorithms graph algorithms

来源：评论

学校读者我要写书评

暂无评论

VEViD:Vision Enhancement via Virtual diffraction and coherent Detection

引用

eLight 2022年第1期2卷 301-316页

作者： Bahram Jalali Callen MacPhee Electrical and Computer Engineering Department UCLALos AngelesUSA

The history of computing started with analog computers consisting of physical devices performing specialized functions such as predicting the position of astronomical bodies and the trajectory of cannon *** modern times,this idea has been extended,for example,to ultrafast nonlinear optics serving as a surrogate analog computer to probe the behavior of complex phenomena such as rogue *** we discuss a new paradigm where physical phenomena coded as an algorithm perform computational imaging ***,diffraction followed by coherent detection becomes an image enhancement *** Enhancement via Virtual diffraction and coherent Detection(VEViD)reimagines a digital image as a spatially varying metaphoric“lightfield”and then subjects the field to the physical processes akin to diffraction and coherent *** term“Virtual”captures the deviation from the physical *** light field is pixelated and the propagation imparts a phase with dependence on frequency which is different from the monotonically-increasing behavior of physical *** frequencies exist in three bands corresponding to the RGB color channels of a digital *** phase of the output,not the intensity,represents the output *** is a high-performance low-light-level and color enhancement tool that emerges from this *** algorithm is extremely fast,interpretable,and reduces to a compact and intuitively-appealing mathematical *** demonstrate image enhancement of 4k video at over 200 frames per second and show the utility of this physical algorithm in improving the accuracy of object detection in low-light conditions by neural *** application of VEViD to color enhancement is also demonstrated.

关键词： Physics-inspired computer vision natural algorithms Low-light image enhancement Color enhancement

来源：评论

学校读者我要写书评

暂无评论

ANTS on a Plane 27th

ANTS on a Plane

引用

27th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Aggarwal, Abhinav Saia, Jared Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA

ISBN: (纸本)9783030549206;9783030549213

In the ANTS (Ants Nearby Treasure Search) problem, multiple searchers, starting from a central location, search for a treasure. The searchers cannot communicate and have few bits of initial knowledge, called advice, when they begin the search. In this paper, we initiate the study of ANTS in the geometric plane. Our main result is an algorithm, GoldenFA, that tolerates arbitrarily many crash failures caused by an adaptive adversary, and requires no bits of advice. GoldenFA takes O ((L + L-2(t+1) ND) log L) expected time to find the shape, for a shape of diameter D, at distance L from the central location, with N searchers, t < N of which suffer adversarial crash-failures. We complement our algorithm with a lower bound, showing that it is within logarithmic factors of optimal. Additionally, we empirically test GoldenFA, and a related heuristic, and find that the heuristic is consistently faster than the state-of-the-art. Our algorithms and analysis make critical use of the Golden Ratio.

关键词： Golden Ratio Reliability Computational geometry natural algorithms

来源：评论

学校读者我要写书评

暂无评论

Recent advances in mobile touch screen security authentication methods: A systematic literature review

引用

COMPUTERS & SECURITY 2019年第0期85卷 1-24页

作者： Ibrahim, Tahir Musa Abdulhamid, Shafi'i Muhammad Alarood, Ala Abdusalam Chiroma, Haruna Al-garadi, Mohammed Ali Rana, Nadim Muhammad, Amina Nuhu Abubakar, Adamu Haruna, Khalid Gabralla, Lubna A. Natl Open Univ Nigeria Dept Informat Technol Lagos Nigeria Fed Univ Technol Dept Cyber Secur Sci Minna Nigeria Univ Jeddah Dept Comp Sci Jeddah Saudi Arabia Fed Coll Educ Tech Dept Comp Sci Gombe Nigeria Qatar Univ Dept Comp Sci & Engn Dept Doha Qatar Univ Teknol Malaysia Fac Comp Johor Baharu Malaysia Gombe State Univ Dept Math Gombe Nigeria Int Islamic Univ Malaysia Dept Comp Sci Selangor Malaysia Bayero Univ Dept Comp Sci Kano Nigeria Princess Nourah Bint Abdulrahman Univ Saudi Arabi Comp Sci & IT Dept Coll Community Riyadh Saudi Arabia

The security of the smartphone touch screen has attracted considerable attention from academics as well as industry and security experts. The maximum security of the mobile phone touch screen is necessary to protect the user's stored information in the event of loss. Previous reviews in this research domain have focused primarily on biometrics and graphical passwords while leaving out PIN, gesture/pattern and others. In this paper, we present a comprehensive literature review of the recent advances made in mobile touch screen authentication techniques covering PIN, pattern/gesture, biometrics, graphical password and others. A new comprehensive taxonomy of the various multiple class authentication techniques is presented in order to expand the existing taxonomies on single class authentication techniques. The review reveals that the most recent studies that propose new techniques for providing maximum security to smartphone touch screen reveal multi-objective optimization problems. In addition, open research problems and promising future research directions are presented in the paper. Expert researchers can benefit from the review by gaining new insights into touch screen cyber security, and novice researchers may use this paper as a starting point of their inquiry. (C) 2019 Published by Elsevier Ltd.

关键词： Mobile device security Graphical password PIN based authentication Biometric security Touchscreen gesture/pattern natural algorithms

来源：评论

学校读者我要写书评

暂无评论

A Distributed Learning Dynamics in Social Groups 17

A Distributed Learning Dynamics in Social Groups

引用

36th ACM Symposium on Principles of Distributed Computing (PODC)

作者： Celis, L. Elisa Krafft, Peter M. Vishnoi, Nisheeth K. Ecole Polytech Fed Lausanne Lausanne Switzerland MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450349925

We study a distributed learning process observed in human groups and other social animals. This learning process appears in settings in which each individual in a group is trying to decide over time, in a distributed manner, which option to select among a shared set of options. Specifically, we consider a stochastic dynamics in a group in which every individual selects an option in the following two-step process: (1) select a random individual and observe the option that individual chose in the previous time step, and (2) adopt that option if its stochastic quality was good at that time step. Various instantiations of such distributed learning appear in nature, and have also been studied in the social science literature. From the perspective of an individual, an attractive feature of this learning process is that it is a simple heuristic that requires extremely limited computational capacities. But what does it mean for the group could such a simple, distributed and essentially memoryless process lead the group as a whole to perform optimally? We show that the answer to this question is yes-this distributed learning is highly effective at identifying the best option and is close to optimal for the group overall. Our analysis also gives quantitative bounds that show fast convergence of these stochastic dynamics. We prove our result by first defining a (stochastic) infinite population version of these distributed learning dynamics and then combining its strong convergence properties along with its relation to the finite population dynamics. Prior to our work the only theoretical work related to such learning dynamics has been either in deterministic special cases or in the asymptotic setting. Finally, we observe that our infinite population dynamics is a stochastic variant of the classic multiplicative weights update (MWU) method. Consequently, we arrive at the following interesting converse: the learning dynamics on a finite population considered here can be viewed a

关键词： natural algorithms computational social science social sampling multiplicative weight updating distributed learning

来源：评论

学校读者我要写书评

暂无评论

Optimal Fungal Space Searching algorithms

IEEE TRANSACTIONS ON NANOBIOSCIENCE

引用

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2016年第7期15卷 613-618页

作者： Asenova, Elitsa Lin, Hsin-Yu Fu, Eileen Nicolau, Dan V., Jr. Nicolau, Dan V. McGill Univ Dept Bioengn Montreal PQ H3A 0C3 Canada Mol Sense Ltd Wallasey CH44 1AJ England McGill Univ Dept Bioengn Fac Engn Montreal PQ H3A 0C3 Canada

Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.

关键词： Biomimetics maze searching microfluidics natural algorithms

来源：评论

学校读者我要写书评

暂无评论

An Algorithmic Approach to Collective Behavior

引用

JOURNAL OF STATISTICAL PHYSICS 2015年第3期158卷 514-548页

作者： Chazelle, Bernard Princeton Univ Dept Comp Sci Princeton NJ 08544 USA

The emergence of collective structure from the decentralized interaction of autonomous agents remains, with notable exceptions, a mystery. While powerful tools from dynamics and statistical mechanics have been brought to bear, sometimes with great success, an algorithmic perspective has been lacking. Viewing collective behavior through the lens of natural algorithms offers potential benefits. This article examines the merits and challenges of an algorithmic approach to the emergence of collective order.

关键词： Collective behavior natural algorithms Influence systems s-Energy Dynamic networks Renormalization

来源：评论

学校读者我要写书评

暂无评论

DIFFUSIVE INFLUENCE SYSTEMS

引用

SIAM JOURNAL ON COMPUTING 2015年第5期44卷 1403-1442页

作者： Chazelle, Bernard Princeton Univ Dept Comp Sci Princeton NJ 08540 USA

Influence systems seek to model how influence, broadly defined, spreads across a dynamic network. We build a general analytical framework which we then use to prove that, while Turing-complete, influence dynamics of the diffusive type is almost surely asymptotically periodic. In addition to resolving the dynamics of a widely used family of multiagent systems, we introduce a general renormalization method for the bifurcation analysis of multiagent systems.

关键词： influence systems natural algorithms dynamical systems dynamic networks renormalization limit cycles chaos

来源：评论

学校读者我要写书评

暂无评论

The Convergence of Bird Flocking

引用

JOURNAL OF THE ACM 2014年第4期61卷 21-21页

作者： Chazelle, Bernard Princeton Univ Dept Comp Sci Princeton NJ 08540 USA

We bound the time it takes for a group of birds to stabilize in a standard flocking model. Each bird averages its velocity with its neighbors lying within a fixed radius. We resolve the worst-case complexity of this natural algorithm by providing asymptotically tight bounds on the time to equilibrium. We reduce the problem to two distinct questions in computational geometry and circuit complexity.

关键词： algorithms Theory natural algorithms dynamic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：