Abstract:
The present invention relates to the field of computer data encrypting and decrypting, especially for mobile equipments like PDA, mobile phones, smart cards and the like, which need a good trade-off between computing speed, power consumption and security strength. The invention provides an encrypting/decrypting method implementing simple data operation. This method is based on generating a pseudo-random sequence through a function of the Collatz (or Syracuse) family from a starting number used as a secret key. Binary words of a secret length, extracted from the plain data, are encrypted into a sequence of encrypted numbers representing the offsets of these words whithin the binary form of the pseudo-random sequence.
Abstract:
A method for authenticating an item comprising an RFID having a memory for storing an identifier and a secret key, and a built-in hashing function, is disclosed. According to the method of the invention, the output of the RFID of the item to be authenticated is compared with the output of the RFID of a genuine item. To that end, a random number is transmitted to the item to be authenticated with zero as parameters. The RFID 's identifier, the random number, and the secret key are concatenated and use as input of the built-in hashing function that result is output with the RFID identifier. The RFID 's identifier and the random number are then transmitted to the RFID of the genuine item that returns its identifier and the output of the built-in hashing function computed with the RFID 's identifier of the item to be authenticated, the random number, and the secret key. If the results of both built-in hashing functions are identical, the item is authenticated else, it is counterfeiting.
Abstract:
The present invention is directed to a method, system and program, in a multi-dimensional electronic data table comprising a plurality of data, for creating one or plurality of recursive scalable template instances; a recursive scalable template instance comprising a variable number of contiguous recursive element instances ordered and aligned along a first data table dimension and structured according to a recursive scalable template; a recursive element instance being defined as comprising one or a plurality of scalable template instances; a scalable template instance comprising a variable number of elements structured according to a scalable template; an element being defined as a range of data; a range of data comprising one or a plurality of data; a recursive scalable template comprising a recursive element comprising one or a plurality of scalable templates. The method comprises for each recursive scalable template instance to create, the steps of: . Selecting a recursive scalable template; . Defining a location for creating a recursive scalable template instance; . Creating at the defined location one or a plurality of contiguous recursive element instances ordered and aligned along a first data table dimension; each recursive element instance having a variable size along said first data table dimension and a same size along a second data table dimension; . Structuring each recursive element instance according to the recursive element defined for the recursive scalable template; . Aligning each scalable template instance of each recursive element instance along said first data table dimension; . Aligning within each recursive element instance, each scalable template instance along said second data table dimension.
Abstract:
The present invention is directed to a method, system and program, in a multi-dimensional 5 electronic data table, preferably a spreadsheet, comprising a plurality of data, for managing insertion operations in a recursive scalable template instance; a recursive scalable template instance comprising a variable number of contiguous recursive element instances ordered and aligned along a first data table dimension and structured according to a recursive scalable template; said recursive scalable template comprising a recursive element including one or a plurality of scalable templates; each recursive element instance having a variable size along said first data table dimension and a same size along a second data table dimension; a recursive element instance comprising one or a plurality of scalable template instances; each scalable template instance of each recursive element instance being aligned along said first data table dimension; each scalable template instance within each recursive element instance being aligned along a second data table dimension; a scalable template instance comprising a variable number of elements structured according to a scalable template; an element being defined as a range of data; a range of data comprising one or a plurality of data.
Abstract:
The present invention discloses a system, method and computer program for providing on-line help information in an office application comprising one or a plurality of objects, said on-line help information (624, 642, 643) being dependent on the content (504) of a selected object (503). The method comprises the steps of: detecting (402) an on-line help command as a result of a user action; identifying a selected object (503); determining (403) if the selected object (503) comprises a user entry field; if the selected object (503) comprises a user entry field: identifying the content (504) of said user entry field; parsing (405) the content (504) of the user entry field to identify if any predefined keyword (301) is present, a keyword (302) being characterized by a character string (302); for each predefined keyword (301) identified in the content (504) of the user entry field: identifying (407) a predefined help information (303), if any, associated with the identified keyword (301), said help information specifying one or a plurality of parameters associated with said keyword; and one or plurality of formats and rules related to said one or plurality of parameters; parsing (408) the content (504) of the user entry field to identify the one or plurality of parameters specified in said predefined help information (303); verifying (410) that formats of the one of plurality of parameters within the user entry field satisfy formats specified in the predefined help information (303); verifying (409) that the one or plurality of parameters within the user entry field satisfy the rules specified in the predefined help information (303); if the content (504) of the user entry field does not satisfy a format or a rule specified in the help information of a predefined keyword identified in the content of the user entry field: correcting (409, 410) the content of the user entry field according to the one or plurality of formats and rules specified in the help information (303).
Abstract:
PROBLEM TO BE SOLVED: To provide a method for hiding secret data within a model in an electronic spread sheet. SOLUTION: The method comprises the step of identifying the model in the spread sheet in which the model includes a cell including input data, a cell including intermediate results to be each determined as a result of an equation including the input data and the intermediate results as arguments, and a cell including output data to be determined as a result of an equation including the input data and the intermediate results as the arguments, the step of establishing the equation of the intermediate results including only the input data as the arguments, the step of establishing the equation of the output data including only the input data as the arguments, and the step of deleting the intermediate results so that only the result which is to be acquired as the result is to be included therein. COPYRIGHT: (C)2007,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a system for persistently self-replicating a plurality of ranges of cells through a copy-paste operation in a multiple dimensional spreadsheet. SOLUTION: This method includes a step for defining a set of ranges of cells where each range of cells has the same size and a step for automatically performing a self-replication operation each time the contents of the ranges of cells belonging to the set are changed. A spreadsheet user decides to perform preparation, elimination and name change of a persistent self-replication set(PSRS), addition of a persistent self-replication range(PSRR) to the PSRS or suppression of the PSRR from the PSRS, and data necessary to this operation is recorded by using a common repository called a 'persistent self-replication table'.
Abstract:
PROBLEM TO BE SOLVED: To provide a system and a method for continuously copying and sticking a copy original cell range to one or multiple copy address cell ranges on a multi-dimensional spread sheet. SOLUTION: This method includes a step taking a continuous copying action, a step taking a continuous sticking action, and a step automatically taking a copying action each time the copy original cell range is updated. Continuous copying/sticking actions between the copy original cell range and one or multiple copy address cell ranges are determined by a spread sheet user, and the data required for these actions are recorded by using a common repository called a 'continuous copying/sticking table'.
Abstract:
A system for scheduling electric power consumption cycles is provided. A consumption cycle is a time period of human scale, minutes or hours typically, rather than an electrical cycle. The system includes an electric-powered device driven by power supplied by an electric power network. The system also includes a consumption cycle data (CCD) requesting module communicatively linked to the electric-powered device. The link may use electric power lines via methods such as Broadband over Power Line, or may be wireless. The CCD requesting module is configured to generate a CCD request requesting allocation of electric power from the electric power network. Additionally, the system includes an electric power network node electrically connected to the electric-powered device from which electric power is conveyed to the electric-powered device. The system also includes a CCD responding module communicatively linked to the CCD requesting module. The CCD responding module is configured to determine whether the request for allocation of power can be granted subject to a predetermined capacity constraint.
Abstract:
Verfahren für das dynamische Fehlerdämpfen in einem Knoten eines Netzwerksystems, das einen Verwaltungsknoten aufweist, wobei das Verfahren aufweist:Abrufen von Statistikdaten zum Datenverkehr des Knotens des Netzwerksystems, welches eine Schicht-2-Verbindung und eine Schicht-3-Verbindung aufweist, wobei die Statistikdaten eine Anzahl der gesamten eingehenden Pakete (INt), eine Anzahl der fehlerhaften eingehenden Pakete (INe), eine Anzahl der gesamten abgehenden Pakete (OUTt) und eine Anzahl der fehlerhaften abgehenden Pakete (OUTe) aufweisen, wobei der Knoten eine Verbindungsfehler-Management-Datenstruktur (Link Error Management Information Base, LE-MIB) aufweist;Berechnen eines Fehlerratenwerts (E) und Zuverlässigkeitswerts (R) der LE-MIB auf der Grundlage der Statistikdaten aus dem Abrufen, wobei 0 ≤ R ≤ 1 ist, wobei der Zuverlässigkeitswert (R) umgekehrt proportional zu dem Fehlerratenwert (E) ist;Ermitteln, dass der Fehlerratenwert (E) größer als ein Schwellenwert ist, und daraufhin Starten eines Fehlermessprotokolls für das Überwachen des Datenverkehrs über die Schicht-2-Verbindung des Knotens und das Berechnen eines Strafwerts (P) des Knotens als (MaxPenalty*(1-R)), wobei MaxPenalty eine vorkonfigurierte obere Grenze des Strafwerts (P) ist; undSicherstellen, dass der Strafwert (P) aus dem Initialisieren in einer ersten Wertspanne, einer zweiten Wertspanne oder einer dritten Wertspanne liegt, wobei die erste und die zweite Wertspanne durch einen Unterdrückungsschwellenwert (ST) voneinander getrennt sind und wobei die zweite und die dritte Wertspanne durch einen Wiederverwendungsschwellenwert (RT) voneinander getrennt sind, wobei der Strafwert (P) in der ersten Wertspanne größer als der Unterdrückungsschwellenwert (ST) ist, wobei in der zweiten Wertspanne der Strafwert (P) größer als der Wiederverwendungsschwellenwert (RT) und kleiner oder gleich dem Unterdrückungsschwellenwert (ST) ist und, wobei in der dritten Wertspanne der Strafwert (P) größer als 0 und kleiner oder gleich dem Wiederverwendungsschwellenwert (RT) ist, wobei die erste Spanne dem Neuberechnen des Strafwerts (P) als (P*(1-R)) und dem Deaktivieren der Schicht-3-Verbindung des Knotens zugehörig ist, wobei die zweite Spanne dem Fortsetzen oder dem nicht Fortsetzen des Übertragens des Datenverkehrs zugehörig ist, wobei die dritte Spanne dem Neuberechnen und Reaktivieren der Schicht-3-Verbindung des Knotens zugehörig ist und wobei ein Strafwert (P) gleich 0 dem Reaktivieren und Zurücksetzen des Überwachens des Fehlerratenwerts (E) zugehörig ist.