Patent application number | Description | Published |
20100057851 | RECONFIGURABLE MULTIMEDIA COLLABORATION SYSTEM - A system for multimedia communications implemented with reconfigurable technology is disclosed. The system includes: a SIP engine implemented in hardware that executes functions defined by Session Initiation Protocol (SIP); a XML engine implemented in hardware that executes functions defined by Extensible Markup Language (XML); and an interface that coordinates functions executed by the SIP engine and the XML engine. A standard set of features are provided for robust communications while permitting the addition of more features to enhance the multimedia communications experience. For example, audio and video communication, instant messaging and presence can be provided by the system while P2P and IP Multimedia Systems (IMS) can be provided through expansion. Reconfigurable technology allows the system to achieve optimal performance in performing various tasks. | 03-04-2010 |
20120242800 | APPARATUS AND SYSTEM FOR INTERFACING WITH COMPUTERS AND OTHER ELECTRONIC DEVICES THROUGH GESTURES BY USING DEPTH SENSING AND METHODS OF USE - Disclosed herein are systems and methods for gesture capturing, detection, recognition, and mapping them into commands which allow one or many users to interact with electronic games or any electronic device interfaces. Gesture recognition methods, apparatus and system are disclosed from which application developers can incorporate gesture-to-character inputs into their gaming, learning or the like applications. Also herein are systems and methods for receiving 3D data reflecting hand, fingers or other body parts movements of a user, and determining from that data whether the user has performed gesture commands for controlling electronic devices, or computer applications such as games or others. | 09-27-2012 |
20150245010 | APPARATUS AND SYSTEM FOR INTERFACING WITH COMPUTERS AND OTHER ELECTRONIC DEVICES THROUGH GESTURES BY USING DEPTH SENSING AND METHODS OF USE - Disclosed herein are systems and methods for gesture capturing, detection, recognition, and mapping them into commands that allow one or more users to interact with electronic games or any electronic device interfaces. Gesture recognition methods, apparatus and system are disclosed from which application developers can incorporate gesture-to-character inputs into their gaming, learning or the like applications. Also herein are systems and methods for receiving 3D data reflecting hand, fingers or other body parts movements of a user, and determining from that data whether the user has performed gesture commands for controlling electronic devices, or computer applications such as games or others. | 08-27-2015 |
Patent application number | Description | Published |
20080277718 | 1T MEMS scalable memory cell - This invention relates to the use of a gate dielectric placed under the mobile gate electrode of MOS transistor, without the need of a conductive floating gate. The invention exploits the electromechanical hysteretic behavior of the mobile gate when down contacting (pull-in) and up separating (pull-out) from the gate dielectric, based on the (non)equilibrium between electrical and elastic forces. | 11-13-2008 |
20100140589 | FERROELECTRIC TUNNEL FET SWITCH AND MEMORY - A Ferroelectric tunnel FET switch as ultra-steep (abrupt) switch with subthreshold swing better than the MOSFET limit of 60 mV/decade at room temperature combining two key principles: ferroelectric gate stack and band-to-band tunneling in gated p-i-n junction, wherein the ferroelectric material included in the gate stack creates, due to dipole polarization with increasing gate voltage, a positive feedback in the capacitive coupling that controls the band-to-band (BTB) tunneling at the source junction of a silicon p-i-n reversed bias structure, wherein the combined effect of BTB tunneling and ferroelectric negative capacitance offers more abrupt off-on and on-off transitions in the present proposed Ferroelectric tunnel FET than for any reported tunnel FET or any reported ferroelectric FET. | 06-10-2010 |
20100171569 | ACTIVE DOUBLE OR MULTI GATE MICRO-ELECTRO-MECHANICAL DEVICE WITH BUILT-IN TRANSISTOR - The present invention exploits the combination of the amplification, provided by the integration of a FET (or any other active device with two or more terminals), with the signal modulation, provided by the MEM resonator, to build a MEM resonator with built-in transistor (hereafter called active MEM resonator). In these devices, a mechanical displacement is converted into a current modulation and depending on the active MEM resonator geometry, number of gates and bias conditions it is possible to selectively amplify an applied signal. This invention integrates proposes to integrate transistor and micro-electro-mechanical resonator operation in a device with a single body and multiple surrounding gates for improved performance, control and functionality. Moreover, under certain conditions, an active resonator can serve as DC-AC converter and provide at the output an AC signal corresponding to its mechanical resonance frequency. | 07-08-2010 |
20110298553 | ACTIVE MULTI-GATE MICRO-ELECTRO-MECHANICAL DEVICE WITH BUILT-IN TRANSISTOR - The present invention exploits the combination of the amplification, provided by the integration of a FET (or any other three terminal active device), with the signal modulation, provided by the MEM resonator, to build a MEM resonator with built-in transistor (hereafter called active MEM resonator). In these devices, a mechanical displacement is converted into a current modulation and depending on the active MEM resonator geometry, number of gates and bias conditions it is possible to selectively amplify an applied signal. This invention integrates proposes to integrate transistor and micro-electro-mechanical resonator operation in a device with a single body and multiple surrounding gates for improved performance, control and functionality. Moreover, under certain conditions, an active resonator can serve as DC-AC converter and provide at the output an AC signal corresponding to its mechanical resonance frequency. | 12-08-2011 |
20130306937 | 3D NANO-ELECTRO-MECHANICAL MULTIPLE-STATE CARBON NANOTUBE DEVICE STRUCTURES AND METHODS OF FABRICATION - A 3D M-CNT structure with at least one tri-state CNT NEM switch comprising at least an electrode as a source, an electrode as a gate and an electrode as a drain, a conductive carbon nanotube which is able to take three positions depending on a voltage application to said electrodes. | 11-21-2013 |
20150137068 | JUNCTIONLESS NANO-ELECTRO-MECHANICAL RESONANT TRANSISTOR - A junctionless Nano-Electro-Mechanical (NEM) resonator, comprising a highly doped conductive channel connecting a drain region and a source region; the conduction channel region is movable and the overall structure is fixed at least at these two ends placed on acting the source and drain regions, respectively; at least one fixed gate electrode arranged to control a depletion charge in the highly doped conductive channel thereby modulating dimensions of a cross-section of the highly doped conductive channel. A dimension of the cross-section in the direction of an electrical field that is oriented from the fixed gate electrode to the highly doped conductive channel, is designed in such a way that it can be reduced under the effect of the depletion charge such that a full depletion in the highly doped conductive channel is achievable with the control of the fixed gate electrode. | 05-21-2015 |
20150179800 | METHOD DEVICE AND OPERATION METHOD OF SAID DEVICE - The present invention relates to a single field effect transistor capacitor-less memory device including a drain region, a source region, an intrinsic channel region between the drain region and the source region forming the single field effect transistor and a base. | 06-25-2015 |
Patent application number | Description | Published |
20110282859 | IDENTIFYING UNIVERSAL RESOURCE LOCATOR REWRITING RULES - A computer-implemented process for identifying universal resource locator rewriting rules may receive input of universal resource locators of an application, to form received universal resource locators, may represent the received universal resource locators in a specialized graph and may apply analysis algorithms and heuristics to properties of the specialized graph. The computer-implemented process may further identify universal resource locator rewriting patterns using the specialized graph to form detected patterns and may generate rewrite rules corresponding to the detected patterns. | 11-17-2011 |
20120185459 | IDENTIFYING UNIVERSAL RESOURCE LOCATOR REWRITING RULES - A computer-implemented process for identifying universal resource locator rewriting rules may receive input of universal resource locators of an application, to form received universal resource locators, may represent the received universal resource locators in a specialized graph and may apply analysis algorithms and heuristics to properties of the specialized graph. The computer-implemented process may further identify universal resource locator rewriting patterns using the specialized graph to form detected patterns and may generate rewrite rules corresponding to the detected patterns. | 07-19-2012 |
20130160117 | IDENTIFYING REQUESTS THAT INVALIDATE USER SESSIONS - An illustrative embodiment of a computer-implemented process for identifying a request invalidating a session excludes all marked logout requests of a Web application, crawls an identified next portion of the Web application and responsive to a determination, in one instance, that the state of the crawl is out of session, logs in to the Web application. The computer-implemented process further selects all crawl requests sent since a last time the crawl was in-session, excluding all marked logout requests and responsive to a determination that requests remain, crawls a selected next unprocessed request. Responsive to a determination, in the next instance, that state of the crawl is out of session and the selected request meets logout request criteria, the computer-implemented process marks the selected request as a logout request. | 06-20-2013 |
20130312102 | VERIFYING APPLICATION SECURITY VULNERABILITIES - Verifying application security vulnerabilities includes receiving a source code to analyze, performing a static analysis using the received source code and generating a vulnerability call trace for the received source code. Responsive to a determination that all static analysis results are not validated, mock objects are generated using the vulnerability call trace and a unit test is created using the generated mock objects. The unit test is executed using the generated mock objects and responsive to a determination that an identified vulnerability was validated; a next static analysis result is selected. Responsive to a determination that all static analysis results are validated, results and computed unit tests are reported. | 11-21-2013 |
20130332444 | IDENTIFYING UNVISITED PORTIONS OF VISITED INFORMATION - Identifying unvisited portions of visited information to visit includes receiving information to crawl, wherein the information is representative of one of web based information and non-web based information, computing a locality sensitive hash (LSH) value for the received information, and identifying a most similar information visited thus far. Identifying unvisited portions of visited information further includes determining whether the LSH of the received information is equivalent to most similar information visited thus far and, responsive to a determination that the LSH of the received information is not equivalent to most similar information visited thus far, identifying a visited portion of the received information using information for most similar information visited thus far and crawling only unvisited portions of the received information. | 12-12-2013 |
20140053089 | IDENTIFYING EQUIVALENT JAVASCRIPT EVENTS - Identifying equivalent JavaScript events includes receiving source code containing two JavaScript events for equivalency analysis, extracting an HTML element containing an event from each JavaScript event and analyzing the extracted HTML elements. Responsive to a determination that the HTML elements are of a same type according to equivalency criteria B, and responsive to a determination that the HTML elements have a same number of attributes according to equivalency criteria C, a determination is made whether JavaScript function calls of each JavaScript event are similar according to equivalency criteria A. Responsive to a determination that the JavaScript function calls are similar according to equivalency criteria A, and responsive to a determination that the other attributes of the HTML elements satisfy equivalency criteria D, the JavaScript events are identified as equivalent. | 02-20-2014 |
20140081945 | SYNCHRONIZING HTTP REQUESTS WITH RESPECTIVE HTML CONTEXT - Synchronizing requests with a respective context includes, responsive to a determination that there are more pages to explore, performing regular crawling operations for a current page, recording a current page in a list of explored pages and extracting links from the current page. Responsive to a determination that there are more links to extract, a next link to analyze is selected to form a selected link and responsive to a determination that there is a new request associated with the selected link, a new request identifier is created and saved as an entry in a hashmap. Responsive to a determination that there is not a new request associated with selected link, a request associated with the selected link is updated with a new link value when the link value differs. | 03-20-2014 |
20140081946 | CRAWLING RICH INTERNET APPLICATIONS - Embodiments relating to a computer-implemented process, an apparatus and a computer program product is provided for crawling rich Internet applications. In one aspect the method includes executing an event in a set of events discovered in a state exploration phase according to a predetermined priority of events in each set of events in the sets of events discovered, wherein the event from a higher priority is exhausted before an event from a lower priority is executed and determining any transitions. Responsive to a determination that there are at least one transition any remaining set of events is executed in a transition exploration phase. In addition the method determines the existence of any new states as a result of executing an event in the set of events and returns to the state exploration phase, responsive to a determination that a new state exists. | 03-20-2014 |
20140082480 | IDENTIFICATION OF SEQUENTIAL BROWSING OPERATIONS - Identifying sequential browsing operations includes receiving session data associated with a plurality of sessions, creating a reduced page for each page in a series of pages associated with a first session in the plurality of sessions, and creating a hash value associated with each reduced page for each page in the series of pages associated with the first session of the plurality of sessions. Responsive to a determination that the hash value of the first session is equivalent to the hash value of the second session, an associated page is identified as an equivalent page and the equivalent pages are merged to create a common sequence without a need to resend requests associated with the session data to a server. | 03-20-2014 |
20140208195 | REPRESENTATION OF AN ELEMENT IN A PAGE VIA AN IDENTIFIER - Embodiments are directed to computing, by an apparatus comprising a processing device, an identifier (ID) for an element in a page using an algorithm responsive to encountering the element a first time, causing, by the apparatus, the ID to be stored in a storage device, encountering, by the apparatus, the element a second time, determining, by the apparatus, that the element is encountered the second time, and responsive to determining that the element is encountered the second time, representing, by the apparatus, the element by the ID at the time of the second encounter by retrieving the ID from the storage device. | 07-24-2014 |
20140208198 | REPRESENTATION OF AN ELEMENT IN A PAGE VIA AN IDENTIFIER - Embodiments are directed to computing, by an apparatus comprising a processing device, an identifier (ID) for an element in a page using an algorithm responsive to encountering the element a first time, causing, by the apparatus, the ID to be stored in a storage device, encountering, by the apparatus, the element a second time, determining, by the apparatus, that the element is encountered the second time, and responsive to determining that the element is encountered the second time, representing, by the apparatus, the element by the ID at the time of the second encounter by retrieving the ID from the storage device. | 07-24-2014 |
20150156216 | VERIFYING APPLICATION SECURITY VULNERABILITIES - Verifying application security vulnerabilities includes receiving a source code to analyze, performing a static analysis using the received source code and generating a vulnerability call trace for the received source code. Responsive to a determination that all static analysis results are not validated, mock objects are generated using the vulnerability call trace and a unit test is created using the generated mock objects. The unit test is executed using the generated mock objects and responsive to a determination that an identified vulnerability was validated; a next static analysis result is selected. Responsive to a determination that all static analysis results are validated, results and computed unit tests are reported. | 06-04-2015 |
20150193402 | TRACKING JAVASCRIPT ACTIONS - An embodiment for tracking JavaScript actions in a rich Internet application, receives a document object model (DOM) representative of a particular page of an application at a particular time and analyzes the DOM received to identify each JavaScript action on the particular page for which each JavaScript action identified, a JavaScript action characteristics ID is calculated and stored. Responsive to a determination multiple instances of a same ID exist, collecting a list of JavaScript actions corresponding to each ID corresponding to a multiple JavaScript action and removing from memory JavaScript action entries for the multiple instances of the same ID. A neighbor influence is computed for a member of the list of JavaScript actions remaining and the JavaScript action ID calculated for the member of the list of JavaScript actions remaining is stored. Responsive to a determination there are no more multiple JavaScript actions, return all JavaScript action IDs stored. | 07-09-2015 |
Patent application number | Description | Published |
20120278480 | SYSTEM AND METHOD FOR IDENTIFYING SESSION IDENTIFICATION INFORMATION - A computer-implemented process, computer program product, and apparatus for identifying session identification information. A recording is initiated and an operation sequence of interest is performed while recording and the recording ceases. Responsive to a determination that the operation sequence of interest was successful, information from the operation sequence of interest is saved as recorded information and responsive to a determination that a same operation sequence of interest was recorded, the recorded information from each operation sequence of interest is compared. Differences in the recorded information are identified to form identified differences and a session identifier is constructed using the identified differences. | 11-01-2012 |
20130091152 | IDENTIFYING UNKNOWN PARAMETER AND NAME VALUE PAIRS - Identifying parameter and name/value pair separators within two or more strings of data. The identifying is performed by selecting at least one name/value pair separator candidate from the two or more strings of data, and filtering the at least one name/value pair separator candidate using one or more rules, thereby removing any of the name/value pair separator candidates that do not conform to any of the one or more rules. The identifying additionally includes selecting at least one parameter separator candidate from the two or more strings of data, and filtering the at least one parameter separator candidate using one or more rules, thereby removing any of the at least one parameter separator candidates that do not conform to any of the one or more rules. The result is a set of tuples that includes a name/value separator candidate, and a parameter separator candidate. | 04-11-2013 |
20130346387 | IDENTIFYING EQUIVALENT LINKS ON A PAGE - A computer-implemented process for identifying equivalent links on a page responsive to a determination that the crawler has not visited all required universal resource locators, locates a next URL to be crawled to form a current URL and processes the current URL to identify equivalent URLs. Responsive to a determination that the crawler has not visited the current URL, determine whether necessary to crawl all identified equivalent URLs and responsive to a determination that it is necessary to crawl all identified equivalent URLs, adding all equivalent URLs to a list of URLs to be crawled. | 12-26-2013 |
20140379736 | IDENTIFYING UNKNOWN PARAMETER AND NAME VALUE PAIRS - A mechanism is provided for identifying parameter and name/value pair separators within two or more strings of data. The identifying is performed by selecting at least one name/value pair separator candidate from the two or more strings of data, and filtering the at least one name/value pair separator candidate using one or more rules, thereby removing any of the name/value pair separator candidates that do not conform to any of the one or more rules. The identifying additionally includes selecting at least one parameter separator candidate from the two or more strings of data, and filtering the at least one parameter separator candidate using one or more rules, thereby removing any of the at least one parameter separator candidates that do not conform to any of the one or more rules. The result is a set of tuples that includes a name/value separator candidate, and a parameter separator candidate. | 12-25-2014 |
20150193621 | SECURITY SCAN USING ENTITY HISTORY - An illustrative embodiment of a computer-implemented process for security scanning using entity history responsive to a determination that a set of vulnerabilities exist for a selected security entity, tests the selected entity using a vulnerability set selected from an issues history and responsive to a determination that all vulnerabilities are not found, determining whether more vulnerabilities sets exist. Responsive to a determination that more vulnerabilities sets exist, obtains a next set of vulnerabilities and tests the selected security entity using another vulnerability set selected from the issues history. Responsive to a determination that a set of vulnerabilities does not exist for the selected security entity, performs a full scan of the selected security entity and responsive to a determination that security issues are identified, records the security issues identified in the issues history. | 07-09-2015 |