Author: claimsbot

1. A method of controlling access by a client to a resource that is controlled by a resource server and is made available to members of a nested group, the method comprising:
(a) presenting from the client to the resource server a first request to access the resource;
(b) in response to the first request, sending a challenge from the resource server to the client to prove membership in the nested group;
(c) in response to the challenge, performing a search at the client to obtain a chain of group credentials that proves membership in the nested group; and
(d) presenting from the client to the resource server a second request to access the resource, the second request including the chain of group credentials.
2. The method of claim 1 wherein membership in each group is controlled by a group server and wherein step (c) comprises contacting with the client at least one group server to obtain therefrom group credentials proving membership in the group controlled by that server.
3. The method of claim 2 wherein step (c) further comprises providing from the client to the at least one group server group credentials proving membership in a group nested in the group controlled by that server.
4. The method of claim 1, wherein one of said chains of group credentials comprise one or more proofs of group membership.
5. The method of claim 4, wherein said proofs of group membership comprise one or more group membership certificates.
6. The method of claim 4, wherein said proofs of group membership comprise one or more group membership lists.
7. The method of claim 1, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
8. The method of claim 7, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
9. The method of claim 7, wherein said proofs of group non-membership comprise one or more group membership lists.
10. A method of controlling access by a client to a resource that is controlled by a resource server and is made available to non-members of a nested group, the method comprising:
(a) presenting from the client to the resource server a first request to access the resource;
(b) in response to the first request, sending a challenge from the resource server to the client to prove non-membership in the nested group;
(c) in response to the challenge, performing a search at the client to obtain a chain of group credentials that proves non-membership in the nested group; and
(d) presenting from the client to the resource server a second request to access the resource, the second request including the chain of group credentials.
11. The method of claim 10 wherein membership in each group is controlled by a group server and wherein step (c) comprises contacting with the client at least one group server to obtain therefrom group credentials proving non-membership in the group controlled by that server.
12. The method of claim 11 wherein step (c) further comprises providing from the client to the at least one group server group credentials proving non-membership in a group nested in the group controlled by that server.
13. The method of claim 10, wherein one of said chains of group credentials comprise one or more proofs of group membership.
14. The method of claim 13, wherein said proofs of group membership comprise one or more group membership certificates.
15. The method of claim 13, wherein said proofs of group membership comprise one or more group membership lists.
16. The method of claim 10, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
17. The method of claim 16, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
18. The method of claim 16, wherein said proofs of group non-membership comprise one or more group membership lists.
19. A computer system having a resource to which a client desires access and which is controlled by a resource server so that the resource is made available to members of a nested group, the system comprising:
a mechanism in the client that presents to the resource server a first request to access the resource;
a mechanism in the resource server and operable in response to the first request, that sends a challenge to the client to prove membership in the nested group;
a mechanism in the client and operable in response to the challenge, that performs a search to obtain a chain of group credentials that proves membership in the nested group; and
a mechanism in the client that presents to the resource server a second request to access the resource, the second request including the chain of group credentials.
20. The system of claim 19 wherein membership in each group is controlled by a group server and wherein the mechanism that obtains a chain of group credentials comprises a mechanism that contacts at least one group server to obtain therefrom group credentials proving membership in the group controlled by that server.
21. The system of claim 20 wherein the mechanism that obtains a chain of group credentials further comprises a mechanism that provides to the at least one group server group credentials proving membership in a group nested in the group controlled by that server.
22. The system of claim 19, wherein one of said chains of group credentials comprise one or more proofs of group membership.
23. The system of claim 22, wherein said proofs of group membership comprise one or more group membership certificates.
24. The system of claim 22, wherein said proofs of group membership comprise one or more group membership lists.
25. The system of claim 19, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
26. The system of claim 25, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
27. The system of claim 25, wherein said proofs of group non-membership comprise one or more group membership lists.
28. A computer system having a resource to which a client desires access and which is controlled by a resource server so that the resource is made available to non-members of a nested group, the system comprising:
a mechanism in the client that presents to the resource server a first request to access the resource;
a mechanism in the resource server and operable in response to the first request, that sends a challenge to the client to prove non-membership in the nested group;
a mechanism in the client and operable in response to the challenge, that performs a search to obtain a chain of group credentials that proves non-membership in the nested group; and
a mechanism in the client that presents to the resource server a second request to access the resource, the second request including the chain of group credentials.
29. The system of claim 28 wherein membership in each group is controlled by a group server and wherein the mechanism that obtains a chain of group credentials comprises a mechanism that contacts at least one group server to obtain therefrom group credentials proving non-membership in the group controlled by that server.
30. The system of claim 29 wherein the mechanism that obtains a chain of group credentials further comprises a mechanism that provides to the at least one group server group credentials proving non-membership in a group nested in the group controlled by that server.
31. The system of claim 28, wherein one of said chains of group credentials comprise one or more proofs of group membership.
32. The system of claim 31, wherein said proofs of group membership comprise one or more group membership certificates.
33. The system of claim 31, wherein said proofs of group membership comprise one or more group membership lists.
34. The system of claim 28, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
35. The system of claim 34, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
36. The system of claim 34, wherein said proofs of group non-membership comprise one or more group membership lists.
37. A client device on a computer network, said client device configured for requesting one or more resources from a server on the network, in which access to said resources is so controlled by said server as to make them available to members of a nested group, said client device comprising:
A. means for presenting to the server a first request to access the resource;
B. means operable in response to a challenge from the server generated by the first request for performing a search to obtain one or more chains of group credentials that prove client membership in the nested group, and
C. means for transmitting to the server a second request for one or more of the resources, said second request including the one or more chains of group credentials that prove client membership in the nested group.
38. The client device of claim 37, wherein one of said chains of group credentials comprise one or more proofs of group membership.
39. The client device of claim 38, wherein said proofs of group membership comprise one or more group membership certificates.
40. The client device of claim 38, wherein said proofs of group membership comprise one or more group membership lists.
41. The client device of claim 37, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
42. The client device of claim 41, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
43. The client device of claim 41, wherein said proofs of group non-membership comprise one or more group membership lists.
44. A client device on a computer network, said client device configured for requesting one or more resources from a server on the network, in which access to said resources is so controlled by said server as to make them available to non-members of a nested group, said client device comprising:
A. means for presenting to the server a first request to access the resource,
B. means operable in response to a challenge from the server generated by the first request for performing a search to obtain one or more chains of group credentials that prove client non-membership in the nested group, and
C. means for transmitting to the server a second request for one or more of the resources, said second request including the one or more chains of group credentials that prove client non-membership in the nested group.
45. The client device of claim 44, wherein one of said chains of group credentials comprise one or more proofs of group membership.
46. The client device of claim 45, wherein said proofs of group membership comprise one or more group membership certificates.
47. The client device of claim 45, wherein said proofs of group membership comprise one or more group membership lists.
48. The client device of claim 44, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
49. The client device of claim 48, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
50. The client device of claim 48, wherein said proofs of group nonmembership comprise one or more group membership lists.
51. A computer program product comprising a computer usable medium having thereon computer readable program code representing a sequence of instructions that, when executed by a processor in a network device requesting one or more resources from a server, in which access to said resources is so controlled by said server as to make them available to members of a nested group, configures the network device to operate as a client device that:
A. presents to the server a first request to access the resource,
B. in response to a challenge from the server generated by the first request performs a search to obtain one or more chains of group credentials that prove client membership in the nested group, and
C. transmits to the server a second request for one or more resources, said second request including the one or more chains of group credentials that prove membership in the nested group.
52. The computer program product of claim 51, wherein one of said chains of group credentials comprise one or more proofs of group membership.
53. The computer program product of claim 52, wherein said proofs of group membership comprise one or more group membership certificates.
54. The computer program product of claim 52, wherein said proofs of group membership comprise one or more group membership lists.
55. The computer program product of claim 51, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
56. The computer program product of claim 55, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
57. The computer program product of claim 55, wherein said proofs of group non-membership comprise one or more group membership lists.
58. A computer program product comprising a computer usable medium having thereon computer readable program code representing a sequence of instructions that, when executed by a processor in a network device requesting one or more resources from a server, in which access to said resources is so controlled by said server as to make them available to non-members of a nested group, configures the network device to operate as a client device that:
A. presents to the server a first request to access the resource,
B. in response to a challenge from the server generated by the first request performs a search to obtain one or more chains of group credentials that prove client non-membership in the nested group, and
C. transmits to the server a second request for one or more resources, said second request including the one or more chains of group credentials that prove non-membership in the nested group.
59. The computer program product of claim 58, wherein one of said chains of group credentials comprise one or more proofs of group membership.
60. The computer program product of claim 59, wherein said proofs of group membership comprise one or more group membership certificates.
61. The computer program product of claim 59, wherein said proofs of group membership comprise one or more group membership lists.
62. The computer program product of claim 58, wherein one of said chains of group credentials comprise one or more proofs of group non-membership.
63. The computer program product of claim 62, wherein said proofs of group non-membership comprise one or more group non-membership certificates.
64. The computer program product of claim 62, wherein said proofs of group non-membership comprise one or more group membership lists.

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. Compound of formula:
1548
in which:
R1 represents a (C2-C6)alkyl; a group (CH2)n-G with n ranging from 0 to 5 and G representing a non-aromatic C3-C13 mono- or polycyclic hydrocarbon group optionally substituted with one or more (C1-C3) alkyl; a phenyl(C1-C3) alkyl in which the phenyl group is optionally substituted one or more times with a halogen, with a (C1-C3)alkyl or with a (C1-C3)alkoxy; a group (CH2)nNR2R3 in which n represents an integer from 1 to 6 and R2 and R3, which may be identical or different, represent a (C1-C3)alkyl or constitute, with the nitrogen atom to which they are attached, a morpholino, piperidino, pyrrolidinyl or piperazinyl group;
X1, X2, X3 or X4 each independently represents a hydrogen or halogen atom, a (C1-C6)alkyl, a (C1-C3)alkoxy or a trifluoromethyl; it being understood that only one from among X1, X2, X3 and X4 possibly represents a hydrogen atom;
R4 represents hydrogen, a group (CH2)nCOOR5 in which n is as defined above and R5 represents a hydrogen atom, a (C1-C6) alkyl or a (C6-C10) aryl-(C1-C6)alkyl; a (C1-C6)alkyl; a group (CH2)nOR5 or a group (CH2)nNR2R3 in which n, R2, R3 and R5 are as defined above; a group (CH2)n-tetrazolyl in which n is as defined above, or R4 represents one of these: groups in the form of an alkali-metal or alkaline-earth metal salt;
Y1, Y2 and Y3 independently represent a hydrogen, a halogen, a (C1-C3)alkyl, a (C1-C3)alkoxy, a nitro, cyano, (C1-C6)acylamino, carbamoyl, trifluoromethyl, a group COOR6 in which R6 represents hydrogen, or (C1-C3) alkyl;
or one of the salts or solvates thereof.
2. Compound of formula (I) according to claim 1, in which R1, R4, X1, X2, X3 and X4 are as defined in claim 1 and Y1, Y2 and Y3 represent hydrogen; a salt or solvate thereof.
3. Compound of formula (I) according to claim 1, in which R1 and R4 are as defined in claim 1, Y1, Y2 and Y3 represent hydrogen; and
1549
represents 2,6-dimethoxy-4-methylphenyl;
a salt or solvate thereof.
4. Compound of formula (I) according to claim 1, in which R1, R4, Y1, Y2 and Y3 are as defined in claim 1, and
1550
represents 2,6-dimethoxy-4-methylphenyl;
a salt or solvate thereof.
5. Compound of formula (I) according to claim 1, in which R1, R4, Y1, Y2 and Y3 are as defined in claim 1, and
1551
X2 representing methyl or a chlorine atom;
a salt or solvate thereof.
6. Compound of formula:
1552
in which R1, X1, X2, X3 and X4 are as defined for (I) in claim 1.
7. Process for the preparation of a compound of formula (I) according to any one of claims 1 to 5, comprising the step consisting in reacting an aminotriazole of formula:
1553
in which R1, X1, X2, X3 and X4 are as defined for (I) in claim 1, with an indolecarboxylic acid derivative of formula 8:
1554
in which R4, Y1, Y2 and Y3 are as defined for (I) in claim 1, in order to obtain the compounds of formula (I),
a salt or solvate thereof.
8. Process for the preparation of a compound of formula (I) according to any one of claims 1 to 5, comprising the reaction of an aminotriazole of formula:
1555
in which R1, X1, X2, X3 and X4 are as defined for (I)
either with an indolecarboxylic acid derivative of formula:
1556
in which R4, Y1, Y2 and Y3 are as defined above for (I);
or with an indolecarboxylic acid derivative of formula:
1557
in which Y1, Y2 and Y3 are as defined above for (I) and R4 is a precursor group of R4, in which case the compound of formula:
1558
in which R1, X1, X2, X3, X4, Y1, Y2 and Y3 are as defined for (I) and R4 is a precursor group of R4, R4 being defined for (I), is formed as an intermediate.
9. Pharmaceutical composition containing, as active principle, a compound of formula (I) according to claim 1, or one of the pharmaceutically acceptable salts thereof.
10. Pharmaceutical composition containing, as active principle, a compound according to claim 2, or one of the pharmaceutically acceptable salts thereof.
11. Pharmaceutical composition containing, as active principle, a compound according to claim 3, or one of the pharmaceutically acceptable salts thereof.
12. Pharmaceutical composition containing, as active principle, a compound according to claim 4, or one of the pharmaceutically acceptable salts thereof.
13. Pharmaceutical composition containing, as active principle, a compound according to claim 5, or one of the pharmaceutically acceptable salts thereof.
14. Use of a compound according to any one of claims 1 to 5 for the preparation of medicines intended to treat eating behaviour disorders and obesity and to reduce the intake of food.
15. Use of a compound according to any one of claims 1 to 5, for the preparation of medicines intended to treat tardive dyskinesia.
16. Use of a compound according to any one of claims 1 to 5 for the preparation of medicines intended to treat disorders of the gastrointestinal sphere.

1. A circuit for estimating a latency through a FIFO buffer, comprising:
a first detector for detecting a first plurality of instances of a pattern in first data values serially written to a write port of the FIFO buffer;
a second detector for detecting a second plurality of instances of the pattern in second data values serially read from a read port of the FIFO buffer, wherein the second data values are the first data values delayed by the latency through the FIFO buffer;
a counter coupled to the first and second detectors and counting a count of active transitions of a sample clock signal, the counter started in response to each detected instance of the first plurality of instances and stopped in response to each detected instance of the second plurality of instances, wherein the count provides an estimate of the latency of the FIFO buffer; and
a data generator coupled to the first detector and the write port of the FIFO buffer:
wherein:
the data generator generates the first data values and serially writes the first data values to the write port of the FIFO buffer;
the first data values repeat the first plurality of instances of the pattern;
the pattern includes a first block of zero values followed by a second block of one values;
the first block of zero values has a first duration and the second block of one values has a second duration; and
a sum of the first and second durations is greater than an upper limit on the latency.
2. The circuit of claim 1, wherein the first and second durations are equal, and the first and second durations are each greater than a sampling period between the active transitions of the sample clock signal.
3. The circuit of claim 1, wherein the write port of the FIFO buffer writes an input data word having a number of bits and the read port reads an output data word having the number of bits, the first data values are serially written to one of the bits of the input data word of the write port, and the second data values are serially read from a corresponding one of the bits of the output data word of the read port.
4. The circuit of claim 3, wherein:
the FIFO buffer writes the input data word at the write port in response to a write clock signal;
the FIFO buffer updates the output data word provided at the read port in response to a read clock signal;
the write clock signal and the read clock signal have a nominally shared period and a varying phase relationship that is a varying multiple of the nominally shared period plus a varying fraction of the nominally shared period;
the latency of the FIFO buffer is a varying multiple of the nominally shared period plus the varying fraction of the nominally shared period; and
the sample clock signal is synchronous with at least one of the write clock signal and the read clock signal, a phase of the sample clock signal being rotated following each count for the first and second pluralities of instances of the pattern.
5. The circuit of claim 3, wherein:
the FIFO buffer writes the input data word at the write port in response to a write clock signal;
the FIFO buffer updates the output data word provided at the read port in response to a read clock signal;
the write clock signal and the read clock signal have a nominally shared period and a varying phase relationship that is a varying multiple of the nominally shared period plus a varying fraction of the nominally shared period
the latency of the FIFO buffer is the varying multiple of the nominally shared period plus the varying fraction of the nominally shared period; and
the sample clock signal is asynchronous with both the write clock signal and the read clock signal.
6. The circuit of claim 5, further comprising an averaging circuit coupled to the counter, wherein the averaging circuit continuously provides the estimate that includes integer and fractional values with the estimate of the latency being the integer value times a sampling period between the active transitions of the sample clock signal plus the factional value of the sampling period.
7. The circuit of claim 6, wherein:
the first detector includes:
a first register for sampling the first data values at the active transitions of the sample clock signal and for synchronizing between the sample clock signal and the write clock signal; and
a second register for starting the counter upon detecting a first data transition from a zero value to a one value at an output of the first register; and

the second detector includes:
a third register for sampling the second data values at the active transitions of the sample clock signal and for synchronizing between the sample clock signal and the read clock signal; and
a fourth register for stopping the counter upon detecting a second data transition from a zero value to a one value at an output of the third register.
8. The circuit of claim 7, wherein:
the averaging circuit provides the estimate that is updated for each first data transition to be a first fraction of a preceding value of the estimate plus a second fraction of a terminal value of the count output from the counter for the first data transition; and
a sum of the first and second fractions is unity.
9. The circuit of claim 8, wherein a first number of the zero values in the first block of each first instance of the pattern equals a second number of the one values in the second block of each first instance of the pattern, and the first and second numbers equal a number of the nominally shared period sufficient to exceed the sampling period.
10. The circuit of claim 1, wherein
the first and second durations are equal, and the first and second durations are greater than a period between the active transitions of the sample clock signal.
11. The circuit of claim 1, wherein:
the FIFO buffer has the write port for writing an input data word having a number of bits in response to a write clock signal and the read port for reading an output data word having the number of bits in response to a read clock signal;
the first data values are serially written to one of the bits of the input data word of the write port and the second data values are serially read from one of the bits of the output data word of the read port;
the write clock signal and the read clock signal have a nominally shared period and an indeterminately varying phase relationship that is a varying multiple of the nominally shared period plus a varying fraction of the nominally shared period;
the latency of the FIFO buffer is the varying multiple of the nominally shared period plus the varying fraction of the nominally shared period; and
the sample clock signal is synchronous with at least one of the write clock signal and the read clock signal, and a phase of the sample clock signal is rotated following each count for the first and second pluralities of instances of the pattern.
12. The circuit of claim 1, wherein:
the write port of the FIFO buffer writes an input data word having a number of bits in response to a write clock signal;
the read port of the FIFO buffer reads an output data word having the number of bits in response to a read clock signal;
the first data values are serially written to one of the bits of the input data word of the write port and the second data values are serially read from one of the bits of the output data word of the read port;
the write clock signal and the read clock signal have a nominally shared period and an indeterminately varying phase relationship that is a varying multiple of the nominally shared period plus a varying fraction of the nominally shared period;
the latency of the FIFO buffer is the varying multiple of the nominally shared period plus the varying fraction of the nominally shared period; and
the sample clock signal is asynchronous with both the write clock signal and the read clock signal.
13. The circuit of claim 1, further comprising an averaging circuit coupled to the counter, wherein the averaging circuit continuously provides the estimate that varies and includes integer and fractional values, and the estimate is the integer value times a period plus the factional value of the period.
14. The circuit of claim 1, wherein:
the first detector includes:
a first register for sampling the first data values at the active transitions of the sample clock signal and for synchronizing between the sample clock signal and a write clock signal for serially writing the first data values into the FIFO buffer; and
a second register for starting the counter upon detecting a transition from a zero value to a one value at an output of the first register; and

the second detector includes:
a third register for sampling the second data values at the active transitions of the sample clock signal and for synchronizing between the sample clock signal and a read clock signal for serially reading the second data values from the FIFO buffer; and
a fourth register for stopping the counter upon detecting a transition from a zero value to a one value at an output of the third register.
15. The circuit of claim 1, wherein an averaging circuit provides the estimate that is updated for each count for the first and second pluralities of instances of the pattern to be a first fraction of a preceding value of the estimate plus a second fraction of the count, a sum of the first and second fractions being unity.
16. A circuit arrangement, comprising:
a FIFO buffer having a write port and a read port;
a first detector coupled to the write port of the FIFO buffer and configured to detect a first plurality of instances of a pattern in first data values serially written to the write port;
a second detector coupled to the read port of the FIFO buffer and configured to detect a second plurality of instances of the pattern in second data values serially read from the read port, wherein the second data values are the first data values delayed by a latency through the FIFO buffer;
a counter coupled to outputs of the first and second detectors, the counter configured to count active transitions of a sample clock signal, wherein the counter is started in response to each detected instance of the first plurality of instances and stopped in response to each detected instance of the second plurality of instances, and the count provides an estimate of the latency of the FIFO buffer; and
a data generator having an output coupled to an input of the first detector and to the write port of the FIFO buffer;
wherein:
the data generator generates the first data values and serially writes the first data values to the write port of the FIFO buffer;
the first data values repeat the first plurality of instances of the pattern;
the pattern includes a first block of zero values followed by a second block of one values;
the first block of zero values has a first duration and the second block of one values has a second duration; and
a sum of the first and second durations is greater than an upper limit on the latency.
17. The circuit arrangement of claim 16, wherein the first and second durations are equal, and the first and second durations are each greater than a sampling period between the active transitions of the sample clock signal.
18. A method for estimating a latency through a FIFO buffer, comprising:
detecting a first plurality of instances of a pattern in first data values serially written to a write port of the FIFO buffer;
detecting a second plurality of instances of the pattern in second data values serially read from a read port of the FIFO buffer, wherein the second data values are the first data values delayed by the latency through the FIFO buffer;
counting a count of active transitions of a sample clock signal, wherein the counting is started in response to each detected instance of the first plurality of instances and the counting is stopped in response to each detected instance of the second plurality of instances, and the count provides an estimate of the latency of the FIFO buffer;
generating the first data values; and
serially writing the first data values to the write port of the FIFO buffer;
wherein:
the first data values repeat the first plurality of instances of the pattern,
the pattern includes a first block of zero values followed by a second block of one values,
the first block of zero values has a first duration and the second block of one values has a second duration, and
a sum of the first and second durations is greater than an upper limit on the latency.

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 for automating securities order execution, comprising:
a memory:
a processor disposed in communication with the memory and configured to issue processing instructions stored in the memory to:
receive order information from a client;
apply at least one filtering rule to determine whether the order can be automatically executed or whether to the order needs to be manually processed by a trader within a brokerage;
determine, based on the application of the at least one filtering rule, an order destination;
route the order to the order destination;
execute the order when the order is determined to be automatically executable; and
report the result of the order execution to the client.
2. The system of claim 1 wherein the at least one filtering rule includes at least one broker filter configured to determine if the identified client meets requirements to make the requested trade.
3. The system of claim 2 wherein the order is passed to the trader within the brokerage when the identified client does not clear any of the at least one broker filters.
4. The system of claim 1 wherein the at least one filtering rule includes at least one trader filter.
5. The system of claim 4 wherein the order is passed to the trader within the brokerage when the order does not clear any of the at least one trade filters.
6. The system of claim 1 wherein the at least one filtering rule includes at least one compliance filter configured to determine if the order follows governing market rules.
7. The system of claim 6 wherein the order is passed to the trader within the brokerage when the order does not clear any of the at least one compliance filters.
8. The system of claim 1, wherein the order information is tagged with a client identifier.
9. The system of claim 1, wherein the at least one filtering rule includes at least one broker filter, at least one trade filter and at least one compliance filter.
10. A processor-implemented method for automating securities order execution, comprising:
receiving, via a processor, order information from a client;
applying at least one filtering rule to determine whether the order can be automatically executed or whether to the order needs to be manually processed by a trader within a brokerage;
determining, based on the application of the at least one filtering rule, an order destination;
routing the order to the order destination;
executing the order when the order is determined to be automatically executable; and
reporting the result of the order execution to the client.
11. The method of claim 10 wherein the at least one filtering rule includes at least one broker filter configured to determine if the identified client meets requirements to make the requested trade.
12. The method of claim 11 wherein the order is passed to the trader within the brokerage when the identified client does not clear any of the at least one broker filters.
13. The method of claim 10 wherein the at least one filtering rule includes at least one trader filter.
14. The method of claim 13 wherein the order is passed to the trader within the brokerage when the order does not clear any of the at least one trade filters.
15. The method of claim 10 wherein the at least one filtering rule includes at least one compliance filter configured to determine if the order follows governing market rules.
16. The method of claim 15 wherein the order is passed to the trader within the brokerage when the order does not clear any of the at least one compliance filters.
17. The method of claim 10, wherein the order information is tagged with a client identifier.
18. The method of claim 10, wherein the at least one filtering rule includes at least one broker filter, at least one trade filter and at least one compliance filter.
19. A processor-accessible non-transitory medium storing processor-issuable instructions to:
receive order information from a client;
apply at least one filtering rule to determine whether the order can be automatically executed or whether to the order needs to be manually processed by a trader within a brokerage;
determine, based on the application of the at least one filtering rule, an order destination;
route the order to the order destination;
execute the order when the order is determined to be automatically executable; and;
report the result of the order execution to the client.