Abstract: Electronic network security by establishing a network topology, including multiple devices, where the network includes a command and control layer and a transport layer, where the command and control layer is changeable by the transport layer and vice versa. All phases of an intrusion attempt are monitored to anticipate an intrusion, prevent an intrusion, and remedy a successful intrusion. An assessment of the threat is made in multiple dimensions. The topology of the network may be changed in accordance with the threat assessment. In addition, computer traffic in the network and from the intrusion source may be modified or stopped to guard against an intrusion, prevent an intrusion, and remedy a successful intrusion. The command and control layer is changeable by the transport layer and vice versa.

Abstract: A method of securely authenticating a user's response to a challenge request before completing a transaction is disclosed. When a user wishes to complete a transaction, an image is projected onto the user's face. The user reads the image in a mirror and responds accordingly. If the user identifies the correct image, the transaction is allowed to proceed.

Abstract: A device and method of determining changes to a graphical user interface (GUI) that does not require the use of a configuration file or the use of data from a previous operation of an application computer program by identifying a program currently running, determining a first tree structure for the GUI, identifying a communication from the program to the GUI, returning to the third step if the communication does not change the GUI, determining a second tree structure for the changed GUI, comparing the first and second tree structures for any change, discarding the first tree structure, renaming the second tree structure as the first tree structure, and transmitting the identified change to a user, and returning to the third step.

Abstract: The present invention is a device for and method of measuring similarity between sets using a union block, three function blocks, an adder, a subtractor, and a divider. The first set is fed into the first function block and the first input of the union block. The second set is fed into the second function block and the second input of the union block. The output of the union block is fed into the input of the third function block. The outputs of the first and second function block feed into the adder. The output of the adder and the output of the third function block feed into the subtractor. The output of the subtractor feeds into the input of the divider.

Abstract: A method of demodulating an AIS signal by receiving the signal, sampling the signal, estimating the carrier frequency, estimating the complex conjugate of the carrier frequency contribution to each sample, multiplying each sample by the complex conjugate and calling the results a base-banded sampled signal (BBSS), correlating the BBSS with known preambles, identifying a maximum magnitude of the BBSS/preamble correlation and its location and the associated preamble, computing a complex inner product of the preamble with a segment of the BBSS, estimating the carrier phase as an argument function of the eighth step result, estimating a complex conjugate of the carrier phase contribution to the BBSS, multiplying each fifth step result starting at the location of the maximum magnitude of the BBSS/preamble correlation by the tenth step result, and demodulating the results starting at that location.

Abstract: A method of authenticating a user by capturing an image of the user, assigning a user-name, selecting an image category, selecting a pattern, selecting locations on the user's face, assigning a rotation-value, logging onto a computer, presenting images, where some images are in the image category, selecting images that are the pattern away from the images in the image category, calculating a rotation angle, projecting the selected images that are rotated by the rotation angle onto the user's face at the locations, capturing an image of the user's face with the rotated images projected thereon, and authenticating the user if the user's facial features match the user's face and the projected images are the pattern away from the images in the image-category, are at the locations, are rotated by the rotation angle, and exhibit distortion consistent with the contour of the user's face.

Abstract: A device and method of detecting and correcting errors in data having a control unit, a coefficient computation unit, an error computation unit, and an error detection and correction unit, where errors such as garbled data, missing data, and added data are either detected and corrected or just detected.

Abstract: A device for and method of determining if a SIM card was removed and reinserted into a device by initially inserting the SIM card into the device, checking for the presence of the SIM card, if the SIM card is present then returning to the second step, if the SIM card is not present then reporting that the SIM card has been removed from the user-definable electronic device, checking for the presence of the SIM card, if the SIM card is not present then returning to the fifth step, and if the SIM card is present then reporting that the SIM card has been reinserted into the device, and returning to the second step.

Abstract: A device for voice identification including a receiver, a segmenter, a resolver, two advancers, a buffer, and a plurality of IIR resonator digital filters where each IIR filter comprises a set of memory locations or functional equivalent to hold filter specifications, a memory location or functional equivalent to hold the arithmetic reciprocal of the filter's gain, a five cell controller array, several multipliers, an adder, a subtractor, and a logical non-shift register. Each cell of the five cell controller array has five logical states, each acting as a five-position single-pole rotating switch that operates in unison with the four others. Additionally, the device also includes an artificial neural network and a display means.

Abstract: A device and method of routing traffic in a network by receiving the network, assigning a maximum temperature value to gateway nodes, calculating temperature values for router nodes, determining self-utilization values for nodes, determining neighborhood-utilization values for router nodes, determining pressure values for gateway nodes, determining pressure values for router nodes, identifying router node sent traffic, identifying neighboring nodes having higher temperatures than router node, identifying neighboring node with lowest pressure value, sending traffic to neighboring node with lowest pressure value, and stopping if the neighboring node is a gateway node, otherwise identifying the node as a router node and returning to the step of finding neighboring nodes.

Abstract: A single-use Universal Serial Bus port protector having a top piece and a tongued planar surface, where the top piece includes a rectangular surface, a rectangular planar surface, a slotted planar surface, and at least one lever breakably attached to the slotted planar surface, and where the tongued planar surface includes two rails and two projections, where the top piece and the tongued planar surface are slideably insertable into a Universal Serial Bus port to ensure that no electrical connection is made to the Universal Serial Bus port when the top piece and the tongued planar surface are so inserted, where the at least one lever engages with at least one of the rails of the tongued planar surface upon insertion, and where the at least one lever breaks off when the Universal Serial Bus port protector is removed from the Universal Serial Bus port.

Abstract: A device and method of determining candidates to decode by receiving a message, selecting m, identifying m voltages in message near zero volts, generating binary version of message, generating candidates that are variations of the binary message by varying the m positions, multiplying a modified binary message by the parity check matrix of the message, generating a matrix of the rows of the parity check matrix corresponding to the m positions, determining a rank v of the matrix, eliminating rows that are not linearly independent, determining if the sixth step result is in a span of the ninth step result, if so then there are 2m-1-2m-v(m?1) candidates, where the candidates can multiply the seventh step result to get the sixth step result and candidates with odd weights more than one Hamming distance from the candidates, otherwise there are 2m-1 candidates having odd weight.

Abstract: The present invention is a device for and method of language processing that includes a communication database of communications, a transcription database of transcripts for the communication, an extractor for extracting a visual representation of each communication, a first displayer for displaying a visual representation of a communication and its transcription, a segmentor for segmenting a visual representation, a media player, a first editor for blanking portions of a transcription and adding text, a second editor for filling in blanks and adding text, a second displayer for displaying a transcription that were blanked along with the corresponding entries made by the second editor and adding textual information, and a third displayer for providing feedback.

Abstract: A device and method of collision-free hashing of near-match inputs that includes the following components. An adder for receiving an input i, a check value cv, and outputs n, which is greater than or equal to the sum of i and cv. A checker for receiving a value n, a value d, a first polynomial, and an output at which the first polynomial appears if the checker determines that the first polynomial is of degree proportional to d and divides xn+1. A factorization block for factoring the first polynomial into a second polynomial and a third polynomial. A first division block for dividing an input of bit length i by the second polynomial to generate a first portion of the hash of the input. A second division block for dividing the input by the third polynomial to generate a second portion of the hash of the input.

Abstract: A method of collision-free hashing of near-match by selecting bit positions d that differ between a first input and a second input, selecting a degree of a first polynomial for a cyclic code proportional to d, selecting a bit length i of the first input and the second input, selecting a bit length cv of a check value greater than or equal to d, setting n>=i+cv, generating the first polynomial that divides xn+1, factoring the first polynomial into a second and a third polynomials, receiving the first input, dividing the first input by the second polynomial, dividing the first input by the third polynomial, and identifying the results of the last two steps as a hash of the first input.

Abstract: The present invention pertains to demodulation of GMSK signals by estimating a carrier frequency of the signal having a carrier residual, basebanding the signal, tracking the signal's carrier frequency, removing the carrier residual, detecting a data burst, generating a bank of poly-bit matched filters, applying the bank of poly-bit matched filters to the signal, determining a magnitude and phase of the output of each poly-bit filter of the bank of poly-bit matched filters, determining a maximum magnitude, determining the location of a baud center, generating a plurality of correlation signals by applying the bank of poly-bit matched filters at the baud center, estimating a carrier phase, removing the estimated carrier phase, applying a Viterbi decoding algorithm to the signal, and estimating the transmitted data sequence.

Abstract: A device and method of minimally incrementing and decrementing the weights of a minimal number of links in a network to cause a link/node that is not in the shortest path in the network to be in the shortest path by determining the shortest path with link/node, identifying links in this path that are not in the shortest path without link/node, decrementing identified links to make the path the shortest path, identifying a link in the shortest path without link/node not in the path with link/node, incrementing the link, redoing these steps to determine a number of links and modifications to links that would cause the link/node to appear in the shortest path, identifying the set of links and modifications with the fewest links, and modifying the network in accordance with the identified set.

Abstract: A reusable tamper indicating bag closure for transporting most items in a bag such as documents and portable computing devices including laptops, PDAs, mobile phones, iPods® . . . etc. that would appeal to a broad spectrum of customers including the individual buyer, the business user, and the government user. The tamper-evident bag closure is defined by a lid with multiple hasps and a base with knobs that attach to the bag and is secured by a locking mechanism placed through an opening on the base and inserted within an insertion aperture such that locking the lock mechanism causes the lid to slide into alignment with the base and engages the plurality of hasps with the plurality of knobs thus securing the bag. The bag closure also has several tamper indicating features including the use of tamper indicating markers, wire seals and tamper indicating labels.