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

2009 Joint Conferences on Pervasive Computing (JCPC)最新文献

筛选
英文 中文
Integrating business policy into system engineering processes using ontology 使用本体将业务策略集成到系统工程流程中
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420165
S. Azzam, T. Ayodele, Jarupa Vipoopinyo, Shikun Zhou
{"title":"Integrating business policy into system engineering processes using ontology","authors":"S. Azzam, T. Ayodele, Jarupa Vipoopinyo, Shikun Zhou","doi":"10.1109/JCPC.2009.5420165","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420165","url":null,"abstract":"Business policy reflects way too many things not only restricting what the company should do but also predicting the future direction of the company. It is desirable that the description of business policy can be interchangeable between business descriptions and engineering specifications so that the rules can be integrated into engineering process without further misinterpreting and conflicting. This paper presents our initiatives of a work to investigate and identify suitable ontologies, as well as suitable ontology alignment framework. A set or sets of formal vocabulary will be developed across various ontologies to specify business policy in a way that different levels of business managers, business people and technical people especially engineers can exchange and share business rules without misinterpreting and inconsistency.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128202374","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 web service process transaction framework based on compensation and proxy 基于补偿和代理的web服务流程事务框架
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420157
Nan Cheng, Meina Song, Qian Wang
{"title":"A web service process transaction framework based on compensation and proxy","authors":"Nan Cheng, Meina Song, Qian Wang","doi":"10.1109/JCPC.2009.5420157","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420157","url":null,"abstract":"In this paper, we propose and describe a web service process transaction framework based on compensation and proxy, composed of web service proxy and transaction pool. The proxy acts as an intermediation between the process engine and web services and also as a manager to operate the lifecycle of the process units stored in the transaction pool. As the container of process units, the transaction pool stores them which encapsulates the transaction information of the process and each of its services, created by the proxy. Different from traditional transaction framework, the Web Service Process Transaction Framework is not based on the rollback but the compensation mechanism to cancel the operation already finished when the process interrupts. Therefore, the framework solves the problem that the rollback is inadequate with the distributed process application and enables the compensation made by the framework automatically and accurately","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128689687","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
Automatic test data generation model by combining dataflow analysis with genetic algorithm 结合数据流分析和遗传算法的自动测试数据生成模型
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420148
Mingjie Deng, Rong Chen, Zhenjun Du
{"title":"Automatic test data generation model by combining dataflow analysis with genetic algorithm","authors":"Mingjie Deng, Rong Chen, Zhenjun Du","doi":"10.1109/JCPC.2009.5420148","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420148","url":null,"abstract":"Dataflow techniques have been widely applied to test the object-oriented software, but the existing techniques mainly care how to arrange method sequence to test, not paying attention to how to generate test data automatically. Although the existing random test data generators can create test data automatically, yet information about the test requirement is not incorporated into the generation process, it may fail to find data to satisfy the requirements. This paper presents an automatic test data generation model that combine genetic algorithm (GA) with dataflow analysis. The model applies Control Flow Graph (CFG) which is partitioned into proper blocks to aid data flow analysis. Data Type Graph (DTG) presented in this paper facilitates the constructing of an object to realize automatic testing. Due to the search function of genetic algorithm, it improves the efficiency of test data generation. The experimental results prove our model to be more effective in test data generation and in coverage of dataflow than the random algorithm, showing the applicable significance of the model in software testing for both desktop and embedded systems.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933235","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 study of weighted association rule applied in human resource job requirement 加权关联规则在人力资源岗位需求中的应用研究
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420070
Wen-Hsing Kao, I-Mei Huang, Hsun-Shou Shen, Chi-Ching Lin
{"title":"A study of weighted association rule applied in human resource job requirement","authors":"Wen-Hsing Kao, I-Mei Huang, Hsun-Shou Shen, Chi-Ching Lin","doi":"10.1109/JCPC.2009.5420070","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420070","url":null,"abstract":"As the development of the Internet application is thriving and the speed of the internet connection is rising, people now are enjoying the convenience and user-friendly interface of career engagement from the human resource service providers. In this research, we are proudly having the opportunity to cooperate with 1111.com.tw, one of the most famous HR service providers in Taiwan, and to mine its valuable database. The main technology of data mining discussed in this paper is weighted association rules and the purpose of this research is to find out the associated rules in employees' or job seekers' computer skills and the IT job requirements. Plus, we implemented a weighted concept to the main algorithm in order to gain a more realistic mining result to match the real world HR application. Therefore, we can provide the real trend of the IT job requirements and give better directions to the students and the people who are seeking jobs.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129091514","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 novel handoff method for integrated 3G and NEMO network 一种新的3G和NEMO集成网络切换方法
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.2316/Journal.202.2011.3.202-3034
Hui-Min Huang, Jia-Lin Chang
{"title":"A novel handoff method for integrated 3G and NEMO network","authors":"Hui-Min Huang, Jia-Lin Chang","doi":"10.2316/Journal.202.2011.3.202-3034","DOIUrl":"https://doi.org/10.2316/Journal.202.2011.3.202-3034","url":null,"abstract":"This paper aims to revise handoff method for integrated 3G and NEMO network. The method includes horizontal handoff and vertical handoff for heterogeneous wireless network. This paper took advantage of the NEMO characteristic to propose a novel horizontal handoff method. It adopts the conception of hierarchical network to design vertical handoff. We proposed the idea that MH has cache in BS and MR. Our method decreases handoff latency, deliverable packet latency and distance to resend losing packet. Complete the handoff schema of integrated 3G and NEMO Network by our method.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123258626","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 courseware platform for safety education through dual experience based learning using an integrated environment of a miniaturized world and a computerized world 利用微型化世界和计算机化世界的集成环境，通过基于双重体验的学习进行安全教育的课件平台
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420214
K. Ota, Hikaru Nihei, Junbo Wang, Lei Jing, Mizuo Kansen, Zixue Cheng
{"title":"A courseware platform for safety education through dual experience based learning using an integrated environment of a miniaturized world and a computerized world","authors":"K. Ota, Hikaru Nihei, Junbo Wang, Lei Jing, Mizuo Kansen, Zixue Cheng","doi":"10.1109/JCPC.2009.5420214","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420214","url":null,"abstract":"Ubiquitous learning is one of fields utilizing widespread ubiquitous technologies and gives learners more effective and personalized education than the traditional one. Safety education is necessary for children since accidents and crimes against them happen increasingly in recent years. The children might need to protect them from dangers by themselves. Though it is important for the children to learn safety knowledge through real experiences on danger, it is not always realizable because of lack of opportunities and possibilities of hurting the children. In contrast, a virtual experience is possible and popular to educate the children in some ways such as using computers. However, only virtual experiences might be insufficient for children to practice what they learnt in the real world. Therefore we propose a novel approach by fusing a real world and virtual space to let a learner have dual experiences in both real and virtual worlds. We design a support system which employs the following techniques: (1) a platform of dual experiencing learning, (2) dual experiencing learning scenario design policies, and (3) personalized dual experiencing learning course.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"2 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270735","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
Distortion-free multiple images sharing scheme with universal share 具有通用共享的无失真多图像共享方案
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420069
S. J. Hsu, Chuan-Feng Chiu, S. Jan, Chia-Tai Chan
{"title":"Distortion-free multiple images sharing scheme with universal share","authors":"S. J. Hsu, Chuan-Feng Chiu, S. Jan, Chia-Tai Chan","doi":"10.1109/JCPC.2009.5420069","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420069","url":null,"abstract":"Recently, Fang and Lin proposed a multiple images sharing system with a universal share. This universal share can be used for a company's organizer to attend the recovery meeting of any shared images. Since the organizer only needs to keep the unique share, it reduces the difficulties of the share management of the organizer. However, the universal share is embedded into a secret by the least-significant-bits (LSB) substitution method before evaluating all the shares of the secret. The secret image becomes a distortion image. The original secret cannot be reconstructed without loss. In this paper, we present a distortion-free sharing scheme for the sharing of multiple images. Instead of using LSB to embed a universal share, all the bits of the secret image and the universal share are used to generate the coefficients of sharing polynomials. Moreover, this paper employs the Galois Field GF(28) instead of GF(251). Since all the information of the security image is hiding in those polynomials, the original secret can be revealed without any distortion.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122298551","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
Enhancing collective entity resolution utilizing Quasi-Clique similarity measure 利用准团相似性测度增强集体实体分辨力
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420180
Zhang Yongxin, Li Qingzhong, Bian Ji
{"title":"Enhancing collective entity resolution utilizing Quasi-Clique similarity measure","authors":"Zhang Yongxin, Li Qingzhong, Bian Ji","doi":"10.1109/JCPC.2009.5420180","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420180","url":null,"abstract":"Entity resolution(ER) is the problem of identifying duplicate references that refer to the same real world entity. It is a critical component of data integration and data cleaning. Attribute-based entity resolution is the traditional approach where similarity is computed for each pair of references based on their attributes. More recently, context-base entity resolution has been proposed which considers the attributes of the related references. In this paper, we present a collective entity resolution approach which using Quasi-Clique similarity to improve the accuracy. It complements the traditional methodology by reducing the number of false positive. An experimental evaluation on several datasets shows high recall and precision rates, which validate the method's efficiency.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121017652","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
Combinatorial reverse auction algorithm for group buying 团购的组合反向拍卖算法
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420086
Fu-Shiung Hsieh
{"title":"Combinatorial reverse auction algorithm for group buying","authors":"Fu-Shiung Hsieh","doi":"10.1109/JCPC.2009.5420086","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420086","url":null,"abstract":"Group buying is an important business model. From the perspective of buyers, quantity based discounts provide a huge incentive to form coalitions and take advantage of lower prices without ordering more than their actual demand. By forming a coalition, buyers can also improve their bargaining power and negotiate more advantageously with sellers to purchase at a lower price. In this paper, we study coalition formation problem in group buying. We formulate this problem as a combinatorial reverse auction with multiple buyers and multiple sellers. We propose the concept of proxy buyer to deal with this problem. The proxy buyer consolidates the demands from the buyers and then holds a reverse auction to try to obtain the goods from a set of sellers who can provide the goods. The main results include: (1) a problem formulation for the combinatorial reverse auction problem; (2) a solution methodology based on Lagrangian relaxation and (3) analysis of numerical results based on our solution algorithms.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123779199","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
Combing multiple linear regression and manifold regularization for indoor positioning from unique radio signal 结合多元线性回归和流形正则化的室内唯一无线电信号定位方法
2009 Joint Conferences on Pervasive Computing (JCPC) Pub Date : 2009-12-01 DOI: 10.1109/JCPC.2009.5420112
Zhenyu Chen, Jingye Zhou, Yiqiang Chen, Xingyu Gao
{"title":"Combing multiple linear regression and manifold regularization for indoor positioning from unique radio signal","authors":"Zhenyu Chen, Jingye Zhou, Yiqiang Chen, Xingyu Gao","doi":"10.1109/JCPC.2009.5420112","DOIUrl":"https://doi.org/10.1109/JCPC.2009.5420112","url":null,"abstract":"Traditional learning methods for indoor positioning are based on a multitude of wireless radio signals synchronously, while only one or two Access Points (APs) can be perpetually and steadily received by users in the real-world indoor environment. In this paper, we propose a novel indoor positioning method by two aspects. On the one hand, we establish multiple linear regression to estimate the Euclidean distance between reference AP and mobile terminals. On the other, we propose manifold regularization approach to predict the intersection angle drew from reference baseline. Experimental results show that our proposed method achieves an acceptable and effective room-level precision using unique radio signal in the deployed indoor test-bed.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125005382","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
首页 上一页 下一页 尾页
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学术官方微信