Author: claimsbot

1. A system comprising:
a data store to maintain data items and search documents, one or more of the data items associated with a respective search document that includes a friends list identifying friends of an owner of the respective data item, the friends list comprising a friends list, an address list, a contact list, or a group;
at least a memory and a processor to implement a search engine configured to:
receive a search request and search criteria from a client device associated with a searcher;
receive a friends list of the searcher;
search the data store to identify search results as data items that satisfy the search criteria;
generate a ranking value for the data items in the search results, the ranking value for a respective data item based on whether the searcher is listed in the friends list of the owner of the respective data item and based on the number of friends that are listed in both the friends list of the owner of the respective data item and the friends list of the searcher;
adjust an order of the data items in the search results based on the ranking values; and
return the adjusted search results.
2. The system of claim 1, wherein the data items comprise one or more of user profiles, digital images, movies, video content, songs, audio content, or data documents.
3. The system of claim 1, wherein the friends lists are obtained from a service associated with a social network that manages friends lists for users of the social network.
4. The system of claim 1, wherein the search engine is configured to generate the ranking value for the respective data item in the search results by:
increasing the ranking value by a first amount in response to determining that the searcher is listed in the friends list of the owner of the respective data item; and
increasing the ranking value by a second amount for each friend that is listed in both the friends list of the searcher and the friends list of the owner of the respective data item.
5. The system of claim 4, wherein the first amount is greater than the second amount.
6. The system of claim 1, wherein the search engine is configured to adjust the order of the data items in the search results based on the ranking values by ordering data items with higher ranking values before data items with relatively lower ranking values in the search results.
7. The system of claim 1, wherein the data items of the search results are data items that both satisfy the search criteria and that have an associated access control list that indicates the data item can be accessed by the searcher.
8. The system of claim 1, wherein the search criteria comprises at least a portion of a name and the data items comprise one or more user profiles of respective users associated with the data items.
9. A system comprising:
one or more processors implemented at one or more computing devices; and
one or more memories comprising instructions stored thereon that, responsive to execution by the one or more processors, implement a search engine configured to perform operations comprising:
determining search results as data items that satisfy a search criteria of a search request received from a searcher;
adjusting an order of the data items in the search results by, for one or more of the data items in the search results, moving the data item higher in the search results if the searcher is included in a contact list of an owner of the data item and moving the data item higher in the search results if one or more contacts in a contacts list of the searcher are also included in the contact list of the owner of the data item; and
returning the adjusted search results to the searcher.
10. The system of claim 9, wherein the search engine is configured to adjust the order of the data items in the search results by moving the data item relatively higher in the search results if the searcher is included in a contact list of the owner of the respective data item than if the one or more contacts in the contact list of the searcher are also included in the contact list of the owner of the respective data item.
11. The system of claim 9, wherein the search engine is configured to adjust the order of the data items in the search results by:
generating a ranking value for the data items in the search results, the ranking value for a respective data item based on whether the searcher is listed in the contact list of the owner of the respective data item and based on the number of contacts that are listed in both the contact list of the owner of the respective data item and the contact list of the searcher; and
ordering data items with higher ranking values before data items with relatively lower ranking values in the search results.
12. The system of claim 11, wherein the search engine is configured to generate the ranking value for the respective data item in the search results by:
increasing the ranking value by a first amount in response to determining that the searcher is listed in the contact list of the owner of the respective data item; and
increasing the ranking value by a second amount for each contact that is listed in both the contact list of the searcher and the contact list of the owner of the respective data item.
13. The system of claim 12, wherein the first amount is greater than the second amount.
14. The system of claim 9, wherein the search criteria comprises at least a portion of a name and the data items comprise one or more user profiles of respective users associated with the data items.
15. A computing device comprising:
a display device; and
at least a memory and a processor to implement a search interface module, the search interface module configured to:
cause display of a user interface on the display device;
receive, via the user interface, a search request and a search criteria from a searcher;
obtain a friends list of the searcher from a social network service;
provide the search criteria and the friends list of the searcher to a search engine;
receive, from the search engine, adjusted search results as data items satisfying the search criteria, the data items ordered based at least in part on a social distance between the searcher and respective owners of the data items; and
cause display of the adjusted search results on the display device.
16. The computing device of claim 15, wherein the social distance is based at least in part on a respective owner of a data item being identified in the friends list of the searcher.
17. The computing device of claim 15, wherein the social distance is based at least in part on the searcher being identified in a friends list of a respective owner of a data item.
18. The computing device of claim 15, wherein the social distance is based at least in part on one or more friends being identified in both the friends list of the searcher and a friends list of a respective owner of a data item.
19. The computing device of claim 15, wherein the social distance is based at least in part on a number of friends that are identified in both the friends list of the searcher and a friends list of a respective owner of a data item.
20. The computing device of claim 15, wherein the search results are adjusted based on a ranking value such that data items with higher ranking values are ordered before data items with relatively lower ranking values.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A process for providing and transmitting navigation data in a navigation system, comprising the steps of:
providing a plurality of navigation data blocks;
interleaving of at least two of said plurality of navigation data blocks;
subsequent to said step of interleaving, transmitting said plurality of navigation data blocks to navigation terminals.
2. The process according to claim 1, including the step of establishing a transmission time for interleaving each data unit of each of said plurality of data blocks by means of an algorithm wherein a succession of transmission times deviates from the original sequence of the data units within the navigation data block.
3. The process according to claim 2, wherein the algorithm is constructed in such a way that, for transmission of k time-critical navigation blocks with k2, 3, 4, . . . and of a time-uncritical navigation data block, the transmission times of the data units of each time-critical navigation data block is established in each case as a fraction 1k of the transmission time of the time-uncritical navigation data block.
4. The process according to claim 1, wherein the navigation data blocks are distributed into identical packets with indexed data addresses and an interleaving takes place by successive transmission of a data unit of a packet in each case.
5. The process according to claim 4, wherein first the data units of all packets with the lowest and the highest data address are consecutively transmitted and then the data units of all packets with the next higher or next lower data address are successively transmitted.
6. The process according to claim 4, wherein at least a first group of packets is reserved for navigation data blocks with time-critical navigation data and at least a second group of packets of navigation data blocks is reserved for navigation data blocks with time-uncritical navigation data.
7. The process according to claim 3, wherein status reports are transmitted as time-critical data and that navigation useful data are transmitted as time-uncritical navigation data.
8. The process according to claim 7, wherein integrity reports concerning navigation data transmitting facilities of the navigation system are transmitted as status reports.
9. The process according to claim 8, wherein the transmission of navigation data by a navigation satellite takes place, and in reports on the specific integrity of the transmitting navigation satellite, or on the integrity of a selected group of navigation satellites or on the integrity of all navigation satellites of a satellite navigation system to which the navigation satellite belongs are transmitted.
10. The process according to claim 8, wherein alternatively or additionally, reports on the integrity of navigation satellites of other satellite navigation systems are transmitted as integrity reports.
11. The process according to claim 4, wherein
all packets have a length of n data units,
packets of the first group of packets are filled with nk, k2, 3, 4, 5, . . . data units of a navigation block of time-critical data and
packets of the second group of packets are filled with n data units of a navigation block of time-uncritical data.
12. The process according to claims 3, wherein a volume of time-critical data at a maximum is half of the volume of time-uncritical data.
13. The process according to claim 12, wherein a volume of time-critical data at a maximum amounts to a fourth of the volume of time-uncritical data.
14. A satellite navigation system having a plurality of navigation satellites with (NDU) facilities for furnishing navigation data in the form of a plurality of navigation data blocks and facilities for transmitting data to navigation terminals (UT), wherein each of said plurality of navigation satellites includes a (DIU) facility for interleaving at least two navigation data blocks prior to transmission of the at least two navigation data to said navigation terminals (UT).
15. The satellite navigation systems according to claim 14, wherein the (DIU) facility for interleaving operates by using a method according to claim 2.
16. A user terminal (UT) for a satellite navigation system having a (DPU) facility for reconstructing navigation data blocks which are received from the user terminal by a receiving unit (RU) of at least one navigation satellite and which are subjected to an interleaving according to a process according to claim 1 prior to receiving said navigation data block.
17. Computer program for processing navigation data of a satellite navigation system which were subjected to an interleaving according to a process according to claim 1, whereby the computer program is constructed for interacting with (DPU) facilities of a user terminal (UT) according to claim 16.
18. Computer program product containing at least one machine readable program carrier (DC) on which a computer program according to claim 17 is stored in the form of electronically readable control signals, whereby the computer program product is constructed for interaction with a user terminal (UT).

1. A method of automatically harvesting and screening plant embryos in multiple stages, comprising:
automatically sorting and singulating plant embryos;
automatically classifying the sorted and singulated plant embryos using a first classification method; and
automatically classifying the plant embryos that have passed the first classification method using a second classification method.
2. The method of claim 1, wherein the step of automatic sorting and singulating comprises automatically removing plant embryos from a development medium.
3. The method of claim 2, wherein the automatic removal of plant embryos comprises washing off the plant embryos from the development medium using aqueous liquid.
4. The method of claim 1, wherein the step of sorting and singulating embryos comprises using a flow cytometer.
5. The method of claim 1, wherein the step of sorting and singulating embryos comprises placing the embryos onto a porous material for sieving.
6. The method of claim 5, wherein the embryos placed on the porous material are sprayed with aqueous liquid to remove any suspensor tissues or residual embryonal suspensor masses (ESM) from the embryos.
7. The method of claim 5, wherein the porous material comprises a porous conveyor belt.
8. The method of claim 7, wherein the embryos are placed in a reservoir which dispense the embryos onto the porous conveyor belt, the reservoir being configured to dispense the embryos onto the belt in a regulated manner.
9. The method of claim 8, wherein the reservoir comprises a pipe.
10. The method of claim 7, wherein the plant embryos sorted and singulated after sieving are placed on a classification conveyor belt, along which the first and second automatic classification methods are carried out.
11. The method of claim 10, wherein the sorted and singulated plant embryos are transferred from the porous conveyor belt to the classification conveyor belt by gravity.
12. The method of claim 10, wherein the classification conveyor belt extends generally perpendicularly to the porous conveyor belt.
13. The method of claim 10, wherein the sorted and singulated plant embryos are placed on the classification conveyor belt in a single file along the length of the classification conveyor belt.
14. The method of claim 13, wherein the plant embryos are placed in a single file spaced apart from each other.
15. The method of claim 10, further comprising the step of automatically removing those embryos that have been classified as undesirable by the first or second automatic classification method from the classification conveyor belt.
16. The method of claim 15, wherein the automatic removal of undesirable embryos is carried out by a jet.
17. The method of claim 10, further comprising the step of automatically removing those embryos that have been classified as desirable by the first and second automatic classification methods from the classification conveyor belt.
18. The method of claim 17, wherein the step of automatically removing desirable embryos comprises transferring those desirable embryos onto a receiving surface in a predefined array.
19. The method of claim 18, wherein the receiving surface comprises a tray mounted on a motorized platform configured to adjust the position of the tray relative to the classification conveyor belt so as to receive the embryos dropping by gravity from the classification conveyor belt into a predefined array.
20. The method of claim 19, wherein the dropping of the embryos by gravity from the classification conveyor belt is assisted by a jet.
21. The method of claim 7, wherein the sorted and singulated plant embryos are classified according to the first classification method while on the porous conveyor belt, and the plant embryos that have passed the first classification method are transferred from the porous conveyor belt onto an index tray in a predefined array.
22. The method of claim 21, wherein the second classification method is carried out on the plant embryos that are placed on the index tray.
23. The method of claim 1, wherein the first classification step classifies the embryos based on their shape and size and the second classification step classifies the embryos based on their putative germination vigor according to a predefined classification model.
24. The method of claim 1, wherein the second classification method is more selective and time-consuming than the first classification method.
25. A system for automatically harvesting and screening plant embryos in multiple stages, comprising:
means for automatically sorting and singulating plant embryos;
means for automatically classifying the sorted and singulated plant embryos using a first classification method; and
means for automatically classifying the plant embryos that have passed the first classification method using a second classification method.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A semiconductor integrated circuit comprising:
cell arrays comprised of multiple basic cells formed in arrays, wherein each of the basic cells comprises:
an input switch connected to input lines that receive input data only from immediately adjacent upperlowerrightleft basic cells;

a first data path including a first data holding circuit and an arithmetic logic circuit between the input switch and output lines that output data only to the immediately adjacent upperlowerrightleft basic cells;
a second data path including a second data holding circuit between the input switch and the output lines; and
a configuration memory

wherein the input lines and the output lines are each connected only to the immediately adjacent upperlowerrightleft basic cells;
wherein the configuration memory is adapted to store input switch selection information and arithmetic logic circuit function information;
wherein the input switch is adapted to select the input data specified by the input switch selection information from among the input lines;
wherein the arithmetic logic circuit is adapted to perform calculations on the input data as specified by the arithmetic logic circuit function information;
wherein the first data holding circuit is adapted to store calculated result data from the arithmetic logic circuit, and the second data holding circuit is adapted to hold data input from the input lines,
wherein each of the basic cells is adapted to perform an arithmetic calculation by using the first path and to simultaneously transfer data by using the second path in parallel, and
wherein the input switch is adapted to select the input data sent from any of the immediately adjacent upper basic cell, lower basic cell, left basic cell and right basic cell, and to output the selected input data to any of the first data path and the second data path,
wherein the configuration memory comprises a configuration selector, a first configuration memory device and a second configuration memory device;
wherein each of the first configuration memory device and a second configuration memory device is adapted to store the input switch selection information and the arithmetic logic circuit function information,
wherein the configuration selector is adapted to output the input switch selection information and the arithmetic logic circuit function information stored in one of the first configuration memory device and the second configuration memory device into the input switch and the arithmetic logic circuit according to an instruction on a configuration select signal line, and
wherein the input switch selection information and the arithmetic logic circuit function information stored in the unselected one of the first and second configuration memory devices are rewritten while the configuration selector outputs the input switch selection information and the arithmetic logic circuit function information stored in the selected one of the first and second configuration memories.
2. A semiconductor integrated circuit according to claim 1, wherein the arithmetic logic circuit includes a first arithmetic circuit, and a second arithmetic circuit for performing calculations different from the first arithmetic circuit, and
the arithmetic logic circuit is adapted to utilize first arithmetic function information to decide whether to perform arithmetic calculations using the first arithmetic circuit or perform calculations using the second arithmetic circuit.
3. A semiconductor integrated circuit according to claim 1,
wherein either one of the first configuration memory device and a second configuration memory device, which is selected by the configuration select signal line, does allow rewriting.
4. A semiconductor integrated circuit according to claim 3,
wherein the configuration memory further comprises an address decoder, an address signal line and a data line;
wherein the address decoder is adapted to decode addresses on the address line; and
wherein the input switch selection information and the arithmetic logic circuit function information in either one of the first configuration memory device and the second configuration memory device, which matches the address, are rewritten by data input from the data line.
5. A semiconductor integrated circuit according to claim 1, further comprising a controller adapted to control writing of the input switch selection information, on the configuration memory contained in each of the multiple basic cells.
6. A semiconductor integrated circuit according to claim 1, further comprising a data memory adapted to store data for processing, wherein the data stored in the data memory is input to the cell arrays.
7. A semiconductor integrated circuit according to claim 1, wherein each cell further comprises:
a third data path between the input switch and the output lines,
wherein the third data path is adapted to transfer data input from the input lines into the output lines.
8. A semiconductor integrated device according to claim 1, further comprising:
a third data path connected between an input of the input switch and an output of the first data holding circuit; and
a fourth data path connected between the input of the input switch and an output of the second data holding circuit,
wherein the input switch is adapted to select the input data sent from any of the immediately adjacent upper basic cell, the lower basic cell, left basic cell and right basic cell and the third and the fourth paths, and to output the selected input data to any of the first data path and the second data path.