Frequent-Pattern-Based Broadcast Scheduling for Conflict Avoidance in Multichannel Data Dissemination Systems

With the popularity of mobile devices, using the traditional client-server model to handle a large number of requests is very challenging. Wireless data broadcasting can be used to provide services to many users at the same time, so reducing the average access time has become a popular research topic. For example, some location-based services (LBS) consider using multiple channels to disseminate information to reduce access time. However, data conflicts may occur when multiple channels are used, where multiple data items associated with the request are broadcasted at about the same time. In this article, we consider the channel switching time and identify the data conflict issue in an on-demand multichannel dissemination system. We model the considered problem as a data broadcast with conflict avoidance (DBCA) problem and prove it is NP-complete. We hence propose the frequent-pattern-based broadcast scheduling (FPBS), which provides a new variant of the frequent pattern tree, FP ∗ -tree, to schedule the requested data. Using FPBS, the system can avoid data conflicts when assigning data items to time slots in the channels. In the simulation, we discussed two modes of FPBS: online and offline. The results show that, compared with the existing heuristic methods, FPBS can shorten the average access time by 30%.

Efficient Clinical Data Sharing Framework Based on Blockchain Technology

Background While electronic health records have been collected for many years in Taiwan, their interoperability across different health care providers has not been entirely achieved yet. The exchange of clinical data is still inefficient and time consuming. Objectives This study proposes an efficient patient-centric framework based on the blockchain technology that makes clinical data accessible to patients and enable transparent, traceable, secure, and effective data sharing between physicians and other health care providers. Methods Health care experts were interviewed for the study, and medical data were collected in collaboration with Ministry of Health and Welfare (MOHW) Chang-Hua hospital. The proposed framework was designed based on the detailed analysis of this information. The framework includes smart contracts in an Ethereum-based permissioned blockchain to secure and facilitate clinical data exchange among different parties such as hospitals, clinics, patients, and other stakeholders. In addition, the framework employs the Logical Observation Identifiers Names and Codes (LOINC) standard to ensure the interoperability and reuse of clinical data. Results The prototype of the proposed framework was deployed in Chang-Hua hospital to demonstrate the sharing of health examination reports with many other clinics in suburban areas. The framework was found to reduce the average access time to patient health reports from the existing next-day service to a few seconds. Conclusion The proposed framework can be adopted to achieve health record sharing among health care providers with higher efficiency and protected privacy compared to the system currently used in Taiwan based on the client–server architecture.

PSXI-9 CriaCerto - Breeding System Simulator App: a case of study in Brazil

CriaCerto App was launched in February 2019 by Embrapa, Brazil, as free access, available at www.criacerto.com. It simulates the costs and benefits of the main breeding systems for cattle production: Natural Service (NS), One Fixed Time Artificial Insemination plus NS (1FTAI), Two Fixed Time Artificial Insemination plus NS (2FTAI), and Three Fixed Time Inseminations (3FTAI). This work aimed to evaluate the use of the App as well as the results of the simulations carried out during the 12 months following its launch. From February 14th, 2019 to February 20th, 2020, 4,780 accesses to the platform were recorded, with an average access time of 3 min 30 s. Eighty percent of accesses were made using mobile phones, 15% from desktops, and 5% via tablets. These accesses resulted in 975 different simulations, where 51% were from NS, 24% of 1FTAI, 14% 2FTAI, and 11% 3FTAI. There was a difference between the prices the farmers were willing to pay for the bulls according to the reproduction method. Those who performed NS simulations were willing to pay less for bulls than those who simulated 1FTAI or 2FTAI. It was also observed that the price to be paid per semen dose on 1FTAI simulations was practically double of the 2FTAI. This indicates that farmers are willing to invest in genetically superior bulls, which are usually more expensive, but the decision is made based on the total amount of money spent. It also indicates that farmers take into account the trade-off between the cost of the bull, semen dose and the benefits of genetic improvement. In Brazil only 12% of the total beef cows participate in artificial insemination programs. Nonetheless, through this study, we concluded that farmers are opened to invest in FTAI, even though they do not want to pay high prices in semen doses.

Analisis Perbandingan Performa Average Access Time Cache pada Prosesor Komputer

Performa komputer dari generasi ke generasi mengalami peningkatan yang cukup pesat, terutama dalam hal kecepatan pemrosesan data. Jika kita amati, kecepatan komputer dalam melakukan pemrosesan data merupakan arah dari perkembangan generasi komputer. Kecepatan pemrosesan data ini sangat dipengaruhi oleh average access time pada cache prosesor. Tujuan penelitian ini adalah untuk membandingkan performa dan memberikan gambaran average access time pada multilevel cache proseesor komputer. Untuk mendapatkan perbandingan dan gambaran mengenai cara menghitung average access time ini, digunakan dua buah prosesor sebagai sampel yaitu Intel Core I7 2600K dan Phenom II X6 1100T. Untuk membandingkan average access time dari kedua prosesor tersebut, diperlukan dua indikator yaitu access time dan hit rate. Dari hasil analisis yang dilakukan, dapat disimpulkan bahwa dari segi average access time, prosesor Phenom X6 1100T memiliki performa lebih baik jika dibandingkan dengan prosesor Intel Core I7 2600K.

ACCESS TIME OF EMERGENCY VEHICLES UNDER THE CONDITION OF STREET BLOCKAGES AFTER A LARGE EARTHQUAKE

The previous studies have been carried out on accessibility in daily life. However it is an important issue to improve the accessibility of emergency vehicles after a large earthquake. In this paper, we analyzed the accessibility of firefighters by using a microscopic simulation model immediately after a large earthquake. More specifically, we constructed the simulation model, which describes the property damage, such as collapsed buildings, street blockages, outbreaks of fires, and fire spreading, and the movement of firefighters from fire stations to the locations of fires in a large-scale earthquake. Using this model, we analyzed the influence of the street-blockage on the access time of firefighters. In case streets are blocked according to property damage simulation, the result showed the average access time is more than 10 minutes in the outskirts of the 23 wards of Tokyo, and there are some firefighters arrive over 20 minutes at most. Additionally, we focused on the alternative routes and proposed that volunteers collect information on street blockages to improve the accessibility of firefighters. Finally we demonstrated that access time of firefighters can be reduced to the same level as the case no streets were blocked if 0.3% of residents collected information in 10 minutes.

ACCESS TIME OF EMERGENCY VEHICLES UNDER THE CONDITION OF STREET BLOCKAGES AFTER A LARGE EARTHQUAKE

The previous studies have been carried out on accessibility in daily life. However it is an important issue to improve the accessibility of emergency vehicles after a large earthquake. In this paper, we analyzed the accessibility of firefighters by using a microscopic simulation model immediately after a large earthquake. More specifically, we constructed the simulation model, which describes the property damage, such as collapsed buildings, street blockages, outbreaks of fires, and fire spreading, and the movement of firefighters from fire stations to the locations of fires in a large-scale earthquake. Using this model, we analyzed the influence of the street-blockage on the access time of firefighters. In case streets are blocked according to property damage simulation, the result showed the average access time is more than 10 minutes in the outskirts of the 23 wards of Tokyo, and there are some firefighters arrive over 20 minutes at most. Additionally, we focused on the alternative routes and proposed that volunteers collect information on street blockages to improve the accessibility of firefighters. Finally we demonstrated that access time of firefighters can be reduced to the same level as the case no streets were blocked if 0.3% of residents collected information in 10 minutes.

A four-phase data replication algorithm for data grid

<p>Nowadays, scientific applications generate a huge amount of data in terabytes or petabytes. Data grids currently proposed solutions to large scale data management problems including efficient file transfer and replication. Data is typically replicated in a Data Grid to improve the job response time and data availability. A reasonable number and right locations for replicas has become a challenge in the Data Grid. In this paper, a four-phase dynamic data replication algorithm based on Temporal and Geographical locality is proposed. It includes: 1) evaluating and identifying the popular data and triggering a replication operation when the popularity data passes a dynamic threshold; 2) analyzing and modeling the relationship between system availability and the number of replicas, and calculating a suitable number of new replicas; 3) evaluating and identifying the popular data in each site, and placing replicas among them; 4) removing files with least cost of average access time when encountering insufficient space for replication. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid Projects. The simulation results show that the proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage and percentage of storage filled.</p>

Implementasi Sistem Bluetooth menggunakan Android dan Arduino untuk Kendali Peralatan Elektronik

ABSTRAKDalam suatu ruangan yang dipenuhi peralatan elektronik, remote control sangatlah penting. Keterbatasan sebuah remote control untuk mengendalikan hanya satu peralatan elektronik tentu menjadi kendala tersendiri. Untuk mengurangi kendala tersebut direalisasikan remote control yang dapat mengendalikan seluruh peralatan elektronik menggunakan perantara Bluetooth yang terintegrasi pada Android dan Arduino. Android akan mengirimkan perintah pada Arduino melalui Bluetooth, Arduino menerjemahkan perintah menjadi kode ke infra merah yang selanjutnya diterima oleh receiver peralatan elektronik. Dilakukan pengujian terhadap sistem remote control sehingga menghasilkan kesimpulan bahwa sistem remote control tersebut dapat berfungsi pada tiga versi Android berbeda, persentasi keberhasilan dari alat kendali 94,8% menggunakan tombol dan 92,8% menggunakan perintah suara, waktu akses rata-rata 0,17385 detik untuk perintah menggunakan tombol dan 0,20995 detik untuk perintah menggunakan perintah suara, dan jarak optimal pengirim infra merah (Tx) terhadap penerima infra merah (Rx) adalah 320 cm dengan lebar 180,8 cm.Kata Kunci: Alat kendali, Bluetooth, Arduino, AndroidABSTRACTIn a room full of electronic equipment, control device are very important. The limitations of a remote control to control only one electronic device become obstacles that it needs a lot of control devices To reduce these constraints are realized remote control that can control the entire electronic devices using integrated Bluetooth intermediaries on Android and Arduino. Android will send commands to the Arduino via Bluetooth, Arduino code to translate the commands into infrared subsequently accepted by the receiver electronics. The first test installs Android application on three different versions. The second experiment tests all the tool buttons control for each electronic equipment. The third test is to examine the percentage of success of the control apparatus , producing 94.8 % success using the control buttons and 92.8 % control success using voice commands. The four test calculate the access time when sending a command until the electronic device executes the corresponding command. This test result in an average access time of 0.17385 seconds for commands using the buttons and 0.20995 seconds for command using voice control. The fifth testing is to test the coverage area of infrared , infrared sender optimal distance ( Tx ) to the infrared receiver ( Rx ) is 320 cm by 180.8 cm widthKeywords: remote control, Bluetooth, Arduino, Android

Implementasi Distributed File Server pada Apache Web Server

In this research, a Distributed File Server (DFS) is developed to manage the need of a large storage space in the server, especially when the multimedia files are saved permanently in the web server. In the development, Apache Web Server is used with 1 computer as the main server, 2 computers as file servers, and 1 computer as the client who sends request. The result from the implementation of the DFS is the usage of main server’s storage space can be reduced by 99,77% from the full usage condition, causing an optimization in the web server. Another parameter is also being tested by the implementation of the DFS, which is the index.html page’s average access time. When only one server is being used, the average access time is 2,327 second. Whereas, when three servers are being used, the average access time is 5,577 second. Index Terms - Apache, distributed file server, web server optimization, average access time