• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    专

    Light emitting droplets and related methods

    KR1085564A
    发明人
    Timothy M. Swager, Sara N. Nagelberg, Mathias Kolle, Lukas Zeininger, Kent Harvey, Myles Herbert
    受让人
    Massachusetts Institute of Technology
    申请人
    Samsung Electronics Co. Ltd.
    申请号
    3305964
    申请日
    1982-04-23
    公开(公告)号
    KR1085564A
    公开(公告)日
    1982-05-12
    IPC分类号
    B21B038/00
    CPC分类号
    -
    优先权号
    129773
    优先权日
    1995-04-27
    摘要

    NOVELTY - The method involves introducing a state variable representing a maintenance action and efficiency measure representing degrading performance of a compressor. An overall cost function representing additional system costs related to degradation in performance is set based on cost-estimate, measure, cost-forecasts and variable. The cost function is minimized with respect to the state variable to schedule the action.

    USE - Used for scheduling a maintenance action e.g. washing event, of a compressor of a gas turbine (claimed).

    ADVANTAGE - The maintenance action is scheduled by minimizing the cost function with respect to the state variable, in order to optimize the scheduling of the compressor maintenance action. The performance of the compressor is thus improved so as to increase the efficiency of the gas turbine.

    DESCRIPTION OF DRAWING(S) - The drawing shows an evolution of compressor efficiency.

    权利要求
    1. A stretching exerciser comprising: a base for positioning on a floor; a seat bar having a bottom end pivoted to said base and a top end; a back cushion fastened pivotally with the top end of said seat bar and forwardly backwardly turnable relative to said seat bar, said back cushion being closely attached to said seat bar due to the effect of the gravity weight thereof when receiving no external force; a seat mounted on said seat bar below said back cushion; and a spring bar for supporting said seat bar on said base in a backwardly tilted position, said spring bar having a bottom end coupled to said base and a top end coupled to said seat bar.
    2. The stretching exerciser as claimed in claim 1 , further comprising two elastic cord members provided at two sides of said base, said elastic cord members each having one end provided with handle means for the holding of the user's hands or hooking of the user's legs to stretch said elastic cord members.
    3. The stretching exerciser as claimed in claim 2 , wherein said base comprises two pairs of pulleys symmetrically disposed at front and rear sides thereof; said elastic cord members are respectively extended through said pulleys.
    4. The stretching exerciser as claimed in claim 1 , wherein said base comprises a front transverse bar, a rear transverse bar, and a longitudinal bar connected between said front transverse bar and said rear transverse bar; the bottom end of said seat bar is pivoted to said longitudinal bar.
    5. The stretching exerciser as claimed in claim 4 , wherein said longitudinal bar is a retractable bar connected between said front transverse bar and said rear transverse bar for enabling said front transverse bar to be moved forwards and backwards relative to said rear transverse bar, said longitudinal bar having a lock screw for locking said front transverse bar in position.
    6. The stretching exerciser as claimed in claim 1 , wherein said base comprises a leg extension bar at a front side thereof for the hooking of the user's legs.
    7. The stretching exerciser as claimed in claim 1 , wherein said seat bar is a retractable bar having a fixed end pivoted to said base and a movable end pivoted to said back cushion.
    8. The stretching exerciser as claimed in claim 1 , wherein said seat comprises a seat pad and two parallel seat frame bars fixedly provided at a bottom side of said seat pad, said sear frame bars each having a rear end protruding over a rear side of said seat pad and bilaterally pivoted to a back side of said seat bar; said seat bar has a front side provided with a horizontally extended detachable axle for supporting said seat frame bars of said seat in a position not parallel to said seat bar.
    9. The stretching exerciser as claimed in claim 8 , wherein said seat bar comprises two horizontal barrels disposed at the front side thereof at different elevations; said axle is selectively mounted in one of said horizontal barrels.
    10. The stretching exerciser as claimed in claim 1 , wherein said spring bar has the bottom end pivoted to said base and the top end detachably pivoted to said seat bar such that when the top end of said spring bar is disconnected from said seat bar, said spring bar and said seat bar can be turned downward and closely attached to said base in horizontal.
    说明书
    [0001]BACKGROUND
    [0002]Encryption may be described as the process of encoding or altering information so as to limit access to the information to an authorized entity. If an unauthorized entity ascertains the encrypted information, absent a key that is used to decrypt the encrypted information, the encrypted information may be unintelligible to the unauthorized entity. The encrypted information may be referred to as ciphertext. The key may be generated by a process that generates pseudo-random encryption keys.
    [0003]BRIEF DESCRIPTION OF DRAWINGS Features of the present disclosure are illustrated by way of example and not limited in the following figure(s), in which like numerals indicate like elements, in which: FIG. 1 illustrates an example layout of a zone based key version encoding apparatus; FIG. 2 illustrates a table including zone value hexadecimal values; FIG. 3 illustrates an encryption flowchart to illustrate operation of the zone based key version encoding apparatus of FIG. 1 ; FIG. 4 illustrates a decryption flowchart to illustrate operation of the zone based key version encoding apparatus of FIG. 1 ; FIG. 5 illustrates an example block diagram for zone based key version encoding; FIG. 6 illustrates an example flowchart of a method for zone based key version encoding; and FIG. 7 illustrates a further example block diagram for zone based key version encoding.
    [0004]DETAILED DESCRIPTION
    [0005]For simplicity and illustrative purposes, the present disclosure is described by referring mainly to examples. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. It will be readily apparent however, that the present disclosure may be practiced without limitation to these specific details. In other instances, some methods and structures have not been described in detail so as not to unnecessarily obscure the present disclosure.
    [0006]Throughout the present disclosure, the terms “a” and “an” are intended to denote at least one of a particular element. As used herein, the term “includes” means includes but not limited to, the term “including” means including but not limited to. The term “based on” means based at least in part on.
    [0007]Zone based key version encoding apparatuses, methods for zone based key version encoding, and non-transitory computer readable media having stored thereon machine readable instructions to provide zone based key version encoding are disclosed herein. The apparatuses, methods, and non-transitory computer readable media disclosed herein provide for the storage of a key version within parts of a binary-coded-decimal (BCD) format known as zone bits, and therefore storage of the key version as metadata embedded in a binary-coded-decimal value. The storage of the key version as metadata embedded in a binary-coded-decimal value eliminates the need for an external storage to separately store the key version. Thus, by storage of the key version as metadata embedded in a binary-coded-decimal value, storage systems need not be modified in that the need for a secondary storage source for the key version is eliminated.
    [0008]With respect to storage of a key version as metadata embedded in a binary-coded-decimal value, format preserving encryption (FPE) is a form of encryption that does not change the underlying layout of data such that an encrypted version of the data looks like valid data and can be placed in databases or data stores without changing the data schema. For example, binary-coded-decimal numbers may be encrypted by using format preserving encryption such that the numbers still maintain the same format when encrypted. The encryption utilizes a secret key, and often the key is selected from a list of keys. The key version of the selected key needs to be stored in some way so the encrypted data can be decrypted using the correct key. However, storage of the key version may entail a change in the database or data store schema, which can add technical complexities to the storage of the key version.
    [0009]An encrypt/decrypt operation may use a key value, and the key value may need to be stored securely as it may represent the fundamental secret permitting encryption/decryption operations. A system may rotate through different keys from a key set so that if any one key is compromised, the effect of the compromised key may be limited to those values encrypted with the compromised key. Such a system may need a key version for a key used for each encrypted value to be stored in some way to permit future decryption.
    [0010]For example, the key version to encrypt the number 1.23 may be three (e.g., the third key in a set), and the associated key may encrypt the number to 9.46. In this case the encrypted number, as well as the key version, would need to be stored in a same database, or in different databases. The need to store the key version presents technical challenges with respect to maintaining datastore/database schema.
    [0011]In order to address at least these technical challenges associated with storage of a key version associated with a key for encryption/decryption of a number, the apparatuses, methods, and non-transitory computer readable media disclosed herein provide for storage of the key version within parts of a binary-coded-decimal format. In this regard, storage of the key version within parts of the binary-coded-decimal format obviates the need for separate storage of the key version, and/or database or data store schema changes.
    [0012]For the apparatuses, methods, and non-transitory computer readable media disclosed herein, in order to store the key version as metadata embedded in a binary-coded-decimal value, one or more of the zone representations for a binary-coded-decimal may be identified, and appropriate zone values may be used to represent the key version used for the encryption. When decrypting, the zones may first be extracted, and the key version used may be determined from the extracted zones. Thus, by storage of the key version within parts of the binary-coded-decimal format, key version security is increased in that the need for a secondary storage source for the key version is eliminated.
    [0013]For the apparatuses, methods, and non-transitory computer readable media disclosed herein, modules, as described herein, may be any combination of hardware and programming to implement the functionalities of the respective modules. In some examples described herein, the combinations of hardware and programming may be implemented in a number of different ways. For example, the programming for the modules may be processor executable instructions stored on a non-transitory machine-readable storage medium and the hardware for the modules may include a processing resource to execute those instructions. In these examples, a computing device implementing such modules may include the machine-readable storage medium storing the instructions and the processing resource to execute the instructions, or the machine-readable storage medium may be separately stored and accessible by the computing device and the processing resource. In some examples, some modules may be implemented in circuitry.
    [0014]FIG. 1 illustrates an example layout of a zone based key version encoding apparatus (hereinafter also referred to as “apparatus 100 ”).
    [0015]Referring to FIG. 1 , the apparatus 100 may include a data ascertaining module 102 to ascertain data 104 that is to be encrypted. According to an example, the ascertained data may include a binary-coded-decimal number.
    [0016]A key ascertaining module 106 is to ascertain a key 108 , including a key version 110 , that is to be used to encrypt the data 104 .
    [0017]An encryption module 112 is to generate encrypted data 114 by encrypting the data 104 based on the ascertained key 108 . According to an example, the encryption module 112 is to generate the encrypted data 114 by applying format preserving encryption to encrypt the data 104 based on the ascertained key 108 .
    [0018]A zone determination module 116 is to determine a zone 118 representing the key version 110 . According to an example, the zone determination module 116 is to determine the zone 118 representing the key version 110 by converting a decimal value of the key version 110 to a binary value, determining a binary zone value from the binary value, and converting the binary zone value to the zone 118 representing the key version 110 .
    [0019]An encrypted zoned data generation module 120 is to generate encrypted zoned data 122 by applying the determined zone 118 to the encrypted data 114 to encode the key version 110 . According to an example, the encrypted zoned data generation module 120 is to generate the encrypted zoned data 122 by applying the determined zone 118 to the encrypted data 114 to encode the key version 110 by determining a byte corresponding to the encrypted data 114 , and inserting the zone 118 representing the key version 110 into the byte corresponding to the encrypted data 114 .
    [0020]A key version storage module 124 is to store the encrypted zoned data 122 including the encoded key version 110 .
    [0021]With respect to decryption of the encrypted data 114 , a decryption module 126 is to ascertain the encrypted zoned data 122 . For example, the decryption module 126 is to ascertain the encrypted zoned data 122 at a subsequent time after generation of the encrypted zoned data 122 , when the encrypted data 114 is to be decrypted.
    [0022]The decryption module 126 is to extract the zone 118 representing the key version 110 from the ascertained encrypted zoned data 122 .
    [0023]The decryption module 126 is to determine, from the extracted zone 118 representing the key version 110 , a decimal value corresponding to the key version 110 . According to an example, the decryption module 126 is to determine, from the extracted zone 118 representing the key version 110 , the decimal value corresponding to the key version 110 by converting the extracted zone 118 representing the key version 110 to a binary value, and converting the binary value to the decimal value corresponding to the key version 110 .
    [0024]The decryption module 126 is to ascertain the key 108 corresponding to the determined decimal value corresponding to the key version 110 .
    [0025]The decryption module 126 is to extract the encrypted data 114 from the encrypted zoned data 122 . According to an example, the decryption module 126 is to extract the encrypted data 114 from the encrypted zoned data 122 by removing a zone bit from the encrypted zoned data 122 .
    [0026]The decryption module 126 is to decrypt the extracted encrypted data 114 based on the ascertained key 108 corresponding to the determined decimal value corresponding to the key version 110 .
    [0027]Referring to FIGS. 1-4 , operation of the elements of the apparatus 100 is described in further detail.
    [0028]FIG. 2 illustrates a table including zone value hexadecimal values.
    [0029]Referring to FIG. 2 , the binary-coded-decimal format may represent a format of encoding decimal numbers 0 to 9 in a standard byte (8 bits). One version of the binary-coded-decimal format may divide the binary-coded-decimal byte into two parts. The lower four bits may represent the decimal number, and the upper four bits may represent “zone” values. A zone format may use the upper three bits to represent a zone value and its least significant bit of the upper four bits to represent the sign bit. The table of FIG. 2 illustrates zone value hexadecimal values.
    [0030]Referring to FIG. 2 , the values 29, 62, D1 may respectively represent the binary-coded-decimal digits 9, 2, −1, and concatenated together would represent the decimal value −921. In this case, a negative value is inferred if one or more of the individual binary-coded-decimal values is negative.
    [0031]There are other forms of zone values that limit the available zones. One form includes the Extended Binary Coded Decimal Interchange Code (EBCDIC) standard. This standard defines four positive zones A*, C*, E* and F*, and two negative zones B* and D*, where ‘*’ is the actual number of digits 0 through 9.
    [0032]A zone may be enumerated as shown in FIG. 2 , and the enumeration value may be used as a key identifier for binary-coded-decimal digits. For example, a value from 0 to 9 or −0 to −9 may be one of 8 possible zones, and when the value is encrypted with, for example, the 5 th key in a key set, then zone 4 would be used (e.g., hex values 80 to 89 or 90 to 99 as shown in FIG. 2 ). For example, the encrypted value 8 would be represented by 88, and the encrypted value −8 would be represented by 98 (both from zone 4).
    [0033]In this regard, extended key sets may be created by representing values by a minimum number of digits. For example, the value 3 may be represented as 03, and thus two zone digits would be used, permitting up to 64 key versions. For example, the zone digits 37, 21 represent the number −71, and the two zones used are 3 and 1, respectively (e.g., see FIG. 2 ). In binary, these zones may be represented as 011 and 001. Concatenating these zones results in binary 011001, which is equivalent to hex value 19, or decimal 25. The decimal 25 in this case may be defined as combined zone 25 (combined zones would span 0 through 63), which is the 26 th ordinal zone, and may therefore represent key version 26.
    [0034]FIG. 3 illustrates an encryption flowchart to illustrate operation of the apparatus 100 .
    [0035]At block 300 , the data ascertaining module 102 is to ascertain the data 104 (e.g., a binary-coded-decimal value) that is to be encrypted. For example, the data 104 may include an unencrypted binary-coded-decimal value “39” represented as two bytes 03h 09h. In this case, two binary-coded-decimal digits provide two zones of three bits each, totaling 6 bits, which may represent up to 64 values.
    [0036]At block 302 , the key ascertaining module 106 is to ascertain a key 108 (e.g., from a key set at 304 ; see also block 306 ), including a key version 110 (see also block 308 ), that is to be used to encrypt the data 104 .
    [0037]At block 310 , the encryption module 112 is to generate encrypted data 114 (e.g., see also block 312 ) by encrypting the data 104 based on the ascertained key 108 . According to an example, the encryption module 112 is to generate the encrypted data 114 by applying format preserving encryption to encrypt the data 104 based on the ascertained key 108 . For example, assuming that the encrypted data 114 includes a value of “53”, the encrypted binary-coded-decimal value “53” may be represented as two bytes 05h 03h.
    [0038]At block 314 , the zone determination module 116 is to determine a zone 118 (e.g., see also block 316 ) representing the key version 110 . For example, assuming that the key version 110 is “21”, decimal value 21 is hex value 15h, or bit value 00010101, which may be represented as zone 010 (2) and zone 101 (5) (e.g., see FIG. 2 ).
    [0039]At block 318 , the encrypted zoned data generation module 120 is to generate the encrypted zoned data 122 (e.g., see also block 320 ) by applying the determined zone 118 to the encrypted data 114 to encode the key version 110 . For example, zone (2) and zone (5) may be applied to generate the encrypted zoned data 122 as two bytes 25h 53h.
    [0040]FIG. 4 illustrates a decryption flowchart to illustrate operation of the apparatus 100 .
    [0041]At block 400 , the decryption module 126 is to ascertain the encrypted zoned data 122 . For example, the encrypted zoned data 122 may include encrypted binary-coded-decimal zoned value “53” represented as two bytes 25h 53h.
    [0042]At block 402 , the decryption module 126 is to extract the zone 118 representing the key version 110 (e.g., see also block 404 ) from the ascertained encrypted zoned data 122 . For example, the decryption module 126 is to extract zone values 2 and 5 (e.g., binary 010 and 101).
    [0043]At block 406 , the decryption module 126 is to ascertain the key 108 (e.g., see also blocks 408 and 410 ) corresponding to the determined decimal value corresponding to the key version 110 . For example, the binary values 010 and 101 may be combined to generate binary 010101, which is decimal value 21 (representing the key version).
    [0044]At block 412 , the decryption module 126 is to extract the encrypted data 114 (e.g., see also block 414 ) from the encrypted zoned data 122 . For example, the decryption module 126 is to extract the encrypted data 114 as binary-coded-decimal value “53” represented as bytes 05h 03h.
    [0045]At block 416 , the decryption module 126 is to decrypt (e.g., see also block 418 ) the extracted encrypted data 114 based on the ascertained key 108 corresponding to the determined decimal value corresponding to the key version 110 . For example, the decryption module 126 is to decrypt the binary-coded-decimal value “53” using key version “21”.
    [0046]At block 420 , the decryption module 126 is to convert the decrypted value from block 418 to a binary-coded-decimal representation to generate the final decrypted binary-coded-decimal value (e.g., see also block 422 ). For example, the final decrypted binary-coded-decimal value may be determined as decrypted binary-coded-decimal value “39” represented by two bytes 03h 09h.
    [0047]FIGS. 5-7 respectively illustrate an example block diagram 500 , an example flowchart of a method 600 , and a further example block diagram 700 for zone based key version encoding. The block diagram 500 , the method 600 , and the block diagram 700 may be implemented on the apparatus 100 described above with reference to FIG. 1 by way of example and not limitation. The block diagram 500 , the method 600 , and the block diagram 700 may be practiced in other apparatus. In addition to showing the block diagram 500 , FIG. 5 shows hardware of the apparatus 100 that may execute the instructions of the block diagram 500 . The hardware may include a processor 502 , and a memory 504 (i.e., a non-transitory computer readable medium) storing machine readable instructions that when executed by the processor cause the processor to perform the instructions of the block diagram 500 . The memory 504 may represent a non-transitory computer readable medium. FIG. 6 may represent a method for zone based key version encoding, and the steps of the method. FIG. 7 may represent a non-transitory computer readable medium 702 having stored thereon machine readable instructions to provide zone based key version encoding. The machine readable instructions, when executed, cause a processor 704 to perform the instructions of the block diagram 700 also shown in FIG. 7 .
    [0048]The processor 502 of FIG. 5 and/or the processor 704 of FIG. 7 may include a single or multiple processors or other hardware processing circuit, to execute the methods, functions and other processes described herein. These methods, functions and other processes may be embodied as machine readable instructions stored on a computer readable medium, which may be non-transitory (e.g., the non-transitory computer readable medium 702 of FIG. 7 ), such as hardware storage devices (e.g., RAM (random access memory), ROM (read only memory), EPROM (erasable, programmable ROM), EEPROM (electrically erasable, programmable ROM), hard drives, and flash memory). The memory 504 may include a RAM, where the machine readable instructions and data for a processor may reside during runtime.
    [0049]Referring to FIGS. 1-5 , and particularly to the block diagram 500 shown in FIG. 5 , the memory 504 may include instructions 506 to ascertain data 104 that is to be encrypted.
    [0050]The processor 502 may fetch, decode, and execute the instructions 508 to ascertain a key 108 , including a key version 110 , that is to be used to encrypt the ascertained data 104 .
    [0051]The processor 502 may fetch, decode, and execute the instructions 510 to generate encrypted data 114 by encrypting the ascertained data 104 based on the ascertained key 108 .
    [0052]The processor 502 may fetch, decode, and execute the instructions 512 to determine a zone 118 representing the key version 110 .
    [0053]The processor 502 may fetch, decode, and execute the instructions 514 to generate encrypted zoned data 122 by applying the determined zone 118 to the encrypted data 114 to encode the key version 110 .
    [0054]The processor 502 may fetch, decode, and execute the instructions 516 to store the encrypted zoned data 122 including the encoded key version 110 .
    [0055]Referring to FIGS. 1-4 and 6 , and particularly FIG. 6 , for the method 600 , at block 602 , the method may include ascertaining encrypted zoned data 122 .
    [0056]At block 604 the method may include extracting a zone 118 representing a key version 110 from the ascertained encrypted zoned data 122 .
    [0057]At block 606 the method may include determining, from the extracted zone 118 representing the key version 110 , a decimal value corresponding to the key version 110 .
    [0058]At block 608 the method may include ascertaining a key 108 corresponding to the determined decimal value corresponding to the key version 110 .
    [0059]At block 610 the method may include extracting the encrypted data 114 from the encrypted zoned data 122 .
    [0060]At block 612 the method may include decrypting the extracted encrypted data 114 based on the ascertained key 108 .
    [0061]Referring to FIGS. 1-4 and 7 , and particularly FIG. 7 , for the block diagram 700 , the non-transitory computer readable medium 702 may include instructions 706 to ascertain a key 108 , including a key version 110 , that is to be used to encrypt data 104 .
    [0062]The processor 704 may fetch, decode, and execute the instructions 708 to generate encrypted data 114 by applying format preserving encryption to encrypt the data 104 based on the ascertained key 108 .
    [0063]The processor 704 may fetch, decode, and execute the instructions 710 to determine zones (e.g., a plurality of the zones 118 ) representing the key version 110 .
    [0064]The processor 704 may fetch, decode, and execute the instructions 712 to generate encrypted zoned data 122 by applying the determined zones to the encrypted data 114 to encode the key version 110 .
    [0065]The processor 704 may fetch, decode, and execute the instructions 714 to store the encrypted zoned data 122 including the encoded key version 110 .
    [0066]What has been described and illustrated herein is an example along with some of its variations. The terms, descriptions and figures used herein are set forth by way of illustration only and are not meant as limitations. Many variations are possible within the spirit and scope of the subject matter, which is intended to be defined by the following claims—and their equivalents—in which all terms are meant in their broadest reasonable sense unless otherwise indicated.
    同族专利
    暂无同族专利