Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Andreozzi
Daniele Andreozzi, Aprilia IT
| Patent application number | Description | Published |
|---|---|---|
| 20080251743 | Valve for a Container, Preferably a Cylinder Containing High Pressure Gas - The present invention relates to an improved valve ( | 10-16-2008 |
Dean Andreozzi, Grand Haven, MI US
| Patent application number | Description | Published |
|---|---|---|
| 20090310238 | INTERIOR REARVIEW MIRROR ASSEMBLY - An interior rearview mirror assembly for a vehicle includes a reflective element and an attachment plate attached thereto. A mounting assembly is configured to mount the mirror assembly to an interior portion of the vehicle. The mounting assembly includes a toggle portion and a cam actuator, with the toggle portion pivotally mounting to a first mounting element and the cam actuator pivotally mounting to a second mounting element of the attachment plate. The toggle portion engages the cam actuator such that pivotal movement of the cam actuator imparts a pivotal movement of the toggle portion. The attachment plate may include at least one mounting element protruding through a circuit element supported at the attachment plate. | 12-17-2009 |
Matteo Andreozzi, Pisa IT
| Patent application number | Description | Published |
|---|---|---|
| 20100278152 | Scheduling Method and System for Communication Networks; Corresponding Devices, Network and Computer Program Product - In a method of scheduling transmission services over a high speed packet access communication link such as a HSDPA and/or a HSUPA link a list of queues is created for transmission services to be provided over the link. The queues, which include both Real Time and Non Real Time queues, are allotted respective service priorities based e.g. on a channel quality indicator and/or a Quality of Service indicator to produce an ordered list of queues based on the service priorities. The link resources needed for serving at least one set of queues having higher priorities in the ordered list are estimated and a check is made. If these resources are available, the set of queues having higher priorities in the ordered list are served. If the resources required are not available, at least one queue is removed from the ordered list of queues. | 11-04-2010 |