A Python based implementation of swap curve bootstrapping using a multi-dimensional solver.

Transposes (swaps) the Y and Z axis of a 3-rd dimension MRF

This project provides a flexible framework for oceanographic time‑series forecasting. It separates dimensionality reduction (DR) and forecasting into interchangeable components, enabling you to swap in your own algorithms with minimal changes.

交换数组维度

A dimension-swapping metroidvania-esque puzzle game

视频维度互换特效制作工具

Through modularity and tool-less design, the skull allows swapping audio-visual sensors and external interactive interfaces. The design novelty is in being the first truly open-source, parametric head through FreeCAD. It offers almost limitless customization options for industry, research and hobbyists through dimensional modification.

The fourth assignment for AUT's Basic Programming course (Fall 2024) introduces advanced C programming challenges. Students will swap values of 2D arrays, transpose square matrices in-place, and sort arrays using various algorithms like Bubble Sort and Merge Sort. The tasks emphasize the mastery of pointers and multi-dimensional arrays.

No description available

No description available

aka CommunityBashProject

These two simple nodes for InvokeAI let you easily swap the width and height values for images. The Aspect Preset allows you to select a preset aspect ratio.

This is a datapack for minecraft that will swap the dimensions

Three dimensional array swapping axes.

cs-689-dimensional-modeling-swapnashenolikar created by GitHub Classroom

No description available

cs-689-dimensional-modeling-swapnashenolikar-1 created by GitHub Classroom

swap diagonal elements of 5 dimension array.

Fun Dimension Swapping game made in unity

No description available

Swap the time dimension with the x dimension in a video. Project Leader: Ajai Nelson

C# Program to swap adjacent elements of an one dimensional array.

Mathematica code for Proposal for High-Dimensional Entanglement Swapping with Linear Optics and Ancillary Photons

Java 2 dimensional array and Swap columns and rows / двумерный масив с заменой столбцов на рядки.

A 1-dimensional linear array of N compare-and-swap processing elements, where data flows through the array.

Autonomous overnight LLM eval pipeline for local GGUF models — multi-turn agentic tasks, dimension-routed dual-judge scoring, SQLite-backed comparison reports. Built for llama.cpp + llama-swap on dual-GPU rigs.

A C# console program for manipulating 2D arrays. It includes functions for allocating memory and initializing random values, swapping rows/columns, and rotating diagonals. The program displays the matrix after each operation using a two-dimensional format. The user can continue running the program until they want to quit.

These are C# scripts that are used in a Unity project that I am working on with a student of mine. The Unity project is very similar to the popular game Candy Crush because the user must swap objects on a two-dimensional grid to make alignments of the same color.

“Rubix Cube” is one among the easiest Computer Graphics Projects. The original game is a 2 Dimensional game that involves swapping of any 2 tiles and arranging the tiles in the correct sequence. We modified this idea to include a blank position. This now increases level of difficulty as only the tiles adjacent to the blank position can now be translated, unlike the Puzzle Slider game.

A bucket sort begins with a one-dimensional array of positive integers to be sorted and a two-dimensional array of integers with rows indexed from 0 to 9 and columns indexed from 0 to n – 1, where n is the number of values to be sorted. Each row of the two-dimensional array is referred to as a bucket. Write a class named BucketSort containing a method called sort that op erates as follows: a) Place each value of the one-dimensional array into a row of the bucket array, based on the value’s “ones” (rightmost) digit. For example, 97 is placed in row 7, 3 is placed in row 3 and 100 is placed in row 0. This procedure is called a distribution pass. b) Loop through the bucket array row by row, and copy the values back to the original array. This procedure is called a gathering pass. The new order of the preceding values in the one-dimensional array is 100, 3 and 97. c) Repeat this process for each subsequent digit position (tens, hundreds, thousands, etc.). On the second (tens digit) pass, 100 is placed in row 0, 3 is placed in row 0 (because 3has no tens digit) and 97 is placed in row 9. After the gathering pass, the order of the values in the one-dimensional array is 100, 3 and 97. On the third (hundreds digit) pass, 100 is placed in row 1, 3 is placed in row 0 and 97 is placed in row 0 (after the 3). After this last gathering pass, the original array is in sorted order. The two-dimensional array of buckets is 10 times the length of the integer array being sorted. This sorting technique provides better performance than a bubble sort, but requires much more memory—the bubble sort requires space for only one additional element of data. This comparison is an example of the space/time trade-off: The bucket sort uses more memory than the bubble sort, but performs better. This version of the bucket sort requires copying all the data back to the original array on each pass. Another possibility is to create a second two dimensional bucket array and repeatedly swap the data between the two bucket arrays.