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

2008 International Symposium on Computer Science and Computational Technology最新文献

筛选
英文 中文
Design and Implementation of XML-based GUI for Cross Platform Backup System 基于xml的跨平台备份系统GUI的设计与实现
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.275
Huajun Chen, Zhi Zheng
{"title":"Design and Implementation of XML-based GUI for Cross Platform Backup System","authors":"Huajun Chen, Zhi Zheng","doi":"10.1109/ISCSCT.2008.275","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.275","url":null,"abstract":"It is important for modern enterprise to backup business data. The heterogeneous databases and systems can be protected and stored by network data backup system. A design of XML-based GUI for cross platform backup system is proposed, by which user can centrally backup and restore data. The plug-in enabled architecture of the GUI can improve system compatibility, reliability and flexibility. Finally, a method is given to define the GUI with XML.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132290673","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}
引用次数: 2
A Layered Service Registry Model in Government Information Resource Governance and Interchange 政府信息资源治理与交换中的分层服务注册模型
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.288
Jun Liu, Jianzhong Qiao, Shukuan Lin, S. Ge
{"title":"A Layered Service Registry Model in Government Information Resource Governance and Interchange","authors":"Jun Liu, Jianzhong Qiao, Shukuan Lin, S. Ge","doi":"10.1109/ISCSCT.2008.288","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.288","url":null,"abstract":"Government information resource catalog and interchange is becoming a very important domain in IT construction these years. Chinese government has put great attention to this area. This paper outlines specific features and issues of China¿s government information resource catalog and exchange. A government information resource and service registry model is presented accordingly, and considerations of security control, large scale catalog synchronization, and practical engineering methodology are discussed extensively.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133124363","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 New Security Mechanism Based on SIP in Wireless LAN-3G Integration 基于SIP的无线LAN-3G集成安全机制
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.23
Hui Lin, Li Xu, Xiaoding Wang
{"title":"A New Security Mechanism Based on SIP in Wireless LAN-3G Integration","authors":"Hui Lin, Li Xu, Xiaoding Wang","doi":"10.1109/ISCSCT.2008.23","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.23","url":null,"abstract":"The traditional security enforcement approach of network is employing cryptography and authentication scheme. However, we consider that the conventional view of security based on cryptography alone is not sufficient for the wireless LAN and Third-generation (3G) integration networks against malicious or non-malicious insertion of data from internal adversaries or faulty nodes. In this paper, we propose a trust degree-based dynamic model for wireless LAN and 3G integration networks where nodes maintain trust degree for other nodes meanwhile the trust degree is applied to evaluate their trustworthiness. Finally the conclusion is made by verifying the performance of this model through some preliminary simulation results.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133785880","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
Adding Extension Models to Government Business Model 为政府业务模型添加扩展模型
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.137
Tianying Chen, Bosheng Zhou, Shaomin Xing, Yong Yang
{"title":"Adding Extension Models to Government Business Model","authors":"Tianying Chen, Bosheng Zhou, Shaomin Xing, Yong Yang","doi":"10.1109/ISCSCT.2008.137","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.137","url":null,"abstract":"Government business model (GBM) is used to depict business processes of governments. It includes three basic models, which are process model, organization model and resource model. But these three models can not depict the collaboration relation between the infrastructure elements (including organization model elements and resource model elements) or the information flow in a government business process. In this paper, we proposed collaboration model and information model as extension models for GBM. Also, formal definitions for collaboration model and information model were given, including model definition, element definition and relationship definition. Finally, the system architecture of government business modeling system (GBMS) was presented. The two extension models greatly improved the expression abilities of business model and made GBM more complete and accurate. After a year of practice, it has been found that the extended GBM and its supporting tool GBMS can be effectively used for business process catalogue and information resource planning.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124171314","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}
引用次数: 2
Phased Waking Coverage Scheme Based on Hibernation of Redundant Nodes for Wireless Sensor Networks 基于冗余节点休眠的无线传感器网络分阶段唤醒覆盖方案
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.36
Chen-Hsiang Feng, Jiang Peng, He Qing
{"title":"Phased Waking Coverage Scheme Based on Hibernation of Redundant Nodes for Wireless Sensor Networks","authors":"Chen-Hsiang Feng, Jiang Peng, He Qing","doi":"10.1109/ISCSCT.2008.36","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.36","url":null,"abstract":"We propose a phased waking three dimensional coverage scheme based on hibernation of redundant nodes for the limited energy of nodes and redundancy in wireless sensor networks. A large number of sensor nodes are randomly deployed in the monitoring region and the redundant nodes can hibernate which will be waken by phases after the on-duty nodes are exhausted. Each node¿s state can be determined at any moment until all of the nodes in the entire sensor network are exhausted. The simulation results show that our method improves the network performance. Besides, the phased waking strategy outperforms the one not by stages, and waking the nodes after hibernation achieves higher network performance than directly waking in turn with the same number of nodes deployed in the 3D monitoring region.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117020402","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}
引用次数: 4
A New Controlled Commutation Strategies for Matrix Converter 一种新的矩阵变换器控制换相策略
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.153
Lv Hao, N. Ziling, Zhihao Ye
{"title":"A New Controlled Commutation Strategies for Matrix Converter","authors":"Lv Hao, N. Ziling, Zhihao Ye","doi":"10.1109/ISCSCT.2008.153","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.153","url":null,"abstract":"Traditional voltage-controlled commutation strategies are basically proposed to avoid detecting zero crossing problem of current-controlled commutation. Commutation problem is one reason of matrix converter can not be used in high-power environment. This paper proposes a novel four-step safe commutation strategy in transition intervals. The strategy resolves the short circuit phenomenon during changing intervals and consummates the voltage-controlled commutation. It has many advantages such as little influence on input and output waveform, easy to realize and decrease switching loss. Experimental results verify the validity and feasibility of the safe commutation strategies. This commutation strategy possesses a broad application foreground on AC-AC converter.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117037296","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
Website Structure Optimization Technology Based on Customer Interest Clustering Algorithm 基于客户兴趣聚类算法的网站结构优化技术
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.124
Shutong Cheng, Congfu Xu, Hongwei Dan
{"title":"Website Structure Optimization Technology Based on Customer Interest Clustering Algorithm","authors":"Shutong Cheng, Congfu Xu, Hongwei Dan","doi":"10.1109/ISCSCT.2008.124","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.124","url":null,"abstract":"Based on an analysis on the Web log mining algorithm of predecessors, this paper presents the Web site structure optimization technology to improve customer interest. The technology proposes similar customer groups and clustering algorithms of relevant Web pages based on interest matrix of customers accessing a Web site to discover the hidden customer access patterns. Experiment results demonstrate the effectiveness of our algorithms.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116029493","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}
引用次数: 3
A New Modulation Identification Scheme for OFDM in Multipath Rayleigh Fading Channel 一种新的多径瑞利衰落信道OFDM调制识别方案
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.192
Jingjing Zhang, Bingbing Li
{"title":"A New Modulation Identification Scheme for OFDM in Multipath Rayleigh Fading Channel","authors":"Jingjing Zhang, Bingbing Li","doi":"10.1109/ISCSCT.2008.192","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.192","url":null,"abstract":"This paper applies wavelet transform (WT) on Orthogonal Frequency Division Multiplexing (OFDM) and single carrier (SC) digital signals twice (WT-T) to extract the transient characteristics of them, and then by using the transient characteristics in WT-T domain, it is easy to identify the two types of signals. The simulations show that the proposed identification algorithms can obtain good performances in low signal to noise ratio (SNR) and multipath Rayleigh fading channel. In addition, the effects of sample rate and symbol rate on the identification algorithms are analyzed and simulated. To obtain the best performances of the identification algorithms, sample rate is set to be equal to 2.4 times of carrier frequency approximately, therefor, the difference of characteristics between OFDM and SC signals reaches maximum, while OFDM and SC signals can be well separated if only the symbol rate is greater than 20 kHz.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116449434","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}
引用次数: 14
Research of Graph-Based Workflow Access Control 基于图的工作流访问控制研究
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.259
Yonghe Wei, Chunjing Shi
{"title":"Research of Graph-Based Workflow Access Control","authors":"Yonghe Wei, Chunjing Shi","doi":"10.1109/ISCSCT.2008.259","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.259","url":null,"abstract":"Using graph transformation as a formalism to specify access control has several advantages, from the intuition provided by the visual aspect to the precise semantics and the systematic verification of constraints. Graph transformations provide a uniform and precise framework for the specification of access control policies. This article presents specification formalisms for workflow access control policies using graph transformation. The authorization states are represented by graphs and state transition by graph transformation. The proposed formalization provides an intuitive description for the manipulation of graph structures as they occur in workflow access control and a precise specification of consistency conditions on graphs and graph transformations. We specifies a type graph to represents the type information in the graph transformation for workflow access control, a set of rules to build the system states and sets of positive and negative constraints to specify wanted and unwanted framework. Using formal properties of graph transformation, it is can to detect inconsistencies between a rules and a constraint and lay the foundation for their resolutions. We present an algorithm to automatically check and eliminate conflicts between rules and positive and negative constraints.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520004","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
Energy Analysis Method of Computational Complexity 计算复杂度的能量分析方法
2008 International Symposium on Computer Science and Computational Technology Pub Date : 2008-12-20 DOI: 10.1109/ISCSCT.2008.113
Wang Peng
{"title":"Energy Analysis Method of Computational Complexity","authors":"Wang Peng","doi":"10.1109/ISCSCT.2008.113","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.113","url":null,"abstract":"Energy analysis method of computational complexity is proposed. Entropy and quantum superposition theory are used to calculate the problem¿s lower bound of energy consumption. Energy consumption and computational complexity are direct ratio. The computational complexity is decided only by initial state and final state of problem. The algorithm¿s details are needless in this method. Energy analysis method reflects the physics essences of the problem. It is a very simple method to calculate the lower bound of problem¿s complexity. The lower bound of search problem and sort problem are calculated by this method. The lower bound of search problem is logn and the lower bound of sort problem is nlogn. The results are accord with the facts well.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123534327","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信