server problem
Recently Published Documents


TOTAL DOCUMENTS

110
(FIVE YEARS 13)

H-INDEX

16
(FIVE YEARS 1)

2021 ◽  
Vol 17 (3) ◽  
pp. 1-23
Author(s):  
Christian Coester ◽  
Elias Koutsoupias ◽  
Philip Lazos

We study a variant of the k -server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a sequence of requests. In the framework of competitive analysis, we show a surprisingly tight connection between this problem and the resource augmentation version of the k -server problem, also known as the (h,k) -server problem, in which an online algorithm with k servers competes against an offline algorithm with h servers. Specifically, we show that the infinite server problem has bounded competitive ratio if and only if the (h,k) -server problem has bounded competitive ratio for some k = O ( h ). We give a lower bound of 3.146 for the competitive ratio of the infinite server problem, which holds even for the line and some simple weighted stars. It implies the same lower bound for the (h,k) -server problem on the line, even when k/h → ∞, improving on the previous known bounds of 2 for the line and 2.4 for general metrics. For weighted trees and layered graphs, we obtain upper bounds, although they depend on the depth. Of particular interest is the infinite server problem on the line, which we show to be equivalent to the seemingly easier case in which all requests are in a fixed bounded interval. This is a special case of a more general reduction from arbitrary metric spaces to bounded subspaces. Unfortunately, classical approaches (double coverage and generalizations, work function algorithm, balancing algorithms) fail even for this special case.


2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Muhammad Purwoko

This research aims to examine the inhibiting factor of electronic mortgage registration procedures. The type of this research is empirical normative legal research by using the statutory, conceptual and empirical approach. The result shows that the electronic registration of mortgage performed through several steps, namely: (1) login to the application of electronic land services; (2) choosing the mortgage service on the menu bar; (3) submit an application to make a mortgage file; (4) completing the entry; (5) uploading the necessary documents; (6) confirming file; (7) paying a deposit order for the security rights registration; (8) recording and issuance of mortgage certificate. While the inhibiting factors on the electronic registration of mortgages are: (a) there is some official land registrar (in short term known as PPAT) who do not understand the registration procedures of electronic mortgage rights services. (b) the PPAT has not validated and registered their data in the PPAT Partner application at mitra.atrbpn.go.id; (c) the creditors have not validated and registers in the financial services partners application at mitra.atrbpn.go.id (d) the certificate of land rights has not been validated which will be used as the object to grant a mortgage right. Before the deed of mortgage rights granted, at the time of the checking the PNBP can only be paid a day after the validation completed; (e) the server problem which often occurred when uploading the requirements and the deed documents; (f) the required documents for filing a mortgage rights application are not complete.


2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Arief Rahman ◽  
Wiwiek Wahyuningsih ◽  
Sinta Andriyani

This research aims to examine the inhibiting factor of electronic mortgage registration procedures. The type of this research is empirical normative legal research by using the statutory, conceptual and empirical approach. The result shows that the electronic registration of mortgage performed through several steps, namely: (1) login to the application of electronic land services; (2) choosing the mortgage service on the menu bar; (3) submit an application to make a mortgage file; (4) completing the entry; (5) uploading the necessary documents; (6) confirming file; (7) paying a deposit order for the security rights registration; (8) recording and issuance of mortgage certificate. While the inhibiting factors on the electronic registration of mortgages are: (a) there is some official land registrar (in short term known as PPAT) who do not understand the registration procedures of electronic mortgage rights services. (b) the PPAT has not validated and registered their data in the PPAT Partner application at mitra.atrbpn.go.id; (c) the creditors have not validated and registers in the financial services partners application at mitra.atrbpn.go.id (d) the certificate of land rights has not been validated which will be used as the object to grant a mortgage right. Before the deed of mortgage rights granted, at the time of the checking the PNBP can only be paid a day after the validation completed; (e) the server problem which often occurred when uploading the requirements and the deed documents; (f) the required documents for filing a mortgage rights application are not complete.


2019 ◽  
Vol 6 (3) ◽  
pp. 1-17
Author(s):  
Björn Feldkord ◽  
Friedhelm Meyer Auf Der Heide
Keyword(s):  

Author(s):  
T. M. Obajuluwa ◽  
F. O. Talabi ◽  
O. Oluwasola

The study examined the knowledge of the use of new media tools and applications for the enhancement of information gathering and dissemination in the newsroom and the challenges faced in the integration of these tools in journalism practice, giving credence to peculiarities of the Nigerian situation. The study seeks to achieve the following objectives: to find out the challenges of news and information gathering in a digital age, to determine the knowledge level and operational skill of journalists use of the veritable tools such as apps and ICT facilities employed in the new media realm and also to enumerate ICTs challenges faced in order to engender support and vibrant journalism practice in Nigeria. The survey research method was adopted while the questionnaire was used as an instrument of data collection. Respondents showed a slightly above average knowledge level of podcasting and Google image uses (64%). However, there was little knowledge demonstrated in the uses of the wiki, dejero/bambuser etc (38% and 29% respectively). Also, challenges plaguing journalism practice in Nigeria include inadequate staff training, epileptic telecommunication network and internet server problem as a major problem (among others). This study, therefore, among others; recommends that the government provides the needed social infrastructures, which the media need to operate. In this sense, the government should improve on the power supply situation so that ICT facilities can function under the right environment and adequate training for right knowledge and use of technological applications used for attaining the standards of international media best practices.


2019 ◽  
Vol 135 ◽  
pp. 212-218
Author(s):  
Ramon Augusto Sousa Lins ◽  
Adrião Duarte Neto Dória ◽  
Jorge Dantas de Melo

Author(s):  
Dimitris Fotakis ◽  
Loukas Kavouras ◽  
Panagiotis Kostopanagiotis ◽  
Philip Lazos ◽  
Stratis Skoulakis ◽  
...  

We study the multistage K-facility reallocation problem on the real line, where we maintain K facility locations over T stages, based on the stage-dependent locations of n agents. Each agent is connected to the nearest facility at each stage, and the facilities may move from one stage to another, to accommodate different agent locations. The objective is to minimize the connection cost of the agents plus the total moving cost of the facilities, over all stages. K-facility reallocation problem was introduced by (B.D. Kaijzer and D. Wojtczak, IJCAI 2018), where they mostly focused on the special case of a single facility. Using an LP-based approach, we present a polynomial time algorithm that computes the optimal solution for any number of facilities. We also consider online K-facility reallocation, where the algorithm becomes aware of agent locations in a stage-by stage fashion. By exploiting an interesting connection to the classical K-server problem, we present a constant-competitive algorithm for K = 2 facilities.


Sign in / Sign up

Export Citation Format

Share Document