1461177596-5d60edc5-d147-4707-8419-ec9aede86b1b

1. A multi-code Chien’s search circuit for BCH codes with various values of m in GF(2m), comprising:
a combined matrix unit, for providing a plurality of Chien’s search matrices, receiving a plurality of inputted values, multiplying the inputted values by partial or all elements in one or more Chien’s search matrix to get first operation values and second operation values, outputting the first operation values, and outputting the second operation values according to different properties of the inputted values via one of a plurality of line groups;
a plurality of first multiplexers, each first multiplexer connected with one line in each line group and receiving specific second operation values, for choosing the second operation values from the corresponding line group according to different properties of the inputted values, and outputting the second operation values;
a plurality of registers, each register connected with a specific first multiplexer, for receiving the second operation values, and outputting the second operation values in a next clock; and
a plurality of second multiplexers, each second multiplexer connected with a specific register, receiving a value of a specific coefficient except a constant coefficient in an error location polynomial and the second operation values from the register, for outputting the value of the specific coefficient as the inputted value to the combined matrix unit in the first iterative operation of Chien’s search, and outputting the second operation values to the combined matrix unit as the inputted values in the rest iterative operations of Chien’s search,
wherein values of specific coefficients of the error location polynomial for the same Chien’s search matrix and the second operation values obtained by processing the values of specific coefficients have the same properties of the inputted values.
2. The Chien’s search circuit according to claim 1, wherein the Chien’s search matrix has a form of AyA\u03a9, where
where
A
y

=
A
11
A
21
\u2026
A

p
\ue89e
\ue89e
1
A
12
A
22
\u2026
A

p
\ue89e
\ue89e
2
\u22ee
\u22ee
\u22f1
\u22ee
A

1
\ue89e
\ue89e
t
A

2
\ue89e
\ue89e
t
\u2026
A
pt
,
\ue89e
A
\u03a9

=
A

1
\ue89e
\ue89e
p
0
\u2026
0
0
A

2
\ue89e
\ue89e
p
\u2026
0
\u22ee
\u22ee
\u22f1
\u22ee
0
0
\u2026
A
tp
,
and
A
ij

=
\u03b1
0
ij
\u03b1
1
ij
\u2026
\u03b1

m

1

ij
\u03b1
0

ij
+
1
\u03b1
1

ij
+
1
\u2026
\u03b1

m

1
ij
+
1
\u22ee
\u22ee
\u22f1
\u22ee
\u03b1
0

ij
+
m

1
\u03b1
1

ij
+
m

1
\u2026
\u03b1

m

1
ij
+
m

1
,
where p is a number of parallel computations that the Chien’s search circuit has; t is an error correction ability corresponding to the BCH code; \u03b10, \u03b11, . . . and \u03b1m-1 form a standard basis in GF(2m); 1\u2266i\u2266p; 1\u2266j\u2266t.
3. The Chien’s search circuit according to claim 2, wherein different Chien’s search matrices corresponds to different values of m andor t.
4. The Chien’s search circuit according to claim 2, wherein each Chien’s search matrix is equally divided into a plurality of portions in the row direction with the number of portions being the same as the number of the error correction ability of the corresponding BCH code; each portion has sub-matrices in the corresponding Ay and A\u03a9.
5. The Chien’s search circuit according to claim 4, wherein each portion of one Chien’s search matrix is aligned with that of another Chien’s search matrix sequentially by a method.
6. The Chien’s search circuit according to claim 5, wherein the method is aligning in one side, aligning centrally, or offsetting a certain amount from one side.
7. The Chien’s search circuit according to claim 5, wherein the locations where are not covered by the portions of the Chien’s search matrix are set to be elements of 0 in the combined matrix unit.
8. The Chien’s search circuit according to claim 5, wherein the Chien’s search matrices are separated by elements of 0.
9. The Chien’s search circuit according to claim 1, wherein there are common sub-expressions in partial elements in two Chien’s search matrices and one Chien’s search matrix utilizes the common sub-expressions of the other Chien’s search matrix.
10. The Chien’s search circuit according to claim 1, wherein the first operation value further adds to a value of a constant coefficient of the error location polynomial; if the sum is 0, the corresponding element, \u03b1up+i where 1\u2266i\u2266p, is a root of the error location polynomial.

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 method for applying a security policy to a network devices, the method comprising:
performing an identification of a device connected to an access point;
collecting audit information pertaining to the device, by querying network equipment; and
applying a security policy that includes requirements pertaining to the identification and the audit information, the applying of the security policy taking place at a gatekeeper, wherein applying the security policy includes altering a data communication within the access point with respect to the device.
2. The method of claim 1, wherein the applying of the security policy includes the gatekeeper granting, to the device, access to a subset of a protected network.
3. The method of claim 2, wherein granting access includes assigning an access control list.
4. The method of claim 2, wherein granting access includes assigning a VLAN.
5. The method of claim 1, wherein performing the identification of the device includes identifying a user of the device.
6. The method of claim 1, wherein performing the identification includes using an EAP protocol.
7. The method of claim 1, wherein the security policy includes a requirement to have a required version of an application on the device.
8. The method of claim 1, wherein the security policy includes a requirement pertaining to an operating system type on the device.
9. The method of claim 1, wherein the security policy includes a limit on what other devices are coupled to the device.
10. The method of claim 1, wherein the security policy includes a requirement pertaining to an operating system version on the device.
11. The method of claim 1, wherein the security policy includes a requirement for a user of the device to enter a password.
12. The method of claim 1, wherein the security policy includes a requirement for antivirus software running on the device.
13. The method of claim 1, wherein the applying of the security policy includes the gatekeeper taking part in facilitating an update to a software application on the device.
14. The method of claim 1, wherein the audit information includes information pertaining to an application on the device.
15. The method of claim 1, wherein the audit information includes information pertaining to an operating system of the device.
16. The method of claim 1, wherein the audit information includes information pertaining to security vulnerabilities on the device.
17. The method of claim 1, wherein the audit information includes information pertaining to configuration of the device.
18. The method of claim 1, wherein the audit information is obtained from network equipment to which the device is directly connected.
19. The method of claim 1, wherein the audit information is obtained from network equipment to which the device is indirectly connected.
20. The method of claim 1, wherein the audit information is obtained from a router to which the device is indirectly connected.
21. The method of claim 1, further comprising collecting information by probing the device, the probing including sending a specific packet to the device and detecting the presence or absence of a response, the information collected by probing being used in applying the security policy.
22. The method of claim 1, further comprising collecting information by probing the device, the probing including sending a specific packet to the device, receiving a response and examining contents of the response, the information collected by probing being used in applying the security policy.
23. The method of claim 1, further comprising collecting information using an agent executing on the device, the information collected using the agent being used in applying the security policy.
24. The method of claim 1, wherein the altering the data communication includes allowing access to a secure subset of a network from the device.
25. The method of claim 1, wherein the audit information pertaining to the device includes audit data.
26. The method of claim 1, wherein the audit information includes third party information.
27. A method for applying a security policy to a network device, the method comprising:
performing an identification of a device connected to an access point;
collecting information pertaining to the device from network equipment to which the device is directly or indirectly connected, by querying the network equipment;
collecting information using an agent executing on the device;
collecting information by probing the device, the probing including sending a specific packet to the device; and
applying a security policy that includes requirements pertaining to the identification, the information collected using the agent, the information collected by probing and the audit information, the applying of the security policy taking place at a gatekeeper, wherein applying the security policy includes altering a data communication within the access point with respect to the device.
28. The method of claim 27, wherein the probing further includes detecting the presence or absence of a response to the packet.
29. The method of claim 27, wherein the probing further includes receiving a response to the packet and examining contents of the response.
30. A method for applying a security policy to a network device, the method comprising:
performing an identification of a device connected to an access point;
collecting audit information pertaining to the device from network equipment to which the device is directly or indirectly connected, by querying the network equipment; and
applying a security policy that includes requirements pertaining to the identification and the audit information, the applying of the security policy taking place at a gatekeeper, wherein applying the security policy includes altering a data communication within the access point with respect to the device, wherein altering the data communication includes using a RADIUS protocol.

1461177586-cb900517-2aa1-4598-90fd-e56ab4c2168b

1. Trans-1,2-cyclohexane bis(urea-urethane) compounds of the formulae
wherein R1 and R\u20321 each, independently of the other, is an alkylene group, an arylene group, an arylalkylene group, or an alkylarylene group, R2 and R\u20322 each, independently of the other, is an alkyl group with at least 8 carbon atoms, an aryl group, an arylalkyl group, or an alkylaryl group, R3 and R\u20323 each, independently of the other, is a hydrogen atom or an alkyl group, R4 and R\u20324 each, independently of the other, is a hydrogen atom, a fluorine atom, an alkyl group, or a phenyl group, n is an integer of 0, 1, 2, 3, or 4, and R5 is an alkyl group, an aryl group, an arylalkyl group, an alkylaryl group, or a substituent other than an alkyl, aryl, arylalkyl, or alkylaryl group which is a halogen atom, an imine group, an ammonium group, a cyano group, a pyridinium group, an ether group, an aldehyde group, a ketone group, an ester group, a carbonyl group, a thiocarbonyl group, a sulfide group, a sulfoxide group, a phosphine group, a nitrile group, a mercapto group, a nitro group, a nitroso group, a sulfone group, an acyl group, a urethane group, a urea group, or a mixture thereof.
2. Compounds according to claim 1 wherein at least one of R1 and R\u20321 is an alkylene group.
3. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is a linear alkylene group.
4. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is a branched alkylene group.
5. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is a cyclic alkylene group.
6. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is a substituted alkylene group.
7. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is an unsubstituted alkylene group.
8. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is an alkylene group having hetero atoms therein.
9. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is an alkylene group having no hetero atoms therein.
10. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is an alkylene group having at least 2 carbon atoms.
11. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is an alkylene group having at least about 6 carbon atoms.
12. Compounds according to claim 2 wherein at least one of R1 and R\u20321 is an alkylene group having no more than about 60 carbon atoms.
13. Compounds according to claim 1 wherein at least one of R1 and R\u20321 is an arylene, arylalkylene, or alkylarylene group.
14. Compounds according to claim 13 wherein at least one of R1 and R\u20321 is a substituted arylene, arylalkylene, or alkylarylene group.
15. Compounds according to claim 13 wherein at least one of R1 and R\u20321 is an unsubstituted arylene, arylalkylene, or alkylarylene group.
16. Compounds according to claim 13 wherein at least one of R1 and R\u20321 is an arylene, arylalkylene, or alkylarylene group having hetero atoms therein.
17. Compounds according to claim 13 wherein at least one of R1 and R\u20321 is an arylene, arylalkylene, or alkylarylene group having no hetero atoms therein.
18. Compounds according to claim 1 wherein R1 and R\u20321 are the same as each other.
19. Compounds according to claim 1 wherein R1 and R\u20321 are different from each other.
20. Compounds according to claim 1 wherein at least one of R2 and R\u20322 is an alkyl group.
21. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is a linear alkyl group.
22. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is a branched alkyl group.
23. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is a cyclic alkyl group.
24. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is a substituted alkyl group.
25. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is an unsubstituted alkyl group.
26. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is an alkyl group having hetero atoms therein.
27. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is an alkyl group having no hetero atoms therein.
28. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is an alkyl group having at least about 8 carbon atoms.
29. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is an alkyl group having at least 10 carbon atoms.
30. Compounds according to claim 20 wherein at least one of R2 and R\u20322 is an alkyl group having no more than 60 carbon atoms.
31. Compounds according to claim 1 wherein at least one of R2 and R\u20322 is an aryl, arylalkyl, or alkylaryl group.
32. Compounds according to claim 31 wherein at least one of R2 and R\u20322 is a substituted aryl, arylalkyl, or alkylaryl group.
33. Compounds according to claim 31 wherein at least one of R2 and R\u20322 is an unsubstituted aryl, arylalkyl, or alkylaryl group.
34. Compounds according to claim 31 wherein at least one of R2 and R\u20322 is an aryl, arylalkyl, or alkylaryl group having hetero atoms therein.
35. Compounds according to claim 31 wherein at least one of R2 and R\u20322 is an aryl, arylalkyl, or alkylaryl group having no hetero atoms therein.
36. Compounds according to claim 1 wherein R2 and R\u20322 are the same as each other.
37. Compounds according to claim 1 wherein R2 and R\u20322 are different from each other.
38. Compounds according to claim 1 wherein R1 and R\u20321 are the same as each other and wherein R2 and R\u20322 are the same as each other.
39. Compounds according to claim 1 wherein R3 and R\u20323 are each hydrogen atoms.
40. Compounds according to claim 1 wherein at least one of R3 and R\u20323 is an alkyl group with from 1 to 3 carbon atoms.
41. Compounds according to claim 1 wherein R3 and R\u20323 are each hydrogen atoms, wherein R1 and R\u20321 are the same as each other, and wherein R2 and R\u20322 are the same as each other.
42. Compounds according to claim 1 wherein R4 and R\u20324 are each hydrogen atoms.
43. Compounds according to claim 1 wherein R4 and R\u20324 are each fluorine atoms.
44. Compounds according to claim 1 wherein at least one of R4 and R\u20324 is an alkyl group.
45. Compounds according to claim 1 wherein R1 and R\u20321 are the same as each other, R2 and R\u20322 are the same as each other, R3 and R\u20323 are each hydrogen atoms, R4 and R\u20324 are the same as each other, and R4 and R\u20324 are hydrogen atoms or fluorine atoms.
46. Compounds according to claim 1 wherein R1 and R\u20321 are the same as each other, R2 and R\u20322 are the same as each other, R3 and R\u20323 are each hydrogen atoms, R4 and R\u20324 are the same as each other, R4 and R\u20324 are hydrogen atoms or fluorine atoms, and n is 0.
47. Compounds according to claim 1 of the formulae
48. Compounds according to claim 1 of the formulae
49. Compounds according to claim 1 of the formulae
50. Compounds according to claim 1 of the formulae
51. Compounds according to claim 1 of the formulae
52. Compounds according to claim 1 of the formulae
53. Compounds according to claim 1 of the formulae
54. Compounds according to claim 1 of the formulae

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 method of network management, comprising:
receiving data from one or more network devices in a network being managed;
using the data to generate and store, in a data store, a representation of a topology of at least a portion of the network;
receiving a command, the command having been generated in response to an occurrence in the network; and
analyzing the command against the topology to determine an expected effect of executing the command in the network;
wherein the analyzing step is carried out at least in part in a hardware element.
2. The method as described in claim 1 further including repeating the receiving data step so as to maintain current the representation of the topology.
3. The method as described in claim 1 wherein the data is received in response to a command line interface query to the one or more network devices.
4. The method as described in claim 1 wherein the command is a network configuration command that is generated in response to an alarm in the network.
5. The method as described in claim 1 wherein the analyzing step is carried out against an algorithm selected from a set of algorithms associated with network management system (NMS) functions.
6. The method as described in claim 1 further including generating an alarm if the expected effect is a subsequent incident.
7. The method as described in claim 1 further including passing the command to the network if the expected effect is that the command will execute successfully.