EDITORIAL

2020 ◽  
Vol 1 (1) ◽  
Author(s):  
JIPS EDITOR
Keyword(s):  
Laser Spectroscopy ◽  
Chief Editor ◽  
Accelerator Physics ◽  
Laser Materials ◽  
Physics Community ◽  
Minimum Number ◽  
Peer Reviewers ◽  
On Line

Journal of the Physical Society of Indonesia (JPSI) is an international journal published by the Physical Society of Indonesia (PSI, previously HFI or Himpunan Fisika Indonesia/Indonesian Physical Society). JPSI is the continuation of Physics Journal of the Indonesian Physical Society formally published by Himpunan Fisika Indonesia (HFI) since 1996-2001 (ISSN 1410-8860) in printed format.          In HFI meeting in Denpasar on 16 October 2014 it was agreed to continue the publication of the journal in on-line format named Journal of the Indonesian Physical Society (JIPS) published in English. The name has been further changed into Journal of the Physical Society of Indonesia (JPSI) following the change of HFI (Himpunan Fisika Indonesia/Indonesian Physical Society) into Physical Society of Indonesia (PSI).Preparations for website, editors, peer reviewers, and call of papers was started in mid 2016. Papers in this first publication of JPSI (Volume 1, Number 1, April  2019) were received and accepted for publication between June 2016 and March 2019, consisting of  5 papers (minimum number of papers required for journal accreditation) in the fields of biophysics, laser materials, laser spectroscopy, and accelerator physics. However because JPSI’s ISSN was issued in July 2019, it is not applicable for April 2019 issue.  Hence regrettably all issues will be published in Volume 1, Number 2, October 2019 issue.Publication of the following number of  JPSI (Volume 1, Number 2) is scheduled for October 2019. We cordially invite the physics community to submit papers through our website at http://journal.fisika.or.id/jpsi. Chief Editor

scholarly journals A Note on On-Line Ramsey Numbers for Some Paths

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 735
Author(s):  
Tomasz Dzido ◽  
Renata Zakrzewska
Keyword(s):  
Ramsey Number ◽  
Ramsey Numbers ◽  
Minimum Number ◽  
On Line ◽  
Infinite Set ◽  
Do So

We consider the important generalisation of Ramsey numbers, namely on-line Ramsey numbers. It is easiest to understand them by considering a game between two players, a Builder and Painter, on an infinite set of vertices. In each round, the Builder joins two non-adjacent vertices with an edge, and the Painter colors the edge red or blue. An on-line Ramsey number r˜(G,H) is the minimum number of rounds it takes the Builder to force the Painter to create a red copy of graph G or a blue copy of graph H, assuming that both the Builder and Painter play perfectly. The Painter’s goal is to resist to do so for as long as possible. In this paper, we consider the case where G is a path P4 and H is a path P10 or P11.

High-Resolution Laser Spectroscopy of theDLines of On-Line ProducedNa21,22,24,25Using a New High-Sensitivity Method of Detection of Optical Resonances

1975 ◽  
Vol 34 (19) ◽  
pp. 1209-1211 ◽  
Author(s):  
G. Huber ◽  
C. Thibault ◽  
R. Klapisch ◽  
H. T. Duong ◽  
J. L. Vialle ◽  
...  
Keyword(s):  
High Resolution ◽  
Laser Spectroscopy ◽  
High Sensitivity ◽  
Optical Resonances ◽  
On Line ◽  
Sensitivity Method

Laser Spectroscopy at On-Line Isotope Separators

2008 ◽  
Author(s):  
J. Billowes ◽  
P. Demetriou ◽  
R. Julin ◽  
S. V. Harissopulos
Keyword(s):  
Laser Spectroscopy ◽  
On Line

Scalable Algorithms for Server Allocation in Infostations

2010 ◽  
pp. 645-656
Author(s):  
Alan A. Bertossi ◽  
M. Cristina Pinotti ◽  
Phalguni Gupta
Keyword(s):  
Bin Packing ◽  
Multiprocessor Scheduling ◽  
Interval Graph ◽  
Scalable Algorithms ◽  
Coverage Area ◽  
Special Cases ◽  
Minimum Number ◽  
Server Allocation ◽  
On Line ◽  
Web Surfing

The server allocation problem arises in isolated infostations, where mobile users going through the coverage area require immediate high-bit rate communications such as web surfing, file transferring, voice messaging, email and fax. Given a set of service requests, each characterized by a temporal interval and a category, an integer k, and an integer hc for each category c, the problem consists in assigning a server to each request in such a way that at most k mutually simultaneous requests are assigned to the same server at the same time, out of which at most hc are of category c, and the minimum number of servers is used. Since this problem is computationally intractable, a scalable 2-approximation online algorithm is exhibited. Generalizations of the problem are considered, which contain bin-packing, multiprocessor scheduling, and interval graph coloring as special cases, and admit scalable on-line algorithms providing constant approximations.

On-line laser spectroscopy of short-lived mercury isotopes

1978 ◽  
Vol 4 (1-2) ◽  
pp. 61-72
Author(s):  
H. -J. Kluge
Keyword(s):  
Laser Spectroscopy ◽  
Mercury Isotopes ◽  
On Line
Sign in / Sign up

Export Citation Format

Share Document