Raymond J Krasinski

US Patent:

6490370, Dec 3, 2002

Filed:

Aug 10, 1999

Appl. No.:

09/371375

Inventors:

Raymond J. Krasinski - Suffern NY
Yasser alSafadi - Yorktown Heights NY

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

G06K 900

US Classification:

382195, 382181, 382190, 382236, 382305, 382311, 345418, 345473, 345706, 345968, 358403, 707 3, 707102, 7071041, 7075011

Abstract:

A video processing device and method for generating a descriptor data structure representative of a feature that has been selected from among of plurality of features including visual, conceptual, textual and graphical of a visual animated data file includes a user input unit for selecting a desired feature and generating an associated descriptor data containing attribute values, and a processor identifies the selected feature inserts selected attribute values into a standard descriptor template. Various types of features, from concepts about a video sequence, to age identification, to images in a video clip, to particular objects or colors can all be classified in a standard descriptor template, to provide uniformity in storing and retrieving the various features currently lacking in freeform or single feature descriptors.

US Patent:

6850948, Feb 1, 2005

Filed:

Oct 30, 2000

Appl. No.:

09/699609

Inventors:

Raymond Krasinski - Suffern NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

G06F 1700
G06F 1516

US Classification:

707101, 709247, 715513, 715514

Abstract:

A method and apparatus are disclosed for compressing textual documents encoded using a tag-based markup language, such as XML or SGML documents, in a manner that allows a compressed document to be processed without decompression. A document is compressed using a standard compression algorithm that is applied only to the data elements of the document. The tag elements of the XML document that impose the hierarchical structure on the data elements are not compressed. The hierarchical relationship of the data elements can be ascertained from the compressed document. A user can thereafter selectively decompress desired portions of the document, without decompressing the entire document. An identification of the employed compression technique can be inserted into a root node tag element of the XML document or into an additional tag element pair that is inserted into the XML document. An XML decoder can utilize the uncompressed tag elements to ascertain the hierarchical structure of the compressed data and present the user with a corresponding hierarchical expression of the document.

US Patent:

6966027, Nov 15, 2005

Filed:

Oct 4, 1999

Appl. No.:

09/411756

Inventors:

Raymond J. Krasinski - Suffern NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

G60F017/00

US Classification:

715513

Abstract:

A method and apparatus are disclosed for streaming XML content in a manner that allows the receiver to decode the XML data that is actually received, even if an entire XML document is not received. Each XML document is decomposed and encoded as a collection of sub-trees. Each sub-tree from the larger XML document tree can be parsed and validated by the XML receiver as if it is an independent tree. Each streamed XML document utilizes a structure node that serves as a sub-tree wrapper function around each independent sub-tree. The structure node indicates the relationship of the sub-tree to other sub-trees, thereby allowing the XML receiver to reconstruct the full tree.

US Patent:

6976173, Dec 13, 2005

Filed:

Sep 28, 2001

Appl. No.:

09/966435

Inventors:

Raymond Krasinski - Suffern NY, US
Michael A. Epstein - Spring Valley NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

G06F001/26

US Classification:

713193, 713200, 713201

Abstract:

Methods and apparatus for attacking a screening algorithm. The methods include the steps of marking content to be downloaded, inserting at least one section of legitimate content into the marked content, and subjecting the content to a screening algorithm. The screening algorithm may include the steps of determining a number of segments that are included within the content, selecting at least two segments within the content, screening the two segments to determine whether the two segments verify correctly through the screening algorithm, and downloading the content when it is determined that the two segments verify correctly through the screening algorithm. Once the content has been successfully downloaded, the integrity of the downloaded content may be restored by removing the legitimate content that was previously inserted into the downloaded content.

US Patent:

7124356, Oct 17, 2006

Filed:

Dec 3, 1999

Appl. No.:

09/454348

Inventors:

Yasser Alsafadi - Yorktown Heights NY, US
Aninda Dasgupta - Croton-On-Hudson NY, US
Raymond Krasinski - Suffern NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

G06F 17/00

US Classification:

715513, 707100

Abstract:

A method of operating a system including a digital network interconnected intelligent digital devices (IDDS) generating and receiving eXtensible Markup Language (XML) documents containing data and respective Document Type Definitions (DTDs) describing the data content. Preferably, the method includes steps for transmitting a generated XML document from a first IDD to a second IDD, and, when the respective DTD for the generated XML document satisfies a predetermined criteria, operating on the data contained in the XML document at the second IDD. In a first exemplary case, the second IDD maintains a list of trusted DTDs, and the predetermined criteria is equality between the name of the respective DTD and the name of a trusted DTD. Alternatively, the predetermined criteria is satisfied by inclusion of the name of a program residing on the second IDD in the respective DTD. In a second exemplary case, the transmitting step includes transmitting the generated XML document from the first IDD to the second IDD and a third IDD, the operating step includes operating on the data contained in the XML document at the second IDD when the respective DTD for the generated XML document satisfies a first predetermined criteria, and the method further includes the step of operating on the data contained in the XML document at the third IDD when the respective DTD for the generated XML document satisfies a second predetermined criteria.

US Patent:

7991998, Aug 2, 2011

Filed:

Sep 22, 2003

Appl. No.:

10/529353

Inventors:

Martin C. Rosner - Cortlandt Manor NY, US
Raymond J. Krasinski - Suffern NY, US
Michael A. Epstein - Spring Valley NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

H04L 29/06

US Classification:

713168, 713171, 380258, 726 3

Abstract:

A system and method determines the proximity of the target node to the source node from the time required to communicate messages within the node-verification protocol. The node-verification protocol includes a query-response sequence, wherein the source node communicates a query to the target node, and the target node communicates a corresponding response to the source node. The target node is configured to communicate two responses to the query: a first response that is transmitted immediately upon receipt of the query, and a second response based on the contents of the query. The communication time is determined based on the time duration between the transmission of the query and receipt of the first response at the source node and the second response is compared for correspondence to the query, to verify the authenticity of the target node.

US Patent:

8239676, Aug 7, 2012

Filed:

Jun 22, 2011

Appl. No.:

13/166059

Inventors:

Martin C. Rosner - Cortlandt Manor NY, US
Raymond J. Krasinski - Suffern NY, US
Michael A. Epstein - Spring Valley NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

H04L 29/06

US Classification:

713165, 380258, 713168

Abstract:

A system and method determines the proximity of the target node to the source node from the time required to communicate messages within the node-verification protocol. The node-verification protocol includes a query-response sequence, wherein the source node communicates a query to the target node, and the target node communicates a corresponding response to the source node. The target node is configured to communicate two responses to the query: a first response that is transmitted immediately upon receipt of the query, and a second response based on the contents of the query. The communication time is determined based on the time duration between the transmission of the query and receipt of the first response at the source node and the second response is compared for correspondence to the query, to verify the authenticity of the target node.

US Patent:

8312166, Nov 13, 2012

Filed:

Oct 12, 2006

Appl. No.:

12/089950

Inventors:

Michael Epstein - Spring Valley NY, US
Raymond J. Krasinski - Suffern NY, US

Assignee:

Koninklijke Philips Electronics N.V. - Eindhoven

International Classification:

G06F 15/173

US Classification:

709238, 709245, 709249, 709250, 709251, 709252, 709253

Abstract:

A method of determining proximity between a root node and a leaf node in a network is presented. The method comprises computing a link proximity value between any two mutually connected nodes in the network. At an initial node, a proximity computation request message is sent containing a proximity counter to an intermediate node to which the initial node is connected. At an intermediate node, being connected to a first node and to a second node, upon receipt of the proximity computation request message containing a proximity counter from the first node, the computed link is added to a proximity value and passed on the proximity computation request message to the second node. At a final node, upon receipt of the proximity computation request message, the proximity between the root node and the leaf node is determined as the value indicated by the proximity counter.

Address:

5 Reigate Pl, Suffern, NY 10901

Phone:

9175605928

VIN:

3FAHP0HA6AR112840

Make:

FORD

Model:

FUSION

Year:

2010