2010 Second International Conference on Knowledge and Systems Engineering最新文献_第4页

Extracting Parallel Texts from the Web 从网络中提取平行文本

2010 Second International Conference on Knowledge and Systems Engineering Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.14

Le Quang Hung, L. Cuong

引用次数: 2

SDA*: A Simple and Unifying Solution to Recent Bioinformatic Challenges for Conservation Genetics SDA*:一个简单和统一的解决方案，以最近的生物信息学挑战保护遗传学

2010 Second International Conference on Knowledge and Systems Engineering Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.24

B. Minh, S. Klaere, A. von Haeseler

引用次数: 4

Investigation of the Hemodynamic Response in Near Infrared Spectroscopy Data Analysis 近红外光谱数据分析中血流动力学响应的研究

2010 Second International Conference on Knowledge and Systems Engineering Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.26

Le Hoa Nguyen, K. Hong

引用次数: 2

Safe Typing for Transactional vs. Lock-Based Concurrency in Multi-threaded Java 多线程Java中事务性与基于锁的并发性的安全类型

2010 Second International Conference on Knowledge and Systems Engineering Pub Date : 2010-10-01 DOI: 10.1109/KSE.2010.9

Thi Mai Thuong Tran, Olaf Owe, M. Steffen

{"title":"Safe Typing for Transactional vs. Lock-Based Concurrency in Multi-threaded Java","authors":"Thi Mai Thuong Tran, Olaf Owe, M. Steffen","doi":"10.1109/KSE.2010.9","DOIUrl":"https://doi.org/10.1109/KSE.2010.9","url":null,"abstract":"Many concurrency models have been developed for high-level programming languages such as Java. A trend here is towards more flexible concurrency control protocols, going beyond the original Java multi-threading treatment based on lexically-scoped concurrency control mechanism. Two proposals supporting flexible, non-lexical concurrency control are the lock-handling via the Lock-classes in Java5 and Transactional Featherweight Java (TFJ), an extension of Featherweight Java by transactions. Even if these two take quite different approaches towards dealing with concurrency —“pessimistic” or lock-based vs. “optimistic” or based on transactions— the added flexibility of non-lexical use of the corresponding concurrency operators comes at a similar price: improper usage leads to run-time exceptions and unwanted behavior. This is in contrast with the more disciplined use under a lexically scoped regime, where each entrance to a critical region is syntactically accompanied by a corresponding exit (as e.g. with traditional synchronized methods or as with so-called atomic blocks).To assure safe use of locking, resp. transactions in these settings, we present in this paper abstractions in the form of two static type and effect systems, which make sure that for instance, no lock is released by a thread which does not hold it, resp., that no commit is executed outside any transaction. We furthermore compare the two mentioned approaches to concurrency control on the basis of these type abstractions.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131953131","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