2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications最新文献

Trusted Block as a Service: Towards Sensitive Applications on the Cloud 可信块即服务:面向云上的敏感应用

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.13

J. Hao, Wentong Cai

引用次数: 9

Object-Level Data Model for Keyword Search over Relational Databases 关系型数据库关键字搜索的对象级数据模型

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.185

Jun Zhang, Renjun Shao

{"title":"Object-Level Data Model for Keyword Search over Relational Databases","authors":"Jun Zhang, Renjun Shao","doi":"10.1109/TrustCom.2011.185","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.185","url":null,"abstract":"Keyword Search Over Relational Databases(KSORD) has been widely studied in recent years. However, existing KSORD methods are usually based on schema graph or data graph and they are actually tuple-level methods. That is, the retrieved objects are direct tuple-level relational data, and the retrieval results are tuple-connected trees which are difficult to be understood by end-users. There are still much work to do to further improve the effectiveness and efficiency of existing KSORD methods. The essential cause is that an entity is usually divided into some parts stored in different tables due to normalized relational database design. In fact, the relational data model is storage-oriented rather than end-user-oriented. Therefore, a novel method called Object-level Keyword Search Over Relational Databases(OKSORD) is proposed in this paper. In OKSORD method, relational data are modeled as an object-level data graph, in which each node may consist of several tuples to present the complete information of an entity. There are two key issues in OKSORD method, one is object-level data modeling for relational databases, the other is object-level searching and ranking based on object-level data graph. This paper mainly addresses the first issues. The main contributions are as follows. Firstly, the concept of OKSORD is introduced for the first time. Secondly, an algorithm for classifying relation schemas is proposed to partition relations into four categories: primary relations, secondary relations, linked relations and coding relations. Finally, an object-level data model for relational data is defined and the algorithm for generating corresponding object-level data graph is proposed.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121809982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributed Private-Key Generation Scheme with Self-Certified Identity 具有自我认证身份的分布式私钥生成方案

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.65

Yongming Xie, Guojun Wang

引用次数: 0

Probabilistic Schedulability Guarantees for Dependable Real-Time Systems under Error Bursts 突发错误下可靠实时系统的概率可调度性保证

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.157

Hüseyin Aysan, R. Dobrin, S. Punnekkat, Rolf Johansson

{"title":"Probabilistic Schedulability Guarantees for Dependable Real-Time Systems under Error Bursts","authors":"Hüseyin Aysan, R. Dobrin, S. Punnekkat, Rolf Johansson","doi":"10.1109/TrustCom.2011.157","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.157","url":null,"abstract":"The fundamental requirement for the design of effective and efficient fault-tolerance mechanisms in dependable real-time systems is a realistic and applicable model of potential faults, their manifestations and consequences. Fault and error models also need to be evolved based on the characteristics of the operational environments or even based on technological advances. In this paper we propose a probabilistic burst error model in lieu of the commonly used simplistic fault assumptions in the context of processor scheduling. We present a novel schedulability analysis that accounts for the worst case interference caused by error bursts on the response times of tasks scheduled under the fixed priority scheduling (FPS) policy. Further, we describe a methodology for the calculation of probabilistic schedulability guarantees as a weighted sum of the conditional probabilities of schedulability under specified error burst characteristics. Finally, we identify potential sources of pessimism in the worst case response time calculations and discuss potential means for circumventing these issues.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127114272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Decreasing SoC Test Power Dissipation and Test Data Volume Based on Pattern Recombination 基于模式重组降低SoC测试功耗和测试数据量

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.90

Chunlei Mei, Maoxiang Yi, Zhifei Shen

{"title":"Decreasing SoC Test Power Dissipation and Test Data Volume Based on Pattern Recombination","authors":"Chunlei Mei, Maoxiang Yi, Zhifei Shen","doi":"10.1109/TrustCom.2011.90","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.90","url":null,"abstract":"Ever-growing test data volume and test power dissipation poses significant cost and security challenges in testing core-based system-on-chip (SoC). In this paper, a test pattern recombination technique is proposed to improve test data compression and decrease scan test power dissipation. The proposed technique first analyzes the entropy of a test set, which is used to determine the maximum compression ratio, and then divides the test set into a group of patterns that are used as scan slices for scan test based on multi-scan chains. The probability of the compatibility between the patterns in every vector is calculated, according to which the patterns of each test vector are recombined so that the patterns with high compatible probability are placed closely. Finally, for all the test vectors in a test set, a unified arrangement order for their patterns is determined based on the goal that the test set can be compressed and the scan test power dissipation can be decreased to advantage. The proposed scheme is applied to ISCAS89 test benchmarks and their MinTest test sets are used. The experimental results show that compared to the recently presented scheme, the proposed technique can effectively ensure a high data compression ratio and reduce shift power dissipation during testing.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127176681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Reform and Practice of Training Engineering Professionals in 2C+E Computer Science 计算机工程专业2C+E专业人才培养的改革与实践

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.178

Jianbo Fan, Liangxu Liu, Rina Su, Hua Yu, Qingfeng Li

引用次数: 2

Phase-Wise Clustering of Time Series Gene Expression Data 时间序列基因表达数据的分相聚类

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.231

Poonam Goyal, Navneet Goyal, R. Karwa, M. John

{"title":"Phase-Wise Clustering of Time Series Gene Expression Data","authors":"Poonam Goyal, Navneet Goyal, R. Karwa, M. John","doi":"10.1109/TrustCom.2011.231","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.231","url":null,"abstract":"Extensive studies have shown that analyzing micro array time series data is important in bioinformatics research and biomedical applications. An observation in the analysis of gene expression data is that many genes have similarity in their expression patterns and therefore appear to be co-regulated. Previously, the time series gene expression data was analyzed mainly by checking the global similarities between the gene expression profiles and local similarities were overlooked. Local similarities can provide useful insight into gene behavior. In this paper, we propose a clustering algorithm for analyzing the time series gene expression data to identify the gene clusters based on the phase-wise local similarities in the cell cycle. Our approach exploits the fact that the genes which are involved in one phase of a cell cycle would have a characteristic profile for time points belonging to that phase and may not be involved in other phases. Moreover, a gene that is clustered with a set of genes in one phase might be involved with a different set of genes in other phases. In the proposed approach, we first clustered the genes at every time point of a phase and group genes with similar expression profiles, i.e., we group those genes together which remain in the same cluster at every time point within a phase. The functions of genes were obtained from Gene Ontology. In this paper, the results are presented for different phases of a cell cycle. Candidate genes are identified for these phases and their groups are analyzed. We found that the group of candidate genes had few genes which are known to be involved. Furthermore, some genes are found to be involved in more than one phase with different set of genes. Results presented show that local similarities can provide useful insight into gene behavior. Results are compared with an existing algorithm, STEM. We have used a saccharomyces cerevisiae cell cycle micro array database which is part of the Stanford Micro array Database (SMD).","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125964857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A Decision Making Ontology Building Process for Analytical Requirements Elicitation 面向分析需求的决策本体构建过程

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.212

Fahmi Bargui, H. Ben-Abdallah, J. Feki

引用次数: 6

Cross-Platform Application Sharing Mechanism 跨平台应用程序共享机制

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.77

Raja Naeem Akram, K. Markantonakis, K. Mayes

引用次数: 4

A Model for a Testbed for Evaluating Reputation Systems 评价信誉系统的试验台模型

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2011-11-16 DOI: 10.1109/TrustCom.2011.40

P. Chandrasekaran, B. Esfandiari

引用次数: 7