Author: claimsbot

1. Method for synchronizing a frequency of a client clock with a server clock frequency, such synchronization being performed through timing packets transmitted by the server towards the client through a telecommunication network, wherein the method comprises:
transmission, by the server, of groups of timing packets such that an emission timing packet period (\u03c41) is smaller than an emission group period (\u03c43),
the emission timing packet period (\u03c41) being a period of time between transmissions of successive timing packets within individual groups of timing packets from among the groups of timing packets,
the emission group period (\u03c43) being a period of time between transmissions of the timing packets that are transmitted first from each of successive groups from among the groups of timing packets,
the emission timing packet period (\u03c41) being such that transmission delays of timing packets within a same group are practically correlated, and
the emission group period (\u03c43) being such that transmission delays of timing packets from different groups are practically uncorrelated.
2. Method according to claim 1, further comprising:
using, by the client, an average (<\u03c41>) of timing packets inter-arrival times, measured between successive timing packets within a group, to estimate a distributed reference frequency (1\u03c4est).
3. Method according to claim 2, further comprising:
using, by the client, an average (<\u03c43>) of group inter-arrival times, measured between first timing packets of successive groups, to estimate the distributed reference frequency (1\u03c4est) through a weighted equation such as:
\u03c4
est

=
a
\xd7
\u2329

\u03c4
1

\u232a

N
+
(

1
–
a

)

\xd7
\u2329

\u03c4
3

\u232a

M
wherein N and M are integers, \u201ca\u201d is a weighting coefficient, <\u03c41> is an average of timing packets inter-arrival times, <\u03c43> is an average of group inter-arrival times and 1\u03c4est is an estimation of the distributed reference frequency.
4. Method according to claim 1 wherein each group comprises a pair of timing packets.
5. Method according to claim 4 wherein, to achieve a given timing packet bandwidth equivalent to a periodic transmission of timing packets with a period of T, the emission timing packet period \u03c41 and the emission group packet period \u03c43 are such that:
\u03c43=2\xd7T=\u03c41+\u03c42

wherein \u03c42 is an emission period measured between the last timing packet of a first group and the first timing packet of a successive group.
6. Method according to claim 1 wherein a function is used to determine the emission timing packet period (\u03c41) andor the emission group period (\u03c43) according to monitored queuing effects in the transmission of the timing packets between the server and the client.
7. Method according to claim 6 wherein the queuing effects are monitored according to a Deviation Lag function (DLF).
8. Method according to claim 1 wherein groups of timing packets are transmitted by sets so that the emission group period (\u03c43) is smaller than an emission set period, measured between successive sets of groups.
9. A server comprising:
a clock aimed to synchronize in frequency a client clock through timing packets transmitted via a telecommunication network,
wherein the server is configured to transmit groups of timing packets such that an emission timing packet period (\u03c41) is smaller than an emission group period (\u03c43),
the emission timing packet period (\u03c41) being a period of time between transmissions of successive timing packets within individual groups of timing packets from among the groups of timing packets,
the emission group period (\u03c43) being a period of time between transmissions of the timing packets that are transmitted first from each of successive groups from among the groups of timing packets,
the emission timing packet period (\u03c41) being such that transmission delays of timing packets within a same group are practically correlated, and
the emission group period (\u03c43) being such that transmission delays of timing packets from different groups are practically uncorrelated.
10. A client terminal comprising:
a clock to be frequency synchronized through timing packets transmitted by a server clock through a telecommunication network,
wherein the client is configured to filter and use groups of timing packets for synchronization such that timing packets inter-arrival periods are smaller than group inter-arrival periods,
each timing packet inter-arrival periods being a period of time between transmissions of successive timing packets within individual groups of timing packets from among the groups of timing packets,
each group inter-arrival period being a period of time between transmissions of the timing packets that are transmitted first from each of successive groups from among the groups of timing packets,
the timing packets inter-arrival periods being such that transmission delays of timing packets within a same group being practically correlated, and
the group inter-arrival periods being such that transmission delays of timing packets from different groups being practically uncorrelated.

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. An integrated circuit, comprising:
A. a shift register;
B. a test bus;
C. plural target circuits; and
D. plural test interfaces separate from the shift register and coupled between the test bus and the respective target circuits, each test interface having a select output for coupling the register with the test bus.
2. The circuit of claim 1 in which the test bus includes a test data input lead and a test data output lead, each test interface connects to the test data input and is selectively coupled to the test data output, and the shift register is located outside of the target circuits and the test interfaces.
3. The circuit of claim 1 including a test access port linking module that includes the shift register and that receives the select outputs from the test interfaces, the linking module including control circuits selectively coupling the shift register with the test bus in response to receiving a select output.
4. The circuit of claim 1 including a test access port linking module that includes the shift register and that receives the select outputs from the test interfaces, the linking module including an enable output connected to each test interface.
5. The circuit of claim 1 in which the shift register is a two bit register.
6. The circuit of claim 1 in which the test bus includes a test data in lead, a test data out lead, a test clock in lead, and a test mode select lead.
7. The circuit of claim 1 in which each test interface includes a state machine coupled with an instruction register and a data register, and the data register is coupled with a target circuit.
8. The circuit of claim 1 including a state machine separate from the test interfaces and coupled with the test bus and the shift register.
9. The circuit of claim 1 including a first test access port controller including a state machine and having control outputs coupled to the shift register and in which each of the plural test interfaces include a test access port controller including a state machine, the test access port controllers of the plural test interfaces being separate from the first test access port controller.
10. The circuit of claim 1 in which the shift register includes a serial input and the test bus includes a serial test data input lead, the select output for coupling the serial input of the shift register to the serial test data input lead.
11. The circuit of claim 1 including a first test access port controller including a state machine and having control outputs coupled to the shift register and in which each of the plural test interfaces include a test access port controller including a state machine, the test access port controllers of the plural test interfaces being separate from the first test access port controller, the first test access port controller selected by the select output for controlling the shift register.

1. A computer-implemented method for searching a large number of hypertext documents in accordance with a search query, comprising:
forming a set of expert documents from the set of all hypertext documents crawled without reference to the search query;
ranking the expert documents in accordance with the search query;
ranking target documents pointed to by the ranked expert documents; and
returning a results list based on the ranked target documents.
2. The computer-implemented method of claim 1, wherein the hypertext documents are pages in the world wide web.
3. The computer-implemented method of claim 1, wherein the hypertext documents are sites in the world wide web.
4. The computer-implemented method of claim 1, wherein the hypertext documents are documents in a hypertext database.
5. The computer-implemented method of claim 1, wherein an expert reverse index is constructed in memory for keywords appearing in the expert documents, the expert reverse index identifying the location of the keywords in the expert documents.
6. The computer-implemented method of claim 5, wherein a keyword of an expert document is included in the expert reverse index if the keyword is part of a key phrase that qualifies at least one URL in the expert document.
7. The computer-implemented method of claim 6, wherein a key phrase qualifies a URL if the URL is within the scope of the key phrase in the expert document.
8. The computer-implemented method of claim 6, wherein a key phrase in an HTML title qualifies all URLs in the entire document.
9. The computer-implemented method of claim 6, wherein a key phrase in an HTML heading qualifies all URLs in that portion of the document before a next HTML heading in the document of greater or equal importance.
10. The computer-implemented method of claim 6, wherein a key phrase in an HTML anchor qualifies the URLs in the anchor.
11. The computer-implemented method of claim 1, wherein forming a set of expert documents includes:
determining a document having at least a predetermined number of outlinks to be an expert document if the document also points to at least the predetermined number of targets on distinct non-affiliated hosts.
12. The computer-implemented method of claim 11, wherein expert documents additionally must point to documents that share the same broad classification.
13. The computer-implemented method of claim 1, wherein ranking target documents pointed to by the expert documents includes:
determining a plurality of edge scores for each target document, where an edge score is determined for edges between the expert documents and the target document;
determining a target score in accordance with the edge scores of the target document;
ranking the target documents in accordance with the target scores.
14. The computer-implemented method of claim 13, further including:
determining an edge score only for those links to the target document from a predetermined number of top-ranked expert documents.
15. The computer-implemented method of claim 13, further including selecting target documents to be ranked that are linked to by at least two mutually non-affiliated selected expert documents, where the selected target also is not affiliated with the expert documents.
16. The computer-implemented method of claim 13, where an edge score between an expert document and a target document ES(E,T) is determined as follows, where ExpertScore reflects the rankings of the expert documents:
a) find #occurrences of each keyword in all keyphrases of expert document E
b) if the #occurrences for any keyword in E is 0: ES(E,T)=0 else ES(E,T)=ExpertScore(E)*sum of #occurrences for all keywords.
17. The computer-implemented method of claim 13, wherein, if two affiliated experts have edges to the same target, the edge having a lower edge score is discarded and is not used to determine the target score.
18. The computer-implemented method of claim 17, wherein two hypertext documents are affiliated if at least one of the following is true: 1) they share the same rightmost non-generic suffix and 2) they have an IP address in common.
19. The computer-implemented method of claim 1, wherein ranking the expert documents in accordance with the search query comprises:
determining a level score for each of the expert documents;
determining a fullness factor for each key phrase on each of the expert documents; and
determining an expert score for each expert document in accordance with the level score of the expert document and the fullness factors for the key phrases of the expert document.
20. The computer-implemented method of claim 1, forming a set of expert documents occurs before a search query is received.
21. An apparatus that searches a large number of hypertext documents in accordance with a search query, comprising:
a processor and a memory, the processor executing instructions stored in the memory, the instruction comprising:
a software portion configured to form a set of expert documents from the set of all documents crawled without reference to the search query;
a software portion configured to rank the expert documents in accordance with the search query;
a software portion configured to rank target documents pointed to by the ranked expert documents; and
a software portion configured to return a results list based on the ranked target documents.
22. A computer program product, comprising:
a computer readable medium having computer readable instructions stored therein to search a large number of hypertext documents in accordance with a search query, including:
computer readable program code devices for causing a computer to form a set of expert documents from the set of all documents crawled without reference to the search query;
computer readable program code devices for causing a computer to rank the expert documents in accordance with the search query;
computer readable program code devices for causing a computer to rank target documents pointed to by the ranked expert documents; and
computer readable program code devices for causing a computer to return a results list based on the ranked target documents.

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 system comprising:
a first memory;
an inputoutput (IO) processor configured to:
receive a virtual device IO operation request;
store the virtual device IO operation request in the memory;
form a message using information from the virtual device IO operation request; and
transmit the message to a strategy processor;

a strategy processor coupled to the IO processor and configured to receive the message using information from the virtual device IO operation request and form at least one physical device IO operation using the information from the virtual device IO operation request;
a second memory; and
a second microprocessor coupled to the second memory, wherein the strategy processor is encoded as instructions stored in the second memory and executable on the second microprocessor, and wherein the first memory and the IO processor belong to a first computer system and the second memory and the second microprocessor belong to a second computer system, the first computer system being coupled to the second computer system via a network.
2. The system of claim 1 further comprising:
a first microprocessor coupled to the first memory, wherein the IO processor is encoded as instructions stored in the first memory and executable on the first microprocessor.
3. The system of claim 1 wherein at least a portion of the first memory forms a buffer, the buffer storing data corresponding to the virtual device IO operation request.
4. The system of claim 1 wherein the information from the virtual device IO operation request includes a virtual device destination.
5. The system of claim 1 wherein the message includes an indication of a remote IO operation request.
6. The system of claim 1 further comprising:
information about organization of at least one virtual device, the information about organization of at least one virtual device being stored in the second memory.
7. The system of claim 1 wherein the strategy processor is part of a volume manager.
8. The system of claim 1 wherein the strategy processor is further configured to transfer the at least one physical device IO operation to the IO processor for execution.
9. The system of claim 1 further comprising:
at least one storage device coupled to the IO processor.