ArticlePDF Available

Use of Colors in Teletext and Videotex

March 1985

March 1985
14(2):1–3

Authors:

Rune Pettersson

Institute for Infology, Tullinge, Sweden

Content uploaded by Rune Pettersson

Content may be subject to copyright.

A preview of the PDF is not available

My life with words, visuals, and form

Book

Full-text available

Dec 2023

Rune Pettersson

My life with words, visuals, and form. This book includes some special memories often related to several of my many non-commercial books, drawings, paintings, poems, and other texts. This book is mainly about my private activities, and what I have done in my own time, not payed for by any employer

Rune Pettersson-List of Projects

Data

Full-text available

Nov 2018

Rune Pettersson

I have sorted all my documents available on ResearchGate in twelve different "project areas". In this way it will be easier for an-yone to search for and find research within their own areas of in-terest. Due to copyright situations a few of my documents are not available. / Rune

Ord, bild & form–observationer och forskningsresultat.

Book

Full-text available

Dec 2023

Rune Pettersson

I min bok Ord, bild och form – observationer och forskningsresultat beskriver jag mina arbetsuppgifter under 50 yrkesverksamma år. Jag har arbetat både praktiskt och teoretiskt med frågor som rör samspel mellan ord, bilder och form i skilda medier. Detta arbete har bidraget till att informationsdesign kunde bli inrättat som ett nytt akademiskt ämne i Sverige. Boken innehåller referenser till mina artiklar, böcker och konferensbidrag.

ResearchGate has not been able to resolve any references for this publication.

Article

Color image encryption method based on qubits rotation about axis

August 2016

A color image encryption method based on quantum computing is proposed. Firstly, the color image is encoded in quantum superposition |Image>. Each pixel is described by three quantum bits |r>, |g>, |b> which represent the red, green and blue colors. And then, all qubits are randomly rotated on the Bloch sphere. The quantum fourier transform(QFT) is performed on the |Image>. Once again, all qubits ... [Show full abstract] are randomly rotated on the Bloch sphere and the inverse QFT is performed on the |Image>, and the encryption process is implemented. The simulation results on the classic computer show that the method has better security, and can be run on quantum computers in the future. © 2016, Editorial Office of Control and Decision. All right reserved.

Article

Full-text available

Children’s Intuitive Teleology: Shifting the Focus of Evolution Education Research

June 2012 · Evolution: Education and Outreach

Research has shown that children usually provide teleological explanations for the features of organisms and artifacts, from a very early age (3–4 years old). However, there is no consensus on whether teleological explanations are given in the same manner for non-living natural objects as well. The present study aimed to document the teleological explanations of 5- to 8-year-old children for ... [Show full abstract] particular features (color and shape) of organisms, artifacts and non-living natural objects. In addition, it was examined if there was any correlation between these explanations and children’s explanations for the usefulness of those features. Our results indicate a developmental shift in children’s teleological explanations, from a non-selective teleology in pre-school to a selective one in the second grade. In the latter case, children provided teleological explanations mostly for the shape of the feet of organisms and for the shape of artifacts, whereas pre-school children provided teleological explanations for non-living natural objects as well, both for the color and for the shape in all cases. Our results are not conclusive and further research is required, including a larger spectrum of students, since teleology is one of the most important conceptual obstacles in understanding evolution that persists even into adulthood. We conclude by proposing a particular research program for this purpose.

Article

Search for color singlet and color reconnection effects in hadronic Z decays at LEP

Article

On total weight choosability of graphs

May 2013 · Journal of Combinatorial Optimization

For a graph G with vertex set V and edge set E, a (k,k′)-total list assignment L of G assigns to each vertex v a set L(v) of k real numbers as permissible weights, and assigns to each edge e a set L(e) of k′ real numbers as permissible weights. If for any (k,k′)-total list assignment L of G, there exists a mapping f:V∪E→ℝ such that f(y)∈L(y) for each y∈V∪E, and for any two adjacent vertices u and ... [Show full abstract] v, ∑y∈N(u)f(uy)+f(u)≠∑x∈N(v)f(vx)+f(v), then G is (k,k′)-total weight choosable. It is conjectured by Wong and Zhu that every graph is (2,2)-total weight choosable, and every graph with no isolated edges is (1,3)-total weight choosable. In this paper, it is proven that a graph G obtained from any loopless graph H by subdividing each edge with at least one vertex is (1,3)-total weight choosable and (2,2)-total weight choosable. It is shown that s-degenerate graphs (with s≥2) are (1,2s)-total weight choosable. Hence planar graphs are (1,10)-total weight choosable, and outerplanar graphs are (1,4)-total weight choosable. We also give a combinatorial proof that wheels are (2,2)-total weight choosable, as well as (1,3)-total weight choosable.