Zeitschriften und Ausgaben

Volumen 9 (2022): Heft 16 (June 2022)

Volumen 8 (2021): Heft 15 (November 2021)

Volumen 8 (2021): Heft 14 (October 2021)

Volumen 7 (2020): Heft 13 (November 2020)

Volumen 6 (2019): Heft 12 (December 2019)

Volumen 6 (2019): Heft 11 (September 2019)

Volumen 5 (2018): Heft 10 (December 2018)

Volumen 5 (2018): Heft 9 (September 2018)

Volumen 4 (2017): Heft 8 (December 2017)

Volumen 4 (2017): Heft 7 (May 2017)

Volumen 3 (2016): Heft 6 (December 2016)

Volumen 3 (2016): Heft 5 (March 2016)

Zeitschriftendaten
Format
Zeitschrift
eISSN
2182-1976
Erstveröffentlichung
16 Apr 2016
Erscheinungsweise
2 Hefte pro Jahr
Sprachen
Englisch

Suche

Volumen 3 (2016): Heft 6 (December 2016)

Zeitschriftendaten
Format
Zeitschrift
eISSN
2182-1976
Erstveröffentlichung
16 Apr 2016
Erscheinungsweise
2 Hefte pro Jahr
Sprachen
Englisch

Suche

5 Artikel
Uneingeschränkter Zugang

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 5 - 42

Zusammenfassung

Abstract

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

Schlüsselwörter

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Uneingeschränkter Zugang

Where are (Pseudo)Science Fool’s Hoax Articles in April From?

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 43 - 74

Zusammenfassung

Abstract

In this paper, we discuss in detail what is behind April Fool’s Day

Schlüsselwörter

  • April fool’s day
Uneingeschränkter Zugang

Finding the Year’s Share in Day-of-Week Calculations

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 75 - 86

Zusammenfassung

Abstract

The dominant part in the mental calculation of the day of the week for any given date is to determine the year share, that is, the contribution of the two-digit year part of the date. This paper describes a number of year share computation methods, some well-known and some new. The “Parity Minus 3” method, in particular, is a new alternative to the popular “Odd+11” method. The paper categorizes the methods of year share computation, and presents simpler proofs of their correctness than usually provided.

Schlüsselwörter

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Uneingeschränkter Zugang

Quantum Distribution of a Sudoku Key

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 87 - 94

Zusammenfassung

Abstract

Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Schlüsselwörter

  • sudoku
  • quantum key distribution methods
Uneingeschränkter Zugang

The Maximum Queens Problem with Pawns

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 95 - 102

Zusammenfassung

Abstract

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Schlüsselwörter

  • chess
  • n-queens problem
  • combinatorics
5 Artikel
Uneingeschränkter Zugang

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 5 - 42

Zusammenfassung

Abstract

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

Schlüsselwörter

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Uneingeschränkter Zugang

Where are (Pseudo)Science Fool’s Hoax Articles in April From?

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 43 - 74

Zusammenfassung

Abstract

In this paper, we discuss in detail what is behind April Fool’s Day

Schlüsselwörter

  • April fool’s day
Uneingeschränkter Zugang

Finding the Year’s Share in Day-of-Week Calculations

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 75 - 86

Zusammenfassung

Abstract

The dominant part in the mental calculation of the day of the week for any given date is to determine the year share, that is, the contribution of the two-digit year part of the date. This paper describes a number of year share computation methods, some well-known and some new. The “Parity Minus 3” method, in particular, is a new alternative to the popular “Odd+11” method. The paper categorizes the methods of year share computation, and presents simpler proofs of their correctness than usually provided.

Schlüsselwörter

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Uneingeschränkter Zugang

Quantum Distribution of a Sudoku Key

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 87 - 94

Zusammenfassung

Abstract

Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Schlüsselwörter

  • sudoku
  • quantum key distribution methods
Uneingeschränkter Zugang

The Maximum Queens Problem with Pawns

Online veröffentlicht: 08 Dec 2016
Seitenbereich: 95 - 102

Zusammenfassung

Abstract

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Schlüsselwörter

  • chess
  • n-queens problem
  • combinatorics

Planen Sie Ihre Fernkonferenz mit Scienceendo