Unordered List Generation for Dynamic Wallpaper Playback
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional wallpaper carousel methods lack efficiency in generating unordered lists for image playback, leading to repetitive and unengaging visual experiences on terminal devices.
Innovation Solution
A method and apparatus for generating an unordered list by randomly acquiring and inserting elements from an ordered list, cycling through the process until the number of elements in the unordered list matches the ordered list, ensuring a unique and dynamic image playback sequence, and incorporating automatic image deletion based on configuration parameters and storage weights.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If traditional wallpaper carousel methods extract wallpapers directly from a database for playback, then the implementation is simple, but the visual experience is repetitive and lacks engagement
Solution Approach 1:
The patent applies dynamics by transforming the static, fixed-order wallpaper playback into a dynamic, randomized sequence. The unordered list generation algorithm randomly shuffles wallpaper elements, making the playback sequence variable and unpredictable, thereby enhancing visual experience diversity while maintaining implementation feasibility
Solution Approach 2:
The patent changes the ordering parameter of the wallpaper sequence from fixed (traditional) to randomized (unordered list). By modifying the sequence parameter through random acquisition and insertion operations, the system achieves diverse visual experiences without complicating the core extraction mechanism
2Adaptability or versatility
If the unordered list generation process continuously cycles through random acquisition and insertion operations, then a unique playback sequence is achieved, but the computational complexity increases
Solution Approach 1:
The unordered list generation algorithm is self-service in that it automatically manages its own state through the cyclic process. The algorithm tracks the number of elements in the unordered list versus the ordered list, automatically determining when to continue or terminate the random acquisition and insertion operations, reducing the need for external control complexity
Solution Approach 2:
The patent implements feedback by continuously monitoring the element count comparison between the unordered and ordered lists. This feedback mechanism controls the cyclic execution, ensuring the process terminates when the unordered list contains all elements, thereby managing complexity through automated termination conditions
3Quantity of substance
If images are continuously stored in the database for wallpaper carousel, then the visual content is abundant, but storage overflow may occur
Solution Approach 1:
The patent applies discarding and recovering by implementing automatic deletion of images based on configuration parameters and storage weights. Less preferred images are discarded when storage thresholds are reached, while the system recovers storage space to maintain abundant visual content without causing overflow
Solution Approach 2:
The image management system is self-service through automatic deletion operations. The system autonomously monitors storage conditions, evaluates image preferences using configuration parameters, and deletes appropriate images without user intervention, balancing content abundance with storage constraints
Data Source
AI summary
A method and apparatus for generating an unordered list, a method for managing images and a terminal device are disclosed. The method for generating the unordered list includes: randomly acquiring a first element from an ordered list and inserting the first element into the unordered list; cycling the execution of the following steps in a case where a number of current elements in the unordered list is smaller than a sum of elements in the ordered list: determining whether a position at which the first element is located is an edge position in the ordered list and randomly acquiring a second element from the ordered list based on a determining result, and randomly acquiring a target position from the unordered list and inserting the second element into the target position in the unordered list; and ending the cyclic execution in a case where the number of the elements in the unordered list is equal to the sum of the elements in the ordered list.