Patent application number | Description | Published |
20100199422 | Sliding back for a wheelchair with commode that can be converted into bed - A wheel chair with commode for a patient that coverts in to a bed is disclosed. The wheel chair includes an outer rectangular main frame standing on at least four wheeled legs, first, second, third, and four outer frame being connected to each other by pivots or hinges, a pair of additional wheels being connected to the third frame by means of links that prevent the chair or bed from tilting backward due to weight of first and second frames and the patient, a means for making movements of the first, second, third and fourth frames to convert chair into bed or vice-versa, inner frames being slidably fitted inside the outer frames, and a commode pan or pot being fitted under the main frame, wherein a cushion is provided between said main frame and commode pan or pot. | 08-12-2010 |
20100199429 | Sliding back for fouler bed - A bed and chair with commode for a patient is disclosed. The bed and chair with commode includes a rectangular main frame, which stands on at least four legs, four frames fitted on the main frame, patient's body over it when patient is lifted up off the bed, side guards being fixed on both sides of main frame for supporting the straps or nets over it and for avoiding the patient from falling down a lifting means for lifting the body of patient over the straps or nets, and a commode pan or pot being fitted under the middle frame with the help of hinge and linkage arrangement. The sliding back of the bed moves upwards and downwards by a mechanism when the back support frame is raised to chair position or lowered to bed position. | 08-12-2010 |
Patent application number | Description | Published |
20120041923 | METHOD AND SYSTEM FOR EFFICIENTLY READING A PARTITIONED DIRECTORY INCIDENT TO A SERIALIZED PROCESS - A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory. | 02-16-2012 |
20120042062 | METHOD AND SYSTEM FOR PARTITIONING DIRECTORIES - A method of partitioning directory. Accesses, e.g., shared/exclusive, and/or waiting requests, e.g., shared/exclusive, to access one or more files with a directory are monitored, e.g., incrementing/decrementing respective counters. The waiting requests are queued to be granted at a later time. The directory is determined to be primed for partitioning if a number of waiting requests to access the directory is greater than a threshold value of a plurality of heuristics and optionally further based on satisfying the condition for at least a programmable time threshold period. A trigger signal is automatically generated if the directory is primed for partitioning. The trigger signal causes a file system to partition the directory. It is appreciated that the plurality of heuristics is user programmable. | 02-16-2012 |
20120042063 | METHOD AND SYSTEM FOR LINK COUNT UPDATE AND SYNCHRONIZATION IN A PARTITIONED DIRECTORY - A method of updating a link count in a partitioned directory shared by a plurality of computers within a cluster. The partitioned directory is traversed once by a first computer to obtain a link count. The link count is stored in the first computer and broadcast to a cluster of computers. A total number of allocated links is less than a maximum limit on link count minus the link count. A respective number of links is allocated to each computer within the cluster. Delta values of each computer are updated in real-time as subdirectories are created/erased. A delta value associated with each of the plurality of computers is received. A delta value represents a net number of links created or removed by each computer. The link count is updated based on the previous link count and further based on each of the delta values and further based a delta value associated with the first computer. The updated link count is stored by the first computer and broadcast to the plurality of computers. | 02-16-2012 |
20120109921 | INODE SYSTEMS AND METHODS - Systems and methods for inode use are presented. In one embodiment; an inode reuse method includes: receiving an indication of an operation that involves access to file related information; assigning an inode to the access; identifying one of a plurality of inode reuse scenarios for the inode; and making the inode available for reuse in accordance with the one of the plurality of inode reuse scenarios. In one embodiment, the one of the plurality of inode reuse scenarios is a relatively expedited reuse scenario. In one exemplary implementation, the relatively expedited inode reuse scenario is utilized if the inode is not required for further processing associated with the operation. The inode can be reused for another immediately subsequent operation. In one embodiment, a first one of the plurality of inode reuse scenarios includes placing the inode at a head queue position of a use queue and a second one of the plurality of inode reuse scenarios includes placing the inode in a tail queue position of the use queue. Association of the inode to the inode reuse scenario can be tracked. The tracking can include flagging the inode for relatively expedited reuse. | 05-03-2012 |
20120259820 | METHOD AND SYSTEM FOR RESTARTING FILE LOCK SERVICES AT AN ADOPTIVE NODE DURING A NETWORK FILESYSTEM SERVER MIGRATION OR FAILOVER - A method for file lock recovery in a distributed computer system. The method includes executing a distributed computer system having a plurality of nodes comprising a cluster, and initiating a network file system server fail over from one node of the cluster to an adoptive node of the cluster. File lock services are then stopped at the adoptive node. File lock services are subsequently restarted at the adoptive node, wherein the restart causes the adoptive node to commence a grace period for other network file system clients to connect to the adoptive node and reclaim file locks. After restarting file lock services, a cluster file system is updated on the adoptive node with process identifiers, and file lock services are resumed at the adoptive node. The cluster file system can be simultaneously exposing the file lock services to other clients as well, like CIFS, etc. | 10-11-2012 |
Patent application number | Description | Published |
20110282917 | SYSTEM AND METHOD FOR EFFICIENT RESOURCE MANAGEMENT - Embodiments of the present invention are directed to a method and system for managing resources. The method includes receiving a request, within an electronic system, which corresponds to an object of a file system and accessing a local data structure. The data structure comprises information corresponding to a plurality of inode numbers. The method further includes performing the request and updating the local data structure based on the request. The updating of the local data structure is independent of a plurality of data structures of a cluster of servers. | 11-17-2011 |
20120259819 | METHOD AND SYSTEM FOR PERFORMING A CLEAN FILE LOCK RECOVERY DURING A NETWORK FILESYSTEM SERVER MIGRATION OR FAILOVER - A method for file lock recovery in a distributed computer system. The method includes executing a distributed computer system having a plurality of nodes comprising a cluster, and initiating a network file system server migration from one node of the cluster to a different node of the cluster. A migration count is incremented, wherein the migration count is stored at each of the nodes comprising the cluster. File lock services are paused at each of the nodes comprising the cluster. The network file system server migration is completed at the different node of the cluster. The migration count is then decremented in response to the completion. File lock services are then resumed at each of the nodes comprising cluster. | 10-11-2012 |
20130246362 | METHOD AND SYSTEM FOR IMPLEMENTING FAST INCREMENTAL BACKUPS - A method for fast incremental replication of a file system. The method includes, at a data storage level, tracking file system status for a plurality of files by using a data structure inside respective inodes for the plurality of files, and at a file system level, tracking file system status for a plurality of files by using a file system mask structure. For all files present in a backup, a catalogue of the file path name and inode number is maintained on a source file system. During incremental backup, a source file system data structure enumerating a plurality of modified inodes is consulted. For inodes that have not been marked as removed or created, the file system mask structure that tracks modified portions is consulted to obtain a file incremental change and inodes. The method further includes performing incremental backup using the inodes that have been modified and appended. | 09-19-2013 |
Patent application number | Description | Published |
20120117035 | FILE SYSTEM CONSISTENCY CHECK ON PART OF A FILE SYSTEM - A file system that includes multiple logical devices can be subdivided into multiple containers. The containers each include respective non-overlapping sets of the logical devices. An amount of memory allocated to a container is dynamic. A set of the containers can be selected for a file system consistency check. The file system consistency check is performed on only the set of the containers instead of on the entire file system. | 05-10-2012 |
20120271870 | METHOD AND SYSTEM FOR RECLAIMING STORAGE ON A SHARED STORAGE DEVICE OR INDEPENDENT OF THE MOUNT STATE OF A FILE SYSTEM - A method for storage reclamation in a shared storage device. The method includes executing a distributed computer system having a plurality of file systems accessing storage on a shared storage device, and initiating a reclamation operation by using a reclamation agent that accesses the shared storage device. The method further includes reading the file system data structure that represent unallocated storage blocks of one of the plurality of file systems that will undergo a reclamation operation. A plurality of I/O resources that are used to provide I/O to the unallocated storage blocks are then interrupted. Storage from the unallocated storage blocks is then reclaimed, and normal operation of the I/O resources that are used to provide I/O to the unallocated storage blocks is resumed. | 10-25-2012 |
20130024428 | METHOD AND SYSTEM FOR A FAST FULL STYLE SYSTEM CHECK USING MULTITHREADED READ AHEAD - A method for file system checking in a storage device. The method includes executing a computer system having a plurality microprocessor cores, initiating a file system check operation by using a file system check agent that execute on the computer system and accesses a storage device, and validating a plurality of meta-data structures of the file system. The method further includes dividing and allocating the metadata structures among a plurality of worker threads. For each worker thread, data corresponding to the metadata structures is processed using a read ahead operation. file system check is processed to completion, wherein the read ahead operation feeds data corresponding to the metadata structures to each of the plurality of worker threads in parallel. | 01-24-2013 |
20130024486 | METHOD AND SYSTEM FOR IMPLEMENTING HIGH AVAILABILITY STORAGE ON THINLY PROVISIONED ARRAYS - A method for storage allocation and reclamation in a storage device. The method includes executing a distributed computer system having a plurality of file systems accessing storage on a shared storage device, creating a physical storage allocation state map that indicates whether a plurality of data blocks comprising a range of data is allocated or unallocated, and consulting a free extent state map to identify free data blocks of the shared storage device. An allocation operation is performed causing the shared storage device to allocate storage a requested range of allocation. The physical storage allocation state map is updated in accordance with the requested range of allocation. Upon a subsequent reclamation process, the physical storage allocation state map is accessed to identify free previously allocated data blocks. Reclamation processing a subsequent performed on the identified free previously allocated data blocks. | 01-24-2013 |
Patent application number | Description | Published |
20120260234 | TESTING SYSTEM - The present subject matter relates a testing system for an application. The system includes a test data generation module to generate test data for a program code. The test data generation module in turn includes a relational expression creation module that determines a relational expression corresponding to a set of parameters of the program code based on a rule indicating a format of a valid test data for the parameters. A boundary recognition module identifies a set of boundary values of the parameters based on the relational expression. Further, a solver module then generates valid test data and invalid test data for the parameters based on the boundary values. | 10-11-2012 |
20120330900 | DATABASE SAMPLING - The present subject matter relates to systems and methods for database sampling. The method comprises identifying at least one query table and one or more associated tables amongst a plurality of tables in a production database, based on filtering criteria. Further, the method comprises generating a key value list for the at least one query table and each of the one or more associated tables based on an order indicated by an order list. Based on the generated key value list, the sample data is extracted in a reverse order indicated by the order list, from the at least one query table and each of the one or more associated tables. | 12-27-2012 |
20130060820 | Data Masking Setup - Methods and systems for masking data columns in a database are described herein. The method describes obtaining a masking template. Further the method describes associating the masking template with at least one rule and selecting columns based on the at least one rule. The method further describes identifying at least one column from the selected columns for applying masking setup and initiating masking setup on the at least one column based on the masking template. | 03-07-2013 |
20130254113 | ADMINISTERING PAY PER USE SOFTWARE LICENSING - A method and a system for administering pay-per-use (PPU) licensing of software applications are disclosed. The system comprises a processor and a memory. The memory comprises an administrative module configured to generate a license file based upon a request sent by a user. The license file is used by the user for accessing a software application. The administrative module is further configured to receive a log file from the user. The log file comprises a track of at least one of a number of usages of the software application and a time period of the software application. The memory further includes an assessment module configured to determine a validity of the license file based upon the log file. | 09-26-2013 |
Patent application number | Description | Published |
20140071137 | IMAGE ENHANCEMENT APPARATUS - A method comprising: analysing at least two images to determine at least one object mutual to the at least two images, the object having a periodicity of motion; generating an animated image based on the at least two images, wherein the at least one object is animated; determining at least one audio signal associated with the at least one object; and combining the at least one audio signal with the animated image to generate an audio enabled animated image. | 03-13-2014 |
20140078398 | IMAGE ENHANCEMENT APPARATUS AND METHOD - A method comprising: generating at least two frames from a video, wherein the at least two frames are configured to provide an animated image; determining at least one object based on the at least two frames, the at least one object having a periodicity of motion with respect to the at least two frames; determining at least one audio signal component for associating with the animated image based on a signal characteristic of at least one audio signal; and combining the at least one object and the at least one audio signal component wherein the animated image is substantially synchronised with the at least one signal component based on the signal characteristic. | 03-20-2014 |
20140177845 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR CATEGORICAL SPATIAL ANALYSIS-SYNTHESIS ON SPECTRUM OF MULTICHANNEL AUDIO SIGNALS - A method, apparatus and computer program product are therefore provided according to an example embodiment of the present invention in order to perform categorical analysis and synthesis of a multichannel signal to synthesize binaural signals and extract, separate, and manipulate components within the audio scene of the multichannel signal that were captured through multichannel audio means. In the context of a method, a multichannel signal is received. The method may include computing the spectrum for the multichannel signal, determining tonality of bands within the spectrum, and generating a band structure for the spectrum. The method may also include performing spatial analysis of the bands, performing source filtering using the bands, performing synthesis on the filtered band components, and generating an output signal. A corresponding apparatus and a computer program product are also provided. | 06-26-2014 |
20140328500 | METHOD AND AN APPARATUS FOR AUTOMATIC VOLUME LEVELING OF AUDIO SIGNALS - There is provided a method for audio signal adjustment comprising: determining a loudness estimate for at least one frame of an audio signal; determining a level value for the at least one frame based on the loudness estimate; and adjusting the audio signal based on the level value. An apparatus for carrying out the method is also provided. | 11-06-2014 |
20150296319 | SPATIAL AUDIO ENHANCEMENT APPARATUS - An apparatus comprising: a depth map estimator configured to determine, associated with at least one visual image, a depth map comprising at least one distance value in a direction relative to an apparatus; a direction of arrival estimator configured to determine, using at least two microphones, at least one audio source signal with a direction; and an audio signal processor configured to process the at least one audio source signal based on the at least one distance value in the direction of the at least one audio source signal. | 10-15-2015 |
20150365167 | Method and Apparatus for Optical Communication - A method, apparatus and computer program for controlling a digital microlens array camera to obtain a sequence of images each including microimages captured by respective microlenses; for determining in each of the images a set of diffused microimages in which an optical communication light source is diffused over each of the microimages of the set; and for decoding optically communicated information from the set. | 12-17-2015 |
Patent application number | Description | Published |
20090281835 | Medical prescription scheduler for reminding and compliance - A medical prescription scheduler for reminding and compliance is basically envisioned and devised to simplify the programming of a reminder device, and comprises of a single device or a pair of complimentary devices. A scheduler device is meant for achieving a speedy and facilitated scheduling of a medical prescription, formatting the scheduled prescription based on format specifications compliant with the prescription reminder application program of a recipient reminder device, and transmitting the formatted scheduled medical prescription to the reminder device. When unpacked in the receiving reminder device, said format is intended for realizing the programming of the reminder device. And the programmed reminder device is capable of audio-visually reminding each dose of each medication of said prescription till compliance. Preferably, the scheduler and reminder devices are modified commonly used electronic devices, wherein either the existing hardware and/or software is suitably adapted or the requisite hardware and/or software is incorporated so as to accomplish the scheduling and reminding function. While inputting a prescription, the computing means of a scheduler device assists a prescriber by performing relational analysis and by displaying cautionary or advisory information. In addition to facilitating a doctor in scheduling a medical prescription, a means for promoting pharmaceutical products and generating revenues is included. | 11-12-2009 |
20110000515 | Solar central receiver system employing common positioning mechanism for heliostats - A solar central receiver system employing common positioning mechanism for heliostats relates to a system of concentrating and harvesting solar energy. The heliostats of said system are positioned like facets of a Fresnel type of reflector. The heliostats are placed in arrays, wherein each array has a common positioning mechanism. The common positioning mechanism synchronously maneuvers the arrays of heliostats in altitudinal and/or azimuthal axis for tracking an apparent movement of the sun. The common positioning mechanism is employed for synchronously orienting said heliostats with respect to a stationary object and the sun such that incident solar radiation upon said heliostats is focused upon said stationary object from dawn to dusk. Subsequent to each said orientation of said heliostats, collective disposition of said heliostats always forms an arrangement that is capable of reflecting and thereby focusing incident solar radiation upon said stationary object. | 01-06-2011 |
20140251315 | Method and apparatus for orienting arrays of mechanically linked heliostats for focusing the incident sunlight on a stationary object - The present invention is a method and apparatus for periodic orientation of arrays of mechanically linked heliostats positioned on rotatable shafts such that incident sunlight is focused on a stationary object. In each altitudinal orientation a minuscule predefined push is given by an actuator and the time interval between each altitudinal orientation is 2×(T | 09-11-2014 |
Patent application number | Description | Published |
20100069263 | SEQUENCE TAG DIRECTED SUBASSEMBLY OF SHORT SEQUENCING READS INTO LONG SEQUENCING READS - The invention provides compositions and methods for preparing DNA sequencing libraries. In particular, the method relates to preparing DNA sequencing libraries from kilobase scale nucleic acids. The invention also provides methods for assembling short read sequencing data into longer contiguous sequences. The method is useful for various applications in genomics, including genome assembly, full length cDNA sequencing, metagenomics, and the analysis of repetitive sequences of assembled genomes. | 03-18-2010 |
20130137588 | SEQUENCE TAG DIRECTED SUBASSEMBLY OF SHORT SEQUENCING READS INTO LONG SEQUENCING READS - The invention provides compositions and methods for preparing DNA sequencing libraries. In particular, the method relates to preparing DNA sequencing libraries from kilobase scale nucleic acids. The invention also provides methods for assembling short read sequencing data into longer contiguous sequences. The method is useful for various applications in genomics, including genome assembly, full length cDNA sequencing, metagenomics, and the analysis of repetitive sequences of assembled genomes. | 05-30-2013 |
20130137605 | SEQUENCE TAG DIRECTED SUBASSEMBLY OF SHORT SEQUENCING READS INTO LONG SEQUENCING READS - The invention provides methods for preparing DNA sequencing libraries by assembling short read sequencing data into longer contiguous sequences for genome assembly, full length cDNA sequencing, metagenomics, and the analysis of repetitive sequences of assembled genomes. | 05-30-2013 |