5 New Applications Available for Review on Peer-to-Patent

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Peer-to-Patent has posted 5 new pending patent applications for your review!
 
The new pending patent applications pertain to a wide array of inventions, including:
 
Configuring a wind-farm network
Estimating sortedness of a data stream
Security systems for protecting assets
Timer modification
Annotation based thunking 
 
The success of Peer-to-Patent depends upon participation from a knowledgeable, diverse community.  If you know anyone who might be interested in these applications, please forward this on to them or ask them to visit www.peertopatent.org
 
An application from GE, available here.  Wind turbines for wind power generation are typically grouped in large numbers referred to as wind-farms.  Each wind turbine includes monitoring and control devices. Typically, wind-farms have a centralized control unit connected to a local area network of wind turbines to allow for monitor and control of the entire wind-farm.  Each device connected to the wind-farm network requires an IP address in order to communicate on the network.  In addition, the central control unit needs to be able to uniquely identify each device in the network.  A unique identification is lost using dynamic address assignment.  For this reason, network settings in a wind-farm network are done manually.  This is extremely time consuming, labor intensive, and prone to error.  This application (Application #11/380939; Publication #20070255832) describes a method for automatically configuring a wind-farm network.  This is the fourth application from GE and will be available for public review until January 14, 2008.
 
An application from IBM, available here.  In computer applications that access data in a streaming fashion it is often desirable to estimate the sortedness of the data steam.  Sortedness being the number of operations required to place the elements in the data steam in a sorted order.  An estimation of sortedness may be useful in data steams corresponding to network routing or when comparing very long rankings.  However, it is difficult to estimate sortedness in a feasible manner without having to scan the data steam more than once and/or without having to actually sort the entire sequence.  Therefore, there is a need for a method that requires only one pass over a sequence of data elements and adequately samples data elements from the sequence to allow for an estimation of sortedness.  This application (Application #11/405994; Publication #20070244891) describes a method of scanning in a data steam once in order to obtain uniform data samples from selected intervals and using the obtained data samples to estimate the degree of sortedness of that data stream.  This is the seventh application from IBM and will be available for public review until February 07, 2008.
 
An application from independent inventor Jeffrey Dean Lindsay, available here.  The claimed invention is directed toward improving the security of protected assets, particularly assets protected with a password system, including personal identification numbers.  In spite of the many efforts made to increase the security of password-accessible systems, there remains a need to provide more flexible convenient systems in which users can configure security rules for access to secured assets.  The application (Application #11/416647; Publication #20070250920) describes security systems for protecting assets, including a password-based security system that can provide different levels of access responsive to entry of a primary or secondary password.  In some versions, user-configurable security rules can provide customized responses to entry of primary or secondary passwords including feigned or limited access, security alerts, etc.  Passwords comprising overt and covert components can be used to provide enhanced security and improved user control over system response.  This is the first application from Jeffrey Dean Lindsay and will be available for public review until March 3, 2008.
 
Two applications from Intel.  The first is available here.  Computer systems and electronic devices, such as microprocessors, may contain timer circuits to maintain a running numerical count for use by other logic or devices.  On occasion, a timer may need to be updated with a new value by a user or computer program.  A known method of updating a timer is by first reading the current timer value, storing it, loading a new timer value, and then programming the new timer value into the timer.  The problem is that these operations take time to perform.  Therefore, some time may pass between the first operation and when the new timer value is finally programmed into the timer.  This creates a difference between the ?real time? and the time reflected by the timer.  Difference between real time and the timer value can cause problems for processes running on a computer.  This application (Application #11/416647; Publication #20070260907) describes a technique to modify a timer without the timer advancing by a significant amount.  This is the fourth application from Intel and will be available for public review until February 28, 2008.
 
Another application from Intel is available here.  Thunking describes any variety of process by which a first process executing a first set of machine executable instructions compiled with specific parameter (platform type, word size, bit-value, etc.) is able to successfully make a function call to another set of machine executable instructions compiled for another set of parameters.  In general, thunking involves a translation of function calls, function call parameters, and/or return parameters between at least two processes compiled for differing specifications.  Difficulties arise because virtual machines have no way of knowing whether the passed data structure is actual data or a pointer to data and thus the virtual machine cannot successfully implement the necessary thunking.  The application (Application #11/440850; Publication #200070234286) describes methods and apparatus to implement annotation based thunking.  The process sends as call parameters, based upon a predetermined bit threshold, either data or a data pointer and adds to the sent data structure an annotation record to allow the process receiving the function call to complete a function call.  This is the fifth application from Intel and will be available for public review until January 28, 2008.
 
WE APOLOGIZE THAT OUR CURRENT MAIL PROGRAM INSERTS TRACKABLE LINKS.  WE ARE IN THE PROCESS OF SWITCHING MAIL PROGRAMS.  WE DO NOT TRACK CLICK-THRUS OR ANY OTHER USER INFORMATION.  
 
Thank you,
The Peer-to-Patent Team 

 
 


This message was sent from Peer-to-Patent to @xxxxxxxxxxxx It was sent from: New York Law School, 57 Worth Street, New York, NY 10013. You can modify/update your subscription via the link below. Email Marketing Software

Manage your subscription

[Index of Archives]     [Kernel Newbies]     [Share Photos]     [IDE]     [Security]     [Git]     [Netfilter]     [Bugtraq]     [Photo]     [Yosemite]     [Yosemite News]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Linux ATA RAID]     [Samba]     [Video 4 Linux]     [Device Mapper]     [Linux Resources]

  Powered by Linux