Fading Coder

One Final Commit for the Last Sprint

Using Reactive Feign in Spring Cloud Gateway

Problem Root Cause Spring Cloud Gateway relies on a fully reactive, non-blocking thread pool. Attempting to use standard OpenFeign— which executes synchronous, blocking I/O calls—triggers an IllegalStateException with a message indicating block()/blockFirst()/blockLast() operations are disallowed on...

PAPR Performance Comparison: GFDM versus OFDM Signal Generation in MATLAB

This analysis implements a complete simulation framework for comparing the Peak-to-Average Power Ratio (PAPR) characteristics of Generalized Frequency Division Multiplexing (GFDM) and Orthogonal Frequency Division Multiplexing (OFDM) systems. The simulation covers baseband signal generation for bot...

Advanced MySQL Indexing and Query Optimization Techniques

Checking Query Execution CostTo evaluate the efficiency of a query execution plan, inspect the optimizer's cost calculation.SHOW SESSION STATUS LIKE 'Last_query_cost';Prefix Indexing for String ColumnsIndexing long text columns entirely can consume excessive space. Instead, index a prefix of the str...

Fixing the JDK Version Reset Triggered by POM Changes in IntelliJ IDEA

Many developers notice that after modifying the pom.xml in an IntelliJ IDEA Maven project, the configured JDK version silently drops back to a lower default. Even though the IDE’s Settings and Project Structure dialogs show the correct version, Maven’s re-import wipes out those manual overrides. Thi...

Function Implementation and Algorithm Tasks

task 1 question 1: the function convert_score_to_grade takes a enteger as input and returns a character representing the grade. question 2: the returned value will continue to output E until it reaches that value. task 2 question 1: adds all the digits of a number. question 2: yes, the original appr...

Solutions for Niuke Winter Algorithm Training Camp Problems D, H, I, J

Problem D: Array Product OperationsApproachGiven the constraint that |M| ≤ 109, any integer within this range can be decomposed into a product of at most 20 distinct factors. This observation is crucial for solving the problem efficiently.The strategy involves counting distinct elements in the array...

Setting Up Oracle 19c RAC with ASM on CentOS 7.4

Prerequisites 1. Environment Planning Before starting the installation, define the hardware and software specifications for the Oracle Real Application Clusters (RAC) environment. Component Specification Operating System Two CentOS 7.4 virtual machines Disk Space 50 GB per node Memory 4 GB per node...

Constructing Tree Structures via Recursion in C#

Processing hierarchical datasets frequently necessitates transforming a flat collection into a nested tree format. In C#, recursion provides an efficient mechanism to traverse parent-child relationships defined by identifiers. The following implementation demonstrates how to retrieve complete sub-st...

Computing Squared Euclidean Distances Between Point Sets in PointNet++

Computing Pairwise Squared Euclidean Distances def square_distance(src, dst): """ Compute squared Euclidean distances between each pair of points from two sets. The formula used is: ||a - b||^2 = ||a||^2 + ||b||^2 - 2 * a^T * b Input: src: source points, [B, N, C] dst: target points,...

Surviving Process Death with Android ViewModel and SavedStateHandle

When Android kills an application in the backgronud, the system may later restore it exactly where the user left off. To keep UI state across this recreation you can combine ViewModel with SavedStateHandle. The handle acts like a tiny key-value bundle that survives both configuration changes and pro...