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

Journal of universal computer science (Online)最新文献

筛选
英文 中文
PLA Based Strategy for Solving RCPSP by a Team of Agents 基于PLA的agent团队求解RCPSP策略
Journal of universal computer science (Online) Pub Date : 2016-06-15 DOI: 10.1007/978-3-319-39630-9_25
P. Jędrzejowicz, E. Ratajczak-Ropel
{"title":"PLA Based Strategy for Solving RCPSP by a Team of Agents","authors":"P. Jędrzejowicz, E. Ratajczak-Ropel","doi":"10.1007/978-3-319-39630-9_25","DOIUrl":"https://doi.org/10.1007/978-3-319-39630-9_25","url":null,"abstract":"","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117142115","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}
引用次数: 10
Integrating Multiple Experts for Correction Process in InteractiveRecommendation Systems 交互式推荐系统中多专家纠错过程的集成
Journal of universal computer science (Online) Pub Date : 2012-11-28 DOI: 10.3217/jucs-019-04-0581
Xuan Hau Pham, Jason J. Jung, N. Nguyen
{"title":"Integrating Multiple Experts for Correction Process in InteractiveRecommendation Systems","authors":"Xuan Hau Pham, Jason J. Jung, N. Nguyen","doi":"10.3217/jucs-019-04-0581","DOIUrl":"https://doi.org/10.3217/jucs-019-04-0581","url":null,"abstract":"To improve the performance of the recommendation process, most of recommendation systems (RecSys) should collect better ratings from users. Particularly, rating process is an important task in interactive RecSys which can ask users to correct their own ratings. However, in real world, there are many inconsistencies (e.g., mistakes and missing values) or incorrect in the user ratings. Thereby, expert-based recommendation framework has been studied to select the most relevant experts in a certain item attribute (or value). This kind of RecSys can i) discover user preference and ii) determine a set of experts based on attribute and value of items. In this paper, we propose a consensual recommendation framework integrating multiple experts to conduct correction process. Since the ratings from experts are assumed to be reliable and correct, we first analyze user profile to determine the preference and find out a set of experts. Next, we measure a minimal inconsistency interval (MinIncInt) that might contain incorrect ratings. Finally, we propose solutions to correct the incorrect rating based on ratings from multiple experts.","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115338908","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}
引用次数: 10
Reinforcement Learning on a Futures Market Simulator 期货市场模拟器上的强化学习
Journal of universal computer science (Online) Pub Date : 2007-05-31 DOI: 10.3217/jucs-014-07-1136
K. Moriyama, M. Matsumoto, Ken-ichi Fukui, S. Kurihara, M. Numao
{"title":"Reinforcement Learning on a Futures Market Simulator","authors":"K. Moriyama, M. Matsumoto, Ken-ichi Fukui, S. Kurihara, M. Numao","doi":"10.3217/jucs-014-07-1136","DOIUrl":"https://doi.org/10.3217/jucs-014-07-1136","url":null,"abstract":"In recent years, it becomes vigorous to forecast a market by using machine learning methods. Since they assume that each trader's individual decisions do not affect market prices at all, most existing works use a past market data set. Meanwhile there is an attempt to analyze economic phenomena by constructing a virtual market simulator, where human and artificial traders really make trades. Since prices in the market are determined by every trader's decisions, it is more realistic and the assumption cannot be applied any more. In this work, we design and evaluate several reinforcement learners on a futures market simulator U-Mart (Unreal Market as an Artificial Research Testbed). After that, we compare our learner to the previous champions of U-Mart competitions.","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122219511","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}
引用次数: 5
A new fair non-repudiation protocol for secure negotiation and contract signing 一个新的公平的不可否认协议，用于安全谈判和合同签署
Journal of universal computer science (Online) Pub Date : 2006-10-30 DOI: 10.1145/1501434.1501454
A. Ruiz-Martínez, C. I. Marín-López, Laura Baño-López, A. Gómez-Skarmeta
{"title":"A new fair non-repudiation protocol for secure negotiation and contract signing","authors":"A. Ruiz-Martínez, C. I. Marín-López, Laura Baño-López, A. Gómez-Skarmeta","doi":"10.1145/1501434.1501454","DOIUrl":"https://doi.org/10.1145/1501434.1501454","url":null,"abstract":"In some scenarios, such as B2B or IPR contracting, or by legal requirement, the participation of an e-notary in the contract signing is required in many cases, that is, an on-line TTP. This e-notary gives validity to the contract or performs some tasks related to the contract, such as contract registration or fraud detection. In these B2B or DRM contracting scenarios, two important additional features are needed: the negotiation of the e-contract and confidentiality. However, until now, e-contract signing protocols have not considered both of these as an essential part of the protocol. In this paper, we present a new protocol which is designed to make negotiation and contract signing secure and in a confidential way. Moreover, the protocol, compared to other previous proposals based on an on-line TTP, reduces the e-notary's workload. Finally, we describe how the protocol is being used in conjunction with an extended version of ODRL to achieve agreements on the rights of copyright works in a DRM infrastructure.","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114614691","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}
引用次数: 12
Sustainable Memory System Using Global and Conical Spaces 利用全局和锥形空间的可持续记忆系统
Journal of universal computer science (Online) Pub Date : 2005-09-14 DOI: 10.1007/11553939_122
Hidekazu Kubota, S. Nomura, Y. Sumi, T. Nishida
{"title":"Sustainable Memory System Using Global and Conical Spaces","authors":"Hidekazu Kubota, S. Nomura, Y. Sumi, T. Nishida","doi":"10.1007/11553939_122","DOIUrl":"https://doi.org/10.1007/11553939_122","url":null,"abstract":"","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123136013","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}
引用次数: 12
Using Recommendation to Improve Negotiations in Agent-based Systems 在基于代理的系统中使用推荐改进谈判
Journal of universal computer science (Online) Pub Date : 2005-09-14 DOI: 10.1007/11552451_72
Mateusz Lenar, Janusz Sobecki
{"title":"Using Recommendation to Improve Negotiations in Agent-based Systems","authors":"Mateusz Lenar, Janusz Sobecki","doi":"10.1007/11552451_72","DOIUrl":"https://doi.org/10.1007/11552451_72","url":null,"abstract":"","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115816212","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}
引用次数: 21
An Application of the DEDS Control Synthesis Method DEDS控制综合方法的应用
Journal of universal computer science (Online) Pub Date : 2004-06-06 DOI: 10.3217/jucs-011-02-0303
F. Capkovic
{"title":"An Application of the DEDS Control Synthesis Method","authors":"F. Capkovic","doi":"10.3217/jucs-011-02-0303","DOIUrl":"https://doi.org/10.3217/jucs-011-02-0303","url":null,"abstract":"An application of the method suitable for modelling and control of general discrete event dynamic systems (DEDS) to special kinds of communication systems is presented in this paper. The approach is based on Petri nets (PN) defined in [12] and directed graphs (DG) described in [11]. It is supported by the previous author’s works [1]–[10], [13].","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116819481","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}
引用次数: 9
Alias Verification for Fortran Code Optimization Fortran代码优化的别名验证
Journal of universal computer science (Online) Pub Date : 2002-04-01 DOI: 10.3217/jucs-009-03-0270
T. Nguyen, F. Irigoin
{"title":"Alias Verification for Fortran Code Optimization","authors":"T. Nguyen, F. Irigoin","doi":"10.3217/jucs-009-03-0270","DOIUrl":"https://doi.org/10.3217/jucs-009-03-0270","url":null,"abstract":"Abstract Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a common variable that is aliased with another formal parameter is modified. Compilers, assuming standard-conforming programs, consider that an assignment to one variable will not change the value of any other variable, allowing optimizations involving the aliased variables. Higher performance results but anything may happen: the program may appear to run normally, or may produce incorrect answers, or may behave unpredictably. The results may depend on the compiler and the optimization level. To guarantee the standard conformance of programs and to maintain the referential transparency in order to make program analyses exact and program optimizations safe, precise alias information retrieval at a reasonable cost, especially the determination of overlaps between arrays are studied in this paper. Static analyses and code instrumentation are used to find all violations of the prohibitions against aliasing in Fortran code. Alias violation tests are inserted only at places where it cannot be proved statically that they are useless in order to reduce the number of dynamic checks at run-time. A specific memory location naming technique is used to compact representation and enhance the precision of alias analysis. Modifications on the dependence graph created by aliasing are also studied to show the impact of aliases on some program optimizing transformations. Experimental results on SPEC95 benchmark are presented and some related issues are also discussed.","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133855167","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}
引用次数: 8
A Logic for Abstract State Machines 抽象状态机的逻辑
Journal of universal computer science (Online) Pub Date : 2001-09-10 DOI: 10.3217/jucs-007-11-0980
R. Stärk, Stanislas Nanchen
{"title":"A Logic for Abstract State Machines","authors":"R. Stärk, Stanislas Nanchen","doi":"10.3217/jucs-007-11-0980","DOIUrl":"https://doi.org/10.3217/jucs-007-11-0980","url":null,"abstract":"We introduce a logic for sequential, non distributed Abstract State Machines. Unlike other logics for ASMs which are based on dynamic logic, our logic is based on atomic propositions for the function updates of transition rules. We do not assume that the transition rules of ASMs are in normal form, for example, that they concern distinct cases. Instead we allow structuring concepts of ASM rules including sequential composition and possibly recursive submachine calls. We show that several axioms that have been proposed for reasoning about ASMs are derivable in our system and that the logic is complete for hierarchical (non-recursive) ASMs.","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552002","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}
引用次数: 1096
Rotation-Symmetric Functions and Fast Hashing 旋转对称函数和快速哈希
Journal of universal computer science (Online) Pub Date : 1998-07-01 DOI: 10.3217/jucs-005-01-0020
J. Pieprzyk, Chengxin Qu
{"title":"Rotation-Symmetric Functions and Fast Hashing","authors":"J. Pieprzyk, Chengxin Qu","doi":"10.3217/jucs-005-01-0020","DOIUrl":"https://doi.org/10.3217/jucs-005-01-0020","url":null,"abstract":"Efficient hashing is a centerpiece of modern cryptography. The progress in computing technology enables us to use 64-bit machines with the promise of 128-bit machines in the near future. To exploit fully the technology for fast hashing, we need to be able to design cryptographically strong Boolean functions in many variables which can be evaluated faster using partial evaluations from the previous rounds. We introduce a new class of Boolean functions whose evaluation is especially efficient and we call them rotation symmetric. Basic cryptographic properties of rotation-symmetric functions are investigated in a broader context of symmetric functions. An algorithm for the design of rotation-symmetric functions is given and two classes of functions are examined. These classes are important from a practical point of view as their forms are short. We show that shortening of rotation-symmetric functions paradoxically leads to more expensive evaluation process.","PeriodicalId":103108,"journal":{"name":"Journal of universal computer science (Online)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133538793","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}
引用次数: 109
下一页 尾页
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学术官方微信