최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0658333 (2000-09-08) |
발명자 / 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 | 피인용 횟수 : 2 인용 특허 : 287 |
A method of monitoring a status condition of a first server with a second server in a server network, and also providing synchronization and messaging between the two servers, the method including: transmitting a software-generated pulse waveform from the first server to a device coupled to the firs
A method of monitoring a status condition of a first server with a second server in a server network, and also providing synchronization and messaging between the two servers, the method including: transmitting a software-generated pulse waveform from the first server to a device coupled to the first server, wherein the software-generated pulse waveform is comprises a first command corresponding to a logic level low and a second command corresponding to a logic level high; setting said device to a first state during logic level lows of said pulse waveform and to a second state during logic level highs of said pulse waveform; receiving the software-generated pulse waveform with the second server by determining when said device is in the first state and when it is in the second state; and determining when said device no longer changes from the first state to the second state. In order to provide synchronization and messaging, said pulse waveform is frequency modulated in order to communicate specified commands and/or reference points between the two servers.
A method of monitoring a status condition of a first server with a second server in a server network, and also providing synchronization and messaging between the two servers, the method including: transmitting a software-generated pulse waveform from the first server to a device coupled to the firs
A method of monitoring a status condition of a first server with a second server in a server network, and also providing synchronization and messaging between the two servers, the method including: transmitting a software-generated pulse waveform from the first server to a device coupled to the first server, wherein the software-generated pulse waveform is comprises a first command corresponding to a logic level low and a second command corresponding to a logic level high; setting said device to a first state during logic level lows of said pulse waveform and to a second state during logic level highs of said pulse waveform; receiving the software-generated pulse waveform with the second server by determining when said device is in the first state and when it is in the second state; and determining when said device no longer changes from the first state to the second state. In order to provide synchronization and messaging, said pulse waveform is frequency modulated in order to communicate specified commands and/or reference points between the two servers. ne network; a telephone terminal, connected via said telephone network to said service processing center, for receiving a speech signal, fully recognizing said speech signal in accordance with a speech recognition software module, and acquiring said speech recognition result, said speech recognition result being transmitted from said telephone terminal via said telephone network to said service processing center, said speech response signal being transmitted from said service processing center via said telephone network to said telephone terminal, said speech recognition software module being downloaded from said service processing center via said telephone network to said telephone terminal, wherein said speech recognition software module includes a speech recognition program section and a data section, wherein said data section includes a test pattern section, said telephone terminal carrying out determination of deterioration of lines between said telephone network and said telephone terminal, and wherein said telephone terminal performs recognition of the speech signal in accordance with both the speech recognition software module and information concerning the deterioration of lines. y of cross-counts comprises initializing the cross-count array, stepping through the digital array, and each time two symbols appear within the digital array in the predefined contextual relationship, incrementing a cross-count in the cross-count array that corresponds to those two symbols in that predefined contextual relationship. 7. The method of claim 6, wherein the predefined contextual relationship comprises a relationship of symbol adjacency in the digital array. 8. The method of claim 1, further comprising iterating, for the purpose of assigning further symbols to the symbol reassignment pool, the steps of calculating at least one potential function and assigning the unassigned symbol with the largest potential function. 9. The method of claim 8, wherein the iterating step continues until all symbols from the M-ary alphabet have been assigned to the symbol reassignment pool. 10. The method of claim 9, further comprising generating a symbol reassignment table that assigns adjacent symbols in the symbol reassignment pool to consecutive symbols in a second alphabet. 11. The method of claim 1, wherein the at least one potential function for each of a set of candidate symbols comprises a left potential function Li,and wherein: C(Ui,Aj) represents the cross-count for the alphabet symbols Uiand Aj,wherein Uirepresents an unassigned symbol and Ajrepresents an assigned symbol; N represents the number of symbols presently assigned to the symbol reassignment pool; wL(N,j) represents a pool-distance-weighting function based on the number of pool positions from the current left end of the pool to the position of the assigned symbol Aj; and the left potential function for an unassigned symbol Uiis calculated as 12. The method of claim 11, wherein: dL(N,j) is the number of pool positions from the current left end of the pool to the assigned symbol Aj; and the pool-distance-weighting function wL(N,j) is inversely proportional to dL(N,j). 13. The method of claim 11, wherein: dL(N,j) is the number of pool positions from the current left end of the pool to the assigned symbol Aj; and the pool-distance-weighting function wL(N,j) is proportional to log2(1+1/dL(N,j)). 14. The method of claim 11, wherein: dL(N,j) is the number of pool positions from the current left end of the pool to the assigned symbol Aj; and the pool-distance-weighting function wL(N,j) is proportional to αdL(N,j) , where 0i,and wherein: wR(N,j) represents a pool-distance-weighting function based on the number of pool positions from the current right end of the pool to the position of the assigned symbol Aj; and the right potential function for an unassigned symbol Uiis calculated as 16. The method of claim 15, wherein: dR(N,j) is the number of pool positions from the current right end of the pool to the assigned symbol Aj; and the pool-distance-weighting function wR(N,j) is inversely proportional to dR(N,j). 17. The method of claim 15, wherein: dR(N,j) is the number of pool positions from the current right end of the pool to the assigned symbol Aj; and the pool-distance-weighting function wR(N,j) is proportional to log2(1+1/dR(N,j)). 18. The method of claim 1, wherein calculating at least one potential function comprises calculating at least one potential function for a pair of unassigned symbols, and wherein assigning the unassigned symbol with the larg est potential function further comprises assigning the other symbol of the pair generating the largest potential function to the position selected for the other symbol for calculation of that largest potential function. 19. The method of claim 18, wherein calculating at least one potential function for a pair of unassigned symbols comprises calculating potential functions for at least six possible symbol assignments, wherein Uiand Ujare the unassigned symbols of the pair, P represents the symbols already in the pool, and the six possible symbol arrangements are: UiUjP, PUiUj,UiPUj,UjUiP, PUjUi,and UjPUi. 20. The method of claim 1, wherein the symbol reassignment pool is a vector, the size of the symbol reassignment pool is approximately twice M, and wherein the seed position of the pool is approximately in the middle of the pool, the method further comprising, after assigning the symbols of the M-ary alphabet to the symbol reassignment pool, assigning sequential reassignment symbols to the pool-ordered symbols, and mapping the symbol values in the digital array from the original M-ary alphabet to the corresponding reassignment symbols. 21. The method of claim 1, wherein the symbol reassignment pool is a two-dimensional array. 22. An article of manufacture comprising a computer-readable medium, the computer-readable medium containing a program that configures a processor to execute the method of claim 2. 23. A digital data compressor comprising: a symbol mapper to accept a digital array of symbol values drawn from an M-ary alphabet and generate, according to the method of claim 2, a symbol reassignment table; an array reindexer to reindex the digital array to a new alphabet of symbol values according to the symbol reassignment table; and an encoder to compress the reindexed digital array.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.