129 results about "Equal probability" patented technology

A method for creating and searching medical ontologies includes providing a semi-structured information source comprising a plurality of articles linked to each other, each article having one or more sections and each article is associated with a concept, creating a directed unlabeled graph representative of the information source, providing a plurality of labels, labeling a subset of edges, and assigning each unlabeled edge an equal probability of being assigned one of the labels. For each node, the probability of each outgoing edge is updated by smoothing each probability by an overall probability distribution of labels over all outgoing edges of each node, and the probability of each incoming edge is updated the same way. A label with a maximum probability is assigned to an edge if said maximum probability is greater than a predetermined threshold to create a labeled graph.

Techniques are presented to operate a greater number of dice in parallel while not exceeding peak current limits. The device can arbitrate between multiple dice and, when needed, suspend operations on one or more dice in a way to average the chance of performance penalty so that all chips will proceed with write at an equal probability. In other aspects, the suspension of operations can be weighted based on factors such as the relative speed of the different dice or differing loads.

Disclosed is a non-equal probability constellation labeling method based on an absolute phase shift keying (APSK) constellation diagram. The non-equal probability constellation labeling method based on the APSK constellation diagram is characterized by comprising the steps that: the APSK constellation diagram is constructed, number of steps of the constellation labeling is M, M=2m, and m is a positive integer, numbers of constellation points on each ring is the same, phase deviations of each ring are also the same; a constellation labeling mode of the APSK constellation diagram is designed, and the constellation labeling mode is enabled to be a gray labeling; the constellation points are grouped, and constellation points on the same ring are combined to be a new constellation point; labeling bits of the prior constellation points on the same ring are distributed to the new constellation point in sequence. According to the non-equal probability constellation labeling method based on the APSK constellation diagram, the inhomogeneous constellation diagram and a non-equal probability labeling technology are adopted, distribution of output signals of the constellation labeling is enabled to be close to Gaussian distribution, shaping gain is achieved, performance of a coded modulation system is improved, and signal to noise ratio in a modulation process is reduced.

A full-automatic baggage treating system for airpot features that an equal probability filling method is used to ensure that the baggage comes on the conveying belt with equal probability and the lattice method and the tracking-loating technique based on BIT stream are used for ensuring the precise tracking to each baggage.

The invention provides a neighbor finding method for a directional Ad Hoc network. An antenna active detection/passive monitoring mode of a node is determined based on the binary coding bit of the ID of the node, a channel resource is divided into a plurality of sub-channels through the CDMA or the OFDM technology, the number of the sub-channel which is occupied by the node is determined through an equal-probability random selection method, the purpose that multiple nodes send information alternately on different channels is achieved, the data collision conflict caused by the fact that the multiple nodes send information to the same node at the same time in the neighbor finding process is effectively reduced, the success probability of finding a neighbor node can be remarkably improved, and network networking time is shortened. By the adoption of the neighbor finding method for the directional Ad Hoc network, the neighbor node can be rapidly found in the Ad Hoc network with directional beam transmission being adopted completely, and the neighbor finding method for the directional Ad Hoc network is suitable for all networking scenes with network density being large from small. The neighbor finding method for the directional Ad Hoc network is easy to achieve, the time spent in finding all the neighbor nodes within a one-hop range is short, and reliability is high.

The invention relates to the technical field of job shop scheduling, in particular to an improved culture gene algorithm for solving a multi-objective flexible job shop scheduling problem. The algorithm comprises the following steps of performing process-based encoding; generating an initialized population; performing local search by a hill-climbing method; calculating fitness; judging whether an optimization criterion is met or not (if yes, generating an optimal individual and ending the algorithm, otherwise, executing the next step); performing selection; performing SPX crossover; performing mutation; performing local search by the hill-climbing method; generating a new-generation population; calculating fitness; and circulating the process. The algorithm is improved as follows: the local search is performed by utilizing the hill-climbing method, so that local optimum can be escaped for obtaining a better solution, and the calculation time can be shortened; and in addition, the crossover and mutation modes of the algorithm are improved, the SPX crossover method is adopted, and one of two methods of insertion mutation and replacement mutation is randomly selected for mutating individuals in the population by an equal probability Pm during mutation.

The invention proposes a panoramic image tone consistency correction method and system. The method includes the following steps: extracting a content-consistent area from overlapped areas of all adjacent image pairs, and extracting a color corresponding relation between images according to a cumulative probability histogram of the content-consistent area at an equal probability interval; defining a tone transformation model with relatively high flexibility, and optimizing global tone consistency, image contrast and gradient details while designing a global energy function; and through solving model parameters with strict global optimality, applying respective tone correction models to all images to perform tone consistency correction, and outputting a processing result. The panoramic image tone consistency correction method and system utilize the tone corresponding relation of overlapped areas between adjacent images, and can effectively eliminate relatively large tone difference existing among images; the problems of tone overflow, dynamic range narrowing and gradient loss relative to an original image can be suppressed while tone consistency is corrected, a correction model of global joint optimization does not need to define a specific reference image, and the problem of an accumulative error can be effectively reduced.

A Quantum Dense Coding System. The system includes a source, a transmitter and a receiver. The source is capable of down-converting a pump photon into a signal photon and an idler photon and outputting probability amplitudes, the signal photon and the idler photon, wherein the signal photon and the idler photon have an equal probability of outputting to a transmission channel and a reception channel. The transmitter is capable of receiving probability amplitudes, signal photons and idler photons from the transmission channel; and selectively changing vertical and horizontal phases of probability amplitudes of signal photons and idler photons; and outputting probability amplitudes, signal photons and idler photons. The receiver is capable of receiving probability amplitudes, signal photons and idler photons from the reception channel and the transmitter; and identifying vertical and horizontal phase changes created by the transmitter. A method for the system is also described.

The invention provides a wireless sensor network data fusion method based on double-fusion node ant colony optimization and relates to optimization of a routing path and optimization of selecting of cluster heads of a clustering structure of a wireless sensor network. An equal probability method is used for selecting network cluster heads, non-uniform auxiliary cluster heads are selected through differences of the distance between a node and a base station, an ant colony optimization algorithm is used for conducting route optimization on the cluster heads, directly communicated with the base station, in the network, then the ant colony optimization algorithm is again used for conducting the route optimization on the cluster heads, directly communicated with the base station, in the network so that not all the cluster heads in the network can be directly communicated with the base station, and the cluster heads are communicated with the base station through an optimization path selected through the ant colony optimization algorithm. The wireless sensor network data fusion method well solves the hotspot problems of the far end and the near end which are apart from the base station in the wireless sensor network, can reduce communication energy consumption of the network and prolongs the survival time of the network.

A time sequence mode representation-based weighted directed complicated network construction method comprises the steps of adopting a zero-mean normalization method to normalize an original time sequence; dividing a new time sequence into n sections in an equal probability manner, using the characters in a set character string to represent the sections, and representing the new time sequence into a character string sequence; moving a sliding window of which the length is 1 from left to right from the first character of the character string sequence, every time the sliding window moves one step, dividing the character string sequence into ((n-1)+1) fragments of which the lengths are all 1, and regarding each fragment as a mode; taking the different modes as the nodes of a complicated network, determining the connection edge weights and directions between the nodes of the complicated network according to the conversion frequency and the conversion directions between the nodes, and mapping the character string sequence into the weighted directed complicated network; and calculating the network topology statistical characteristics of the weighted directed complicated network. The method of the present invention enables the classification or identification precision of the time sequence signals to be improved remarkably.

Disclosed herein are systems and methods for compressing data and for estimating sparsity of datasets to aid in compressing data. A device receives a plurality of samples of the sensor data from the sensor and determine a plurality of bits, in which each bit has a substantially equal probability of being determined as a 0 bit or of being determined as a 1 bit. The device estimates a sparsity value of the sensor data based at least in part on the sequence of bits. The device compresses the received samples of the sensor data based at least in part on the determined sparsity value to provide compressed data and transmits the compressed data via the transmitter to a receiver. Sparse data other than sensor data may also be compressed based at least in part on an estimated sparsity value.

The invention discloses a random response surface method-based probabilistic optimal power flow calculation method. The method comprises the following steps of: first, expressing input random variables by a function relationship of a group of standard normal distribution variables by utilizing an equal probability transformation theory, so as to construct a second-order chaos polynomial corresponding to output variables; selecting appropriate configuration points of the normal distribution variables by using an optimal point selection method according to the number of undetermined coefficients in the chaos polynomial; converting the configuration point into sample point values of the input variables; for the random variables which have correlation, carrying out processing by applying an Nataf transformation theory so as to obtain a corresponding sample point; and finally, using the sample point as a disturbance variable to substitute to a power flow equation, carrying out deterministic optimal power flow calculation by using a prime-dual interior point method so as to obtain a system of linear equations about polynomial coefficients, solving the system of linear equations to obtain polynomial coefficients, obtaining numerical characteristics of the variable according to the obtained chaos polynomial of the variable, and estimating a probability density function and a probability distribution function of the variable by applying a kernel density estimation method.

Disclosed are embodiments of a method and an associated computer program product for finding the statistical bounds, the corresponding parameter corners and the probability density function of one or more performance targets for a circuit without requiring Monte Carlo simulation runs. To accomplish this, a joint probability density function for independent parameters that affect the performance target can be constructed. Then, based on the joint probability density function, the statistical bounds of the performance target can be found by constructing an equal-probability-density surface of the joint probability density function and solving a constrained optimization problem on that equal-probability-density surface. Once the statistical bounds are determined, the corresponding parameter corners for the performance target can also be determined. After obtaining multiple statistical bounds corresponding to different accumulated probability density, the probability density function of the performance target can also be obtained.

The invention relates to a wind-hydraulic-thermal coordinated optimization dispatching method based on an improved Benders decomposition method. The method comprises steps of generating a set class number equal probability information sample matrix by using a Latin hypercube sampling method; arranging and reducing all sample scenes in the sample matrix by using a scene reduction method, and obtaining a classic scene set in each scene category; optimizing the allocation of various types of standby resources in consideration of multiple standby requirements caused by wind power output and load volatility; and introducing a conditional value at risk (CVaR) into a dispatching model to quantify and balance a relationship between expected return and risk, so that a generation company can choosea corresponding dispatching scheme according to its own risk. The disclosed method model introduces two optimization strategies including Jenson inequality constraints and multi-cut set feedback whensolving the model with a Benders decomposition algorithm, and improves the calculation speed and accuracy of the Benders decomposition method.

The invention relates to the field of motion planning and provides a rapid path planning method and an enhancement method for a random route map. The planning method comprises the following steps of: randomly generating free nodes in a planning space region; processing a difficult region by adopting the enhancement method; generating a route map according to the preset strategy; and querying an optimized path according to motion planning requirement. The invention has the advantages of a general PRM method, the complexity of implementing the method is basically unrelated to the complexity of the whole planning environment and the dimensionality of planning control, the problem that the general PRM method completely and uniformly distributes the free nodes with equal probability to cause insufficient number of the distributed free nodes in the difficult region is solved, the enhancement method is adopted for performing related processing on the difficult region so as to increase the number of the free nodes in the difficult region, the completeness is higher, and the probability of omitting some feasible paths in the difficult region is reduced.

The invention provides a method of designing an injection target point of a Mars probe with optimal fuel. The method comprises the following steps of firstly, establishing a Mars B plane and transforming a target track constraint to a target point of the B plane; secondly, getting a speed increment which is corrected in the midway by utilizing a differential correcting algorithm, figuring up an equal probability impact ellipse on the B plane according to an injection error, and selecting the injection target point on the ellipse. An injection deviation, which is artificially provided, is eliminated through correcting a cruising section in the midway, so that a selection standard is that the fuel consumed for correcting the injection target point to a final target point is minimized. A plurality of points are selected on the impact probability ellipse, the speed increment required for correcting each point is figured up, then continuous sampling and calculation are carried out near the point with the smallest speed increment, and lastly, the optimal injection target point of the fuel can be approached continuously. According to the method, the probability constraint of the upper-stage impact of the probe or a rocket on the Mars can be met, and meanwhile, the fuel consumption corrected in the midway is optimized.

The invention discloses a symbolic multi-quality-characteristic analysis method based on relative entropy and the grey relational degree. The method comprises the steps that starting from the system function structure and fault mode and influence factors, system quality characteristics are extracted, a multi-quality-characteristic research system is determined, and system quality characteristic data sequences are collected; the system quality characteristic data sequences are symbolized by adopting an equal probability symbolization method to obtain a corresponding symbolic sequence space; the probability distribution characteristics of all quality characteristic sequences are researched, and a symbol sequence frequency statistical histogram is obtained; the problem that system quality characteristics have correlation and nondeterminacy in actual engineering is considered, symbol dynamics relative entropy and the grey correlation analysis method are adopted for carrying out qualitative characterization on the coupling correlation between the quality characteristic symbolic sequences from the perspectives of difference and similarity, and finally expression of the correlation and nondeterminacy of the original mass characteristic data sequences is achieved.

The invention is applicable to the technical field of distribution network planning and discloses a programming method and system for distributed photovoltaic grid-connected penetration level. The method includes the steps of determining photovoltaic power output and load output as random variables, and establishing a comprehensive probabilistic model of the photovoltaic power output and a probabilistic model of the load output; using Latin hypercube sampling method based on the principle of equal probability transformation and a square root method to generate mutually independent random vectors; determining a chance constrained programming model when the sum of penetration levels of distributed photovoltaic power supplies accessed to a distribution network system is the maximum, using a Cuckoo search algorithm based on a particle swarm algorithm to solve the chance constrained programming model, and obtaining the distributed photovoltaic grid-connected maximum penetration level; and according to the distributed photovoltaic grid-connected maximum penetration level, programming the photovoltaic grid-connected level of each node in the distribution network system. The method and system of the invention consider the characteristics of the randomness and volatility of the photovoltaic power output, improve the voltage distribution level of the nodes, and ensure the safe and stableoperation of the distribution network.

The invention discloses a method and a base station for retransmitting a data packet. The method comprises the following steps of: determining a user proportion transmitting the NACK signal receiving a negative acknowledgement NACK signal from a user terminal UE, wherein the user proportion is a ratio of the number of UE transmitting the NACK signal and the number of all UE in the cell; and retransmitting the data packet to the user transmitting the NACK signal when the data packet is required to be retransmitted according to the user proportion transmitting the NACK signal, thereby guaranteeing the reliability of feedback. Furthermore, before acquiring the ratio of the users transmitting the NACK signal occupying the total number of users in the cell, the method performs equal probability grouping to the UE through a random number; after grouping, the number of the UE requiring transmitting the NACK signal in each group is equal, thereby reducing severe power peak effect occurring ina feedback channel.