|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Variables selection methods in near-infrared spectroscopy显示文摘 | Zou Xiaobo Zhao Jiewen Malcolm J.W. Povey Mel Holmes Mao Hanpin | 2010 | Analytica Chimica Acta2010，，1： | 1 |
| 2 | Variables selection methods in near-infrared spectroscopy显示文摘 | Zou Xiaobo Zhao Jiewen Malcolm J W P Mel H Mao Hanpin | 2010 | Analytica Chimica Acta2010，667，： | 1 |
| 3 | Service quality of travel agents:the case of travel agents in Hong Kong显示文摘 | Lam Terry Zhang Hanpin Qiu | | 0，，： | 1 |
| 4 | In vivo noninvasive detection of chlorophyll distribution in cucumber ( Cucumis sativus ) leaves by indices based on hyperspectral imaging显示文摘 | Zou Xiaobo Shi Jiyong Hao Limin Zhao Jiewen Mao Hanpin Chen Zhenwei Li Yanxiao Mel Holmes | 2011 | Analytica Chimica Acta2011，，1： | 1 |
| 5 | Variables selection methods in near-infrared spectroscopy显示文摘 | Zou Xiaobo Zhao Jiewen Malcolm J.W. Povey Mel Holmes Mao Hanpin | 2010 | Analytica Chimica Acta2010，，1： | 1 |
| 6 | Behavioural equivalences of a probabilistic pi-calculus显示文摘Although different kinds of probabilistic π-calculus have been introduced and found their place in quantitative verification and evaluation,their behavioural equivalences still lack a deep investigation.We propose a simple probabilistic extension of the π-calculus,π p,which is inspired by Herescu and Palamidessi's probabilistic asynchronous π-calculus.An early semantics of our π p is presented.We generalise several classic behavioural equivalences to probabilistic versions,obtaining the probabilistic(strong) barbed equivalence and probabilistic bisimulation for π p.Then we prove that the coincidence between the barbed equivalence and bisimilarity in the π-calculus is preserved in the probabilistic setting. | CHEN WeiEn CAO YongZhi WANG HanPin | 2012 | Science China(Information Sciences)2012，55，9： | 0 |
| 7 | Formal Verification of Data Modifications in Cloud Block Storage Based on Separation Logic显示文摘Cloud storage is now widely used,but its reliability has always been a major concern.Cloud block storage(CBS)is a famous type of cloud storage.It has the closest architecture to the underlying storage and can provide interfaces for other types.Data modifications in CBS have potential risks such as null reference or data loss.Formal verification of these operations can improve the reliability of CBS to some extent.Although separation logic is a mainstream approach to verifying program correctness,the complex architecture of CBS creates some challenges for verifications.This paper develops a proof system based on separation logic for verifying the CBS data modifications.The proof system can represent the CBS architecture,describe the properties of the CBS system state,and specify the behavior of CBS data modifications.Using the interactive verification approach from Coq,the proof system is implemented as a verification tool.With this tool,the paper builds machine-checked proofs for the functional correctness of CBS data modifications.This work can thus analyze the reliability of cloud storage from a formal perspective. | Bowen ZHANG Zhao JIN Hanpin WANG Yongzhi CAO | 2024 | Chinese Journal of Electronics2024，33，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员