Results 11 to 20 of about 1,134,449 (313)
The mixed page number of graphs
A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam +4 more
openaire +2 more sources
Erratum Jurnal Psikologi Volume 49, Number 2 in August 2022
This erratum is to explain a pagination error occurred in the published issue of Jurnal Psikologi Volume 25, Number 1 (1998). The error above was due to problem in scanning the printed version of the article that caused one needless page slipped between ...
Erratum Jurnal Psikologi
doaj +1 more source
Automated Page Turner for Musicians
An increasing number of musicians are opting to use tablet devices instead of traditional print media for their music sheets since the digital medium offers the benefit of storing a lot of music in a compact space.
André Tabone +2 more
doaj +1 more source
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei +3 more
doaj +1 more source
Do children spontaneously represent spatial-numeric features of a task, even when it does not include printed numbers (Mix et al., 2016)? Sixty first grade students completed a novel spatial estimation task by seeking and finding pages in a 100-page book
Clarissa A. Thompson +2 more
doaj +1 more source
Front Cover Jurnal Sisfokom (Sistem Informasi dan Komputer) Vol. 9 No. 2 Juli 2020
This article contains front-matter of Jurnal Sisfokom (Sistem Informasi dan Komputer), Volume 9 Number 2 - July 2020, which includes a cover page, title page, editorial team, and table of contents.
Editor in Chief Sisfokom
doaj +1 more source
Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation
The crossing number of graph G is the minimum number of edges crossing in any drawing of G in a plane. In this paper we describe a method of finding the bound of 2-page fixed linear crossing number of G. We consider a conflict graph G′ of G.
A. Suebsriwichai, T. Mouktonglang
doaj +1 more source
On the page-number of a circulant graph
The page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive ...
Xiaoyuan Dong, Dengju Ma
doaj +1 more source
Improved PageRank Algorithm Based on User Behavior and Page Analysis [PDF]
In classical PageRank algorithm,transition probability of page is equally distributed to the outlinks.There are few links of new page,so its PR value is generally low.Classical PageRank algorithm is used to calculate the PR value through links,without ...
WANG Xuyang,REN Guosheng
doaj +1 more source
Squeezed Phonon States: Modulating Quantum Fluctuations of Atomic Displacements
We study squeezed quantum states of phonons, which allow the possibility of modulating the quantum fluctuations of atomic displacements below the zero-point quantum noise level of coherent phonon states.
A. Yariv +10 more
core +1 more source

