Garbage collection can be made real-time and verifiable

An efficient means of memory reclamation (also known as Garbage Collection) is essential for Machine Intelligence applications where dynamic storage allocation is desired or required. Solutions for real-time systems must introduce very small processing overhead and must also provide for the verification of the software in order to meet the application time budgets and to verify the correctness of the software. Garbage Collection (GC) techniques are proposed for symbolic processing systems which may simultaneously meet both real-time requirements and verification requirements. The proposed memory reclamation technique takes advantage of the strong points of both the earlier Mark and Sweep technique and the more recent Copy Collection approaches. At least one practical implementation of these new GC techniques has already been developed and tested on a very-high performance symbolic computing system. Complete GC processing of all generated garbage has been demonstrated to require as little as a few milliseconds to perform. This speed enables the effective operation of the GC function as either a background task or as an actual part of the application task itself

Application of remote sensing to state and regional problems

The methods and procedures used, accomplishments, current status, and future plans are discussed for each of the following applications of LANDSAT in Mississippi: (1) land use planning in Lowndes County; (2) strip mine inventory and reclamation; (3) white-tailed deer habitat evaluation; (4) remote sensing data analysis support systems; (5) discrimination of unique forest habitats in potential lignite areas; (6) changes in gravel operations; and (7) determining freshwater wetlands for inventory and monitoring. The documentation of all existing software and the integration of the image analysis and data base software into a single package are now considered very high priority items

Perencanaan Reklamasi Pada Lahan Bekas Penambangan Timah di PT Berkat Berjaya Sejahtera, Kabupaten Bangka

One of the companies engaged in tin mining is PT Berkat Berjaya Sejahtera with reclamation planning from 2013 to 2022 with a planned land area of 10 Ha. However, the available area exceeds the planned area of 11.08 Ha. Based on these problems, the purpose of this research is to plan reclamation techniques and reclamation cost plans so that reclamation activities can run effectively and efficiently. The method used in this research is quantitative method. The data taken are soil pH and water pH data, topographic data (x, y, z coordinates). Data processing is carried out using a drone tool which is processed using surpac, minescape and surfer software. Based on the results of the research that has been carried out, it can be concluded that the reclamation technique plan is carried out by land stewardship by closing the void starting from elevation 2 to elevation 11 masl and leveling the land area to be reclaimed. The type of plant used in reclamation is oil palm the costs required for this reclamation are divided into 2, namely, Direct Costs and Indirect Costs. Direct costs required amount to Rp 1,326,572,000.00 and Indirect costs required amount to Rp 387,756,995.00. The total cost required for the reclamation of the 11.08 Ha land is IDR 1,714,328,995

Impact of Reclamation Development on Sedimentation and Current Pattern in East Coast Surabaya (Pamurbaya)

Reclamation is an effort to establish a new land area either in coastal areas or in the middle of the ocean. In Pamurbaya area a number of property projects both housing and apartments is still continuing. Environmental impacts of the coastal reclamation project is in the potential increase of flooding. The changes include the extent of the cluster, the composition of river sediments, the tidal pattern, the pattern of ocean currents along the coast and damaging the water system. This study examines changes in current patterns, morphology, and sedimentation rate due to the reclamation modeled using Delft3D software. The pattern of current flow after the reclamation has changed. Basic surface changes that occur before and after reclamation in each crossection is by difference, crossection 1 = +0.22 m, crossection 2 = -0.19 m, and crossection 3 = +0.11 m. The sign (+) shows the occurrence of sedimentation, while (-) is erosion. The condition after the reclamation in crossection 1 is sedimentation, crossection 2 is erosion, and crossection 3 is sedimentation. The difference in intensity is very small, therefore the erosion and sedimentation which took place after reclamation is not too significant

Lock-free Concurrent Data Structures

Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data. These operations are implemented through algorithms that have to be efficient. In the sequential setting, data structures are crucially important for the performance of the respective computation. In the parallel programming setting, their importance becomes more crucial because of the increased use of data and resource sharing for utilizing parallelism. The first and main goal of this chapter is to provide a sufficient background and intuition to help the interested reader to navigate in the complex research area of lock-free data structures. The second goal is to offer the programmer familiarity to the subject that will allow her to use truly concurrent methods.Comment: To appear in "Programming Multi-core and Many-core Computing Systems", eds. S. Pllana and F. Xhafa, Wiley Series on Parallel and Distributed Computin