Economic-geographical assessment of the demographic situation and economic potential of the inter-capital Belarusian-Russian borderlands

Geographic research of the phenomenon of inter-capital space of the Belarusian-Russian border region is an actual research area problem for the socio-economic geography of Belarus and Russia. This is due to the objective need to develop mechanisms of overcoming the demographic and economic peripherality of the region and embedding regional economic systems of border regions into the system of local relations. The purpose of the research is to identify the current distinctive features of the demographic and economic development of the inter-capital space of the Belarusian-Russian border region with the establishment of its niche from the point of the central-peripheral approach. During the analysis of the demographic situation of the inter-capital space of the Belarusian-Russian borderlands, it was established that, generally, in 1999–2019, its main feature was peripherality with the three zones established – the central demographic periphery, the buffer demographic periphery and the demographic semi-periphery – with a predominance in the structure of the first zone. Geographically, the central periphery zone is formed mainly by the rural borderland areas. According to the results of the analysis of the industrial development level, it was discovered that the inter-capital space of the Belarusian-Russian borderlands is characterised by a high degree of spatial inequality due to the development of large industrial centers around the existing periphery. This research had established a spatial differentiation of the transportation accessibility (by the connectivity of administrative centers of the borderlands) and the productivity of road transportation. The economicgeographical analysis of the foreign trade had revealed the diversity of directions and intensity of foreign goods trade between the Belarusian-Russian borderlands, mainly expressed in the predominance of the export-oriented regions with the per capita foreign trade turnover estimated at up to 2000 US dollars.

Area-Efficient Universal Code Generator for GPS L1C and BDS B1C Signals

Recently, multi-frequency multi-constellation receivers have been actively studied, which are single receivers that process multiple global navigation satellite system (GNSS) signals for high accuracy and reliability. However, in order for a single receiver to process multiple GNSS signals, it requires as many code generators as the number of supported GNSS signals, and this is one of the problems that must be solved in implementing an efficient multi-frequency multi-constellation receiver. This paper proposes an area-efficient universal code generator that can support both GPS L1C signals and BDS B1C signals. The proposed architecture alleviates the area problem by sharing common hardware in a time-multiplex mode without degrading the overall system performance. According to the result of the synthesis using the CMOS 65 nm process, the proposed universal code generator has an area reduced by 98%, 93%, and 60% compared to the previous memory-based universal code generator (MB UCG), the Legendre-generation universal code generator (LG UCG), and the Weil-generation universal code generator (WG UCG), respectively. Furthermore, the proposed generator is applicable to all Legendre sequence-based codes.

An iterative local search based hybrid algorithm for the service area problem

This article presents a hybrid algorithm for the service area problem. The design of service areas is one of the essential issues in providing efficient services in both the public and private sectors. For a geographical region with a number of small spatial units, the service area problem is to assign the service-demand units to the service-supply units such that each facility has a service area. The basic criteria for the service areas are the highest service accessibility, the contiguous service areas, and that the service demand does not exceed the service supply in each service area. A hybrid algorithm for the service area problem is proposed by extending iterative local search (ILS) algorithm with three schemes: population-based ILS, variable neighborhood descent (VND) search, and set partitioning. The performance of the algorithm was tested using 60 well-designed instances. Experimentation showed that the instances could be solved effectively and efficiently. The solutions found by the hybrid algorithm approximate optimal solutions or the lower bounds with an average gap of 0.15%.

Archimedes of Syracuse and Sir Isaac Newton: On the Quadrature of a Parabola

Good mathematics stands the test of time. As culture changes, we often ask different questions, bringing new perspectives, but modern mathematics stands on ancient discoveries. Isaac Newton’s discovery of calculus (along with Leibniz) may seem old but is predated by Archimedes’ findings. Current mathematics students should be familiar with parabolas and simple curves; in our introductory calculus courses, we teach them to compute the areas under such curves. Our modern approach derives its roots from Newton’s work; however, we have filled in many of the gaps in the pursuit of mathematical rigor. What many students may not know is that Archimedes solved the area problem for parabolas long before the use of algebraic expressions became mainstream. Archimedes used the geometry of the ancient Greeks, which gave him a vastly different perspective. In this paper we provide both Archimedes’ and Newton’s proofs involving the quadrature of the parabola, trying to remain true to their original texts as much as feasible.

High sensitivity rate-integrating hemispherical resonator gyroscope with dead area compensation for damping asymmetry

The rate-integrating gyroscope (RIG) operation is considered as the next generation architecture for hemispherical resonator gyroscopes (HRGs) with advantages of direct angle measurement and unlimited dynamic range. However, this RIG operation requires high symmetry for the HRG device and the damping mismatch of the two gyroscopic modes will result in a dead area problem. This work analyzes the error mechanism of the damping asymmetry induced dead area and proposed a novel virtual procession compensation method for HRG RIG. The simulation proves the existence of the dead area as the theory predicted. More importantly, the experimental HRG RIG platform with the proposed compensation method can significantly expand the dynamic range with accurate angle measurement and overcome the problem of dead area. The earth rotation is accurate measured which is the first time that captured by a RIG scheme as a state-of-the-art result.

Innovation in Diversification of Various Processed Shells of Northern Coastal Women Craftsmen with High Economical Value in Surabaya Indonesia

A research-based community service program titled Diversified Innovation of Processed Shellfish from Northern Coastal Craftsmen with Economic Value and High Nutrition Potential in the Kulon-Kedung Cowek Cumpat Area Surabaya (1) Mitra1 Ibu Siti Chotimah located at Jl Cumpat Kulon Baru I / 88-Kedung Cowek Surabaya (1) 2) Mitra2 The women of fishermen's wives in the Cumpat Kulon area. Problem: During this time the production and marketing process is very inefficient and ineffective for SMEs that want to improve into a home industry, even though the capacity and high productivity are as follows: 1) to produce various processed shells of Cumpat Kulon-Kedung Cowek Surabaya women who use materials traditional natural spices that are healthy mixing ingredients and spices so far have used manual labor so that the mixing of herbs can not be maximized. 2) To smooth the shells as a superior and basic material is still with a traditional improvised tool in the form of mortar. 3) Marketing is not widely known yet it is superior to the north coast. The solution: 1) the use of a motor-powered mixer machine Specifications:Voltage: 220v Frequency: 50 / 60hz Power: 450 watt Engine Weight: 57 kg Machine diameter: 45 x 36.6 x 60.6 cm 2) use of meat grinder Front hole diameter 9 cm. Upper hole diameter 12 cm. Grinding height 24 cm. meat grinder Front hole diameter 9 cm. Upper hole diameter 12 cm. Grinding height 24 cm. 3) Providing training in creativity and innovation in the manufacture of products from shellfish and e-marketing of coastal products from Kenjeran to partners1 and partners2. Methods: (1) Design, build, maintain, use of a motor-powered mixer machine Specifications: Voltage: 220 frequency: 50/60 Hz Power: 450 watts Machine Weight: 57 kg. Machine diameter: 45 x 36.6 x 60.6 cm (2) Design, build, care for using meat grinder Front hole diameter 9 cm. Upper hole diameter 12 cm. Grinding height 24 cm. (3) Training, practice and mentoring transmit the mindset and behavior of an entrepreneur to students until he behaves and is entrepreneurial for partners1 and partners as well as e-marketing with smartphones.

One Way to Fill All the Concave Region in Grid-Based Map

SUMMARY The search space of the path planning problem can greatly affect the running time and memory consumption, for example, the concave obstacle in grid-based map usually leads to the invalid search space. In this paper, the filling container algorithm is proposed to alleviate the concave area problem in 2D map space, which is inspired from the scenario of pouring water into a cup. With this method, concave areas can be largely excluded by scanning the map repeatedly. And the effectiveness has been proved in our experiments.

EEARP - an Efficient and Energy Aware Routing Protocol for Underwater Wireless Sensor Networks

Recently, Underwater Wireless Sensor Networks (UWSNs) have attracted significant attention from both academia and industry to explore the vast underwater environment. Since UWSNs suffer from long propagation delay, low bandwidth, and high error rate, providing an efficient routing protocol is challenging. This paper proposes EEARP, a series of new routing protocols for underwater networks to improve the performance of existing DBR. The DBR does not consider energy. It only receives data packets from upper depth node and forwards the packets to lower depth nodes. Moreover, this greedy behavior of DBR causes void area problem. EEARP creates a directed acyclic graph rooted at a sink. Each node receives information like depth, energy, and the number of parents from its parents. When forwarding, each node sends a data packet to one or more of its parent nodes. We implemented EEARP in NS2 simulator and evaluated its performance under different scenarios. Results confirm that EEARP outperforms DBR in terms of energy saving, network lifetime, end-to-end delay and packet loss ratio.