Patents by Inventor Silviu Chiricescu

Silviu Chiricescu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10078763
    Abstract: A system and method for metadata processing that can be used to encode an arbitrary number of security policies for code running on a stored-program processor. This disclosure adds metadata to every word in the system and adds a metadata processing unit that works in parallel with data flow to enforce an arbitrary set of policies, such that metadata is unbounded and software programmable to be applicable to a wide range of metadata processing policies. This instant disclosure is applicable to a wide range of uses including safety, security, and synchronization.
    Type: Grant
    Filed: November 19, 2015
    Date of Patent: September 18, 2018
    Assignees: BAE Systems Information and Electronic Systems Integration Incc, The Trustees of the University of Pennsylvania
    Inventors: Silviu Chiricescu, Andre DeHon, Udit Dhawan
  • Patent number: 9554185
    Abstract: The present invention monitors a user's activities to determine how much attention he is paying to one or more devices. Based on the information gathered about the user's current “attention profile,” a “user-interaction parameter” is set that reflects where the user's attention is focused and, ideally, how much of his attention is given to each device. Then, based on the user-interaction parameter, the user interface of at least one of the user's devices is configured to optimize the user's interactions, given the amount of attention he is currently giving to this user interface. If the user is giving the majority of his attention to the television, for example, then the user interface of a companion device can be configured to emphasize the types of interactions available to a user who is not actively watching the companion device.
    Type: Grant
    Filed: December 15, 2011
    Date of Patent: January 24, 2017
    Assignee: ARRIS Enterprises, Inc.
    Inventors: Nitya Narasimhan, Silviu Chiricescu, Venugopal Vasudevan, Joseph F. Wodka
  • Publication number: 20160140363
    Abstract: A system and method for metadata processing that can be used to encode an arbitrary number of security policies for code running on a stored-program processor. This disclosure adds metadata to every word in the system and adds a metadata processing unit that works in parallel with data flow to enforce an arbitrary set of policies, such that metadata is unbounded and software programmable to be applicable to a wide range of metadata processing policies. This instant disclosure is applicable to a wide range of uses including safety, security, and synchronization.
    Type: Application
    Filed: November 19, 2015
    Publication date: May 19, 2016
    Inventors: Silviu Chiricescu, Andre DeHon, Udit Dhawan
  • Publication number: 20140074923
    Abstract: In a device that is a member of an ad-hoc group in a network, a method includes determining an encounter history of the device with other devices in the ad-hoc group and filtering content intended to be shared by the device with the ad-hoc group based on the encounter history. A device includes a network interface to communicate with other devices in an ad-hoc group of a network and a disclosure assessment agent to determine a disclosure factor for disclosure of content to the ad-hoc group based on an encounter history of the device with other devices in the ad-hoc group. The device further includes a disclosure filter agent to filter content intended to be shared with the ad-hoc group based on the disclosure factor.
    Type: Application
    Filed: September 12, 2012
    Publication date: March 13, 2014
    Applicant: GENERAL INSTRUMENT CORPORATION
    Inventors: Venugopal Vasudevan, Silviu Chiricescu, Jehan Wickramasuriya, Joseph F. Wodka
  • Publication number: 20130194310
    Abstract: A method and apparatus for displaying data associated with a first application and data associated with a second application on a portable computing are disclosed. Data from physical and virtual sensors is captured and used to determine a context vector. The context vector may provide information about portable computing device usage. Application modes associated with the context vector by the first application and by the second application are identified in addition to a container mode associated with the context vector by a display container. In one embodiment, the display container is a virtual display space used to identify and describe data for display on a display device. A display configuration is determined form the application modes associated with the context vector and the container mode associated with the context vector and used to display data on a display device.
    Type: Application
    Filed: January 26, 2012
    Publication date: August 1, 2013
    Applicant: GENERAL INSTRUMENT CORPORATION
    Inventors: Venugopal Vasudevan, Silviu Chiricescu, Gilles Drieu, Sriram Yadavalli
  • Publication number: 20130160036
    Abstract: The present invention monitors a user's activities to determine how much attention he is paying to one or more devices. Based on the information gathered about the user's current “attention profile,” a “user-interaction parameter” is set that reflects where the user's attention is focused and, ideally, how much of his attention is given to each device. Then, based on the user-interaction parameter, the user interface of at least one of the user's devices is configured to optimize the user's interactions, given the amount of attention he is currently giving to this user interface. If the user is giving the majority of his attention to the television, for example, then the user interface of a companion device can be configured to emphasize the types of interactions available to a user who is not actively watching the companion device.
    Type: Application
    Filed: December 15, 2011
    Publication date: June 20, 2013
    Applicant: GENERAL INSTRUMENT CORPORATION
    Inventors: Nitya Narasimhan, Silviu Chiricescu, Venugopal Vasudevan, Joseph F. Wodka
  • Patent number: 8160600
    Abstract: A method and apparatus for allocating resources to a node in an ad-hoc communication system is provided herein. During operation, nodes of the system will receive resource allocations from their parent node. The resource allocation comprises a portion of available resources that may vary in size. Each node will determine the resource needs for its children nodes only and then dynamically assign resources to them. The resources assigned to the children nodes comprise a portion of the resources assigned to the node by its parent node. Additionally, knowledge as to how the children further allocate resources to their own children is not known by the parent, however, the children nodes must allocate a portion of their resource to their children nodes.
    Type: Grant
    Filed: November 4, 2008
    Date of Patent: April 17, 2012
    Assignee: Motorola Solutions, Inc.
    Inventors: Ali Saidi, Silviu Chiricescu, Loren J. Rittle, Yang Yu
  • Patent number: 7978670
    Abstract: A method and apparatus to facilitate managing communications with at least one wireless node (102, 103) having an outbound payload memory in a severely resource-constrained wireless network (100) can provide for a coordinator node (101) for that network providing (201) information regarding remaining capacity of those outbound payload memories and then automatically using (202) that information in integral combination with a bandwidth allocation management process to control allocation of at least one wireless communication resource by which the wireless nodes can transmit items contained in the outbound payload memory.
    Type: Grant
    Filed: August 7, 2007
    Date of Patent: July 12, 2011
    Assignee: Motorola Solutions, Inc.
    Inventors: Silviu Chiricescu, Ali Saidi
  • Patent number: 7969928
    Abstract: A method and apparatus that allocates bandwidth among wireless sensor nodes in a wireless sensor network (WSN) is disclosed. The method may include allocating transmission time slots for a plurality of wireless sensor nodes based on at least one channel quality metric, determining battery levels in each of the plurality of wireless sensor nodes and average battery level of all of the plurality of wireless sensor nodes, determining differences in battery level between each of the plurality of wireless sensor nodes and average battery level of all of the plurality of wireless sensor nodes, wherein if any such difference is above a predetermined threshold, increasing the transmission time slots allocation of wireless sensor nodes having higher battery levels relative to other wireless sensor nodes in the plurality of wireless sensor nodes.
    Type: Grant
    Filed: March 2, 2007
    Date of Patent: June 28, 2011
    Assignee: Motorola Solutions, Inc.
    Inventors: Silviu Chiricescu, Ali Saidi
  • Patent number: 7801079
    Abstract: A method and apparatus that allocates bandwidth among wireless sensor nodes in wireless sensor groups in a wireless sensor network (WSN) is disclosed.
    Type: Grant
    Filed: March 2, 2007
    Date of Patent: September 21, 2010
    Assignee: Motorola, Inc.
    Inventors: Ali Saidi, Silviu Chiricescu, Philip E. May, Kent D. Moat
  • Publication number: 20100176940
    Abstract: During operation, a node (104) will determine a particular probability of achieving a successful location. When battery resources are below a threshold the node will utilize a minimum probability for success in determining how many time-slots to collect RSSI measurements. However, if battery resources are above the threshold, a higher probability of achieving a successful location than the minimum may be utilized. After the particular probability of achieving a successful location is determined, a number of time-slots (L) are determined. L comprises a number of time slots that the node must remain awake for to achieve the particular probability of achieving a successful location. The node will then remain awake for L time slots, and compute a location based on measurements taken within those L time slots.
    Type: Application
    Filed: January 15, 2009
    Publication date: July 15, 2010
    Applicant: MOTOROLA, INC.
    Inventors: Ali Saidi, Silviu Chiricescu, Loren J. Rittle, Yang Yu
  • Publication number: 20100111000
    Abstract: A method and apparatus for allocating resources to a node in an ad-hoc communication system is provided herein. During operation, nodes of the system will receive resource allocations from their parent node. The resource allocation comprises a portion of available resources that may vary in size. Each node will determine the resource needs for its children nodes only and then dynamically assign resources to them. The resources assigned to the children nodes comprise a portion of the resources assigned to the node by its parent node. Additionally, knowledge as to how the children further allocate resources to their own children is not known by the parent, however, the children nodes must allocate a portion of their resource to their children nodes.
    Type: Application
    Filed: November 4, 2008
    Publication date: May 6, 2010
    Applicant: MOTOROLA, INC.
    Inventors: Ali Saidi, Silviu Chiricescu, Loren J. Rittle, Yang Yu
  • Publication number: 20090156128
    Abstract: An eyewear apparatus (100) has a first plurality of antennas (144, 142, 158) disposed thereon for transmitting a signal in a narrow beam (402), for example, with a directivity greater than 10 dBi, the signal comprising at least one of data and video. A microcomputer (126) is coupled to the first plurality of antennas for providing the signal thereto.
    Type: Application
    Filed: December 12, 2007
    Publication date: June 18, 2009
    Applicant: MOTOROLA, INC.
    Inventors: Steven J. Franson, Silviu Chiricescu, Derrick Lim
  • Publication number: 20090042580
    Abstract: A method and apparatus to facilitate managing communications with at least one wireless node (102, 103) having an outbound payload memory in a severely resource-constrained wireless network (100) can provide for a coordinator node (101) for that network providing (201) information regarding remaining capacity of those outbound payload memories and then automatically using (202) that information in integral combination with a bandwidth allocation management process to control allocation of at least one wireless communication resource by which the wireless nodes can transmit items contained in the outbound payload memory.
    Type: Application
    Filed: August 7, 2007
    Publication date: February 12, 2009
    Applicant: MOTOROLA, INC.
    Inventors: Silviu Chiricescu, Ali Saidi
  • Publication number: 20080212557
    Abstract: A method and apparatus that allocates bandwidth among wireless sensor nodes in a wireless sensor network (WSN) is disclosed. The method may include allocating transmission time slots for a plurality of wireless sensor nodes based on at least one channel quality metric, determining battery levels in each of the plurality of wireless sensor nodes and average battery level of all of the plurality of wireless sensor nodes, determining differences in battery level between each of the plurality of wireless sensor nodes and average battery level of all of the plurality of wireless sensor nodes, wherein if any such difference is above a predetermined threshold, increasing the transmission time slots allocation of wireless sensor nodes having higher battery levels relative to other wireless sensor nodes in the plurality of wireless sensor nodes.
    Type: Application
    Filed: March 2, 2007
    Publication date: September 4, 2008
    Applicant: Motorola, Inc.
    Inventors: Silviu Chiricescu, Ali Saidi
  • Publication number: 20080211666
    Abstract: A method and apparatus that allocates bandwidth among wireless sensor nodes in wireless sensor groups in a wireless sensor network (WSN) is disclosed.
    Type: Application
    Filed: March 2, 2007
    Publication date: September 4, 2008
    Applicant: Motorola, Inc.
    Inventors: Ali Saidi, Silviu Chiricescu, Philip E. May, Kent D. Moat
  • Publication number: 20080168826
    Abstract: A system includes a first gas sensor [110] to detect a first concentration of a predetermined gas and to determine a first rate of change in the first concentration over a time interval. A second gas sensor [115] detects a second concentration of the predetermined gas and determines a second rate of change in the second concentration over the time interval. A third gas sensor [120] detects a third concentration of the predetermined gas and determines a third rate of change in the third concentration over the time interval. The first, second, and third gas sensors each have a known location. At least one processing device [510] (a) determines respective distances between a gas leak location and the respective locations of the gas sensors based on the detected rates of change, and (b) calculates a location of the gas leak based on a triangulation of the first distance, the second distance, and the third distance.
    Type: Application
    Filed: January 17, 2007
    Publication date: July 17, 2008
    Applicant: MOTOROLA, INC.
    Inventors: Ali Saidi, Silviu Chiricescu, James M. Norris, Michael A. Schuette
  • Patent number: 7159099
    Abstract: A re-configurable, streaming vector processor (100) is provided which includes a number of function units (102), each having one or more inputs for receiving data values and an output for providing a data value, a re-configurable interconnection switch (104) and a micro-sequencer (118). The re-configurable interconnection switch (104) includes one or more links, each link operable to couple an output of a function unit (102) to an input of a function unit (102) as directed by the micro-sequencer (118). The vector processor may also include one or more input-stream units (122) for retrieving data from memory. Each input-stream unit is directed by a host processor and has a defined interface (116) to the host processor. The vector processor also includes one or more output-stream units (124) for writing data to memory or to the host processor. The defined interface of the input-stream and output-stream units forms a first part of the programming model.
    Type: Grant
    Filed: June 28, 2002
    Date of Patent: January 2, 2007
    Assignee: Motorola, Inc.
    Inventors: Brian Geoffrey Lucas, Philip E. May, Kent Donald Moat, Raymond B. Essick, IV, Silviu Chiricescu, James M. Norris, Michael Allen Schuette, Ali Saidi
  • Patent number: 7140019
    Abstract: A method for scheduling a computation for execution on a computer with a number of interconnected functional units. The computation is representable by a data-flow graph with a number of nodes connected by edge. A loop-period of the computation is calculated and the nodes are scheduled for throughput by assigning an execution cycle and a functional unit to each node of the data-flow graph. The scheduling of flexible nodes is adjusted to minimize the number of interconnections required in each execution cycle. The edges of the data-flow graph are allocated to one or more of the interconnections between functional units. The scheduling method may be used, for example, to optimize the interconnection fabric design for an ASIC or as part of a compiler for a re-configurable streaming vector processor.
    Type: Grant
    Filed: June 28, 2002
    Date of Patent: November 21, 2006
    Assignee: Motorola, inc.
    Inventors: Philip E. May, Kent Donald Moat, Raymond B. Essick, IV, Silviu Chiricescu, Brian Geoffrey Lucas, James M. Norris, Michael Allen Schuette, Ali Saidi
  • Patent number: 6934938
    Abstract: A method for producing a formatted description of a computation representable by a data-flow graph and computer for performing a computation so described. A source instruction is generated for each input of the data-flow graph, a computational instruction is generated for each node of the data-flow graph, and a sink instruction is generated for each output of the data-flow graph. The computational instruction for a node includes a descriptor of an operation performed at the node and a descriptor of each instruction that produces an input to the node. The formatted description is a sequential instruction list comprising source instructions, computational instructions and sink instructions. Each instruction has an instruction identifier and the descriptor of each instruction that produces an input to the node is the instruction identifier. The computer is directed by a program of instructions to implement a computation representable by a data-flow graph.
    Type: Grant
    Filed: June 28, 2002
    Date of Patent: August 23, 2005
    Assignee: Motorola, Inc.
    Inventors: Philip E. May, Kent Donald Moat, Raymond B. Essick, IV, Silviu Chiricescu, Brian Geoffrey Lucas, James M. Norris, Michael Allen Schuette, Ali Saidi