text:
Patent US20060241912 - Data management system and method - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA management system manages data collected at a selected frequency and data collected at a lower frequency. If the lower frequency data is abnormal, it is deleted. Deletion of the data collected at the specified frequency is dependent upon the deletion of the data collected less frequently....http://www.google.com/patents/US20060241912?utm_source=gb-gplus-sharePatent US20060241912 - Data management system and methodAdvanced Patent SearchPublication numberUS20060241912 A1Publication typeApplicationApplication numberUS 11/448,274Publication dateOct 26, 2006Filing dateJun 6, 2006Priority dateSep 15, 2004Also published asUS7079980, US7263466, US20060074593Publication number11448274, 448274, US 2006/0241912 A1, US 2006/241912 A1, US 20060241912 A1, US 20060241912A1, US 2006241912 A1, US 2006241912A1, US-A1-20060241912, US-A1-2006241912, US2006/0241912A1, US2006/241912A1, US20060241912 A1, US20060241912A1, US2006241912 A1, US2006241912A1InventorsMasaki MuraokaOriginal AssigneeHitachi, Ltd.Export CitationBiBTeX, EndNote, RefManClassifications (7), Legal Events (1) External Links: USPTO, USPTO Assignment, EspacenetData management system and methodUS 20060241912 A1Abstract A management system manages data collected at a selected frequency and data collected at a lower frequency. If the lower frequency data is abnormal, it is deleted. Deletion of the data collected at the specified frequency is dependent upon the deletion of the data collected less frequently. Images(8) Claims(8)
1. A data management system comprising: a storage system having a plurality of storage areas, wherein first data with a first storage period and second data with a second storage period corresponding to the first data storage period are stored into a first storage area; and a computer, which when updating the first storage period, updates the second storage period with the updated first storage period. 2. The data management system according to claim 1 wherein the computer migrates the first data and the second data from the first storage area to the second storage area when the first storage period exceeds a predetermined storage period. 3. The data management system according to claim 2 wherein performance of the first storage area is different from performance of the second storage area. 4. The data management system according to claim 3 wherein the performance of the second storage area is lower than that of the first storage area. 5. The data management system according to claim 2 wherein the computer deletes one of the first and the second data when exceeding one of the first storage period and the second storage period. 6. A data management method comprising: storing first data with a first storage period and second data with a second storage period corresponding to the storage period of the first data; and updating the first storage period to thereby cause updating of the second storage period. 7. The data management method as in claim 6 further comprising migrating the first data and the second data from the first storage area to the second storage area when the first storage period exceeds a predetermined period. 8. The data management method as in claim 6 further comprising deleting one of the first data and the second data when one of the first storage period and the second storage period is exceeded.
CROSS-REFERENCE TO RELATED APPLICATION(S) This is a continuation of U.S. patent application Ser. No. 10/982,076, filed Nov. 5, 2004, which application claimed priority from Japan Patent Application No. 2004-267807, filed Sep. 15, 2004, the entire disclosure of which is incorporated herein by reference.
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer technology for managing data. 2. Description of the Related Art Computer technology for managing data is known. As managed data, data that represents the results of monitoring by the performance monitoring device disclosed by Japanese Patent Application Laid Open No. 2002-99448 or data that represents the results of monitoring various states of computer machines, and so forth, may be considered, for example. For example, cases may include one where a monitoring device that monitors a state of a certain kind of a computer machine (the CPU usage rate, for example) generates a record that represents the results of this monitoring (�monitoring result record� hereinbelow) at regular intervals and manages the monitoring result records thus generated. Further, there can also be cases where a monitoring device generates a summary record that represents a summary of a plurality of monitoring results represented by a plurality of monitoring result records at regular intervals and manages the summary records thus generated together with the plurality of monitoring result records that form the basis of these summary records. In this case, in order to prevent the managed record group from becoming huge, a method according to which the monitoring device manages the monitoring result records that are generated in each first time unit (every minute, for example) in a first period and deletes monitoring result records if the first period is exceeded, and manages summary records that are generated in each second time unit (every hour, for example) that is greater than the first time unit in a second period that is longer than the first period and deletes summary records if the second period is exceeded may be considered. However, with this method, in cases where the monitoring device detects a summary record representing a unique monitoring result and there is the desire to acquire a plurality of monitoring result records that form the basis of the summary record, for example, sometimes at least one of the plurality of monitoring result records that is to be acquired has already been deleted. When the management period of the monitoring result record is extended, for example, in order to avoid this problem, there is then a large volume of record groups to be managed. This problem is not limited to a case where a plurality of monitoring result records and summary records are managed and can arise in a case where a data group, which includes a plurality of lower level data and upper level data for each of this plurality of lower level data, is managed. BRIEF SUMMARY OF THE INVENTION Therefore, an object of the present invention is to manage efficiently a data group that includes a plurality of lower level data and upper level data for each of the plurality of lower level data. More specifically, for example, an object of the present invention is to manage efficiently a record group that includes a plurality of monitoring result records and summary records that are generated on the basis of the plurality of monitoring result records. Further objects will become evident from the following description. A data management system according to a first aspect of the present invention is capable of accessing a storage device and comprises one or more processors, and a storage region for storing one or more computer programs that allow the one or more processors to operate as a result of being read by the one or more processors. The one or more processors, which read the one or more computer programs from the storage region, perform processes (A) to (D) below: (A) processing to acquire, at a first frequency, monitoring result data that represents monitoring results for a monitoring target, generate a monitoring result record that includes the monitoring result data thus acquired and first deletion condition data that represents a first deletion condition for the monitoring result data, and store the generated monitoring result record in the storage device; (B) processing to generate monitoring result summary data that represents a summary of a plurality of monitoring results represented by a plurality of the monitoring result record stored in the storage device at a second frequency that is lower than the first frequency, determine a second deletion condition for normal state when the content of the summary of the plurality of monitoring results represents normal content and determine a second deletion condition for abnormal state when the summary content represents abnormal content, generate a summary record that includes second deletion condition data that represents the second deletion condition thus determined and the monitoring result summary data thus generated, and then store the generated summary record in the storage device; (C) processing to specify a summary record including second deletion condition data representing the second deletion condition for abnormal state from the storage device and specify a plurality of the monitoring result records that form the basis of the generation of the specified summary record; and (D) processing to update the first deletion condition that is represented by the first deletion condition data of each of the plurality of monitoring result records thus specified to a second deletion condition for abnormal state that is represented by the second deletion condition data included in the specified summary record. Here, the �monitoring target� is a target that is monitored by the data management system or another system, such as the CPU usage rate or power supply state of a computer machine, for example. The monitoring target may be either inside or outside the data management system. The �monitoring result data� may be generated by the one or more processors or may be received from a system outside the data management system. The �frequency� is the number of times that data is acquired within a certain period, for example. More specifically, when the data is acquired at regular intervals, for example, �frequency� may mean �time unit�. The data management system can be constituted by a server or storage device, or by a combination thereof, for example. Processes (A) to (D) above can be performed singly by the server or storage device or can be shared by the server and storage device. The storage device may also be provided in the server. The storage device may be a physical storage device or a logical storage device. In addition, the data management processing system may delete a monitoring result record from the storage device in accordance with deletion condition data that is contained in the monitoring result record. This process can also be performed singly by the server or storage device, for example. A data management system according to a second aspect of the present invention can comprise a lower level data acquisition/storage portion, an upper level data acquisition/storage portion, a first deletion condition setting portion, and a second deletion condition setting portion. The lower level data acquisition/storage portion acquires lower level data at a first frequency and stores the acquired lower level data in the storage device. The upper level data acquisition/storage portion acquires upper level data that is data above each of a plurality of the lower level data stored in the storage device at a second frequency that is lower than the first frequency and stores the upper level data thus acquired in the storage device. The first deletion condition setting portion sets, when the upper level data represents an abnormal state, a deletion condition from the storage device of the upper level data representing an abnormal state. The second deletion condition setting portion sets a deletion condition for each of a plurality of lower level data corresponding with the upper level data representing an abnormal state as a deletion condition that differs from the deletion condition of the lower level data representing a normal state, on the basis of the set deletion condition of the upper level data representing an abnormal state. In cases where the deletion condition of the upper level data representing an abnormal state is set, for example, the data management system may determine the method for updating the deletion conditions of the plurality of lower level data corresponding with the upper level data on the basis of a pre-established rule for setting a deletion condition. Update methods include, for example, a method that applies a deletion condition that is the same as the deletion condition of the upper level data to the lower level data or a method that calculates the deletion condition of the upper level data representing an abnormal state as another deletion condition by means of a predetermined method and applies this other deletion condition. In a first embodiment of the data management system, the deletion condition includes a deletion time at which data is deleted from the storage device. The first deletion condition setting portion sets, as the deletion time of upper level data representing an abnormal state, a deletion time that is later than the deletion time of upper level data representing a normal state. The second deletion condition setting portion sets the deletion times of each of the plurality of lower level data as deletion times that are later than the deletion times of the lower level data representing a normal state. Further, as a method for setting the deletion time of lower level data to a later deletion time, for example, a method that sets and corrects the lower-level data deletion time itself to a later deletion time or adds a deletion-condition extension period without changing the content of the original deletion time may be considered. Further, the �deletion time� may be expressed as a storage period or as the time at which the storage period ends, for example. In a second embodiment of the data management system, according to the first embodiment, the lower level data acquisition/storage portion generates a lower level record that includes second deletion time data representing a second deletion time of the acquired lower level data and the acquired lower level data and stores the lower level record thus generated in the storage device. The first deletion time setting portion sets a first deletion time for normal state that represents the deletion time of the upper level data representing a normal state and sets a first deletion time for abnormal state that represents the deletion time of the upper level data representing an abnormal state. The upper level data acquisition/storage portion generates an upper level record that includes first deletion time data that represents the set first deletion time and the acquired upper level data and stores the generated upper level record in the storage device. When the first deletion time data in the upper level record represents the first deletion time for abnormal state, the second deletion time setting portion changes the second deletion time represented by the second deletion time data of each of the plurality of lower level records corresponding with the upper level record representing an abnormal state to a later deletion time on the basis of the first deletion time for abnormal state. In a third embodiment of the data management system, according to the second embodiment, in certain lower level data among a plurality of lower level data corresponding with the upper level record representing an abnormal state, the second deletion time setting portion keeps the second deletion time as is when the second deletion time represented by the second deletion time data is later than the first deletion time for abnormal state. In a fourth embodiment of the data management system, the data management system is also able to access another storage device and further comprises a data deletion/shift portion that deletes or shifts data. The data deletion/shift portion deletes the upper level data representing a normal state and each of the plurality of lower level data corresponding with the upper level data from the storage device when the deletion conditions of the data are matched, and shifts at least one of the upper level data representing an abnormal state and the plurality of lower level data corresponding with the upper level data from the storage device to the other storage device when the deletion conditions of the data are matched. According to this embodiment, for example, the data processing system may comprise the storage device or another storage device may be provided outside the data processing system. Further, the storage device may be a high-performance or high-reliability device, while the other storage device may be a lower-performance or lower-reliability device. A data management method according to a third aspect of the present invention comprises the steps of acquiring lower level data at a first frequency and storing the acquired lower level data in a storage device; acquiring upper level data that is data above each of a plurality of the lower level data stored in the storage device at a second frequency that is lower than the first frequency and storing the upper level data thus acquired in the storage device; setting, when the upper level data represents an abnormal state, a deletion condition from the storage device of the upper level data representing an abnormal state; and setting a deletion condition for each of a plurality of lower level data corresponding with the upper level data representing an abnormal state as a deletion condition that differs from the deletion condition of the lower level data representing a normal state, on the basis of the set deletion condition of the upper level data representing an abnormal state. All the main constituents of these steps can be computers. A computer program according to a fourth aspect of the present invention is a computer-readable computer program that allows a computer to execute the steps of acquiring lower level data at a first frequency and storing the acquired lower level data in a storage device; acquiring upper level data that is data above each of a plurality of the lower level data stored in the storage device at a second frequency that is lower than the first frequency and storing the upper level data thus acquired in the storage device; setting, when the upper level data represents an abnormal state, a deletion condition from the storage device of the upper level data representing an abnormal state; and setting a deletion condition for each of a plurality of lower level data corresponding with the upper level data representing an abnormal state as a deletion condition that differs from the deletion condition of the lower level data representing a normal state, on the basis of the set deletion condition of the upper level data representing an abnormal state. This computer program may be recorded on a recording medium (a CD-ROM, for example) and installed on a computer from the recording medium, or may be installed on the computer via a communication network. According to the present invention, a data group, which includes a plurality of lower level data and upper level data for each of the plurality of lower level data, can be efficiently managed. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 shows a constitutional example of the data management system according to the first embodiment of the present invention; FIG. 2 schematically shows the principal parts according to this embodiment in the data management system shown in FIG. 1; FIG. 3A shows a constitutional example of performance information; FIG. 3B shows a constitutional example of a performance record; FIG. 4A shows an outline of a method for generating a deletion condition; FIG. 4B shows an outline of a method for generating a summary record; FIG. 5 shows an example of the flow of processing that is executed by a server program; FIGS. 6A and 6B show an example of an aspect in which a deletion condition for an upper level record representing an abnormal state is reflected in a lower level record; FIG. 6C represents a modified example thereof; and FIG. 7 shows a modified example of the server program according to an embodiment of the present invention as well as an example of the flow of processing that is executed by the server program.
DETAILED DESCRIPTION OF THE INVENTION An embodiment of the present invention will be described hereinbelow with reference to the drawings. FIG. 1 shows a constitutional example of a data management system according to an embodiment of the present invention. A client machine 1, a performance monitoring server 2, and a storage system 43 are connected to a first communication network such as a LAN (Local Area Network) 27. The client machine 1, performance monitoring server 2, and storage system 43 are also connected to a second communication network such as a SAN (Storage Area Network) 41. The client machine I is an information processing device such as a personal computer, for example. The client machine 1 comprises a client processor (CPU, for example) 73 and a client memory portion (at least one of a memory and hard disk, for example) 72. A client program 11 is stored in the client memory portion 72. The information processing device functions as the client machine 1 as a result of the client program 11 that is stored in the client memory portion 72 being read to the client processor 73. The client program 11 may be application software, which operates on an operating system (OS) (not shown) of the client machine 1 or may be integrated into the OS. The performance monitoring server 2 is one information processing device that comprises a server memory portion 4 and a server processor 74 (a CPU, for example), for example. The server memory portion 4 comprises at least one of a memory (RAM, ROM, or the like, for example) and a hard disk. A server program 12, for example, is recorded on the server memory portion 4. The server program 12 is at least one program module that comprises a performance monitoring portion 32, a performance data acquisition portion 35, and a performance data storage portion 90, for example. The information processing device functions as a performance monitoring server 2 as a result of a server program 33 stored in the server memory portion 4 being read by the server processor 74. For example, the performance monitoring server 2 is able to monitor the fluctuating performance of a certain device (the CPU usage rate, for example) and generate data that represents this monitored state (called �performance data� hereinbelow). Performance data can be data that represents the performance of each OS, application program or database, for example. More specifically, for example, the performance data may be at least one of the CPU usage rate of the OS, the number of running processes of the OS, the database usage rate, SQL information, parameter information, application roll area usage rate and the response time. At least one of the monitored OS, application program and database may exist in the performance monitoring server 2 or may exist in a device outside the server 2 (in client machine 1 or storage system 43, for example). The performance monitoring server 2 may generate performance data on the basis of the performance monitoring results or may receive performance data via the LAN 27 or the like from a monitoring target that exists outside the server 2. The storage system 43 is a RAID (Redundant Array of Independent Inexpensive Disks) system that is constituted with a plurality of disk-type storage devices (hard disk drives, for example) 77 arranged in the form of an array, for example. The storage system 43 comprises a plurality of logical volumes provided in one or more disk-type storage devices 77 and a storage control device 45 that controls communications between at least one of the client machine 1 and the performance monitoring server 2 (generically termed �upper level device� hereinbelow) and the plurality of logical volumes. The plurality of logical volumes includes, for example, a logical volume (performance information VOL) 47 in which performance information 10 containing one or more performance data items are stored and a logical volume (definition VOL) 49 in which data management definition information 42 is stored. Further, at least one of these logical volumes 47 and 49 may be provided in a server memory portion 35. That is, performance data acquired by the performance monitoring server 2 may be saved in the server memory portion 4 of the performance monitoring server 2 in place of or in addition to being saved in the disk-type storage device 77 of the storage system 43. The storage control device 45 comprises, for example, one or more processors (MPU (Micro Processing Units) or CPU (Central Processing Unit), for example) 95 that execute processing and so forth corresponding with a variety of commands from an upper level device, a memory 94 that comprises a buffer region or the like in which data received from the upper level device is temporarily stored, and a disk interface device (disk I/F hereinbelow) 93 that is an interface for the disk-type storage device 77. In response to an I/O request (a read command or write command, for example) from the upper level device, the storage control device 45 is able to write information received from the upper level device to a logical volume and transfer the information in the logical volume to the upper level device. FIG. 2 provides an outline of the principal parts of this embodiment in the data management system shown in FIG. 1. As indicated by the solid line arrow 101, the client program 11 asks the server program 12 to reference performance information. In response to this request, the performance data acquisition portion 35 of the server program 12 accesses the performance information VOL 47 as indicated by the solid line arrow 108 and reads out all or part of the performance information 10 as indicated by the dotted line arrow 109. The performance data acquisition portion 35 transmits all or part of the performance information 10 thus read to the client program 11 as indicated by the dotted-line arrow 102. Further, the part of the performance information 10 that is read out or transmitted can be a performance record, all or part of performance minute records, all or part of performance hour records, all or part of performance day records, or can be a combination of these records. A description of the performance records will be provided below. The performance monitoring portion 32 acquires performance data (generates or receives from outside, for example) and passes the acquired performance data to the performance data storage portion 90 as indicated by the arrow 103. The performance monitoring portion 32 acquires performance data in minute units, for example, at regular intervals (or irregular intervals). When performance data is passed from the performance monitoring portion 32, the performance data storage portion 90 detects the time at this point (detects the time by using a timer in the server 2, for example). Alternatively, the performance data storage portion 90 detects the time when performance data described subsequently is generated. As indicated by the solid line arrow 104, the performance data storage portion 90 accesses the definition VOL 49 and acquires all or part of data management definition information 34 as indicated by the dotted line arrow 110. The performance data storage portion 90 generates deletion condition data representing a deletion condition on the basis of performance data that is relayed from the performance monitoring unit 32 and the acquired data management definition information 34. The performance data storage portion 90 generates a performance record that includes performance data, collection time data representing the detected time (hereinafter �collection time�), and the generated deletion condition data and, as indicated by the solid line arrow 105, stores the generated performance record in the performance information VOL 47. Further, as indicated by the same arrow 105, the performance data storage portion 90 is able to update or delete the main performance record of the performance information 10 in the performance information VOL 47. Further, as indicated by the solid line arrow 106, the performance data storage portion 90 accesses the performance information VOL 47 and, as indicated by the dotted line arrow 107, is also able to read all or part of the performance information 10. The performance data storage portion 90 comprises a performance record creation and storage portion 90A, a summary record creation and storage portion 90B, and a record deletion portion 90C. Each of these 90A, 90B, and 90C are program modules, for example. The processing performed by each of the 90A, 90B and 90C will be described subsequently. The performance information 10 is information including a plurality of performance records. FIG. 3A shows a constitutional example of the performance information 10. The region in which the performance information 10 is stored is divided into a plurality of subregions. Each of the plurality of subregions corresponds with performance records of a plurality of types, for example. The type of performance record differs depending on what kind of time unit among a plurality of time units to which this record relates. More specifically, for example, the performance records of a plurality of types include a performance record that is generated in minute units (�minute record� hereinbelow) 13A, a performance summary record (�hour record� hereinbelow) 13B that summarizes minute records corresponding to a certain hour (sixty minute records, for example) and a performance summary record (�day record� hereinbelow) 13C that summarizes hour records corresponding to a certain day (twenty-four hour records, for example). The day record 13C is an upper level record, the hour record 13B is a record one level below the day record 13C and the minute record 13A is a record that is one level below the hour record 13B. The plurality of subregions include a minute record table 10A in which one or more minute records 13A are stored, an hour record table 10B in which one or more hour records 13B are stored, and a day record table 10C in which one or more day records 13C are stored. Each of the performance records 13A to 13C of the plurality of types registered in the plurality of tables 10A to 10C is associated with a record that is above or below itself. The server program 12 is able to grasp which upper or lower level record a certain performance record is associated with by referencing collection time data in the respective collection time fields of the certain performance record and of the upper or lower level performance records thereof respectively, for example. More specifically, it can be seen that the minute record 13A, for which the collection time is zero to fifty-nine minutes past h (hour), corresponds with the hour record 13B, for which the collection time data is h hours and zero minutes, and that the hour record, for which the collection time data is d days and zero to twenty-three hours, corresponds with the day record 13C for which the collection time is d days, zero hours, and zero minutes, for example. Further, the time unit levels may be in fewer or more levels than the three levels of minutes, hours and days. In this case also, the above procedure of grasping the relationship of correspondence from collection time data can be adopted. FIG. 3B shows a constitutional example of a performance record. A performance record 13 includes a collection time field 18A in which performance time data is registered, a deletion condition field 18B in which deletion condition data is registered, and a performance data field 18C in which performance data is registered. The performance data field 18C may comprise one or more subdata fields 14, 14, . . . in which one or more performance data elements constituting performance data are each registered. Performance data elements can be the CPU usage rate, the number of paging instances, and so forth. The constitution of the performance record 13 can be the same irrespective of the type of performance record 13. For example, the performance data storage portion 90 is able to register data representing the collection time (year/month/day/hour/minutes, for example) of the minute record 13A in the collection time field 18A of the minute record 13A, register data (year/month/day/hour/minutes, for example) representing an hour record that is generated on the basis of a plurality of minutes records 13A of a collection time at a certain hour in the collection time field 18A of the hour record 13B, and register data representing a day record that is generated on the basis of a plurality of hour records 13B with a collection time of a certain day (year/month/day, for example) in the collection time field 18A of the day record 13C. The server program 12 is able to grasp which upper or lower level record a certain performance record is associated with and grasp that there is a relationship of correspondence as illustrated by the dotted line in FIG. 3A, for example, by referencing the collection time data in the collection time field of the certain performance record and the upper and lower level performance records thereof respectively. Let us now refer to FIG. 2 once again. The data management definition information 34 is information relating to the definition of the data management method (a data or computer program, for example). The data management definition information 34 includes deletion condition definition information 36 and summary definition information 33. The deletion condition definition information 36 is data or a computer program in which rules for setting deletion conditions are defined. More specifically, for example, the deletion condition definition information 36 is a program (script) that generates a storage deadline or the like for the performance record from at least one performance data element that is included in the performance data. For example, when the performance data element represents the CPU usage rate, in order to generate the deletion condition that �the storage period of a performance record for which it is detected that the variation in the CPU usage rate exceeds 50% should be one month and the storage period of a performance record for which it is detected that the variation in the CPU usage rate is 50% or less should be two months�, the script image is as follows: if(abs(CPU %−CPU %[−1])>50) return �storage period> one month�
else return �storage period>2 days�. As shown in FIG. 4A, the server program 12 is able to generate a deletion condition by referencing such deletion condition definition information 36 and performance data and then set data for the generated deletion condition in a performance record. Further, when a deletion condition for an upper level performance record is generated, the deletion condition can be reflected in at least one lower level performance record that corresponds with the upper level performance record. The deletion condition definition information 36 can be of varied content. For example, when performance data elements of a plurality of types are included in the performance data, the rules for setting the storage periods for each type of performance data element can be defined and have content such that the longest storage period is then the deletion condition that is ultimately registered in the deletion condition field. Further, the deletion condition definition information 36 may include an information element that represents a rule for setting deletion conditions by performance record types. For example, deletion condition definition information elements for an upper level performance record may include data or a program that represents not only a rule for setting a deletion condition for this performance record but also a rule regarding the way in which the deletion condition is to be reflected in the performance record below this performance record (for example, as to whether to establish a deletion condition that is the same as the deletion condition of the upper level performance record for the lower level performance record corresponding with this performance record or to calculate the deletion condition of the upper level performance record as another deletion condition by means of a predetermined method and then establish this other deletion condition). More specifically, for example, hour-record deletion condition definition information elements may include the deletion condition �storage period>1 month�, which is set for an hour record in the case of data representing the fact that the �CPU usage rate of the hour record exceeds 60%�, and the deletion condition �and not exists (upper level record)�, which is added to the corresponding lower-level minute record. In this case, when �storage period>one day�, for example, has been registered in the deletion condition field of the original minute record, content such as �storage period>1 day and not exists (upper level record)�, that is, �[the lower level record] is saved until the upper level record is deleted when the storage period exceeds one day� is newly registered in the deletion field. The summary definition information 33 is data or a program whereby a method for creating upper level data from a plurality of lower level data is defined. The summary definition information 33 includes, for example, information elements representing a summary timing definition and information elements representing a summary method definition, for example. As a summary timing definition, in the case of the definition of a minute record, for example, a definition regarding whether to create upper summary data (hour data) every minute or to create upper summary data every hour can be adopted. Further, when upper summary data is created every minute, the number of minute records and the number of hour records are the same. In this case, one lower level record corresponds with a plurality of upper level records. At such time, when two or more upper level records among the plurality of upper level records are upper level records that represent an abnormal state, two or more deletion conditions can be reflected in the lower level record on the basis of the two or more upper level records. In this case, a deletion condition that the time for deletion should be the most remote time among the two or more deletion conditions may be selected and reflected in the lower level record. As a summary method definition, for example, a definition that sets any of the average value, total value, maximum value or minimum value of the plurality of performance data corresponding with the plurality of lower level data as the performance data of the upper level data can be adopted. Further, this summary method definition can be established by the type of performance data element. For example, the summary method may be established so that the average value is adopted when the performance data element is the CPU usage rate or the total value is adopted when the performance data element is the access frequency. The server program 12 can generate an upper level record (hour record, for example) from a plurality of lower level records (minute records, for example) as shown in FIG. 4B, for example, by referencing such summary definition information 33. FIG. 5 shows an example of the flow of processing that is executed by the server program 12. First, the processing to store the minute record 13A will be described. The performance record creation and storage portion 90A acquires a minute record in which the deletion condition field 18B is blank (step S101). Here, for example, the performance record creation and storage portion 90A may receive this minute record from the performance monitoring portion 32 or may generate this minute record on the basis of the performance data received from the performance monitoring portion 32 and the collection time of this performance data. The performance record creation and storage portion 90A generates a deletion condition that conforms with the content of the performance data on the basis of the performance data in the minute record acquired in S101 and the deletion condition definition information 33, sets data representing the generated deletion condition in the blank performance condition field 18B in the minute record acquired in S101, and then stores this minute record in the performance information VOL 47 (S102). The summary record creation and storage portion 90B references the collection time data in the minute record in the performance information VOL 47 and the summary definition information 33 in the definition VOL 49 and judges whether this is the summary timing for the minute record (S103). When an affirmative judgment result is obtained in the processing of S103, the summary record creation and storage portion 90B causes the performance record creation and storage portion 90A to start the processing of S201 (S104). The record deletion portion 90C references deletion condition data in each minute record within the performance information VOL 47 and, if this point in time matches the deletion condition represented by the deletion condition data (if the difference between the minute record collection time and the current time is greater than the storage deadlines set as the deletion condition, for example) the record deletion portion 90C then deletes the minute record containing the deletion condition data (S 105). The record deletion portion 90C is able to execute the processing of S 105 at regular intervals (or irregular intervals). Next, the summary record storage processing will be described. The performance record creation and storage portion 90A references the summary definition information 33 in the definition VOL 49, specifies a range of lower level records (minute records or hour records, for example), which form the basis of the summary record that is to be created, from this information 33, and creates a summary record (hour record or day record, for example) in which the deletion condition field 18B is blank on the basis of the lower level records in the specified range and the summary definition information 33(S201). The performance record creation and storage portion 90A generates a deletion condition that conforms with the content of the performance data on the basis of the performance data in the summary record created in S201 and the deletion condition definition information 33, sets data representing the generated deletion condition in the blank performance condition field 18B in the summary record created in S201, and then stores the summary record in the performance information VOL 47 (S202). Further, thereupon, the performance record creation and storage portion 90A is able to update, on the basis of the deletion condition definition information 33, the deletion condition of at least one lower level record corresponding with the summary record to a new deletion condition according to which deletion is performed at a later time than the time at which deletion is executed according to the former deletion condition. As the update method, a method that rewrites the deletion condition data of the lower level record with other deletion condition data or a method that adds new deletion condition data to the deletion condition field 18B of the lower level record, for example, can be adopted. The summary record creation and storage portion 90B references the collection time data in the summary record in the performance information VOL 47 and the summary definition information 33 in the definition VOL 49 and judges whether this is the timing for making an addition summary of the summary record (S203). When an affirmative judgment result is obtained in the processing in S203, the summary record creation and storage portion 90B causes the performance record creation and storage portion 90A to start the processing of S201 for an additional summary (S204). The record deletion portion 90C references the deletion condition data in each summary record in the performance information VOL 47 and, if this point in time matches the deletion condition represented by the deletion condition data (if the difference between the collection time of the minute record and the current time is larger than the storage deadline set as the deletion condition, for example), the record deletion portion 90C then deletes the summary record containing this deletion condition data (S105). The record deletion portion 90C is able to perform the processing of S205 at regular intervals (or irregular intervals). FIG. 6A and 6B show an example of an aspect in which a deletion condition for an upper level record representing an abnormal state is reflected in a lower level record. FIG. 6C shows a modified example thereof. Further, in FIG. 6A to 6C, the upper level record is an hour record and the lower level record is a minute record. As shown in FIG. 6A, one of a plurality of minute records 13A2, 13A2, . . . , the collection time of which is the eleventh hour, is a minute record that represents an abnormal state and for which the storage deadline �one month� is set as a deletion condition. The storage deadline �two hours� is set as a deletion condition for another minute record that represents a normal state. The storage deadline �two days� is set as the storage condition in an hour record that represents a normal state. In this case, for example, as shown in FIG. 6A, when the storage deadline �7 days� is set as the deletion condition in an hour record representing an abnormal state (a record the collection time of which is 11 o'clock) 13B2, the summary record creation and storage portion 90B detects the fact that the collection time of the hour record 13B2 is 11 o'clock and thus specifies the plurality of minute records 13A2, . . . the collection times of which are in the eleventh hour from the performance information VOL 47. Further, as shown in FIG. 6B, the summary record creation and storage portion 90B rewrites deletion condition data in the hour record 13B representing an abnormal state with deletion condition data of each of the specified plurality of minute records 13A2, 13A2, . . . irrespective of whether the minute record represents an abnormal state or a normal state. Further, at such time, the summary record creation and storage portion 90B is able to judge, for the deletion condition data of the minute records 13A2, 13A2 representing an abnormal state, which of a first time for deleting a minute record in accordance with deletion condition data and a second time for deleting a minute record in accordance with deletion condition data in hour record 13B2 representing an abnormal state is later and determine whether to perform rewriting in accordance with the judgment result. More specifically, for example, the summary record creation and storage portion 90B actually performs the rewriting shown in FIG. 6B when it is judged that the second time is later but, upon judging that the first time is later, retains the current deletion condition data in the minute record representing an abnormal state instead of performing rewriting, as shown in FIG. 6C. The data management system according to this embodiment was described above. According to this data management system, when an upper level record that contains performance data representing an abnormal state is generated, content that is based on a deletion condition set in the upper level record is reflected in the deletion condition of at least one lower level record that corresponds with the upper level record. As a result, when a lower level record of summary data containing performance data representing an abnormal state is to be acquired, a situation where the lower level record has been deleted and cannot be acquired can be prevented from occurring. Further, the following modified examples of the above embodiment may be considered. The differences from the above embodiment will be mainly described below. FIG. 7 shows a modified example of the server program 12 according to an embodiment of the present invention as well as an example of the flow of processing that is executed by the server program. The record deletion portion 90C of the server program 12 can perform processing not only to delete a record but also to shift a record. In a case where, in the processing of S105 or S106 above, the record deletion portion 90 must delete at least one of an upper level record that represents an abnormal state and a plurality of lower level records corresponding with the upper level record from the performance information VOL 47 due to conformity with the deletion conditions of these records, the upper level record containing normal performance data and the plurality of lower level records corresponding with the upper level record respectively are deleted from the performance information VOL 47 when there is conformity with the deletion conditions of such records. However, in cases where at least one of an upper level record containing abnormal performance data and a plurality of lower level records corresponding with the upper level record is deleted (Y in S106 or Y in S206), the record deletion portion 90 shifts the record of the deletion target in the performance information VOL 47 to another logical volume (S107). More specifically, the record deletion portion 90 deletes the deletion target record from within the performance information VOL 47 and writes the deletion target record to another logical volume. When the performance information VOL 47 is provided in the performance monitoring server 2, it may be considered desirable to provide another logical volume constituting the writing destination in a storage device outside the performance monitoring server 2. This spares the storage region of the performance monitoring server 2. Further, according to this modified example, it can be judged whether performance data contained in a record is abnormal or normal depending on whether the deletion condition contained in the record is abnormal or normal (for example, in FIGS. 6A to 6C, depending on whether �two days� has been set as the storage period or another storage period has been set). Moreover, according to this modified example, the record deletion portion 90 is able to determine another logical volume, which constitutes the migration destination, by referencing the a volume management table 88 that is illustrated in FIG. 7. The volume management table 88 may be registered in the server memory portion 35 or in the storage system 43. The ID, attribute, and usage status of each logical volume, for example, are registered in the volume management table 88. The attribute of the logical volume indicates in which type of storage device a logical volume is prepared. More specifically, for example, attributes include high reliability or high performance attributes (Fibre Channel, for example) and lower reliability or performance attributes (serial ATA, for example), for example. The usage status of the logical volume may be in use or unused, for example. The record deletion portion 90 is able to select a logical volume that is in an unused state and of low reliability or low performance (or high reliability or high performance), for example as the other logical volume constituting the migration destination. Embodiments and modified examples of the present invention have been described hereinabove but constitute examples that serve to illustrate the present invention. There is no intention to limit the scope of the present invention to this embodiment and modified examples. The present invention can also be implemented in a variety of other forms. Classifications U.S. Classification702/186International ClassificationG06F15/00Cooperative ClassificationY10S707/99931, Y10S707/99933, G06F11/3495, G06F11/3476European ClassificationG06F11/34T4Legal EventsDateCodeEventDescriptionJan 26, 2011FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google


text:
Miscellaneous Junk Drawer Tools; Starrett, Ridgid, Machinist ; Free Surprise | eBay
Junk Drawer LOT All kinds of goodies. Unique Array Of Things Take A Look
4) JUNK DRAWER LOT
Details about Miscellaneous Junk Drawer Tools; Starrett, Ridgid, Machinist ; Free Surprise
ESTATE SALE 20 US COINS w/ Silver, BU and Proof Included!
254230719924
Last updated on May 17, 2019 06:04:08 PDT View all revisions

type: global

value: This website is an American multinational e-commerce corporation based in San Jose, California, that facilitates consumer-to-consumer and business-to-consumer sales through its website.


text:
Promotional value expires Apr 25, 2015. Amount paid never expires. Limit 10 per person, may buy 10 additional as gifts. Valid only for option listed. Must be 21 or older. Valid only for the Philadelphia Margarita March event listed. Must arrive and check in from 12pm-3pm on day of event. Must use promotional value in 1 visit. Includes eight specialty margaritas (one at each of the 8 different venues). Merchant is solely responsible to purchasers for the care and quality of the advertised goods and services.
The Margarita March is easy to explain, but hard to finish. The task? Celebrate summer by touring eight Philly bars, sampling the signature margarita at each one. The difficulty? On par with hiking from Guadalajara to Mexico City, the founders claim. Luckily, much like early car races, the event emphasizes the journey more than crossing the finish line. Between the mariachi bands and the new friends participants meet, there’s plenty of fun to be had along the way.

value: This website is an American global e-commerce marketplace connecting subscribers with local merchants by offering activities, travel, goods and services in 15 countries. Based in Chicago, Groupon was launched there in November 2008, launching soon after in Boston, New York City and Toronto.


text:
Shop Harvest Design Table Runner or Set of 4 Napkins - Free Shipping On Orders Over $45 - Overstock - 9415812
runner - 16" x 72"
This fall plaid table runner or napkins feature a classic pattern that's easy to pair with. Featuring warm shades of green, orange, and red, it adds a celebratory note during the harvest season. Made with 100% cotton for lasting use.
Runner: 108 inches long x 16 inches wide
Runner: 90 inches long x 16 inches wide
Napkins: 20 inches long x 20 inches wide
Choose from: One (1) runner OR Four (4) napkins
Autumnal colors are ideal for the fall season
Vivid tones add brightness to the table
Item #: 16603195
90.0 In. X 16.0 In. X 1.0 In.
520 Table Linens
Harvest Festival Fall Printed Napkins, Set of 8

value: This website is an American internet retailer selling primarily furniture headquartered in Midvale, Utah, near Salt Lake City.


text:
Working at Fastrac Markets: Employee Reviews | Indeed.com
Fastrac Markets Employee Reviews
(all)Assistant Manager - 21Store Manager - 5Cashier - 4Manager - 4Assistant Store Manager - 3Lead Cashier - 22A - 1Cafe employee - 1Cashier Supervisor - 1Category Manager - 1Customer Service Associate / Cashier - 1Customer Service Representative - 1General Manager - 1Pizza Cook - 1Shift Leader - 1Shift Manager - 1
(all)United States - 49 Amsterdam, NY - 1 Baldwinsville, NY - 1 Buffalo, NY - 5 Camden, NY - 1 Camillus, NY - 2 Central Square, NY - 2 Clay, NY - 1 Clyde, NY - 2 Corning, NY - 1 East Syracuse, NY - 1 Liverpool, NY - 2 Marcy, NY - 1 New Hartford, NY - 1 Old Forge, NY - 1 Oswego, NY - 1 Phoenix, NY - 1 Rochester, NY - 8 Rome, NY - 5 Syracuse, NY - 4 Utica, NY - 2 Watertown, NY - 2
Store Manager (Former Employee) – Clyde, NY – August 27, 2017
I enjoyed working for Fastrac Markets, I was injured and unable to return without restrictions. I had to find other employment until healed properly. By then my position with Fastrac was treminated.
Fun at times but can become very unorganized
Assistant Manager (Current Employee) – Buffalo, NY – August 18, 2017
This job can become very draining at times due being unorganized and to the lack of stability in hours to the lack of displine most employs have displayed,
No breaks, unsteady schedule, not enough discipline
Manager (Former Employee) – Corning, NY – July 18, 2017
When I first got the job I enjoyed it the people where always friendly. As the years have gone by the new employees started to not make the job enjoyable.
workin atmosphere
Manager (Former Employee) – Utica, NY – July 3, 2017
I worked for this company for a couple years. They pay a better hourly wage than most companies but that's it. . After that it's nothing special. They have multiple benefits but they're nothing special. Medical insurance doesn't cost a lot weekly but you have to spend more than $6000.00 before you get any major coverage.The company is greedy and doesn't have any in store benefits for employees. Most c-store companies have something for the store for just employees. Not this one. It also moves people up and down ladders all the time. They promote but in no time demote too. I'm still in touch with many who still work or have left since I did. Don't waste your time.
Productive flexible work environment. Good pay
Assistant Manager (Current Employee) – Rome, NY – June 26, 2017
Always work to be done to keep you busy. Management is great. Develops leadership skills. Everyone I work with is extremely friendly. The only hard part is dealing with difficult customers
Good place if its a first job and you need decent money otherwise I wouldn't advise it.
Assistant Manager (Current Employee) – Old Forge, NY – June 24, 2017
Honestly the most annoying part of the job is the corporate side of things. They don't seem to communicate well even with each other which causes confusion more times than not at the stores. Customers are the usual some good some bad.
Assistant Manager (Former Employee) – Rochester, NY – June 18, 2017
Typical day includes serving customers, cleaning and organizing store (inside and outside). Everyone's an "assistant manager" just different levels. Hardest part is dealing with unruly or belligerent customers.
horrible plaxe to work
Assistant Store Manager (Former Employee) – Phoenix, NY – June 1, 2017
They are a company that cares only about corporate employees .they make u work 8-12 hour shifts with no breaks they hire everyone as management so they can leave u alone in a store with no help they are awful to employees
they pay well for a convienence store
u work non stop they dont care about your family life
on you toes
Category Manager (Former Employee) – East Syracuse, NY – May 2, 2017
fast paced...forward thinking...stay ahead of trends...
Lots of opinions made it difficult to comfortably make decisions
management & ownership were very good with wages
outstanding wage... traveling was always deluxe
difficult to enjoy free time
Cashier (Current Employee) – Syracuse, NY – April 22, 2017
They seem like a good company to work for but they are really not for the employees. They start you out with good pay and then treat you like garbage.
Manager (Former Employee) – Rome, NY – March 3, 2017
Worse company i have ever worked at. You work 60-70 hrs a week with no upper management support at all they treat you like dirt from the top down. If you want to work 7 days a week with no life and get treated like *** this is your pick ! The DM's are horrible and dont deserve their jobs they dont help you at all just take advantage of working you til you physically cant do it anymore. AVOID THIS COMPANY !
Assistant Manager (Current Employee) – Camden, NY – February 2, 2017
I run the store cash people out check in venders , stock any and all cooler/shelves.deal with a lot of cash all day drops to safe .fast customer service with a smile and good attitude.
Normally work with schedule due to drs appointments
No breaks, would be great to at some point show appreciation to valued employees
the joy of working there
Assistant Manager (Former Employee) – Rome, NY 13440 – January 22, 2017
I enjoyed working for fastrac very much. I got to work with a lot of nice people and meet a lot of new customers. Everyday it was something different to deal with.
Store Manager (Former Employee) – Numerous – January 12, 2017
From the district manager to the CEO of the company, they only care about themselves. You are a number. Employees come and go, your store is understaffed, although you do get paid well. If you want to make money, but have no life and work for a company that only care about themselves, this could be a job for you. The food team is fantastic, but everyone else in upper management should find a new job. I would not recommend this company to my worst enemy. This company needs a union and it would stand a chance of being better. Someone needs to control the law breaking upper management.
Comment – January 30, 2017
I agree, terrible company to work for, upper management is horrible
it was a great place to work i enjoyed this job the most meeting new people
Assistant Manager (Former Employee) – Buffalo, NY – January 9, 2017
Fun exciting place to work, Management was awesome, the hardest part was when I had to let staff go or have a customer arrested for stealing. The customers where the best part of the job
Assistant Manager (Former Employee) – Liverpool, NY – December 27, 2016
Great company and a great place to work. The company provides a great work environment for all employees. The company is very fair and if you do something that is not to par, they give you another chance.
4th Assistant Manager (Former Employee) – Central Square, NY – December 25, 2016
I had an amazing manager at first, got the best rating for our inspection ever in that store. Worked 50-70 hours a week. After they TOOK our manager, they gave us a shotty one, who they wished to fire but "didnt have enough dirt on." We had 5 managers in one month. And my Birthday Vacation, i requested off 3 months in advance, but with every new manager, i had to re-inform them, meaning to them, i disnt give "long enough notice"
Customers, great healthcare
Expensive health care, long hours, no raises, hard to get vacation time
Assistant Store Manager (Former Employee) – Oswego, NY – December 23, 2016
Always had hours for employees to pick up taught good life lessons in dealing with customers. Employees always had good attitudes
Assistant Manager (Former Employee) – Watertown, NY – November 4, 2016
New employees all the time. New management in few new positions and didnt know what they were doing. Poor scheduling and no communication between workers and management.
3rd shift assistant manager (Former Employee) – Liverpool, NY – November 2, 2016
Great company fast paced work environment. Very flexible with work schedules and polite and professional management
Just a poorly run company
Asst Manager (Former Employee) – NY – October 16, 2016
First, the descriptions for job postings are not exactly correct. As store manager, be expected to put in 50-70 hrs to cover for lackluster employees. And if the store manager (glorified asst manager) wants to work 40 hrs, you're stuck with all of the extra work on overtime.
There is a high rate of turn-over with this company, and you are just a number.
The hardest part of the job is trying to motivate employees, most of whom just don't care. The best part of the job was being able to go home at some point.
The company does absolutely nothing for the employees. it would be a huge gesture if they even offered their employees one free coffee or fountain beverage per day. There's just nothing that says they care.
you get to go home at some point
Ask a question about working or interviewing at Fastrac Markets. Our community is ready to answer.
Questions about Fastrac Markets
What tips or advice would you give to someone interviewing at Fastrac Markets?
What is the work environment and culture like at Fastrac Markets?
How do you feel about the future of Fastrac Markets?
Fastrac Markets Reviews by Job Title
Fastrac Markets Reviews by Location

value: This website is an American worldwide employment website for job listings launched in November 2004. It is a subsidiary of Japan's Recruit Co.


text:
9780719519093 - Alibris
ISBN: 9780719519093
0719519098
9780719519093
Legends of the South Sea
1970, John Murray Publishers Ltd
ISBN-13: 9780719519093
Legends of the South Seas
1970, John Murray
ISBN 0719519098
ISBN-13 9780719519093
Alibris ID 13544926729
Good. Dust jacket is price clipped and shows minor wear and tear. Pages are clean, text is intact and unmarred. Very Clean Copy-Over 500, 000 Internet Orders Filled.
Alibris ID 14310311332
Good. Legends of the South Sea by Alpers, Antony, 1970-02-27. 416 p. Ill.M.
Alibris ID 12715883734
Very Good. 0719519098 Thomas Crowell (New York) edition, 1970. 9" x 6.25". Dust jacket has a few tiny closed tears on bottom edge (in brodart). xvi, 416 pages, numerous black and white illustrations. U. S. orders are shipped from N.Y. state.
Alibris ID 14098601746
Alibris ID 13247978291
F- in F- jacket. F-/F-. 8vo. original green textured paper boards gilt (slightly faded at edges, prev. owner's small rsm & notation to FFE) in dustwrapper (short closed tear to rear panel); pp. xvi, 416, with illustrations & endpaper maps. A near fine copy.
Alibris ID 13917106489
Alibris ID 13917108993
Alibris ID 13917105289
Alibris ID 13993575525

value: This website is is an online store that sells new books, used books, out-of-print books, rare books, and other media through an online network of independent booksellers.


text:
Colombia plane crash: Lionel Messi and Argentina team were just 18 MINUTES from death | Daily Mail Online
Lionel Messi was 18 MINUTES from death on Colombia crash plane: His flight two weeks earlier nearly ran out of fuel it emerges as survivor is discharged from hospital
Flight for Argentine internationals was in the air four hours and four minutes
The same plane crashed on November 28 after reportedly running out of fuel
Seventy five people were killed when it crashed in Colombia
Survivor Erwin Tumiri was today released from hospital
Published: 12:19 EST, 6 December 2016 | Updated: 08:03 EST, 7 December 2016
International superstars including Lionel Messi were just 18 minutes from death when they flew on the doomed Bolivian LaMia plane just two weeks before it crashed, killing 75.
New reports claim the Argentine footballer and his teammates were in the air for more than four hours - aboard an aircraft which could fly with a full fuel tank for just four hours and 22 minutes.
The same plane crashed into a mountainside on November 28, chartered by Brazilian club AF Chapecoense.
Argentine international Lionel Messi was onboard a flight which was airborne for more than four hours just two weeks before the same flight crashed after reportedly running out of fuel
Citing data from FlightRadar 24h, Brazilian portal Folha de Sao Paulo claims that when the Argentine national team flew on the plane on November 11, it had just an 18 minute margin for error before landing safely.
The flight from Brazil to Argentine capital Buenos Aires, following the team's World Cup qualifier against Brazil, was airborne for four hours and four minutes.
Argentine authorities insist on a 45 minute difference between flight length and fuel capacity.
Rescue workers combing through the wreckage of last week's crash, which killed 75 people in Colombia
The plane, which had two weeks earlier carried the Argentine national team home from Brazil, crashed last week
'Has my daddy died, mummy?' Wife of a Chapecoense player who... 'Football means nothing compared to what happened': Player... 'I screamed and screamed and willed him to live': Beauty... Their final home appearance: Heartbreaking scenes as 100,000...
Last week the same plane crashed after a refuelling stop in Cobija, on the border between Brazil and Bolivia, was abandoned because the airport did not operate after midnight.
The chartered flight carrying members of the top flight club to the final of the Copa Sudamericana then had to wait for a landing slot at Medellin airport in Colombia - and ran out of fuel before it was able to land.
Initial reports said it had been flying for 20 minutes longer than its fuel capacity.
Soldiers carry coffins of Chapecoense Real football club team members, after 50 people associated with the club were killed
The BAE 146 Avro RJ85 jet's maximum range was 1,600 nautical miles, which is just under the distance between Medellin and Santa Cruz, Bolivia, where the plane took off at almost full capacity.
The news broke as Bolivian air technician Erwin Tumiri, one of the few survivors of the doomed flight, was discharged from hospital today.
In an interview with Brazil's Globo TV, he said: 'Everybody went back to their seats. The lights went out and then the plane began to shake.
Erwin Tumiri, one of the few survivors of the doomed flight, was discharged from hospital today
'I thought that the vibration was part of a normal landing. But it wasn't. I just heard a "vroom vroom" sound. I can't remember what happened after that. I woke up on the ground.'
Gustavo Vargas, a LaMia director, told Bolivian journalists it was the pilot, Miguel Quiroga, who had decided to fly onto Medellin, without trying to refuel at Bogota.
Erwin Tumiri was today released from hospital after miraculously surviving the tragic crash
Tumiri said he woke up on the ground after the plane crashed in Colombia last week

value: This website is the website of the Daily Mail, a newspaper in the United Kingdom, and of its sister paper The Mail on Sunday. MailOnline is a division of dmg media, which is owned by Daily Mail and General Trust plc.


text:
Patent US7245924 - Cellular phone and a base station thereof - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsWhen a receiving end is a cellular phone, the cellular phone that displays the local time at the receiving end and a base station used in this cellular phone are realized. A time recognition unit that obtains the local time at the receiving end using the time information acquired from the cellular phone...http://www.google.com/patents/US7245924?utm_source=gb-gplus-sharePatent US7245924 - Cellular phone and a base station thereofAdvanced Patent SearchPublication numberUS7245924 B2Publication typeGrantApplication numberUS 11/219,170Publication dateJul 17, 2007Filing dateSep 1, 2005Priority dateMay 10, 2001Fee statusPaidAlso published asCN1207929C, CN1386023A, EP1257133A2, EP1257133A3, EP1257133B1, EP1257133B8, US6985744, US20020168997, US20060009178, US20070243883Publication number11219170, 219170, US 7245924 B2, US 7245924B2, US-B2-7245924, US7245924 B2, US7245924B2InventorsMakoto Katagishi, Osamu HasegawaOriginal AssigneeHitachi, Ltd.Export CitationBiBTeX, EndNote, RefManPatent Citations (21), Referenced by (8), Classifications (18), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetCellular phone and a base station thereof
US 7245924 B2Abstract
24. The method according to claim 19, further comprising a step of presenting the acquired local time by a speaker of the cellular phone when the receiving end and the transmitting end are in different time zones. Description
In the steps 614 and 615, as shown in FIG. 4, the display unit 106 of the mobile unit 1 displays a telephone number 501 of the receiving end, local time 502 of the recipient, the time 503 of the local station, a display 504 that inquires the user about the advisability of calling, and selection items (505 and 506). The selection items are selected by moving the cursor to either the button 505 or 506 on the display screen and operating the selection key 180 or by making the buttons 505 and 506 correspond to the function key or numeric key (for example, 506 indicates the �1� key for YES and 505 indicates the �3� key for NO) and performing the input operation of the keys that correspond to the buttons 505 and 506. In this embodiment, although the local time 502 of the recipient and the time 503 of the local station are digitally displayed, they may also be displayed in the form of an analog clock. Further, a time zone may also be represented according to the colors of the illumination from behind the display screen (hereinafter reffered to as backlight) and light emitting diode (not shown in the drawing) of the display unit. A date may also be displayed in addition to the time. Moreover, the control unit 110 may also control the reporting of the time to an caller so as to perform voice synthesis by the signal processing unit 103 instead of using the display unit 106 and perform voice reporting using the speaker 105. That is, the signal processing unit 103, the speaker 105, and the control unit 110 have the reporting unit function.
Next, an example of the communication method selection processing in the step 617 is described in detail using FIG. 6. As shown in FIG. 7, the time of the local station and the local time at the recipient are displayed on the display unit 106 and the screen that selects whether to perform a normal call or not (steps 618, 619, and 621) and the selection result is inquired the user of using the operation unit 106. In this embodiment, as shown in FIG. 7, the selection item of the answer, such as the �Call� (507), �Message� (508), �Mail� (509) or �NO� (505) is displayed on the display screen as a button against the display (504) of the inquiry of �Is a message sent ?�. The selection item is selected by moving the cursor to any one of the buttons 505, 507, 508, and 509 on the display screen and operating the selection key 180 or making the buttons 505, 507, 508, and 509 correspond to the function key or numeric key (for example, the �1� key for the �Call� (507), the �2�, key for the �Message� (508), the �3� key for the �Mail� (509), and the �6� key for the �NO� (505) and performing the input operation of the key that corresponds to the buttons 505, 507, 508, and 509.
When the selection result input from the operation unit 107 is the call (step 618-Y), the calling processing of a normal call is performed (step 616), and when it is the message (steps 618-N and 619-Y), the processing that sends a message is performed (step 620). When it is the character mail (steps 619-N and 621-Y), the processing that sends mail is performed (step 622). When the steps 616, 620, and 622 are terminated, the processing terminates and returns to the stand-by state. When the selection result is �NO� (505) (steps 618-N, 619-N, and 621-N), the processing terminates without performing any of the call calling processing, message calling processing, and mail sending processing. Also in this case, after the processing terminates, the processing returns to the stand-by state. In FIG. 7, the selection items of these communication methods are displayed on the display unit 106 at a time. When the display space of the display unit 106 is narrow, the communication methods may also be selected sequentially according to the method selected with YES/NO in the order of the steps 618, 619, and 621. The above processing procedure is stored in the storage unit 108. The control unit 110 calls this procedure and executes the processing. As the selection of the processing method, for example, the control unit 110 selects the method that displays the selection items at a time by default, and may also be able to select the method that is sequentially selected according to the preference of the user.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5528558Aug 12, 1994Jun 18, 1996Mardhekar; Dhananjay V.International time indicating systemUS5742668Jun 6, 1995Apr 21, 1998Bell Communications Research, Inc.Communication systemUS5818920 *Dec 4, 1996Oct 6, 1998Telefonaktiebolaget Lm EricssonApparatus for controlling communication connections based on local timeUS5920824Sep 2, 1997Jul 6, 1999International Business Machines CorporationMethod for computing current time on a cellular mobile systemUS6075992 *Oct 22, 1997Jun 13, 2000Ericsson Inc.Apparatus and method for automatically handling initiation of a call by a portable intelligent communications deviceUS6138008Jan 16, 1998Oct 24, 2000At&T Corp.Wireless telephone menu systemUS6223058Nov 18, 1998Apr 24, 2001Sony CorporationCommunication terminal apparatus and control method thereofUS6310944Dec 17, 1997Oct 30, 2001Nortel Networks LimitedMethod for adding context to communicationsUS20020168987May 8, 2001Nov 14, 2002Shu-Shaw WangMethod and apparatus for filtering incoming calls in a mobile communication systemDE19804188A1Feb 3, 1998Aug 5, 1999Siemens AgFunkger�tEP0731621A2Feb 14, 1996Sep 11, 1996International Business Machines CorporationMethod for computing current local time in a cellular mobile radio systemEP0783219A2Dec 12, 1996Jul 9, 1997Nokia Mobile Phones Ltd.Activation of a telephone's own call answering equipment according to the number of the calling partyEP1032186A2Feb 11, 2000Aug 30, 2000Nokia Mobile Phones Ltd.A method and a cellular telecommunication apparatus for displaying the local timeGB2284965A Title not availableJP2000324210A Title not availableJP2000349906A Title not availableJPH06276262A Title not availableJPH11331350A Title not availableJPH11341135A Title not availableKR19990029329A Title not availableKR20000008413A Title not available* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7590229 *Dec 27, 2005Sep 15, 2009At&T Intellectual Property I, L.P.System for prompting the caller before and after voice-over-internet-protocol call connectionUS7711676Nov 12, 2004May 4, 2010Sap AktiengesellschaftTracking usage of data elements in electronic business communicationsUS7818342Nov 21, 2005Oct 19, 2010Sap AgTracking usage of data elements in electronic business communicationsUS7865519Nov 17, 2004Jan 4, 2011Sap AktiengesellschaftUsing a controlled vocabulary library to generate business data component namesUS7881748 *Dec 22, 2009Feb 1, 2011At&T Mobility Ii LlcNetwork identity and timezone (NITZ) functionality for non-3GPP devicesUS8150012 *Jul 9, 2007Apr 3, 2012Alcatel LucentMethod and apparatus for deriving the present local time of a target stationUS8666043Apr 8, 2009Mar 4, 2014Centurylink Intellectual Property LlcTelephone for providing information associated with a remote geographic location of a called party to a callerUS20080253540 *Mar 20, 2008Oct 16, 2008James SiminoffSystem And Method For Managing Incoming Communication Based Upon Local Time* Cited by examinerClassifications U.S. Classification455/456.1, 379/201.07, 379/201.08International ClassificationH04M1/00, H04M3/42, H04Q7/38, H04M3/487, H04Q7/20, H04M1/725, H04B7/26Cooperative ClassificationH04M1/72583, H04M1/72566, H04M1/72547, H04W4/20, H04M1/72572European ClassificationH04M1/725F4, H04M1/725F2C, H04M1/725F2GLegal EventsDateCodeEventDescriptionDec 24, 2014FPAYFee paymentYear of fee payment: 8Sep 8, 2014ASAssignmentOwner name: HITACHI MAXELL, LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HITACHI CONSUMER ELECTRONICS CO., LTD.;HITACHI CONSUMER ELECTRONICS CO, LTD.;REEL/FRAME:033694/0745Effective date: 20140826Mar 12, 2012ASAssignmentOwner name: HITACHI CONSUMER ELECTRONICS CO., LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HITACHI, LTD.;REEL/FRAME:027842/0306Effective date: 20120215Dec 16, 2010FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
The Spooky Men's Chorale - Wikipedia
With Kate Rowe
The Spooky Men's Chorale are a group of Australian male singers.[1] Most reside in the Blue Mountains region of New South Wales, but some are from Western Australia. Their repertoire consists largely of songs either written or arranged by their director (or "spookmeister") Stephen Taberner, on topics ranging from power tools to covers of ABBA songs. They also perform traditional Georgian music, a major influence on their compositions, harmonies and vocal style.
The Spooky Men's Chorale were created by Stephen Taberner and made their first appearance in August 2001 as part of an evening called "This was nearly my life" at Paddington Uniting Church, Sydney. Taberner claims he called up every man he knew who could sing and "taught them 3 songs, and asked them to show up wearing black and with an interesting hat."[2] The three songs were "Vineyard", a Georgian church song, "Georgia", a mock Georgian original, and "The Mess Song".[2] The latter was an existential rumination on the aftermath of breakfast written by New Zealand’s Don McGlashan and Harry Sinclair of The Front Lawn.[3][not in citation given]
In the first couple of years the group performed and rehearsed sporadically until the National Folk Festival of Easter 2004, held in Canberra, which effectively launched the group and where, thereafter, they became cult figures. The gig at the National was also the debut of what would become the Spooky theme song ("We are the Spooky Men, We dream of mastodons ...") which typified the brand of humour they were beginning to define. The attention received at the National Folk Festival in 2004 gave rise to a series of opportunities to put their music before a wider audience.[citation needed] They are now a staple at folk festivals.[4]
The Spooky Men's Chorale typically perform with between 12 and 16 singers, the exact number at any one time depending on the particular circumstances, locations and so on. When touring in the UK and Europe, the group are regularly joined by up to 6 UK based singers. The UK contingent also perform in their own right as A Fistful of Spookies.
Urban Sea Shanties (2009) - Fred Smith and the Spooky Men's Chorale
Deep (2009) with DVD
Big (2011) containing three tracks ("Big", "The Thing", "The Man in the 17th Row")
^ Denselow, Robin (13 August 2015). "The Spooky Men's Chorale: Warm review – harmony-song troupe go beyond a joke". The Guardian. Retrieved 2 October 2015.
^ a b “The foolishness came later” - a history of the spookymen Stephen Taberner's Blog, 2 June 2010
^ The Front Lawn (1993) More Songs from the Front Lawn.
^ Denselow, Robin (7 September 2015). "The Spooky Men's Chorale – silly, thoughtful and in perfect harmony". The Guardian. Retrieved 2 October 2015.
MusicBrainz: c6fa941e-d403-445f-9cde-5ca0336d7196
Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Spooky_Men%27s_Chorale&oldid=823611451"

value: This website is the English-language edition of the free online encyclopedia Wikipedia. It was founded on 15 January 2001 as Wikipedia's first edition and, as of October 2021, has the most articles of any edition, at 6,412,521.


text:
3.3v power supply | eBay
Skip to main contenteBayShop by categoryShop by categoryEnter your search keywordAll CategoriesAntiquesArtAutomotiveBabyBooksBusiness & IndustrialCameras & PhotoCell Phones & AccessoriesClothing, Shoes & AccessoriesCoins & Paper MoneyCollectiblesComputers/Tablets & NetworkingConsumer ElectronicsCraftsDolls & BearsDVDs & MoviesEntertainment MemorabiliaGift Cards & CouponsHealth & BeautyHome & GardenJewellery & WatchesMusicMusical Instruments & GearPet SuppliesPottery & GlassReal EstateSpecialty ServicesSporting GoodsSports Mem, Cards & Fan ShopStampsTickets & ExperiencesToys & HobbiesTravelVideo Games & ConsolesEverything ElseAdvanced or register':' style="margin-right:3px">Hi -User-!'.replace(/-User-/,escape(a)))+"")}catch(b){document.write("")}})();Hi (Sign in to bid or buy) eBay Deals Sell Help & ContactCurrent language EnglishEnglishFrançais My eBayExpand My eBay Summary Bids/Offers Watch List Wish List All Lists Purchase History Selling My Collections Followed searches MessagesNotification Related: 3.3v ac adapter 5v power supply 3.3v switching power supply 3.3v 5v switching power supply 3.3v adapter 3.3v regulator 3.3v power 2.1mm panel mount
results for 3.3v power supply
Follow 3.3v power supply to get e-mail alerts and updates on your eBay Feed.
Unfollow 3.3v power supply to stop getting updates on your eBay Feed.
Yay! You're now following 3.3v power supply in your eBay Feed.You will receive email alerts for new listings. Don't send me e-mail alerts.
3.3v power supply: Items in search results
AMS1117 3.3V Power Supply Module Voltage Regulator DC-DC 4.5V-12V to 3.3V
2 x DC/DC 4.5V-7V to 3.3V AMS1117 Volt Regulator N24 Power Supply Module US SHIP
C $2.93 to C $3.92
+C $2.48 shipping	4570 sold
+C $2.48 shipping	841 sold
Power Prawn PLUS! Breadboard Power Supply 5V/3.3V - 9V BATT. PWRD Ship from USA
Adafruit LM3671 3.3V Buck Converter Breakout 3.3V Output 600mA Max Power Supply
+C $2.48 shipping	191 sold
C $3.48 to C $4.48
+C $2.48 shipping	112+ sold
C $1.62 to C $6.10
+C $2.48 shipping	398 sold
HLK-PM01 HLK-PM03 HLK-PM12 220V to 5V/3.3V/12V Step Down Power Supply Module S
C $3.41 to C $4.83
+C $2.48 shipping	609 sold
C $2.61 to C $2.89 Was: Previous Price
C $2.94 to C $3.64
C $3.68 to C $3.99
AC-DC 220V to 5V 3.3V 500mA 200mA Isolated Buck Step Down Power Supply Module
Negative voltage Module -12V 12V 5V 3.3V DC Regulator Lab Power Supply board
1pcs Breadboard Power Supply Module 5V/3.3V
2/5/10 PCS AMS1117-3.3V AMS1117-5.0V Power Supply Module NEW
[1x] 3.3V / 5.0V 700mA Compact Breadboard Power Supply Module with USB Mini + DC
C $3.06 to C $3.47
C $6.60 to C $6.85 Was: Previous Price
2Pcs 5V to 3.3V DC-DC Step-Down Power Supply Buck Module AMS1117 LDO 800MA
+C $2.48 shipping	267 sold
DC-DC Boost Step up Converter 3V-12V 3.3V 5V 9V to ±12V Dual Power Supply Module
5 PCS AMS1117-3.3V Mini USB 5V/3.3V DC Perfect Power Supply Module
[1x] MB102 Breadboard Power Supply Module - 3.3V and 5.0V Select - On Off Button
MB102 Breadboard Power Supply Module 3.3V/5V For Arduino Raspberry Pi Breadboard
+C $1.27 shipping	477 sold
AC-DC 220/110V to 3.3V 700mA Step-down Buck Isolation Switch Power Supply Module
+C $2.41 shipping	109 sold
1Pcs 5V/3.3V MB 102 Breadboard Power Supply Module for Arduino Hot Sale


text:
Scott Memorial United Methodist Church Detroit, MI 48227 - YP.comFind People•Advertise With UsBrowseAttorneysHome ServicesMedical & DentalRestaurantsAutomotiveInsuranceBeauty & SpaPetsTop SubcategoriesDivorce AttorneysFamily Law AttorneysReal Estate AttorneysCriminal Law AttorneysChild Custody AttorneysPeople also searched for...AttorneysNotaries PublicBlack Family Law AttorneysProbate AttorneysSocial Security Disability Law AttorneysTax AttorneysReal Estate LawyersTop SubcategoriesPlumbersGeneral ContractorsRoofing ContractorsLocksmithAir Conditioning Service RepairPeople also searched for...ElectriciansPest Control ServicesConcrete ContractorsBed Bug Pest ControlPainting ContractorsMoversLandscape ContractorsTop SubcategoriesDentistsDoctorsHospitalsMedical ClinicsEye DoctorPeople also searched for...24 Hour Urgent CareRite AidPharmaciesTb Test Walk In ClinicsCheap Abortion Clinics24 Hour PharmaciesUrgent CareTop SubcategoriesChinese RestaurantsMexican RestaurantsFast Food RestaurantsItalian RestaurantsSeafood RestaurantsPeople also searched for...RestaurantsZorbas On 6 Mile And GunstonSoul Food RestaurantsAll You Can Eat RestaurantsConey IslandPizza24 Hour Pizza DeliveryTop SubcategoriesAuto Repair ServiceAuto PartsAuto Salvage YardsAuto Glass RepairAuto DetailingPeople also searched for...Scrap Cars With No TitleUsed Auto PartsUsed Car DealersJunk YardJunk Car BuyerTowingCustom Car ShopsTop SubcategoriesAuto InsuranceHomeowners InsuranceHealth InsuranceDental InsuranceInsurance AdjustersPeople also searched for...La InsuranceLook InsuranceTitle CompaniesGeicoGeico InsuranceCar Insurance CompaniesCar InsuranceTop SubcategoriesNail SalonsHair SalonMassage TherapistsTanning SalonsDay SpasPeople also searched for...Eyebrow TattooingWig ShopsBeauty SalonsAfrican Hair BraidingBarbers24 Hour Beauty SupplyTattoo ShopsTop SubcategoriesPet StoresPet GroomingPet Boarding KennelsMobile Pet GroomingVeterinariansPeople also searched for...24 Hour Animal Hospital24 Hour Animal SheltersPet CremationAnimal Removal ServicesBird StoreAnimal SheltersTropical Fish StoresPeople also searched for...Cheap Banquet HallsRestaurantsAuto Salvage YardsPlumbersBanquet HallsScrap Cars With No TitleTemporary Employment AgenciesTaxisTransportation ServicesPain Management Clinics In Detroit Who Prescribe Oxycodone 30 MgHall RentalsMotel With Weekly RatesMexican RestaurantsChat LineUsed Auto PartsAre you a local business owner?Advertise with YPor call 888-367-2194Start your search by typing in the business name below.
Where?My current locationSearchSign In•JoinWrite a ReviewHomeUnited Methodist Churches near Detroit, MIScott Memorial United Methodist ChurchIn mybook® : Community Collection (edit)Added to your community collection.Removed from mybook!We took this business out of your community collection.Scott Memorial United Methodist ChurchWrite a ReviewAdd a PhotoBe the first to review!15361 Plymouth Rd, Detroit, MI 48227(313) 836-6301CLOSED NOWToday: 10:00 am - 2:00 pmTomorrow: 10:00 am - 2:00 pm11YEARS IN BUSINESSAdd to mybookThis listing has been added to mybook.This listing has been removed from mybook.ShareFACEBOOKGOOGLE +TWITTERemailsend to phoneSend to PhoneScott Memorial United Methodist Church15361 Plymouth Rd, Detroit, MI 48227(313) 836-6301Send this business listing as a text message to a mobile phone.I agree to the Terms and ConditionsCancelSendYour text message was sent.To opt out at anytime, send the word STOP to YP411.To get a help message, send the word HELP to YP411.There was an error sending your text.Please try again.Terms: The recipient of this text message may incur charges depending on their wireless carrier. Not all carriers are currently supported.E-MailScott Memorial United Methodist Church15361 Plymouth Rd, Detroit, MI 48227(313) 836-6301Send this business details to yourself or up to 5 friends.Up to 5 email addresses, separate addresses with a commaSend Yourself a CopyCancelSendVisit WebsiteSuggest an EditIs this your business? Customize this page.Claim this businessBusiness DetailsCouponsGalleryReviewsSponsored LinksHoursRegular HoursMon - Fri10:00 am - 2:00 pmPayment methoddiscoverNeighborhoodBrooksAKAScott Memorial Untd Mthdst ChrOther Linkshttp://www.scottumc.orghttp://www.umc.orgCategoriesUnited Methodist Churches, Methodist Churches, Churches & Places of Worship CouponsNo deals available. Claim this business to add deals.Claim this businessGalleryBe the first to add a photo!Add a PhotoReviewsHi there!Be the first to review!5First-class4Better than most3About what I expected2Not the worst...1DisappointingClick to RateShare ReviewLike this review? Share it on your social network to get the word out!ShareTweetShareWant to just link to it instead? Copy URL above and paste away!Sponsored LinksMap & DirectionsPeople Also ViewedOak Grove AME Church(3)19801 Cherrylawn St, Detroit, MICalvary Tabernacle of Detroit8320 Greenfield Rd, Detroit, MITemple Of Faith Baptist Church(1)15801 W Chicago St, Detroit, MIThe Lord Is There A Christian Ministry16134 Plymouth Rd, Detroit, MIGrace Community Church Of Detroit9340 Vaughan St, Detroit, MIPaid AdvertisementAboutAbout UsSite FeedbackContact UsAdvertise with UsCareers - We're HiringCorporate BlogEngineering BlogLegal

value: This website is a United States-based web site operated by YP Holdings that provides listings for local businesses. In 2013 it was re-branded as YP.com or simply "YP".