发布求助
文献互助 智能选刊 最新文献

2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)最新文献

筛选
英文 中文
Trust Propagation and Aggregation in Wireless Sensor Networks 无线传感器网络中的信任传播与聚合
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.29
Haiguang Chen, Huafeng Wu, Xiu Cao, Chuanshan Gao
{"title":"Trust Propagation and Aggregation in Wireless Sensor Networks","authors":"Haiguang Chen, Huafeng Wu, Xiu Cao, Chuanshan Gao","doi":"10.1109/FCST.2007.29","DOIUrl":"https://doi.org/10.1109/FCST.2007.29","url":null,"abstract":"In a multi-hop wireless sensor networks (WSNs), these sensor nodes cooperate each other to form a network without using any infrastructure, which has a wide application due to their easy of deployment. But the security of WSNs is still an issue. Traditionally cryptographic mechanisms such as authentication and encryption only address part of the problem of security in WSNs. Recently, the use of reputation systems has become an important mechanism in WSNs. The trust management is still a very important problem for reputation systems in WSNs. In this paper we develop a formal treatment of trust management for WSNs. The main contribution of our paper is that we define two kinds of operators, propagation and aggregation. It can combine and diffuse trust rating of nodes in WSNs. Simulation results and analysis show that our proposed operators can detect the misbehavior sensor fast and limited the effect of malicious report the trust rating.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124602087","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}
引用次数: 20
Probabilistic Access Allocation of Disk Files for Energy-Efficient Server Systems 节能服务器系统中磁盘文件的概率访问分配
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.24
W. Qu, Masaru Kitrsregawa, Keqiu Li
{"title":"Probabilistic Access Allocation of Disk Files for Energy-Efficient Server Systems","authors":"W. Qu, Masaru Kitrsregawa, Keqiu Li","doi":"10.1109/FCST.2007.24","DOIUrl":"https://doi.org/10.1109/FCST.2007.24","url":null,"abstract":"Reducing energy consumption is an important issue for data centers. Among the various components of a data center, storage is one of the biggest energy consumers. Previous studies have shown that the average idle period for a server disk in a data center is very small compared to the time taken to spin down and spin up. This significantly limits the effectiveness of disk power management schemes. This article addresses the problem of energy-efficient storage management. More specifically, disk power mode as a measurement on energy consumption, response time as a measurement on system performance, and data popularity as a measurement on system workload are studied. The purpose of reduce energy consumption without significant degrading of system performance is realized by dynamically adjusting the power mode of disks and the location of data. A process policy is also proposed for user access. We proved that based on the constructed underlying infrastructure of server system, this policy leads to an optimal solution to the problem.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130254642","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
A Dynamic Metadata Equipotent Subtree Partition Policy for Mass Storage System 大容量存储系统的动态元数据等价子树分区策略
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.6
Gongye Zhou, Q. Lan, Jincai Chen
{"title":"A Dynamic Metadata Equipotent Subtree Partition Policy for Mass Storage System","authors":"Gongye Zhou, Q. Lan, Jincai Chen","doi":"10.1109/FCST.2007.6","DOIUrl":"https://doi.org/10.1109/FCST.2007.6","url":null,"abstract":"Metadata plays an important role in mass storage system. How to distribute and balance the metadata of the metadata server cluster determines the overall performance of a cluster. Two popular metadata distribution policies are the dynamic subtree policy and hashing policy, while the dynamic subtree partition is vulnerable to the imbalance workload and hashing partition has a random distribution which will incur a burst of network overhead when updating metadata. We present a novel approach for metadata management. It combines hash and subtree partitioning policies together to partition directory hierarchy tree into equipotent subtrees with a certain granularity and employs value of hashing subtree to distribute subtrees across the metadata servers. It also employs a balance strategy to adjust the metadata distribution dynamically. After adjustment, we present a hot spots elimination strategy to detect and reclaim hot spots in the file system efficiently. We also demonstrate a design using this strategy to achieve more efficient performance than the other policies using hashing partitioning and subtree partitioning purely.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131166086","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}
引用次数: 7
SDBIA: A Novel Approach to Improve the Reading Performance of Large Objects for Object-Based Storage Device SDBIA:一种提高基于对象存储设备大对象读取性能的新方法
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.27
Jingning Liu, Wanli Peng, F. Wang, Yinliang Yue
{"title":"SDBIA: A Novel Approach to Improve the Reading Performance of Large Objects for Object-Based Storage Device","authors":"Jingning Liu, Wanli Peng, F. Wang, Yinliang Yue","doi":"10.1109/FCST.2007.27","DOIUrl":"https://doi.org/10.1109/FCST.2007.27","url":null,"abstract":"Ext2 file system is optimized for the management of small files, however, the performance of managing large files is not perfect. The Object-based Storage Device of HOSS[1] (Huge Object-Based Storage System, HOSS) adopts ext2 as the underlying file system, so the performance of managing large objects is limited. Two strategies to improve the reading performance of large objects in OSDs are proposed in this paper. Firstly, local relativity of data blocks on disk is utilized to reconstruct the data block index addresses as Successive Data Blocks Index Array (SDBIA). SDBIA will be taken as one attribute of the object and then the performance of getting the data block index address of large objects will be improved obviously. Secondly, successive blocks allocation strategy is adopted. The experiment shows that these two strategies are effective for the performance of reading large objects.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131930688","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
Face Detection Based on LDA and NN 基于LDA和神经网络的人脸检测
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.18
Hiroyuki Kobayashi, Qiangfu Zhao
{"title":"Face Detection Based on LDA and NN","authors":"Hiroyuki Kobayashi, Qiangfu Zhao","doi":"10.1109/FCST.2007.18","DOIUrl":"https://doi.org/10.1109/FCST.2007.18","url":null,"abstract":"In this paper, we propose a new method for face detection by combining a modified linear discriminant analysis (M-LDA) and neural network (NN). Here, M-LDA is used for feature extraction, and NN is used to make the final decision. The M-LDA minimizes the variance within all \"face \" clusters, and at the same time, maximizes the variance between all \"face\" clusters and all \"non-face\" patterns. The feature space obtained by M-LDA has a dimensionality less than that of the original problem, and thus the complexity of the NN used in the second step can be greatly reduced. To validate the efficacy of the proposed method, we conducted several experiments with four methods, namely the proposed method, NN, PCA+NN, and LDA+NN. Results show that the proposed method can provide lower false positive and false negative errors for unknown test","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833602","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
Adaptable Scheduling Framework for Window-Based Real-Time Constraints 基于windows的实时约束的适应性调度框架
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.12
Gang Tu, Junlin Li, Fumin Yang
{"title":"Adaptable Scheduling Framework for Window-Based Real-Time Constraints","authors":"Gang Tu, Junlin Li, Fumin Yang","doi":"10.1109/FCST.2007.12","DOIUrl":"https://doi.org/10.1109/FCST.2007.12","url":null,"abstract":"This paper analyses the relationships of two types of window-based real-time constraint, the sliding and fixed window constraint. First, based on the definition of \"strict harder\", the paper gives out the computing system of window constraints. These analyses of the constraints are useful for designing the scheduling algorithms. Thereby, a scheduling framework that is capable of adapting to the changing environment is presented next, it bases on the idea that trying to guarantee unsolvable constraints is not as good as adjusting them. The scheduling framework modulates real-time system by adjusting the constraints on tasks so as to fit the changed resources. Last, evaluation results are presented to show that the scheduling framework is efficient and can largely decrease the mean rate of lost constraints for real-time tasks.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122047134","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
A Novel Security Risk Evaluation for Information Systems 一种新的信息系统安全风险评估方法
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.9
Zaobin Gan, Jiufei Tang, Ping Wu, V. Varadharajan
{"title":"A Novel Security Risk Evaluation for Information Systems","authors":"Zaobin Gan, Jiufei Tang, Ping Wu, V. Varadharajan","doi":"10.1109/FCST.2007.9","DOIUrl":"https://doi.org/10.1109/FCST.2007.9","url":null,"abstract":"Quantitative security risk evaluation of information systems is increasingly drawing more and more attention. This paper extends the attack tree model, and proposes a new quantitative risk evaluation method .While the risk value of the leaf node (atomic attack) is quantified, the multi- attribute utility theory is adopted. All algorithms are presented for each steps of this new evaluation method. In addition, a worked example is also experimented in this paper. The experimental result shows that the novel method can not only make the evaluation result more reasonable and objective, but also offer a good foundation for the implementation of the automatic evaluation tool.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122891072","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
Research on Architecture of Grid-Based Simulation Platform 网格仿真平台体系结构研究
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.25
Song Wu, Li Qi, Hai Jin, Heng He
{"title":"Research on Architecture of Grid-Based Simulation Platform","authors":"Song Wu, Li Qi, Hai Jin, Heng He","doi":"10.1109/FCST.2007.25","DOIUrl":"https://doi.org/10.1109/FCST.2007.25","url":null,"abstract":"This paper proposes a Grid-based Distributed Simulation Platform (GDSP). It is designed to break the limitation of legacy simulation supporting platform and to meet new requirements from large-scale, distributed, and complicated systems. Simulation services are encapsulated by using web services technology, and they are basic elements of GDSP. With grid technology, GDSP enables users to share, access, and operate remote resource transparently. It is also easier to organize and manage simulation resources. GDSP improves the capability of fault tolerance and provides mechanism of using simulation resources securely. The research result shows that through this management mechanism, multiple users can share and monitor RTI resources, and manage the simulation collaboratively and effectively. At the same time, the impact on real time of RTI caused by the system is minimum.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559254","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
Executing Query over Encrypted Character Strings in Databases 执行数据库加密字符串查询
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.17
Hong Zhu, Jing Cheng, Renchao Jin, Kevin Lü
{"title":"Executing Query over Encrypted Character Strings in Databases","authors":"Hong Zhu, Jing Cheng, Renchao Jin, Kevin Lü","doi":"10.1109/FCST.2007.17","DOIUrl":"https://doi.org/10.1109/FCST.2007.17","url":null,"abstract":"A query scheme which conducts fast LIKE query and range query over the encrypted character strings in databases is proposed in this paper. Firstly, a characteristics matrix is created for every character string in a sensitive attribute of a table to describe the characteristics of the character string. The characteristics matrix is also extended to describe the characteristics of a Chinese character string. Then the characteristics matrix is compressed to a bit string as the index of the character string and the bit string is stored into an index attribute of the sensitive attribute. Moreover, any LIKE query and range query over the sensitive attribute are converted into the queries over the index attribute. Suitable length m for the index attribute and the number of random functions k are selected after we balance the tradeoff between security and efficiency. Finally, we evaluate the efficiency and performance of queries over the encrypted character string. The experimental results indicate the performance for the queries in our scheme has been improved.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073131","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}
引用次数: 13
A Prototype for Active Service System 主动服务系统的原型
2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007) Pub Date : 2007-11-01 DOI: 10.1109/FCST.2007.10
M. Sha, Ming Chen, Yuebin Bai, Boliang Chen, Xiaocong Wang
{"title":"A Prototype for Active Service System","authors":"M. Sha, Ming Chen, Yuebin Bai, Boliang Chen, Xiaocong Wang","doi":"10.1109/FCST.2007.10","DOIUrl":"https://doi.org/10.1109/FCST.2007.10","url":null,"abstract":"Active services is a promising technology and notion in relieving user from burdensome search for meaningful information, which is a problem becoming more serious for the information explosion on Internet and increasingly popular usage of wireless networks terminals. This paper presents a smart prototype for active service system which has a novel index tree-trace map model centralized, wireless networks environment based architecture. The prototype can automatically perceive user requirement by analyzing environment parameters and user information basing on preset rules and system knowledge of operation history, forwardly provide customized service for user. A well-operated experimental system is introduced here as well.","PeriodicalId":211808,"journal":{"name":"2007 Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST 2007)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121580836","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书