Dynamic Unique Code Allocation for Printing Machines
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for allocating unique QR codes to printing machines face limitations in availability and utilization, leading to underutilization and wastage, as codes are pre-allocated and stored in large volumes, making it difficult to adapt to changing requirements and inefficiently utilize the limited number of simple QR codes.
Innovation Solution
A system and method that dynamically allocates and transmits unique codes from a server to printing machines based on real-time printing parameters, communication speed, and time intervals, allowing for optimal patch sizes of codes to be calculated and communicated, eliminating the need for permanent allocation and reducing wastage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If QR codes are pre-allocated and stored in storage devices in large volumes, then the availability of codes for printing is ensured, but the utilization efficiency is reduced due to underutilization and inability to adapt to changing requirements
Solution Approach 1:
The patent implements dynamic allocation of QR codes where the server continuously monitors the usage status of codes across multiple printing machines and reallocates unused codes from machines with excess inventory to machines that need them. This dynamic reallocation mechanism transforms the static pre-allocation system into an adaptive system that responds to changing requirements, thereby improving utilization efficiency while maintaining code availability.
2Manufacturing precision
If simple QR codes are used for better printing quality, then the printing quality is improved, but the number of available codes is limited
Solution Approach 1:
The patent creates a shared code pool that serves multiple printing machines simultaneously, allowing the limited number of simple QR codes to be utilized across different locations and machines. The server manages a universal inventory of simple codes that can be dynamically assigned to any machine needing them, maximizing the utilization of this limited resource while maintaining high printing quality standards across all machines.
3Quantity of substance
If QR codes are physically transferred to printing machines locations, then the codes are available for printing, but the risk of theft and reuse increases
Solution Approach 1:
The patent implements a digital transmission system where QR codes are sent as electronic data from the server to printing machines over a network, eliminating the need for physical transfer of storage devices. The codes exist as digital copies that can be securely transmitted and tracked, removing the physical security risks associated with transporting hard disks, USB drives, or CD-ROMs while maintaining code availability at machine locations.
4Duration of action of stationary object
If a large number of QR codes are allocated to each printing machine, then the codes are available for extended periods, but the adaptability to changing requirements is reduced
Solution Approach 1:
The patent establishes a feedback mechanism where the server continuously monitors the usage status of QR codes at each printing machine and receives information about current printing requirements. Based on this feedback, the server dynamically adjusts code allocations by transferring unused codes from machines with excess inventory to machines with higher demand, thereby adapting to changing requirements while maintaining continuous code availability across the network.
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
Method of using a central computer that is communicatively connectable to a first control computer, wherein the first control computer controls a first printing machine having a first rate of printing, and configured to dynamically allocate and transmit unique codes from a server to the first control computer. The method comprises the steps of: receiving a first request for a first patch of unique codes from the first control computer; determining a first time interval between the first request to the server and the unique code being available to be used by the first printing machine; determining a first communication speed between the server and the first printing machine; dynamically calculating a first optimum patch size of the first patch of unique codes to be delivered to the first printing machine based on the first request from the first control computer of the first printing machine, a file size of a unique code, a printing speed of the first printing machine, the first time interval and the first communication speed; and communicating a first patch of unique codes having a patch size equal to the first optimum patch size to the first control computer of the first printing machine.