Search

Showing total 60 results
Start Over Topic algorithms Publication Type Reviews
60 results

1. Selected Papers on Analysis of Algorithms (Book).

Author

Kidwell, Peggy Aldrich and von zur Gathen, Joachim

Subjects
*ALGORITHMS, *NONFICTION
Abstract

Reviews the book 'Selected Papers on Analysis of Algorithms,' by Donald E. Knuth.

Published
2002

3. GDTN: Genome-Based Delay Tolerant Network Formation in Heterogeneous 5G Using Inter-UA Collaboration.

Author

You, Ilsun, Sharma, Vishal, Atiquzzaman, Mohammed, and Choo, Kim-Kwang Raymond

Subjects
*GENETIC software, *DELAY-tolerant networks, *GENE mapping
Abstract

With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment. [ABSTRACT FROM AUTHOR]

Published
2016
Full Text
View/download PDF

5. Book Review.

Author

Overill, Richard

Subjects
ALGORITHMS, NONFICTION
Abstract

Reviews the book 'Selected Papers on Analysis of Algorithms,' by Donald E. Knuth.

Published
2001

7. N ways to simulate short-range particle systems: Automated algorithm selection with the node-level library AutoPas.

Author

Gratl, Fabio Alexander, Seckler, Steffen, Bungartz, Hans-Joachim, and Neumann, Philipp

Subjects
*N-body simulations (Astronomy), *ALGORITHMS, *SIMULATION software, *PROGRAMMING languages, *GRAPHICAL user interfaces, *ORDER picking systems, *MATHEMATICAL optimization
Abstract

AutoPas is an open-source C++ library delivering optimal node-level performance by providing the ideal algorithmic configuration for an arbitrary scenario in a given short-range particle simulation. It acts as a black-box container, internally implementing an extensive set of algorithms, parallelization strategies, and optimizations that are combined dynamically according to the state of the simulation via auto-tuning. This paper gives an overview of the high-level user perspective, as well as the internal view, covering the implemented techniques and features. The library is showcased by incorporating it into the codes LAMMPS and ls1 mardyn, and by investigating various applications. We further outline node-level shared-memory performance and scalability of our auto-tuning software which is comparable to LAMMPS. Program Title: AutoPas CPC Library link to program files: https://doi.org/10.17632/9kdb2p76hv.1 Developer's repository link: https://github.com/AutoPas/AutoPas Code Ocean capsule: https://codeocean.com/capsule/0391732 Licensing provisions: BSD 2-clause Programming language: C++17, CMake 3.14 Nature of problem: The evaluation of the short-range pairwise interactions in an N-Body simulation can be achieved using many different algorithms and parallelization techniques. Depending on the nature of the scenario, its current state, and the forces of interest, the optimal algorithm configuration can differ greatly. Choosing this optimum is a non-trivial task even for experts. Furthermore, this optimum can change over the course of a simulation. Typically, a particle simulation software only implements one algorithm for force computation and is thus specialized for a certain type of simulation. It is up to the user to choose the program suitable for his needs. Solution method: The AutoPas library implements a range of state of the art algorithms to find the relevant neighbors for the N-Body pairwise force calculation. It provides multiple shared-memory parallelization strategies using OpenMP and further algorithm optimization parameters that can all be set at run-time. A big burden for users persists in requiring the expert knowledge to pick the optimal solution procedure for a simulation. AutoPas removes this burden by tuning all aforementioned options automatically and dynamically. This way, simulation programs that make use of AutoPas give every domain scientist the possibility to make use of the most suitable algorithm configuration for arbitrary scenarios. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

8. UnDiFi-2D: An unstructured discontinuity fitting code for 2D grids.

Author

Campoli, L., Assonitis, A., Ciallella, M., Paciorri, R., Bonfiglioli, A., and Ricchiuto, M.

Subjects
*ALGORITHMS, *PROGRAMMING languages, *FREEWARE (Computer software), *UNSTEADY flow, *CURRENT distribution, *GRAPHICAL user interfaces
Abstract

UnDiFi-2D , an open source (free software) Un structured-grid, Di scontinuity Fi tting code, is presented. The aim of UnDiFi-2D is to model gas-dynamic discontinuities in two-dimensional (2D) flows as if they were true discontinuities of null thickness that bound regions of the flow-field where a smooth solution to the governing PDEs exists. UnDiFi-2D therefore needs to be coupled with an unstructured CFD solver that is used to discretize the governing PDEs within the smooth regions of the flow-field. Two different, in-house developed, CFD solvers are also included in the current distribution. The main features of the UnDiFi-2D software can be summarized as follows: Programming language UnDiFi-2D is written in standard Fortran 77/95; its design is highly modular in order to enhance simplicity of use, maintenance and allow coupling with virtually any existing CFD solver; Usability, maintenance and enhancement In order to improve the usability, maintenance and enhancement of the code also the documentation has been carefully taken into account. The git distributed versioning system has been adopted to facilitate collaborative maintenance and code development; Copyrights UnDiFi-2D is a free software that anyone can use, copy, distribute, change and improve under the GNU Public License version 3. The present paper is a manifesto of the first public release of the UnDiFi-2D code. It describes the currently implemented features, which are the result of more than a decade of still ongoing CFD developments. This work is focused on the computational techniques adopted and a detailed description of the main characteristics is reported. UnDiFi-2D capabilities are demonstrated by means of examples test cases. The design of the code allows to easily include existing CFD codes and is aimed at ease code reuse and readability. Program title: UnDiFi-2D CPC Library link to program files: https://doi.org/10.17632/5hwssmc2mx.1 Licensing provisions: GNU General Public License, version 3 Programming language: Fortran; developed and tested with Intel Fortran Compiler v. 18.0.3 and GNU gfortran. External routines: The code depends on several libraries and third-party packages which are detailed in the corpus of the text. Nature of problem: Numerical computation of flows with discontinuities. Solution method: Shock-fitting technique. Additional comments including restrictions and unusual features: • At present, UnDiFi-2D is validated for inviscid steady and unsteady two-dimensional flows without changes in the number of discontinuity lines and interaction points. • UnDiFi-2D implements a shock-fitting algorithm and can be coupled with unstructured cell-vertex solvers, with an Arbitrary Lagrangian-Eulerian (ALE) formulation. • UnDiFi-2D project adopts git [1], a free and open source distributed version control system. A public repository dedicated to UnDiFi-2D project [2] has been created on github [3], a web-based hosting service for software development projects using git versioning system. Finally, a comprehensive documentation is provided in the form of user manual developed in Pandoc [4]. [1] Git, a free and open source distributed version control system, http://git-scm.com. [2] UnDiFi-2D documentation, https://github.com/UnDiFi/UnDiFi-2D. [3] Github, a web-based hosting service for software development projects using git versioning system, https://github.com. [4] M. Dominici, TUGboat 35(1) (2014) 44-50. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

11. Recent Models, Algorithms and Applications

Author

Voss, Stefan

Subjects
ALGORITHMS, NONFICTION
Abstract

Reviews the book "Recent Models, Algorithms and Applications," edited by Jan Weglarz.

Published
2000

13. Untitled.

Author

HACKETT, J.

Subjects
ALGORITHMS, ALGEBRAIC equations, NONFICTION
Published
2020
Full Text
View/download PDF

14. BOOTSTRAP ALGORITHMS FOR TESTING AND DETERMINING THE COINTEGRATION RANK IN VAR MODELS.

Author

Swensen, Anders Rygh

Subjects
STATISTICAL bootstrapping, DISTRIBUTION (Probability theory), PROBABILITY theory, ALGORITHMS, COINTEGRATION, ECONOMETRICS, TIME series analysis, STOCHASTIC convergence
Abstract

In this paper a bootstrap algorithm for a reduced rank vector autoregressive model with a restricted linear trend and independent, identically distributed errors is analyzed. For testing the cointegration rank, the asymptotic distribution under the hypothesis is the same as for the usual likelihood ratio test, so that the bootstrap is consistent. It is furthermore shown that a bootstrap procedure for determining the rank is asymptotically consistent in the sense that the probability of choosing the rank smaller than the true one converges to zero. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

15. Jointly Minimum BER Transmitter and Receiver FIR MIMO Filters for Binary Signal Vectors (Book).

Author

Hjørungnes, Are, Diniz, Paulo S. R., and de Campos, Marcello L. R.

Subjects
SIGNAL processing, RADIO transmitter-receivers, THEORY, ELECTRIC filters, ALGORITHMS, TRANSFER functions
Abstract

A theory is developed for jointly minimizing the bit error rate (BER) between the desired and decoded signals with respect to the coefficients of transmitter and receiver finite impulse response (FIR) multiple-input multiple-output (MIMO) filters. The original signal is assumed to be a vector time-series with equally likely memory less Bernoulli vector components. The channel model constitutes of a known FIR MIMO transfer function and Gaussian additive noise independent of the original signal. The channel input signal is assumed to be power constrained. Based on the formulas obtained, an iterative numerical optimization algorithm is proposed. When compared with other design methods available in the literature, the proposed method yields better results due to the generality of the model considered and the joint optimization of the transmitter-receiver pair. [ABSTRACT FROM AUTHOR]

Published
2004
Full Text
View/download PDF

22. Book Review: Automating the News: How Algorithms Are Rewriting the Media.

Author

Puschmann, Cornelius

Subjects
ALGORITHMS, JOURNALISTIC ethics, INVESTIGATIVE reporting, ATTRIBUTION of news, FAIRNESS
Abstract

Diakopoulos, Nicholas Automating the News: How Algorithms Are Rewriting the Media. Should algorithms make journalism I better i or just I more productive i (in the words of the author, will they be used by news organizations for "more quality" rather than jus to produce "more content"?. [Extracted from the article]

Published
2020
Full Text
View/download PDF

24. Scheduling algorithms.

Subjects
ALGORITHMS, NONFICTION
Abstract

The article reviews the book "Scheduling Algorithms," by Peter Brucker.

Published
1996

25. Why I Believe People Need Painting By Numbers.

Author

Makansi, Jason

Subjects
PAINT-by-numbers, NONFICTION
Abstract

This piece briefly introduces my Painting By Numbers, which aims to take the core messages of the QL/QR community from academic and professional circles to the rest of the citizenry. I describe the book in the context of the critical need for the most basic numeracy tools to help consumers of news, information, and analysis--delivered through traditional and contemporary social media outlets--determine where a reported numerical result lies on the scale from utter nonsense to a widely established and accepted "fact." [ABSTRACT FROM AUTHOR]

Published
2018

30. Book Reviews.

Author

Maffioli, Francesco

Subjects
ALGORITHMS
Abstract

Reviews the book 'Approximation Algorithms,' by Vijay V. Vazirani.

Published
2002
Full Text
View/download PDF

31. Review.

Author

Everitt, B. S.

Subjects
ALGORITHMS, NONFICTION
Abstract

The article reviews the book "Clustering and Classification," edited by P. Arabie, L. J. Hubert and G. De Soete.

Published
1998
Full Text
View/download PDF

34. Moral Machines?

Author

Pritchard, Michael

Subjects
ALGORITHMS, ROBOTS, ROBOTICS, UTILITARIANISM, ETHICS
Abstract

Wendell Wallach and Colin Allen's Moral Machines: Teaching Robots Right From Wrong (Oxford University Press, 2009) explores efforts to develop machines that, not only can be employed for good or bad ends, but which themselves can be held morally accountable for what they do- artificial moral agents (AMAs). This essay is a critical response to Wallach and Allen's conjectures. Although Wallach and Allen do not suggest that we are close to being able to create full-fledged AMAs, they do talk seriously about making incremental progress in the direction of creating them (even if we never fully succeed). However, there are important questions about the moral development of AMAs that Moral Machines does not address. Given the responsibilities entrusted to human moral agents, we take questions about their moral development very seriously. In the case of children, the hope is that eventually they will develop into full-fledged moral agents. How might we expect this to go with less than fully formed AMAs? Will there be a comparable story of moral development and moral education that we can tell? [ABSTRACT FROM AUTHOR]

Published
2012
Full Text
View/download PDF

35. untitled.

Author

de Lacy, Paul

Subjects
PHONETICS, ALGORITHMS, HIERARCHY (Linguistics), PALATALIZATION
Published
2010
Full Text
View/download PDF

39. Experimental realization of shor's quantum factoring algorithm using nuclear magnetic resonance.

Author

Vandersypen, Lieven M.K., Steffen, Matthias, Breyta, Gregory, Yannoni, Costantino S., Sherwood, Mark H., and Chuang, Isaac L.

Subjects
ALGORITHMS, MAGNETIC resonance, SCIENCE
Abstract

Focuses on the implementation of the simplest instance of Shor's algorithm. Techniques for the precision control and modelling of complex quantum computers; application of the room temperature liquid-state nuclear magnetic resonance techniques; Presentation of the predictive model of decoherence effects.

Published
2001
Full Text
View/download PDF

42. The Analyst's Bookshelf.

Author

Mecloskey, Joseph F.

Subjects
MATHEMATICAL programming, DYNAMIC programming, GRAPHIC methods, ALGORITHMS, GRAPH theory, NONFICTION, SET theory
Abstract

This article focuses on the book "Theorie des Graphes et ses Applications," by Claude Berge. The term graph, the subject of this book has not the common connotation of a plot or curve, but refers to an established but esoteric mathematical sage. The geometric aspect of the above definition is not the heart of the matter, graphs can be symbolic diagrams of a rich variety of situations. The points can represent almost any kind of object and the arcs almost any type of interrelation between them. There is a chapter on transportation networks in the book. It includes Ford-Fulkerson algorithms and the theorems of Hoffman and Gale. Besides questions of optimizing transport and routing the same techniques are fitted to the problem of minimal covering, some combinational teasers, problems in a set theory, and linear programming are also given. The methods continue to solve problems in some subsequent chapters. In what are called simple graphs, the vertices are divided into two sets such that all arcs connect only members of one set with points of the other.

Published
1959
Full Text
View/download PDF

43. Models and Algorithms for Global Optimization.

Author

Sahinidis, Nikolaos V.

Subjects
ALGORITHMS, NONFICTION
Abstract

The article reviews the book "Models & Algorithms for Global Optimization," edited by Aimo Törn and Julius Zilinkskas.

Published
2008

45. Scatter Search: Methodology and Implementations in C.

Author

Lev, Benjamin and Rego, César

Subjects
ALGORITHMS, NONFICTION
Abstract

The article reviews the book "Scatter Search: Methodology and Implementations in C," by Manuel Laguna and Rafael Marti.

Published
2006

48. Approximation Algorithms (Book).

Author

Zhihui Xue and Lev, Benjamin

Subjects
ALGORITHMS, NONFICTION
Abstract

Reviews the book "Approximation Algorithms," by Vijay Vazirani.

Published
2002