101 results about "Reverse order" patented technology

The invention relates to the technical field of hard disks, in particular to a data protection method of a solid state disk and the solid state disk, the method comprises the steps that a flash memory medium is divided into a data block area, a log block area and a metadata area, and the metadata area comprises a mapping directory, a mapping block and a check point block; a block mapping table and a log page mapping table are established in a volatile memory, and dbMSN and lbMSN are stored. Adding write-in data to a log block page, updating a log page mapping table, and generating check points according to full writing of a log area. When no free page exists, the damaged log blocks are selected in a rotating mode to be combined, new data block migration pages are distributed, mapping is updated, the MSN is progressively increased, changes are written into the mapping blocks, and the mapping catalogue is updated when the mapping blocks are addressed. After restarting, positioning a mapping block by a mapping directory to recover block mapping, reading check points in a reverse order, and traversing an uncovered log area to reconstruct log page mapping; and comparing the dbMSN with the lbMSN, setting inconsistent log pages to be invalid, establishing consistent access and shielding invalid pages. According to the method and the device, the problems of data consistency and availability caused by metadata loss, uncertain merging state and low recovery efficiency of the hybrid mapping FTL in a crash scene can be solved.

Example implementations include a method, apparatus, and computer-readable medium configured for receiving, at an interface between a user and a large language model, an original natural language prompt including a plurality of facts from the user. The implementations further include generating a series of contextual sub-questions based on the original natural language prompt using the large language model. Additionally, the implementations further include providing the contextual sub-questions to the large language model to obtain contextual answers. Additionally, the implementations further include applying the contextual sub-questions against the original natural language prompt with the contextual answers as a refined natural language prompt to the large language model in a reverse order of the series. Additionally, the implementations further include outputting, to the user, a final answer from the large language model to a terminal state of the refined natural language prompt.

Instead of feeding data pairs “input”->“output” into a LLM to train it, an artificial “output”->“input” dataset is generated to fine tune the LLM on it. As an example, it may be difficult to parse object / action words from a random sentence. But generating a random sentence given an object, action pair can be solved easily, and these reversed pairs are used to fine tune the LLM.

The disclosure relates to a method, an apparatus, and a computer program for automatically resetting the statuses of error occurrence steps of an RPA process, and a method for automatically resetting the statuses of error occurrence steps of an RPA process of the disclosure presents a method including receiving status information for respective steps in reverse order of the RPA process from a step where an error was detected; adding a resetting operation corresponding to the status information to a resetting operation list; and resetting the statuses of the error occurrence steps based on the resetting operation list.

The embodiment of the application provides a wiping robot operation method and a wiping robot, and the method comprises the following steps: the wiping robot performs first operation on a current operation surface according to a first path mode; after the wiping robot is released from an abnormality, the wiping robot is located on the current operation surface again, and the distance between the wiping robot and a first edge is adjusted, so that the wiping robot is away from the first edge by a first distance; under the condition that the wiping robot is away from the first edge by the first distance, the wiping robot moves on the current operation surface in a first direction and a second direction in reverse order, so that the wiping robot can pass through an initial position at least once and continue to perform the first operation according to the first path mode. Through the application, the problem of waste of cleaning time and high energy consumption in the wiping robot operation method in the related art is solved, and the technical effects of improving cleaning efficiency and reducing energy consumption are achieved.

1. The name of the design product: patrol statistics graphical user interface for electronic device. 2. The use of the design product: an electronic device. 3. The design points of the design product: in the graphical user interface. 4. The picture or photo that best shows the design points: front view. 5. The design product is a flat product, omitting the left view, right view, top view, bottom view, rear view. 6. The human-computer interaction mode of the graphical user interface: the graphical user interface shown in the front view and the change state diagram is the patrol statistics content interface displayed in the electronic device. The front view displays the patrol statistics interface, the left side of the interface displays the patrol task and the regional statistics list, the upper right corner of the regional statistics list displays the normal order and reverse order button, the middle of the interface displays the map of each region, the right side of the interface displays the personnel statistics, the patrol result statistics, and the uncultivated land statistics, and the right upper corner of the interface displays the date column; clicking any one region in the middle of the front view displays the change state diagram 1, the interface displays the subordinate region patrol statistics interface of the region, and the right upper corner of the middle of the interface displays the return button; clicking the date column in the change state diagram 1 displays the change state diagram 2, and the date list is expanded below the date column; selecting any one date in the date list of the change state diagram 2 displays the change state diagram 3, and the interface displays the patrol statistics interface of the corresponding date. The gray area in the front view and each change state diagram is the deleted content screen, and "XX" represents the text or number. In the actual use process, the interface content displayed by the front view and each change state diagram can be correspondingly referred to the reference drawings.

The application provides a multi-directional text comparison method, comprising: exporting a packaging design drawing into a PDF format and parsing text content and corresponding position information; splitting the text parsed from the PDF according to intervals, and judging whether the split text is consistent; calculating 2-gram word frequency by using a large amount of Chinese corpus, calculating the probability of text in a normal order and a reverse order, and taking the probability as a basis to judge whether the text is in a reverse order; processing all the text according to position coordinates, judging the direction of the text block according to the normal order and the reverse order of the text, then sorting and merging the text in the text block; comparing the PDF text content with the standard text content for examination, matching similar lines, and marking the differences of the similar lines. The processing result can greatly reduce the structured difference between the parsed text and the actual text, improve the detection accuracy of the parsed text and the actual text, reduce the workload of manual intervention, thereby reducing the packaging design cost and precision.

The application relates to the technical field of semiconductor preparation, and particularly discloses a cleaning equipment scheduling method and device based on safe tank residence, wherein whether bubble occurrence has occurred is judged based on a first action sequence S1 corresponding to a current new task to be planned, and a process tank with bubble occurrence is a dangerous tank; if bubble occurrence has occurred and the process tank with bubble occurrence is the dangerous tank, a safe tank meeting preset residence conditions is searched in reverse order from a current action with bubble occurrence in the S1; when the safe tank meeting the preset residence conditions is found, forced residence time of a corresponding bubble task in the safe tank is determined based on bubble occurrence time; the priority of an action corresponding to the safe tank and each action after the action in the first action sequence S1 is updated based on the forced residence time; then whether bubble occurrence has occurred is judged based on a second action sequence S2 obtained after the update; if yes, a safe tank is searched in reverse order based on the same strategy, and the process is repeated until the rule succeeds.

The invention discloses a data recovery method and device, equipment, a medium and a product, and the method comprises the steps: obtaining a test interface calling request through an agent module, determining a corresponding thread local variable state based on the test interface calling request, and executing a data processing instruction corresponding to the test interface calling request according to the thread local variable state, storing corresponding data processing information based on the operation type of the data processing instruction; and through a rollback module, when a data recovery request is received, generating a corresponding data recovery instruction based on the data processing information, and executing the data recovery instruction according to an execution reverse order of the data processing instruction. According to the technical scheme, automatic recovery of the interface test data is conditionally realized, and the test efficiency is improved.

The invention discloses a temperature control method, a wire controller and a computer readable storage medium. The temperature control method is applied to the wire controller, the wire controller comprises a screen module and a controller, and the temperature control method comprises the steps that the maximum temperature rise of the controller within first preset time is acquired; in response to the fact that the maximum temperature rise is larger than a first temperature preset threshold value, an operation function corresponding to the maximum temperature rise is recorded into a function set, the controller is controlled to close background applications in sequence according to the unused time from long to short, and the brightness of the screen module is reduced to the minimum; and in response to the fact that the maximum temperature rise is smaller than a second temperature preset threshold value, the controller is controlled to sequentially recover the background applications according to the reverse order of closing the background applications, the brightness of the screen module is recovered, and the second temperature preset threshold value is smaller than the first temperature preset threshold value. According to the temperature control method, the influence of high temperature on the performance of the controller can be reduced, so that the service life of the wire controller is prolonged.

The application discloses a log recording method, device and equipment and a readable storage medium in the computer technical field. The application can determine each to-be-tested item existing in a URL in reverse order from the tail of the URL, then match the current URL according to the determined order (namely, the reverse order) of the to-be-tested items, and if the current URL matches a preset rule, it indicates that the key information needing to be recorded to the log is matched, so the matching content is recorded to the log, thereby the key information to be recorded can be accurately determined. The scheme does not need to analyze the whole URL in full amount, but quickly determines the key information needing to be recorded to the log from the tail of the URL, thereby improving the log recording efficiency, reducing the probability of recording redundant information to the log, and improving the log precision. Correspondingly, the log recording device, equipment and readable storage medium provided by the application also have the above technical effects.

This application discloses a data processing method and an electronic device. The method includes: dividing data to be transmitted into multiple data fragments, wherein the multiple data fragments are numbered sequentially; transmitting each data fragment sequentially in ascending order based on the sequential numbering of the data fragments through a first communication channel with a second device; transmitting each data fragment sequentially in reverse order based on the sequential numbering of the data fragments through a second communication channel with the second device; transmitting the data fragments simultaneously through the first communication channel and the second communication channel until all data fragments have been transmitted.

The invention provides an FST + NN-based double-engine German inverse text standardization method, which comprises the following steps of: S1, sending a German spoken input text into an input and preprocessing layer to obtain an input representation which can be stably processed by a rule / FST and lightweight neural module; s2, the candidate fragments provided by the input and preprocessing layer are standardized through a rule and FST modular analysis layer, inverted-order composite word formation, word form change and cross-category combination of German are covered, and output consistency is ensured through a unified disambiguation strategy; s3, candidate fragments which cannot be recognized and converted by the rule and FST modular analysis layer are recognized and transferred through a lightweight neural network auxiliary layer; and S4, converting'types + standard values' given by the rule and FST modular analysis layer and the lightweight neural network auxiliary layer into texts which can be directly used through an output and post-processing layer. According to the method, a finite-state machine is taken as a core, modular modeling is performed on different types of expressions in German, and long digits are decomposed into a plurality of subunits to be identified and combined step by step through a hierarchical analysis mechanism, so that the processing difficulty is effectively reduced, and the method is provided for overcoming the defects of a rule method in flexibility and coverage. A lightweight neural network is introduced as an auxiliary module and is used for identifying unregistered words and special composite structures which are difficult to cover by rules.

The embodiment of the specification provides a method and device for data processing in multi-party secure calculation. In a service processing process based on multi-party secure calculation, arithmetic inverse square root calculation is performed on a power of 2 in a Boolean sharing form constituted by two data parties. Under the corresponding technical concept, the characteristics of the power of 2 in the binary form and the Boolean sharing, and the positional relationship between the power of 2 and the inverse of the power of 2 before and after the decimal point are utilized. The inverse of the power of 2 in the Boolean sharing form is determined through the bit value reverse arrangement in the Boolean slice. Then, the two parties construct the square root value of the power of 2 by squaring through the splitting of the slice in the Boolean sharing form of the inverse of the power of 2. In this way, the data communication amount of the arithmetic inverse square root calculation of the power of 2 can be greatly reduced, and the service processing efficiency of the secure calculation is improved.

This application relates to the field of database operation and maintenance technology, specifically to an automated operation and maintenance method for audit system databases. This method includes: periodically collecting inventory levels and thresholds at each level of an LSM-Tree, and calculating the level capacity occupancy ratio; using eBPF technology to statistically analyze background I / O latency and traffic within a sliding window, and calculating the unit latency for background disk writes; performing recursive calculations in reverse order using the level capacity occupancy ratio to obtain the end-to-end logical write multiple; analyzing the coupling relationship between the level capacity occupancy ratios of adjacent levels, determining the multi-level concurrent congestion coefficient, obtaining the estimated unit data occupancy time, and inversely deriving the allowed front-end write rate; and combining this with a token bucket algorithm to smoothly limit the write requests of the front-end audit system. The goal of this application is to achieve early detection of backlog trends within the LSM-Tree and to automatically perform predictive traffic control to optimize the operation and maintenance management of the audit system database.

A storage device is disclosed herein. The storage device comprises: a non-volatile memory, where the non-volatile memory includes a block of N wordlines partitioned into a plurality of sub-blocks and the plurality of sub-blocks includes a first sub-block of a first subset of the block of N wordlines and a second sub-block of a second subset of the block of N wordlines; and control circuitry coupled to the block of N wordlines. The control circuitry is configured to: perform a program operation in a normal order programming sequence on the first sub-block; perform a sensing operation on the first sub-block using a reverse sensing scheme; perform a program operation in a reverse order programming sequence on the second sub-block; and perform a sensing operation on the second sub-block using a regular sensing scheme.

According to an embodiment of the present disclosure, a method, device, equipment and storage medium for evaluating a target task are provided. The method comprises: determining at least one dialogue set by dividing the multi-round dialogue data of a target object arranged in reverse chronological order; determining the corresponding evaluation information of the at least one dialogue set by using a trained machine learning model, the evaluation information at least indicating the operation characteristics and attitude change trend of the target object in the corresponding time range for the target evaluation task; determining the target evaluation information for the multi-round dialogue data by performing a weighted fusion operation on the corresponding evaluation information based on the corresponding time range; and determining the evaluation result for the target evaluation task based on the target evaluation information. Thus, by batch summarization and time sequence weighting, the behavior and willingness change of the user in different time ranges can be effectively captured, thereby improving the accuracy of the evaluation and the sensitivity to the time sequence trend.

In an example of a game according to an exemplary embodiment, movement control of a player object is performed on a field, movement control of another object is performed, in accordance with a moving distance of the player object or a lapse of time, history information including at least either of a velocity and a position of the player object in chronological order is stored, in accordance with a first instruction based on an operation input, the movement control of the other object is continued, the movement control of the player object is suspended, and based on the history information, rewind control for returning the player object to a position in the past in reverse order to the chronological order in which the history information is stored is performed.

The application provides a DFA algorithm-based card bin matching method and system, and relates to the technical field of Internet. The method comprises the following steps: constructing a card bin library, and locally caching database card bin information; storing the information into the local cache; when a service is started and initialized, first querying the database card bin information data to obtain a list set; traversing the set to take the card bin therein as a key and the entity data as a value; taking the first 6 bits of the card bin with 6 bits or more as the key, and directly taking the card bin with less than 6 bits as the key; first judging whether there is a key; when there is no key, taking a newly created list set as a value, and putting the card bin into the card bin library in a reverse order according to the length of the card bin; when there is a key, putting the card bin data into the list set, and storing the card bin into the card bin library in a reverse order according to the length of the card bin. The method can realize accurate and efficient matching of the card bin, and avoids the problem of removing the database brute force query.

A method of evaluating delegation of authority from a delegator to a delegate in a distributed access control system for governing access to digital data resource. The method comprising steps of receiving a plurality of leaf policies, where each leaf policy specifies actions and rules associated with access control, each leaf policy requires authority verification. The method comprises receiving a plurality of DoAPs, each DoAP specifies characteristics that define policy identification, and each DoAP, except for root DoAP, requires authority verification. The method comprises checking for authority verification for each leaf policy and for each DoAP, generating plurality of recursive administration requests based on checking step until root DoAP reached and responding to each of plurality of recursive administration requests to ensure that each DoAP resolved, thereby evaluating delegation of authority in the distributed access control system, where the responding is carried out in reverse order, starting from root DoAP.

The application discloses an image encryption method based on fractional order Lur' e chaotic system synchronization. The method uses the Caputo fractional order differential operator to construct a fractional order Lur' e master chaotic system as a key stream generator, uses the time delay segmentation principle to design a time delay state feedback controller for a slave system, and ensures that the master-slave system realizes robust synchronization under the performance index mu through a linear matrix inequality (LMI) condition; a sending end runs the master system to generate a pseudo-random key stream, performs pixel scrambling and XOR diffusion encryption on a plaintext image in sequence, and transmits a ciphertext image through a public channel; a receiving end reconstructs a synchronous slave system according to a shared key, and performs decryption in reverse order to recover the plaintext image. The application expands the key space, provides a corresponding theoretical upper bound of the influence of channel interference on decryption error, considers security, robustness and practicability, and is suitable for image secure communication scenes in a noisy channel environment.

The application provides a material absolute first-in-first-out storage and conveying method, which comprises the following steps: taking out empty box groups from a storage library and inputting the empty boxes in sequence, and filling the empty boxes with materials during the conveying process; sorting at least two full boxes filled with materials which are continuously output in a first horizontal direction according to the output sequence to form a full box group, storing the full box group in the storage library in a translation mode, and recording the storage time; taking out the full box group with the earliest storage time from the storage library in a translation mode and inputting the full box group in a second horizontal direction opposite to the first horizontal direction; emptying the materials in the full boxes during the conveying process of the full boxes in the currently taken-out full box group, and sorting at least two empty boxes which are continuously output after the materials are emptied to form an empty box group and storing the empty box group in the storage library; and arranging the full boxes in the current full box group in a reverse order before the full box group is stored in the storage library or after the full box group is taken out from the storage library. The application realizes the absolute first-in-first-out storage of materials.

The invention relates to the technical field of ship modification, and discloses an in-dock block closure deflection rapid control method, which comprises the following steps of: 1, determining parameters of a block to be closed; step 2, adjusting ballast water; thirdly, the block to be folded is hoisted in; fourthly, sinking control is conducted on the hoisted block; 5, a cloud rail trolley is adopted to conduct fine positioning on the block; sixthly, the horizontal datum line of the block is adjusted in an auxiliary mode through a laser theodolite; seventhly, the second step to the sixth step are repeated from back to front, the warehouse block is sequentially hoisted, and finally the original ship bow block is hoisted until all the blocks to be folded are positioned; according to the method, through cooperative work division of the laser theodolite and the cloud rail trolley, the docking period is shortened, the block hoisting sequence from back to front is combined, the base line condition of the positioned block is dynamically monitored in real time through the laser theodolite erected at the tail after each block is hoisted, deviation accumulation and later reworking are avoided, and the quality risk is greatly reduced.

This invention discloses a circuit and implementation method for sorting sequences bit-by-bit according to index values, relating to the field of digital signal processing technology. It solves the problems of high hardware requirements, complex design, and unpredictable processing delay in existing processor-based bit-by-bit sorting by index values. Key features of the solution include: multiple reversal processing layers, the number of which is determined by the length of the input sequence; the input terminal with the smallest layer number receives the input sequence, and the output terminal with the largest layer number sends the output sequence; each reversal processing layer includes multiple reversal units, the number of which is the same as the layer number; the input terminal with the largest number serves as the input terminal of the layer, and the output terminal with the smallest number serves as the output terminal of the layer; wherein, the number... j The reversing unit is used to process the input sequence with a length of , dividing the sequence into 4 equal segments according to the input order, keeping the first and last segments unchanged, and swapping the middle two segments; the above problem is solved by performing hierarchical reversing processing through a simple circuit structure.

1. The name of the present design product: code recognition column of dialogue graphical user interface of electronic device. 2. The use of the present design product: for an electronic device. 3. The design points of the present design product: the protected part of the graphical user interface in the electronic device. 4. The picture or photo that best indicates the design points: design 3 front view. 5. Design 4 is designated as the basic design. 6. The use of the graphical user interface: the graphical user interface is used for dialogue. The protected part of the graphical user interface is used to identify the code content in the dialogue and execute it. The graphical user interface can be interacted by the user clicking on the graphical user interface or by operating the mouse or tapping the keyboard. The code recognition column presented by design 1 front view includes the SQL statement block preview area on the left and the intelligent agent answer list area on the right. During the process of the user's dialogue with the intelligent agent, the SQL intelligent assistant identifies the intelligent agent answer content, the graphical user interface changes from design 1 front view to design 1 change state figure 1, the identified intelligent agent answers are presented in the intelligent agent answer list area in the order of time in reverse, if the intelligent agent answer including the SQL statement block is selected in the intelligent agent answer list area, the SQL statement block preview area will display the preview of the corresponding SQL statement block; by clicking the "execute task" button, the graphical user interface changes from design 1 change state figure 1 to design 1 change state figure 2, showing that the task is being executed; after a period of time, the graphical user interface changes from design 1 change state figure 2 to design 1 change state figure 3, showing that the task execution is completed, the execution result preview is displayed below the left part of the code recognition column, including the total number of execution results, possible Error information, etc., the user can download the execution result by clicking the "download result" button. The code recognition column presented by design 2 front view includes the SQL statement block preview area on the left and the intelligent agent answer list area on the right, if the intelligent agent answer including the SQL statement block is selected in the intelligent agent answer list area, the SQL statement block preview area will display the preview of the corresponding SQL statement block, by clicking the "execute task" button, the graphical user interface changes from design 2 front view to design 2 change state figure 1, showing that the task is being executed; after a period of time, the graphical user interface changes from design 2 change state figure 1 to design 2 change state figure 2, showing that the task execution is completed, the execution result preview is displayed below the left part of the code recognition column, including the total number of execution results, possible Error information, etc., the user can download the execution result by clicking the "download result" button. The code recognition column presented in the main view of Design 3 includes a SQL statement block preview area on the left and an intelligent agent answer list area on the right. If an intelligent agent answer including a SQL statement block is selected in the intelligent agent answer list area, the SQL statement block preview area will display a preview of the corresponding SQL statement block. By selecting an intelligent agent answer marked as "in execution", the graphical user interface changes to the state diagram 1 of Design 3, and the button in the upper right corner prompts that the task is in execution. By selecting an intelligent agent answer marked as "completed", the graphical user interface changes to the state diagram 2 of Design 3, and the lower part of the left side of the code recognition column displays a preview of the execution result, including the total number of execution results, possible Error information, etc. The user can download the execution result by clicking the "download result" button. By selecting an intelligent agent answer without the SQL statement block marked, the graphical user interface changes to the state diagram 3 of Design 3, and the SQL statement block preview area prompts "no SQL statement block is recognized". The code recognition column presented in the main view of Design 4 includes a SQL statement block preview area on the left and an intelligent agent answer list area on the right. If an intelligent agent answer including a SQL statement block is selected in the intelligent agent answer list area, the SQL statement block preview area will display a preview of the corresponding SQL statement block. By clicking the "execute task" button, the graphical user interface changes from the main view of Design 4 to the state diagram of Design 4, and displays that the task execution is completed. The lower part of the left side of the code recognition column displays a preview of the execution result, including the total number of execution results, possible Error information, etc. The user can download the execution result by clicking the "download result" button. 7. Other circumstances that need to be explained Other explanations: The part of the graphical user interface shown by the dashed line in each view of Design 1 to Design 4 does not constitute the part required to be protected by the appearance design.

The invention discloses a reverse programming implementation method and device based on a Flash memory, which are applied to electronic equipment, and the electronic equipment comprises the Flash memory. The method comprises the steps of obtaining a data size of to-be-written data to obtain a first data size; performing keyword extraction on the to-be-written data to obtain a target keyword; determining a first modification frequency of the to-be-written data according to the target keyword; when the first data size is smaller than the first preset data size and the first modification frequency is smaller than the first preset modification frequency, according to the first data size, distributing reverse-order physical blocks from the free block queue for the data to be written, and obtaining n reverse-order physical blocks; and writing the to-be-written data into the n inverted physical blocks. By adopting the method and the device, reverse writing of the Flash memory can be intelligently realized, so that the intelligence and the flexibility of the Flash memory are improved.

The application provides a message display method and device, electronic equipment and storage medium, wherein the method comprises the following steps: determining and generating a first message element corresponding to a message container according to the message content of the latest chat message in a target conversation; obtaining a second message element corresponding to a historical chat message before the latest chat message in the target conversation; determining and generating a placeholder element based on the first message element, the second message element and the attribute information of the message container; and arranging and rendering the message elements corresponding to each chat message in the message container in a top-down order according to the time stamp of each chat message in the target conversation in a reverse order, and arranging and rendering the placeholder element at the top of the message container. On the one hand, the target of the latest chat message can be displayed at the bottom of the message container, and on the other hand, the performance overhead caused by JavaScript operation of a document object model (DOM) does not need to be considered, thereby improving the performance of page rendering.

The invention belongs to the technical field of data processing, and provides a paging-based message comparison method and device and electronic equipment, and the method comprises the steps: traversing each page according to a time reverse order, and opening departure data, and performing message comparison operation on the message of the current page open departure data and the message of each page of host data, and performing message comparison on the message of the current page open departure data and the message of each page of host data until all pages of host data are traversed, completing the message comparison process, and obtaining a corresponding message comparison result. According to the message comparison method, open departure data and host data are sequentially divided into a plurality of pages, and messages of each page of the open departure data and messages of each page of the host data are sequentially compared according to a reverse time order; therefore, only the full text of a part of the message and a part of the comparison result exist in the memory, and the performance of the message comparison tool is greatly improved.

The invention discloses a small-span space catering conveying method based on an unmanned aerial vehicle, and relates to the technical field of unmanned aerial vehicles, and the method comprises the steps: S1, conveying an instruction group which comprises an unmanned aerial vehicle number, a meal taking area number and a dining table area number; s2, performing initialization; s3, corresponding instruction numbers from the fly preparing area to the meal taking area; s4, when the instruction is only the cup area number, executing the step S5, and when the instruction is only the dinner plate area number, executing the step S6; s7, when the instruction comprises a cup area number and a dinner plate area number at the same time, executing the step S7, and when the position of the number corresponding to the instruction is vacant, executing the step S8; s5, executing a cup clamping command and a cup releasing command; s6, executing a dinner plate clamping command and a dinner plate releasing command; s7, firstly executing a cup clamping command; the order of the dinner plate clamping command and the order of the releasing command are opposite; s8, executing a hole closing or opening command; and S9, flying back to the landing position corresponding to the serial number of the standby flying area. According to the method, the whole meal and / or beverage conveying process is automatically completed, the catering operation efficiency is improved, and the labor cost is saved.

This invention discloses a parallel reverse shuffling sampling method, belonging to the fields of graph data processing and machine learning. The method involves sampling k elements from n elements, performing k reverse shuffling operations to process the shuffling process in reverse order, randomly selecting a position within the corresponding deck size range for each operation, and determining the sampling strategy based on whether an element has already been sampled. The time complexity of this method is O(k·log₂k), which is only related to the number of samples, overcoming the limitation of traditional methods by the degree of the original graph nodes. Furthermore, a GPU parallel implementation method is provided, which decouples operation dependencies through a label propagation strategy, achieving a time complexity of O(k·log₂k). 2 (k / warp_size). This invention achieves a 5.89x performance improvement in fanout-based neighbor sampling and a 5.30x performance improvement in probability-based neighbor sampling, and can be widely applied to large-scale graph data processing in fields such as social networks, recommender systems, and bioinformatics.