Patents Represented by Attorney, Agent or Law Firm Stephen C. Kaufman
-
Patent number: 7161975Abstract: A method for multi-user detection includes receiving a complex input signal due to a superposition of waveforms encoding symbols in a constellation of fixed magnitude and variable phase, which symbols are transmitted respectively by a plurality of transmitters in a common frequency band. The complex input signal is sampled at sampling intervals over the duration of an observation period to provide a sequence of complex samples. The sequence of complex samples is processed to determine soft decision values corresponding to the symbols transmitted by the plurality of the transmitters in the observation period, while constraining the soft decision values to a circle in a complex plane. The soft decision values are projected onto the constellation to estimate the transmitted symbols.Type: GrantFiled: November 27, 2002Date of Patent: January 9, 2007Assignee: International Business Machines CorporationInventors: Shay Ben-David, Ehud Karnin, Jacob Sheinvald
-
Patent number: 7133816Abstract: A preemptive reloading technique is employed in a test program generator. Initialized resources are reset with needed values by reloading instructions. The actual reloaded value is chosen later, when the instruction that actually needs the value is generated. The test program generator distances the reloading instruction from the instruction that actually needs the value, thus making it possible to avoid fixed test patterns and to generate interference-free test segments during design verification.Type: GrantFiled: November 4, 2002Date of Patent: November 7, 2006Assignee: International Business Machines CorporationInventors: Allon Adir, Eitan Marcus, Michal Rimon, Amir Voskoboynik
-
Patent number: 7131085Abstract: A method for verification of a system design represented by a model that includes a plurality of variables. The method includes arranging the variables in an Ordered Binary Decision Diagram (OBDD) according to an initial order of the variables, the OBDD including a number of nodes arranged in rows corresponding respectively to the plurality of the variables. Each processor, among a group of two or more computer processors, is assigned a respective variable among the plurality of the variables. Using each processor, the rows of the OBDD are reordered by varying a position in the OBDD of the row corresponding to the respective variable that is assigned to the processor until at least one of the processors identifies a new order for the OBDD. The new order of the OBDD may be used to verify a characteristic of the model against a specification.Type: GrantFiled: March 30, 2004Date of Patent: October 31, 2006Assignee: International Business Machines CorporationInventors: Monica Farkash, Ziv Nevo
-
Patent number: 7127389Abstract: A speech decoder and a segment aligner are provided in the present invention. The speech decoder may include a spectrum reconstructor operative to reconstruct the spectrum of a speech segment from the amplitude envelope of the spectrum of said speech segment and pitch information, a phase combiner operative to reconstruct the complex spectrum of the speech segment from the reconstructed spectrum, phase information describing the speech segment, and pitch information describing the speech segment.Type: GrantFiled: September 13, 2002Date of Patent: October 24, 2006Assignee: International Business Machines CorporationInventors: Dan Chazan, Zvi Kons
-
Patent number: 7107396Abstract: A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic “create a new page” procedure. Means for performing an atomic write “add block” procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a “delete page” procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.Type: GrantFiled: October 31, 2003Date of Patent: September 12, 2006Assignee: International Business Machines CorporationInventors: Michael Factor, Rivka Matosevich, Sivan Tal
-
Patent number: 7089384Abstract: A method for managing a data storage system includes maintaining a record predictive of locations to which data are to be written on a first storage medium by a host computer. Upon receiving a write command from the host computer directed to storing specified data at a specified location on the first storage medium, if the specified location is not included in the record, the record is updated responsively to the specified location. A signal is sent to the host computer that the specified data have been stored in the data storage system responsively to storing the specified data and, if the specified location was not included in the record, responsively to updating the record. The specified data are copied to the second storage medium responsively to the record, and are stored in the specified location on both the first and second storage media.Type: GrantFiled: December 29, 2003Date of Patent: August 8, 2006Assignee: International Business Machines CorporationInventors: Martin Tross, Aviad Zlotnick
-
Patent number: 7085422Abstract: A method for image separation of an image, wherein the image includes pixels, and the method includes identifying kernels, whereby characteristics of the kernels are reflected by at least one of the following operators, P(x?w,y)?P(x,y)>t AND P(x+w, y)?P(x,y)>t; or P(x, y?w)?P(x,y)>t AND P(x, y+w)?P(x,y)>t; or P(x+d, y+d)?P(x,y)>t AND P(x?d, y?d)?P(x,y)>t; or P(x?d, y+d)?P(x,y)>t AND P(x+d, y?d)?P(x,y)>t, wherein the kernels include at least some of a first group of the pixels. The kernels are associated with a first layer, and pixels that are not associated with the first layer are classified as a second layer. The first layer may be text or graphics and the second layer may be a background. The first layer may be compressed with a high resolution compression technique and the second layer may be compressed with a high lossy compression technique.Type: GrantFiled: February 20, 2002Date of Patent: August 1, 2006Assignee: International Business Machines CorporationInventors: Yaakov Navon, Alexander Nisenboim, Eugene Walach
-
Patent number: 7085902Abstract: A method for managing a data storage system includes copying data stored on a first storage subsystem to a second storage subsystem in an asynchronous mirroring process. A record is maintained on the second storage subsystem, indicative of locations at which the data have been updated on the first storage subsystem and have not yet been copied to the second storage subsystem. Upon receiving at the second storage subsystem, from a host processor, a request to access the data stored at a specified location on the data storage system, if the specified location is included in the record, the second storage subsystem initiates a synchronous transfer of the data at the specified location from the first storage subsystem.Type: GrantFiled: September 29, 2003Date of Patent: August 1, 2006Assignee: International Business Machines CorporationInventors: Amiram Hayardeny, Avi Teperman, Martin Tross, Aviad Zlotnick
-
Patent number: 7080340Abstract: In a system 10 for designing an integrated circuit, a preliminary design of the integrated circuit is defined and critical interconnect lines in the preliminary design are identified. Further, any critical interconnect lines which are affected by crossing lines in the preliminary design are identified, and a transmission line model 35 is defined to represent each critical interconnect line. A layout design of the integrated circuit, comprising circuit components and parameters thereof, is then defined using the preliminary design and the transmission line model 35 for each critical interconnect line. Component parameters are then extracted from the layout design for simulation of the design using the extracted component parameters. During this design process, for each transmission line model 35 representing a critical interconnect line affected by a crossing line, an environment terminal 36 is provided.Type: GrantFiled: November 26, 2003Date of Patent: July 18, 2006Assignee: International Business Machines CorporationInventors: David Goren, Rachel Gordin, Michael Zelikson
-
Patent number: 7062472Abstract: Computer-based methods and systems are provided for constructing, deploying, executing and managing the performance of electronic contract based service applications across multiple business entities. In this context, the electronic service contract includes information to be used for configuration and enforcement not just by the primary parties to the contract, but also by other parties referred to herein as sponsored roles in the contract. At least a portion of the contract may be monitored, enforced or managed by at least one of the sponsored roles. In one aspect of the invention, a computer-based electronic business service system includes: (1) a contract builder; (2) a contract deployment component; (3) one or more measurement systems; (4) a violation detection system; and (5) a management system. Generally, the contract builder component provides the mechanism for defining and pricing the contract, checking the validity of the contract and a repository for storing the completed contracts.Type: GrantFiled: December 14, 2001Date of Patent: June 13, 2006Assignee: International Business Machines CorporationInventors: Asit Dan, Gautam Kar, Alexander Keller, Heiko Hary Ludwig
-
Patent number: 7055093Abstract: Provides method and systems to simplify processing and improve processing speed for validation of an XML document. In an example embodiment, a non-deterministic automaton is generated by a binary tree automaton generation module from a document type definition described by hedge grammar. Furthermore, a deterministic binary tree automaton is generated by a determination module, and a deterministic binary tree automaton of which transition function ? is minimized by a minimization module is generated. This minimum deterministic binary tree automaton is used to validate an XML document with a validation module. When the XML document is normally accepted by the binary tree automaton, validation results wherein the XML document is reasonable are outputted.Type: GrantFiled: August 15, 2002Date of Patent: May 30, 2006Assignee: International Business Machines CorporationInventors: Akihiko Tozawa, Makoto Murata
-
Patent number: 7043472Abstract: A XML-aware file system exploits attributes encoded in a XML document. The file system presents a dynamic directory structure to the user, and breaks the conventional tight linkage between sets of files and the physical directory structure, thus allowing different users to see files organized in a different fashion. The dynamic structure is based upon content, which is extracted using an inverted index according to attributes and values defined by the XML structure. In one application, a dynamically changing federated repository is searchable using a system of local and merged master indices, wherein query results are presented as virtual directory paths that are semantically organized.Type: GrantFiled: October 11, 2002Date of Patent: May 9, 2006Assignee: International Business Machines CorporationInventors: Yariv Aridor, Alain Charles Azagury, Michael Edward Factor, Yoelle Maarek, Benjamin Mandler
-
Patent number: 7039256Abstract: A method for increasing efficiency of interaction by an operator with data on a computer display includes presenting the data to the operator on the computer display, and providing multiple instances of an on-screen control at different locations on the display for selection by the operator using a pointing device linked to the display. The control is actuated responsive to the selection by the operator of any of the instances of the control on the display.Type: GrantFiled: July 3, 2002Date of Patent: May 2, 2006Assignee: International Business Machines CorporationInventors: Aviad Zlotnick, Svetlana Shukevich
-
Patent number: 7023357Abstract: A pluggable mechanism for wireless remote control comprising a control panel for controlling an object, the control panel having a receptacle; and a pluggable unit having a plug that is suitable to be plugged into the receptacle of the control panel, and being capable of receiving remote wireless control commands, the pluggable unit cooperates with the control panel to control the controlled object in response to the received wireless control commands when said pluggable unit being plugged into said receptacle of said control panel. The pluggable mechanism of this invention enables wireless remote control on a manually controlled panel and reduces the cost for implementing new wireless communication technologies.Type: GrantFiled: August 22, 2003Date of Patent: April 4, 2006Assignee: International Business Machines CorporationInventors: Rong Yao Fu, Wei Li, Guan Nuan Liu, Song Song
-
Patent number: 7024589Abstract: A design verification system generates a small set of test cases, from a finite state machine model of the application under test. The finite state machine is reduced by creating efficient samples of the inputs to the application under test which are prepared by combinatorial input parameter selection. The test cases are generated by finite state machine traversal of the reduced state machine, and tests interacting combinations of input parameters in an efficient way. The technique is integrated into a test generator based on a finite state machine. Using an extended language, partial rulesets are employed to instruct the test generator to automatically employ combinatorial input parameter selection during test generation. Another technique for test case generation is disclosed, which uses combinatorial selection algorithms to guarantee coverage of the system under test from the aspect of interaction between stimuli at different stages or transitions in the test case.Type: GrantFiled: June 14, 2002Date of Patent: April 4, 2006Assignee: International Business Machines CorporationInventors: Alan Hartman, Andrei Kirshin, Kenneth Nagin, Sergey Olvovsky
-
Patent number: 7007207Abstract: A test-program generator capable of implementing a methodology, based on a formal language, for scheduling system-level transactions in generated test programs. A system to be tested may be composed of multiple processors, busses, bus-bridges, shared memories, etc. The scheduling methodology is based on an exploration of scheduling abilities in a hardware system and features a Hierarchical Scheduling Language for specifying transactions and their ordering. Through a grouping hierarchy, which may also be expressed in the form of an equivalent tree, the Hierarchical Scheduling Language combines the ability to stress related logical areas of the system with the possibility of applying high-level scheduling requests. A method for generating testcases based on request-files written in the Hierarchical Scheduling Language is also presented.Type: GrantFiled: October 21, 2002Date of Patent: February 28, 2006Assignee: International Business Machines CorporationInventors: Roy Emek, Yehuda Naveh
-
Patent number: 7003420Abstract: Methods and systems are provided that improve design verification by test generators by delaying assignment of values in the generated stimuli until these values are used in the design. Late binding allows the generator to have a more accurate view of the state of the design, and in order to choose correct values. Late binding can significantly improve test coverage with a reasonable performance penalty as measured by simulation time.Type: GrantFiled: October 31, 2003Date of Patent: February 21, 2006Assignee: International Business Machines CorporationInventors: Shmuel Ur, Avi Ziv
-
Patent number: 6973659Abstract: A method for facilitating execution of a remote method, that is originated from a Remote Procedure Call system, in an Event Driven Execution Environment system, including receiving from a Remote Procedure Call system a message expressed in Remote Procedure Call system primitives. Mapping Remote Procedure Call system primitives of the message to Event Driven Execution Environment system primitives. Transmitting primitives of the mapped message to the Event Driven Execution Environment system for execution. Receiving a result of the execution from the Event Driven Execution Environment system, and transmitting the result to the Remote Procedure Call system.Type: GrantFiled: August 22, 2002Date of Patent: December 6, 2005Assignee: International Business Machines CorporationInventors: Eishy Smith, Gal Shachor, Pnina Vortman, Tirtsa Hochberg
-
Patent number: 6952718Abstract: Flow control for a workflow controlling system is achieved wherein a business document flows among a plurality of participants by, at a system which includes a server apparatus including a storage device and terminal apparatus connecting to the server apparatus via a network, generating a document which includes data and rules responding to a request from one of the terminal apparatus and storing it in the storage device, receiving an update request on the document from the first terminal apparatus, determining whether the update request is appropriate or not, and if the update request is appropriate then executing the update on the document, and determining whether the workflow/process was completed or not, and if not completed then identifying the second terminal apparatus which can update next and notifying it.Type: GrantFiled: December 27, 2000Date of Patent: October 4, 2005Assignee: International Business Machines CorporationInventors: Yuhichi Nakamura, Ryoh Neyama, Naishin Seki, Kohichi Kajitani
-
Patent number: 6941297Abstract: A method for Automatic Query Refinement, the method including extracting at least one lexical affinity from at least one document in a search result set of documents, the set resulting from the application of a first query to a document search engine, adding the lexical affinity to the first query, thereby forming a new query, and applying the new query to the document search engine, resulting in a new search result set.Type: GrantFiled: July 31, 2002Date of Patent: September 6, 2005Assignee: International Business Machines CorporationInventors: David Carmel, Eitan Farchi, Yael Petruschka