CN115599809A - Database layout design method based on particle swarm optimization algorithm - Google Patents

Database layout design method based on particle swarm optimization algorithm Download PDF

Info

Publication number
CN115599809A
CN115599809A CN202211433093.8A CN202211433093A CN115599809A CN 115599809 A CN115599809 A CN 115599809A CN 202211433093 A CN202211433093 A CN 202211433093A CN 115599809 A CN115599809 A CN 115599809A
Authority
CN
China
Prior art keywords
interface
control module
central control
layout
central
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202211433093.8A
Other languages
Chinese (zh)
Other versions
CN115599809B (en
Inventor
何春平
钟建聪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zeen Technology Co ltd
Original Assignee
Zeen Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zeen Technology Co ltd filed Critical Zeen Technology Co ltd
Priority to CN202211433093.8A priority Critical patent/CN115599809B/en
Publication of CN115599809A publication Critical patent/CN115599809A/en
Application granted granted Critical
Publication of CN115599809B publication Critical patent/CN115599809B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/242Query formulation
    • G06F16/2428Query predicate definition using graphical user interfaces, including menus and forms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/248Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/26Visual data mining; Browsing structured data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9538Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/451Execution arrangements for user interfaces
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/004Artificial life, i.e. computing arrangements simulating life
    • G06N3/006Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/043Optimisation of two dimensional placement, e.g. cutting of clothes or wood

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Business, Economics & Management (AREA)
  • Software Systems (AREA)
  • Human Resources & Organizations (AREA)
  • Computational Linguistics (AREA)
  • Strategic Management (AREA)
  • Human Computer Interaction (AREA)
  • Mathematical Physics (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Design And Manufacture Of Integrated Circuits (AREA)

Abstract

The invention relates to the technical field of intelligent algorithms, in particular to a database layout design method based on a particle swarm optimization algorithm, which comprises the following steps: gradually iterating the central points of the areas by utilizing a particle swarm optimization algorithm to determine the positions of the alternative central points in the page to be laid; the central control module selects a single alternative central point from a plurality of alternative central points which accord with the matching standard as a layout central point of the interface; the central control module preliminarily determines the size interval of the interface according to historical data stored in a database when the central control module completes the determination of the layout central point of the single interface; the central control module is used for transmitting the information to the information publishing module when the layout of each interface is finished so as to finish the layout of each interface in the page; the invention can effectively improve the retrieval efficiency aiming at the data and the layout efficiency aiming at the page by reasonably arranging the retrieval interactive page aiming at the database.

Description

Database layout design method based on particle swarm optimization algorithm
Technical Field
The invention relates to the technical field of intelligent algorithms, in particular to a database layout design method based on a particle swarm optimization algorithm.
Background
In the information era, more and more people choose to conveniently live through life sharing, information inquiry and the like through an internet platform. Various contents of an internet platform can be displayed to a user through a page, and a component exists in the related technology and can be used for switching different modules in the page to display, but the component cannot be flexibly adapted to various user clients in the actual page layout, so that the use scene of the user is greatly limited. By reasonable layout of the retrieval interactive page aiming at the database, the retrieval efficiency aiming at the data and the speed for acquiring the required data from the retrieval result can be effectively improved.
Chinese patent publication No.: CN103366035B discloses a layout design apparatus and a layout design method, the layout design apparatus has: an item storage unit that stores items used in layout design; a 1 st database that accumulates layout design information of individual users and evaluation values thereof for each user; a 2 nd database that accumulates, for each type corresponding to the attribute of the user, layout design information of the type and an evaluation value thereof; and a layout design generation unit that generates a layout design of the predetermined item using the predetermined item stored in the item storage unit, based on at least one of the layout design information and the evaluation value of the individual predetermined user stored in the 1 st database and the layout design information and the evaluation value of the type corresponding to the attribute of the predetermined user stored in the 2 nd database.
Therefore, in the prior art, the actual distribution position of each interface cannot be determined according to the actual attention duration of the user to each region in the page, so that the user cannot quickly acquire information in the corresponding interface when using the page for data interaction, and the retrieval efficiency of data in the database is low.
Disclosure of Invention
Therefore, the invention provides a database layout design method based on a particle swarm optimization algorithm, which is used for solving the problem of low retrieval efficiency aiming at data in a database caused by the fact that the actual distribution positions of all interfaces cannot be effectively determined in the prior art.
In order to achieve the above object, the present invention provides a database layout design method based on a particle swarm optimization algorithm, which comprises:
step s1, dividing a page to be laid into a plurality of areas, recording a central point of each area as a reference particle to obtain a plurality of particles in the page to be laid, respectively determining an initial value of a variable to be optimized of each particle, and gradually iterating the central points of the areas by utilizing a particle swarm optimization algorithm to determine the position of each alternative central point in the page to be laid;
step s2, the central control module records the coordinates of the alternative central points and respectively calculates the absolute distance between each alternative central point and the coordinates of the absolute central points in the page to be laid so as to sequentially grade each alternative central point;
step s3, when a single interface is laid out, the central control module matches the candidate center points with corresponding ratings according to the function priority of the interface in the page to be laid out and selects a single candidate center point from a plurality of candidate center points according with matching standards as the layout center point of the interface; the central control module preliminarily determines the size interval of the interface according to historical data stored in a database when the central control module determines the layout central point of a single interface;
step s4, the central control module respectively detects whether edge overlapping areas exist on the edges of each adjacent interface when the layout of each interface is finished, and adjusts the layout center point coordinates of the corresponding interface or the size interval of the corresponding interface to corresponding values when the two interface edges are judged to be overlapped;
and step s5, the central control module transmits layout information to the information publishing module to complete the layout of each interface in the page when the layout of each interface is completed and no interface with overlapped edges exists.
Further, in the step s1, the central control module divides the page to be laid out into m × n areas and sequentially counts average duration stay time of the pointer in the page in each area through the database, where m and n are both natural numbers, for the area in the ith row and the nth column, i =1,2,3,. The m, j =1,2,3,. The n is set, the central control module records the average history stay time of the pointer in the area as Tij and takes Tij as an initial value of a reference particle variable to be optimized in the area, and the central control module gradually iterates the central point of each area by using a particle swarm optimization algorithm when the determination of the initial value of each particle variable to be optimized in the page to be laid out is completed to determine the position of each candidate central point in the page to be laid out and records the coordinates of each candidate central point when the determination of the position of each candidate central point is completed.
Further, for a single interface to be laid out, the central control module generates coordinate information P and a size interval E for the interface when finishing the layout of the interface, and sets P (x, y), E (h, l), where x is an abscissa of a center point of the interface layout in a coordinate system corresponding to the page to be laid out, y is an ordinate of the center point of the interface layout in a coordinate system corresponding to the page to be laid out, h is a transverse size of the center point and the edge of the interface layout, and l is a longitudinal size of the center point and the edge of the interface layout, and the central control module records four edge points of the interface as Pa, pb, pc, and Pd, respectively, where Pa (x + h, y + l), pb (x-h, y + l), pc (x-h, y-l), and Pd (x + h, y-l).
Further, for a single candidate center point P (x, y), the central control module obtains the coordinate value of the candidate center point to calculate the absolute distance L between the candidate center point and the absolute center point and ranks the candidate center point according to the absolute distance, sets the coordinate P0 (x 0, y 0) of the absolute center point,
Figure 905506DEST_PATH_IMAGE001
(ii) a The central control module is internally provided with a first preset absolute distance L1, a second preset absolute distance L2, a third preset absolute distance L3 and a fourth preset absolute distance L4, wherein L1 is more than L2 and less than L3 and less than L4,
if L is less than or equal to L1, the central control module ranks the alternative center points as primary alternative center points, and selects corresponding alternative center points from the primary alternative center points as layout center points of the interface when the central control module performs layout aiming at the data display interface;
if L1 is larger than L and is not larger than L2, the central control module ranks the alternative central point as a secondary alternative central point, and the central control module selects a corresponding alternative central point from the secondary alternative central points as a layout central point of the interface when the display switching interface is laid out;
if L2 is larger than L and is not larger than L3, the central control module grades the candidate central point as a third-level candidate central point, and the central control module selects a corresponding candidate central point from the third-level candidate central points as a layout central point of the interface when the secondary screening interface is subjected to layout;
and if L3 is larger than L and smaller than or equal to L4, the central control module grades the candidate central point as a four-level candidate central point, and the central control module selects a corresponding candidate central point from the four-level candidate central points as a layout central point of the interface when the data retrieval interface is laid out.
Further, when the central control module detects whether the single interface is overlapped with other interfaces, the central control module marks the interface to be detected as a first interface, if the central control module determines that the first interface is overlapped with the interface adjacent to the first interface, the central control module detects the number N of the interfaces overlapped with the first interface and determines an adjusting mode aiming at the first interface according to the number, the central control module is provided with a first preset overlapping number N1 and a second preset overlapping number N2, wherein N1 is less than N2,
if N is less than or equal to N1, the central control module sequentially detects the grades of the layout center points in the first interface and each interface overlapped with the first interface and sequentially adjusts the corresponding layout center points to corresponding values according to the ascending order of the grades;
if N1 is more than N and less than or equal to N2, the central control module detects the distribution condition of the interface overlapped with the first interface and further judges whether the layout central point or the size interval of the first interface is adjusted;
and if N is greater than N2, the central control module judges that the size interval of the first interface is adjusted to a corresponding value.
Further, when the central control module eliminates the overlapping of the two interfaces by adjusting the single layout central point, the central control module respectively determines the transverse adjustment amount and the longitudinal adjustment amount of the corresponding layout central point according to the occasion width of the overlapping area of the two interfaces; if the interface to be adjusted is overlapped with the plurality of interfaces, the central control module sequentially detects each overlapped area, sequences each overlapped area according to the descending order of the areas of the overlapped areas, and sequentially adjusts the abscissa and the ordinate of the layout center point in the interface to be adjusted according to the length and the width of each overlapped area in the sequence.
Further, when the number N of the interfaces overlapped with the first interface satisfies that N is less than or equal to N1 and the central control module completes the adjustment of the corresponding layout center point coordinate,
if the original overlap is not eliminated and no new overlap is generated, the central control module secondarily adjusts the corresponding layout central point according to the area of the overlap region which is not eliminated;
if the original overlap is eliminated and no new overlap is generated, the central control module judges that the adjustment aiming at the first interface is finished;
and if the original overlap is eliminated and a new overlap is generated or the original overlap is not eliminated and the new overlap is generated, the central control module carries out secondary adjustment on the corresponding layout central point according to each overlap area.
Further, when the number N of the interfaces overlapping with the first interface satisfies N1 < N ≦ N2,
if the overlapped area is only distributed on one edge of the first interface, the central control module judges that the abscissa of the layout center point of the first interface is adjusted to a corresponding value;
if the overlapped areas are distributed on two adjacent edges in the first interface, the central control module judges that the abscissa and the ordinate of the layout central point of the first interface are respectively adjusted to corresponding values;
if the overlapped areas are distributed on two opposite edges of the first interface or the number of the overlapped areas distributed in the first interface is more than or equal to three, the central control module judges that the size interval of the first interface is adjusted to a corresponding value according to the area of each overlapped area overlapped with the first interface.
Further, the central control module sequentially detects the area of each overlapping area overlapped with the first interface when adjusting the size interval of the first interface, obtains the maximum overlapping area G therefrom, adjusts the size interval of the first interface to a corresponding value according to G, and is provided with a first preset overlapping area G1, a second preset overlapping area G2, a first size space adjusting coefficient alpha 1, a second size space adjusting coefficient alpha 2 and a third size space adjusting coefficient alpha 3, wherein G1 is greater than G2,0 is greater than alpha 1 and is greater than alpha 2 and is greater than alpha 3 and is less than 1,
if G is less than or equal to G1, the central control module judges that the size interval of the first interface is adjusted by using alpha 3;
if G1 is larger than G and smaller than or equal to G2, the central control module judges that the size interval of the first interface is adjusted by alpha 2;
if G is greater than G2, the central control module judges that the size interval of the first interface is adjusted by using alpha 1;
when the central control module adjusts the size interval of the first interface by using α k, k =1,2,3 is set, and the central control module records the adjusted size interval of the first interface as E ', and sets E' (h × α k, l × α k).
Further, when the central control module adjusts the position of the layout center point in the interface to eliminate the overlapping area between the interface and the adjacent interface of the interface, if the central control module determines that the adjusted interface overlaps the page edge, the central control module determines to adjust the size interval of the interface to eliminate the overlapping between the interface and the page edge.
Compared with the prior art, the method has the advantages that the center points of the areas are iterated step by utilizing a particle swarm optimization algorithm to determine the positions of the alternative center points in the page to be distributed, the data retrieval efficiency and the speed of acquiring required data from the retrieval result can be effectively improved by determining the layout center points and the size intervals of the interfaces, and the data retrieval efficiency of the page distributed by the method in the database is effectively improved while the layout efficiency of the method is effectively improved; meanwhile, when the overlapped interfaces are judged to exist in the page with the primarily finished layout, the coordinate or the size interval of the layout center point of the corresponding interface is adjusted according to the rating of the layout center point in each interface, so that the interfaces are effectively prevented from being overlapped, the situation that each interface is located at the optimal position in the optimal size is ensured, the layout efficiency of the method is further improved, and the retrieval efficiency of the page which is laid out by using the method is further improved for the data in the database.
The central control module divides the page to be laid out into m × n areas, counts the average duration dwell time of the pointer in each area in the page in sequence through the database to complete the determination of the position of each alternative central point, and determines the layout neutral point and the size interval of each interface through a particle swarm optimization algorithm.
Furthermore, the invention determines the actual position and the actual size of a single interface by using the coordinate information and the size interval of the layout central point, and can quickly and accurately complete the layout of each interface, thereby further improving the layout efficiency by using the method of the invention.
The central control module obtains the coordinate value of each alternative central point to calculate the absolute distance L between the alternative central point and the absolute central point, and selects the corresponding alternative central point as the layout central point of the interface according to the function of each interface.
The method comprises the steps that a plurality of preset overlapping numbers are set on a central control module, the central control module detects the number N of interfaces overlapped with a first interface and determines an adjusting mode aiming at the first interface or the interface adjacent to the first interface according to the number when the central control module judges that the first interface and the interface adjacent to the first interface are overlapped, the number N of the interfaces overlapped with the first interface is detected to adjust the coordinate or the size interval of the layout center point of the corresponding interface to a corresponding value, the interfaces are effectively prevented from being overlapped, meanwhile, the optimal size of each interface is located at the optimal position in a page, the layout efficiency of the method is further improved, and meanwhile, the retrieval efficiency of the page which is laid out by the method aiming at data in a database is further improved.
Further, when the number N of the interfaces overlapped with the first interface is equal to or less than N1, the central control module determines whether to perform secondary adjustment on the corresponding layout center point according to whether the current overlapped area is eliminated or whether a new impact area is generated, and performs secondary detection after completing single adjustment on the coordinates of the layout center point, so that the situation that the interface which is not eliminated or adjusted in the current overlapped area and other interfaces generate new overlapped areas can be effectively avoided, the interfaces are ensured to be located at the optimal positions in the page in the optimal size while the interfaces are effectively prevented from being overlapped, the layout efficiency of the method is further improved, and the retrieval efficiency of the page which is laid out by using the method of the invention on data in the database is further improved.
Further, when the number N of the interfaces overlapped with the first interface satisfies N1 < N ≦ N2, the central control module determines whether to adjust the layout center coordinates or the size interval of the first interface to the corresponding value according to the distribution condition of each interface overlapped with the first interface, further avoids the interface overlap, and further ensures that each interface is located at the optimal position in the page with the optimal size, further improves the layout efficiency of the method of the present invention, and further improves the retrieval efficiency of the page laid out by using the method of the present invention for the data in the database.
Further, the central control module sequentially detects the areas of the overlapping areas overlapped with the first interface when adjusting the size interval of the first interface, obtains the maximum overlapping area G from the areas, adjusts the size interval of the first interface to a corresponding value according to the maximum overlapping area G, can quickly and accurately eliminate the overlapping by determining the maximum overlapping area, further avoids the disorder of the interface, and further improves the retrieval efficiency of the page which is distributed by using the method of the invention aiming at the data in the database.
Further, when the central control module adjusts the position of the layout center point in the interface to eliminate the overlapping area between the interface and the adjacent interface, the central control module detects whether the adjusted interface overlaps with the page edge and adjusts the size interval of the interface to eliminate the overlapping between the interface and the page edge, and whether the interface overlaps with the page is detected, the page can be effectively and reasonably arranged, so that the interface is ensured to be positioned at the optimal position in the page in the optimal size, the layout efficiency of the method is further improved, and the retrieval efficiency of the page arranged by using the method of the invention for the data in the database is further improved.
Drawings
FIG. 1 is a structural block diagram of a database layout design method based on a particle swarm optimization algorithm according to the present invention;
FIG. 2 is a flow chart of a database layout design method based on particle swarm optimization algorithm according to the present invention;
FIG. 3 is a flow chart of the present invention for determining an adjustment to a first interface based on an amount of overlap;
fig. 4 is a flowchart illustrating adjusting the size interval of the first interface to a corresponding value according to the area of each overlapping region according to the present invention.
Detailed Description
In order that the objects and advantages of the invention will be more clearly understood, the invention is further described below with reference to examples; it should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood by those skilled in the art that these embodiments are only for explaining the technical principle of the present invention, and do not limit the scope of the present invention.
It should be noted that in the description of the present invention, the terms of direction or positional relationship indicated by the terms "upper", "lower", "left", "right", "inner", "outer", etc. are based on the directions or positional relationships shown in the drawings, which are only for convenience of description, and do not indicate or imply that the device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention.
Furthermore, it should be noted that, in the description of the present invention, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; it may be a mechanical connection that is connected to, or may be an electrical connection; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
Please refer to fig. 1, which is a block diagram of a database layout design method based on a particle swarm optimization algorithm according to the present invention, including:
a database for storing historical data of all ion iterations;
the information issuing module is used for issuing information;
the central control module is respectively connected with the database and the information publishing module and is used for recording the coordinates of the alternative central points and grading the alternative central points; matching the candidate center points with corresponding grades according to the function priority of the interface, selecting a single candidate center point from a plurality of candidate center points which accord with the matching standard as the layout center point of the interface, and preliminarily determining the size interval of the interface according to historical data stored in a database; detecting whether edge overlapping areas exist on the edges of every two adjacent interfaces or not, and adjusting the corresponding interfaces when the edges of the two interfaces are overlapped; and transmitting the layout condition of each interface in the page to an information publishing module to complete the layout of each interface in the page.
Please refer to fig. 2, which is a flowchart of the database layout design method based on the particle swarm optimization algorithm of the present invention, the database layout design method based on the particle swarm optimization algorithm of the present invention includes:
step s1, dividing a page to be laid into a plurality of areas, recording a central point of each area as a reference particle to obtain a plurality of particles in the page to be laid, respectively determining an initial value of a variable to be optimized of each particle, and gradually iterating the central points of the areas by utilizing a particle swarm optimization algorithm to determine the position of each alternative central point in the page to be laid;
step s2, the central control module records the coordinates of the alternative central points and respectively calculates the absolute distance between each alternative central point and the absolute central point coordinate in the page to be laid so as to grade each alternative central point in sequence;
step s3, when a single interface is laid out, the central control module matches the candidate center points with corresponding ratings according to the function priority of the interface in the page to be laid out and selects a single candidate center point from a plurality of candidate center points according with matching standards as the layout center point of the interface; the central control module preliminarily determines the size interval of the interface according to historical data stored in a database when the central control module completes the determination of the layout central point of the single interface;
step s4, the central control module respectively detects whether edge overlapping areas exist on the edges of each adjacent interface when finishing the layout of each interface, and adjusts the layout center coordinates of the corresponding interface or the size interval of the corresponding interface to corresponding values when judging that the edges of the two interfaces are overlapped;
and step s5, the central control module transmits layout information to the information publishing module to complete the layout of each interface in the page when the layout of each interface is completed and no interface with overlapped edges exists.
Specifically, in the step s1, the central control module divides the page to be laid out into m × n areas and sequentially counts average duration stay time of the pointer in each area in the page through the database, where m and n are both natural numbers, for the area in the ith row and the nth column, i =1,2,3,. Faradic, m, j =1,2,3,. Faradic, n are set, the central control module records the average history stay time of the pointer in the area as Tij and takes Tij as an initial value of a reference particle variable to be optimized in the area, and the central control module gradually iterates the central point of each area by using a particle swarm optimization algorithm when the initial value of each particle variable to be optimized in the page to be laid out is determined, so as to determine the position of each candidate central point in the page to be laid out and respectively record the coordinates of each candidate central point when the position of each candidate central point is determined.
The central control module divides the page to be laid out into m multiplied by n areas, sequentially counts the average duration stay time of the pointer in each area in the page through the database to complete the determination of the position of each alternative central point, and determines the layout neutral point and the size interval of each interface through the particle swarm optimization algorithm.
Specifically, for a single interface to be laid out, the central control module generates coordinate information P and a size interval E for the interface when finishing the layout of the interface, and sets P (x, y), E (h, l), where x is an abscissa of a center point of the interface layout in a coordinate system corresponding to the page to be laid out, y is an ordinate of the center point of the interface layout in a coordinate system corresponding to the page to be laid out, h is a transverse size of the center point and the edge of the interface layout, and l is a longitudinal size of the center point and the edge of the interface layout, and the central control module records four edge points of the interface as Pa, pb, pc, and Pd, respectively, where Pa (x + h, y + l), pb (x-h, y + l), pc (x-h, y-l), and Pd (x + h, y-l).
The invention determines the actual position and the actual size of a single interface by using the coordinate information and the size interval of the layout central point, and can quickly and accurately complete the layout of each interface, thereby further improving the layout efficiency by using the method of the invention.
Specifically, for a single candidate center point P (x, y), the central control module obtains the coordinate value of the candidate center point to calculate the absolute distance L between the candidate center point and the absolute center point, ranks the candidate center point according to the absolute distance, sets the coordinate P0 (x 0, y 0) of the absolute center point,
Figure 298310DEST_PATH_IMAGE001
(ii) a The central control module is internally provided with a first preset absolute distance L1, a second preset absolute distance L2, a third preset absolute distance L3 and a fourth preset absolute distance L4, wherein L1 is more than L2 and less than L3 and less than L4,
if L is less than or equal to L1, the central control module ranks the alternative center points as primary alternative center points, and selects corresponding alternative center points from the primary alternative center points as layout center points of the interface when the central control module performs layout aiming at the data display interface;
if L1 is larger than L and is not larger than L2, the central control module ranks the alternative central point as a secondary alternative central point, and the central control module selects a corresponding alternative central point from the secondary alternative central points as a layout central point of the interface when the display switching interface is laid out;
if L2 is larger than L and is not larger than L3, the central control module grades the candidate central point as a third-level candidate central point, and the central control module selects a corresponding candidate central point from the third-level candidate central points as a layout central point of the interface when the secondary screening interface is subjected to layout;
and if L3 is greater than L and less than or equal to L4, the central control module grades the candidate center point as a four-level candidate center point, and the central control module selects a corresponding candidate center point from the four-level candidate center points as a layout center point of the interface when the data retrieval interface is laid out.
The central control module obtains the coordinate value of each alternative central point to calculate the absolute distance L between the alternative central point and the absolute central point, and selects the corresponding alternative central point as the layout central point of the interface according to the function of each interface.
Referring to fig. 3, which is a flowchart illustrating determining an adjustment manner for a first interface according to an overlap amount according to the present invention, when the central control module detects whether a single interface overlaps with other interfaces, the central control module marks the interface to be detected as the first interface, and if the central control module determines that the first interface overlaps with an interface adjacent to the first interface, the central control module detects an amount N of interfaces overlapping with the first interface and determines an adjustment manner for the first interface according to the amount, the central control module has a first preset overlap amount N1 and a second preset overlap amount N2, where N1 is less than N2,
if N is less than or equal to N1, the central control module sequentially detects the grades of the layout center points in the first interface and each interface overlapped with the first interface and sequentially adjusts the corresponding layout center points to corresponding values according to the ascending order of the grades;
if N1 is larger than N and is not larger than N2, the central control module detects the distribution condition of the interface overlapped with the first interface and further judges whether the layout central point or the size interval of the first interface is adjusted;
and if N is larger than N2, the central control module judges that the size interval of the first interface is adjusted to a corresponding value.
The central control module is provided with a plurality of preset overlapping quantities, and when the edges of two adjacent interfaces have an overlapping phenomenon, the adjusting mode of the interface is judged according to the overlapping quantities.
The method comprises the steps that a plurality of preset overlapping quantities are set on the central control module, when the central control module judges that the first interface and the interface adjacent to the first interface are overlapped, the central control module detects the quantity N of the interfaces overlapped with the first interface and determines an adjusting mode aiming at the first interface or the interface adjacent to the first interface according to the quantity, the quantity N of the interfaces overlapped with the first interface is detected so as to adjust the coordinate or the size interval of the layout center point of the corresponding interface to a corresponding value, the interface overlapping is effectively avoided, meanwhile, the optimal size of each interface is located at the optimal position in a page, the layout efficiency of the method is further improved, and meanwhile, the retrieval efficiency of the page which is laid out by the method is further improved aiming at data in a database.
Specifically, when the central control module eliminates the overlap of the two interfaces by adjusting the single layout central point, the central control module respectively determines the transverse adjustment amount and the longitudinal adjustment amount of the corresponding layout central point according to the occasion width of the overlap region of the two interfaces; if the interface to be adjusted is overlapped with the plurality of interfaces, the central control module sequentially detects each overlapped area, sequences each overlapped area according to the descending order of the areas of the overlapped areas, and sequentially adjusts the abscissa and the ordinate of the layout center point in the interface to be adjusted according to the length and the width of each overlapped area in the sequence.
Specifically, when the number N of the interfaces overlapped with the first interface satisfies N ≦ N1 and the central control module completes the adjustment of the corresponding layout center point coordinate,
if the original overlap is not eliminated and no new overlap is generated, the central control module secondarily adjusts the corresponding layout central point according to the area of the overlap region which is not eliminated;
if the original overlap is eliminated and no new overlap is generated, the central control module judges that the adjustment aiming at the first interface is finished;
and if the original overlap is eliminated and a new overlap is generated or the original overlap is not eliminated and the new overlap is generated, the central control module carries out secondary adjustment on the corresponding layout central point according to each overlap area.
When the number N of the interfaces overlapped with the first interface is equal to or less than N1 and the central control module completes the adjustment of the corresponding layout central point coordinate, the central control module performs secondary adjustment on the non-eliminated overlapped area according to the actual situation, so that the reasonability of the interface layout is effectively improved, the retrieval efficiency aiming at data and the speed of acquiring required data from the retrieval result can be effectively improved, and the layout efficiency of the method is further improved.
When the central control module completes the adjustment of the corresponding layout center point coordinate under the condition that the number N of the interfaces overlapped with the first interface is not more than N1, whether the corresponding layout center point coordinate is secondarily adjusted is judged according to whether the current overlapped area is eliminated or whether a new impact area is generated, the secondary detection is carried out after the single adjustment of the layout center point coordinate is completed, the occurrence of the condition that the current overlapped area is not eliminated or the adjusted interface and other interfaces generate new overlapped areas can be effectively avoided, the interfaces are ensured to be positioned at the optimal position in the page in the optimal size while the interfaces are effectively prevented from being overlapped, the layout efficiency of the method is further improved, and the retrieval efficiency of the page which is laid out by using the method of the invention for the data in the database is further improved.
Specifically, when the number N of interfaces overlapping the first interface satisfies N1 < N.ltoreq.N 2,
if the overlapped area is only distributed on one edge of the first interface, the central control module judges that the abscissa of the layout center point of the first interface is adjusted to a corresponding value;
if the overlapped areas are distributed on two adjacent edges in the first interface, the central control module judges that the abscissa and the ordinate of the first interface layout central point are adjusted to corresponding values respectively;
if the overlapped areas are distributed on two opposite edges of the first interface or the number of the overlapped areas distributed in the first interface is more than or equal to three, the central control module judges that the size interval of the first interface is adjusted to a corresponding value according to the area of each overlapped area overlapped with the first interface.
When the number N of the interfaces overlapped with the first interface meets N1 and N is not less than N2, the central control module judges whether to adjust the coordinate or the size interval of the layout center point of the first interface to a corresponding value according to the distribution condition of each interface overlapped with the first interface, further ensures that each interface is positioned at the optimal position in a page with the optimal size while further avoiding the interface overlapping, further improves the layout efficiency of the method, and further improves the retrieval efficiency of the page which is laid out by using the method of the invention aiming at the data in the database.
Please refer to fig. 4, which is a flowchart illustrating the present invention adjusting the size interval of the first interface to a corresponding value according to the area of each overlapping area, wherein the central control module sequentially detects the area of each overlapping area overlapping the first interface when adjusting the size interval of the first interface, obtains the maximum overlapping area G therefrom, and adjusts the size interval of the first interface to the corresponding value according to G, the central control module has a first preset overlapping area G1, a second preset overlapping area G2, a first size space adjustment coefficient α 1, a second size space adjustment coefficient α 2, and a third size space adjustment coefficient α 3, wherein G1 is greater than G2,0 is greater than α 1 is greater than α 2 is greater than α 3 is less than 1,
if G is less than or equal to G1, the central control module judges that the size interval of the first interface is adjusted by alpha 3;
if G1 is larger than G and smaller than or equal to G2, the central control module judges that the size interval of the first interface is adjusted by alpha 2;
if G is larger than G2, the central control module judges that the size interval of the first interface is adjusted by using alpha 1;
when the central control module adjusts the size interval of the first interface by using α k, k =1,2,3 is set, and the central control module records the adjusted size interval of the first interface as E ', and sets E' (h × α k, l × α k).
Further, the central control module sequentially detects the areas of the overlapping areas overlapped with the first interface when adjusting the size interval of the first interface, obtains the maximum overlapping area G from the areas, adjusts the size interval of the first interface to a corresponding value according to the maximum overlapping area G, can quickly and accurately eliminate the overlapping by determining the maximum overlapping area, further avoids the disorder of the interface, and further improves the retrieval efficiency of the page which is distributed by using the method of the invention aiming at the data in the database.
Specifically, when the central control module adjusts the position of the layout center point in the interface to eliminate the overlapping area between the interface and the adjacent interface, if the central control module determines that the adjusted interface overlaps the page edge, the central control module determines to adjust the size interval of the interface to eliminate the overlapping between the interface and the page edge.
Further, when the central control module adjusts the position of the layout center point in the interface to eliminate the overlapping area between the interface and the adjacent interface, the central control module detects whether the adjusted interface overlaps with the page edge and adjusts the size interval of the interface to eliminate the overlapping between the interface and the page edge, and whether the interface overlaps with the page is detected, the page can be effectively and reasonably arranged, so that the interface is ensured to be positioned at the optimal position in the page in the optimal size, the layout efficiency of the method is further improved, and the retrieval efficiency of the page arranged by using the method of the invention for the data in the database is further improved.
So far, the technical solutions of the present invention have been described in connection with the preferred embodiments shown in the drawings, but it is easily understood by those skilled in the art that the scope of the present invention is obviously not limited to these specific embodiments. Equivalent changes or substitutions of related technical features can be made by those skilled in the art without departing from the principle of the invention, and the technical scheme after the changes or substitutions can be within the protection scope of the invention.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention; various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A database layout design method based on particle swarm optimization algorithm is characterized by comprising the following steps:
step s1, dividing a page to be laid into a plurality of areas, recording a central point of each area as a reference particle to obtain a plurality of particles in the page to be laid, respectively determining an initial value of a variable to be optimized of each particle, and gradually iterating the central points of the areas by utilizing a particle swarm optimization algorithm to determine the position of each alternative central point in the page to be laid;
step s2, the central control module records the coordinates of the alternative central points and respectively calculates the absolute distance between each alternative central point and the coordinates of the absolute central points in the page to be laid so as to sequentially grade each alternative central point;
step s3, when a single interface is laid out, the central control module matches the candidate center points with corresponding ratings according to the function priority of the interface in the page to be laid out and selects a single candidate center point from a plurality of candidate center points according with matching standards as the layout center point of the interface; the central control module preliminarily determines the size interval of the interface according to historical data stored in a database when the central control module completes the determination of the layout central point of the single interface;
step s4, the central control module respectively detects whether edge overlapping areas exist on the edges of each adjacent interface when the layout of each interface is finished, and adjusts the layout center point coordinates of the corresponding interface or the size interval of the corresponding interface to corresponding values when the two interface edges are judged to be overlapped;
and step s5, the central control module transmits layout information to the information publishing module to complete the layout of each interface in the page when the layout of each interface is completed and no interface with overlapped edges exists.
2. The method for designing a database layout based on particle swarm optimization algorithm according to claim 1, wherein in the step s1, the central control module divides the page to be laid out into m × n areas and sequentially counts the average duration of stay time of the pointer in each area in the page through the database, where m and n are both natural numbers, for the area in the ith row and the nth column, i =1,2,3,.., m, j =1,2,3,.. And n are set, the central control module records the average historical stay time of the pointer in the area as Tij and takes Tij as the initial value of the variable to be optimized of the reference particle in the area, and the central control module gradually iterates the central points of each area by using the particle swarm optimization algorithm when the initial value of each variable to be optimized of the particles in the page to be laid out is determined, so as to determine the position of each candidate central point in the page to be laid out, and records the coordinates of each candidate central point when the determination of each candidate central point is completed.
3. The database layout design method based on particle swarm optimization algorithm according to claim 2, wherein for a single interface to be laid out, the central control module generates layout center point coordinate information P and a size interval E for the interface when finishing laying out the interface, and sets P (x, y), E (h, l), where x is an abscissa of the interface layout center point in a coordinate system corresponding to the page to be laid out, y is an ordinate of the interface layout center point in a coordinate system corresponding to the page to be laid out, h is a transverse size of the interface layout center point and an edge, and l is a longitudinal size of the interface layout center point and the edge, and the central control module records four edge points of the interface as Pa, pb, pc and Pd, respectively, where Pa (x + h, y + l), pb (x-h, y + l), pc (x-h, y-l), pd (x + h, y-l).
4. The database layout design method based on particle swarm optimization algorithm according to claim 3, wherein for a single candidate center point P (x, y), the central control module obtains the coordinate value of the candidate center point to calculate the absolute distance L between the candidate center point and the absolute center point and ranks the candidate center point according to the absolute distance, sets the coordinate P0 (x 0, y 0) of the absolute center point,
Figure 711708DEST_PATH_IMAGE001
(ii) a The central control module is internally provided with a first preset absolute distance L1, a second preset absolute distance L2, a third preset absolute distance L3 and a fourth preset absolute distance L4, wherein L1 is more than L2 and less than L3 and less than L4,
if L is less than or equal to L1, the central control module ranks the alternative center points as primary alternative center points, and selects corresponding alternative center points from the primary alternative center points as layout center points of the interface when the central control module performs layout aiming at the data display interface;
if L1 is larger than L and is smaller than or equal to L2, the central control module ranks the alternative center point as a secondary alternative center point, and the central control module selects a corresponding alternative center point from the secondary alternative center points as a layout center point of the interface when the display switching interface is laid out;
if L2 is larger than L and is not larger than L3, the central control module grades the candidate central point as a third-level candidate central point, and the central control module selects a corresponding candidate central point from the third-level candidate central points as a layout central point of the interface when the secondary screening interface is subjected to layout;
and if L3 is larger than L and smaller than or equal to L4, the central control module grades the candidate central point as a four-level candidate central point, and the central control module selects a corresponding candidate central point from the four-level candidate central points as a layout central point of the interface when the data retrieval interface is laid out.
5. The database layout design method based on the particle swarm optimization algorithm according to claim 4, wherein when the central control module detects whether a single interface overlaps with other interfaces, the central control module marks the interface to be detected as a first interface, if the central control module determines that the first interface overlaps with an interface adjacent to the first interface, the central control module detects the number N of the interfaces overlapping with the first interface and determines an adjustment mode for the first interface according to the number, the central control module is provided with a first preset overlapping number N1 and a second preset overlapping number N2, wherein N1 is less than N2,
if N is less than or equal to N1, the central control module sequentially detects the grades of the layout center points in the first interface and each interface overlapped with the first interface and sequentially adjusts the corresponding layout center points to corresponding values according to the ascending order of the grades;
if N1 is larger than N and is not larger than N2, the central control module detects the distribution condition of the interface overlapped with the first interface and further judges whether the layout central point or the size interval of the first interface is adjusted;
and if N is larger than N2, the central control module judges that the size interval of the first interface is adjusted to a corresponding value.
6. The database layout design method based on the particle swarm optimization algorithm, as set forth in claim 5, wherein the central control module determines the horizontal adjustment amount and the vertical adjustment amount of the corresponding layout center point according to the field width of the overlapped area of the two interfaces when adjusting a single layout center point to eliminate the overlap of the two interfaces; if the interface to be adjusted is overlapped with the plurality of interfaces, the central control module sequentially detects each overlapped area, sequences each overlapped area according to the descending order of the areas of the overlapped areas, and sequentially adjusts the abscissa and the ordinate of the layout center point in the interface to be adjusted according to the length and the width of each overlapped area in the sequence.
7. The database layout design method based on particle swarm optimization algorithm according to claim 6, wherein when the number N of the interfaces overlapping the first interface satisfies N ≦ N1 and the central control module completes the adjustment of the corresponding layout center point coordinate,
if the original overlap is not eliminated and no new overlap is generated, the central control module secondarily adjusts the corresponding layout central point according to the area of the overlap region which is not eliminated;
if the original overlap is eliminated and no new overlap is generated, the central control module judges that the adjustment aiming at the first interface is finished;
and if the original overlap is eliminated and a new overlap is generated or the original overlap is not eliminated and the new overlap is generated, the central control module carries out secondary adjustment on the corresponding layout central point according to each overlap area.
8. The particle swarm optimization algorithm-based database layout design method of claim 7, wherein when the number N of interfaces overlapping the first interface satisfies N1 < N ≦ N2,
if the overlapped area is only distributed on one edge of the first interface, the central control module judges that the abscissa of the layout center point of the first interface is adjusted to a corresponding value;
if the overlapped areas are distributed on two adjacent edges in the first interface, the central control module judges that the abscissa and the ordinate of the layout central point of the first interface are respectively adjusted to corresponding values;
if the overlapping regions are distributed on two opposite edges of the first interface or the number of the edges of the overlapping regions distributed in the first interface is more than or equal to three, the central control module judges that the size interval of the first interface is adjusted to a corresponding value according to the area of each overlapping region overlapped with the first interface.
9. The database layout design method based on particle swarm optimization algorithm according to claim 8, wherein the central control module sequentially detects the areas of the overlapping areas overlapping the first interface, obtains the maximum overlapping area G therefrom, and adjusts the size interval of the first interface to a corresponding value according to G when adjusting the size interval of the first interface, the central control module is provided with a first preset overlapping area G1, a second preset overlapping area G2, a first size space adjusting coefficient α 1, a second size space adjusting coefficient α 2, and a third size space adjusting coefficient α 3, wherein G1 < G2,0 < α 1 < α 2 < α 3 < 1,
if G is less than or equal to G1, the central control module judges that the size interval of the first interface is adjusted by using alpha 3;
if G1 is larger than G and smaller than or equal to G2, the central control module judges that the size interval of the first interface is adjusted by alpha 2;
if G is larger than G2, the central control module judges that the size interval of the first interface is adjusted by using alpha 1;
when the central control module adjusts the size interval of the first interface by using α k, k =1,2,3 is set, and the central control module records the adjusted size interval of the first interface as E ', and sets E' (h × α k, l × α k).
10. The database layout design method based on the particle swarm optimization algorithm according to claim 9, wherein when the central control module adjusts a position of a layout center point in an interface to eliminate an overlapping area between the interface and an adjacent interface, if the central control module determines that the adjusted interface overlaps with a page edge, the central control module determines to adjust a size interval of the interface to eliminate the overlapping between the interface and the page edge.
CN202211433093.8A 2022-11-16 2022-11-16 Database layout design method based on particle swarm optimization algorithm Active CN115599809B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211433093.8A CN115599809B (en) 2022-11-16 2022-11-16 Database layout design method based on particle swarm optimization algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211433093.8A CN115599809B (en) 2022-11-16 2022-11-16 Database layout design method based on particle swarm optimization algorithm

Publications (2)

Publication Number Publication Date
CN115599809A true CN115599809A (en) 2023-01-13
CN115599809B CN115599809B (en) 2023-03-28

Family

ID=84852868

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211433093.8A Active CN115599809B (en) 2022-11-16 2022-11-16 Database layout design method based on particle swarm optimization algorithm

Country Status (1)

Country Link
CN (1) CN115599809B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104238885A (en) * 2014-09-11 2014-12-24 吴涛军 Automatic layout and content displaying method and device suitable for multi-equipment content displaying
US20150286763A1 (en) * 2014-04-02 2015-10-08 Globalfoundries Inc. Pattern matching for predicting defect limited yield
US20180260295A1 (en) * 2017-03-09 2018-09-13 Samsung Electronics Co., Ltd. Screen control method and electronic device supporting the same
CN108764741A (en) * 2018-06-01 2018-11-06 英特尔产品(成都)有限公司 Method and device for determining the layout of the production equipment in factory set region
CN110096328A (en) * 2019-05-09 2019-08-06 中国航空工业集团公司洛阳电光设备研究所 A kind of HUD interface optimization layout adaptive approach and system based on aerial mission
CN114115643A (en) * 2021-11-22 2022-03-01 北京光启元数字科技有限公司 Component display method and device, electronic equipment and readable medium
WO2022160826A1 (en) * 2021-01-28 2022-08-04 华为云计算技术有限公司 Method and apparatus for laying out page
CN115203846A (en) * 2022-07-14 2022-10-18 沈阳工业大学 Particle swarm-sparrow algorithm-based human-computer interface layout optimization method for laser cleaning equipment

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150286763A1 (en) * 2014-04-02 2015-10-08 Globalfoundries Inc. Pattern matching for predicting defect limited yield
CN104238885A (en) * 2014-09-11 2014-12-24 吴涛军 Automatic layout and content displaying method and device suitable for multi-equipment content displaying
US20180260295A1 (en) * 2017-03-09 2018-09-13 Samsung Electronics Co., Ltd. Screen control method and electronic device supporting the same
CN108764741A (en) * 2018-06-01 2018-11-06 英特尔产品(成都)有限公司 Method and device for determining the layout of the production equipment in factory set region
CN110096328A (en) * 2019-05-09 2019-08-06 中国航空工业集团公司洛阳电光设备研究所 A kind of HUD interface optimization layout adaptive approach and system based on aerial mission
WO2022160826A1 (en) * 2021-01-28 2022-08-04 华为云计算技术有限公司 Method and apparatus for laying out page
CN114115643A (en) * 2021-11-22 2022-03-01 北京光启元数字科技有限公司 Component display method and device, electronic equipment and readable medium
CN115203846A (en) * 2022-07-14 2022-10-18 沈阳工业大学 Particle swarm-sparrow algorithm-based human-computer interface layout optimization method for laser cleaning equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
姬文渊等: "基于认知规律的用户界面信息布局设计方法", 《计算机工程与设计》 *

Also Published As

Publication number Publication date
CN115599809B (en) 2023-03-28

Similar Documents

Publication Publication Date Title
Toledo et al. Lane-changing model with explicit target lane choice
Rennen et al. Nested maximin Latin hypercube designs
US6748574B2 (en) Method of and apparatus for determining an optimal solution to a uniform-density layout problem, and medium on which a program for determining the solution is stored
CN104517119B (en) Image distributor and image distributing method
CN111897868B (en) Visual analysis method and system for analyzing and planning bus routes
CN102799954B (en) A kind of Multipurpose Optimal Method and system being applicable to risk assessment
CN116934220A (en) Intelligent warehouse layout method based on intelligent data analysis and algorithm optimization
CN111256697A (en) Unmanned aerial vehicle flight path planning method aiming at path point clustering machine learning
CN111626321A (en) Image data clustering method and device
CN106291764A (en) Based on big data and the method for meteorological forecast of meteorologic analysis field and system
CN115599809B (en) Database layout design method based on particle swarm optimization algorithm
CN113592945A (en) Parking target expected pose calculation method and system, vehicle and storage medium
CN111091329A (en) Semi-open type vehicle path optimization method for multi-vehicle-type transportation of hazardous chemical substances
Zhao et al. On the strength of privacy metrics for vehicular communication
CN113570153B (en) Rainfall station network point number optimization method
CN114724323A (en) Point distribution method of portable intelligent electronic fence for fire scene protection
CN110986951A (en) Path planning method based on penalty weight, navigation grid and grid map
CN110930696A (en) AI navigation-based intelligent city traffic management operation method and system
CN115049321B (en) Material allocation data processing method and system based on geographic information
CN114330526B (en) Traffic flow missing data restoration method based on TGO-SSA-FCM algorithm
CN114549739A (en) Control system and method based on three-dimensional data model
CN112927005A (en) Multi-target genetic algorithm-based vehicle pricing method, system and storage medium
CN108256749A (en) Intersection accidents safety improvement effect evaluation method based on accident modification factor matching technology
JP2004110341A (en) Area dividing method
Zhu et al. Real-Time parking guidance model based on stackelberg game

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant