The following paper presents a model of algorithm for primary copy two-phase locking (2PL). To avoid deadlocks of distributed transactions in distributed database management systems is used a timestamps mechanism. From the two strategies for timestamps mechanism for deadlocks avoiding, we consider the "wound -- wait" strategy. In the paper is presented a comparative variant of the results from the modelling in GPSS World Personal Version environment of the two algorithms: "wait-die" method and "wound -- wait".
本文给出了一个主副本两阶段锁定(2PL)的算法模型。为了避免分布式数据库管理系统中分布式事务的死锁，采用了时间戳机制。从避免死锁的时间戳机制的两种策略中，我们考虑了“伤口-等待”策略。本文对GPSS World Personal Version环境下的“wait-die”法和“wound - wait”两种算法的建模结果进行了比较。
{"title":"An algorithm modelling primary copy two-phase locking with integrated mechanism of timestamps","authors":"S. Vasileva, Lyubomir Gotcev","doi":"10.1145/2516775.2516788","DOIUrl":"https://doi.org/10.1145/2516775.2516788","url":null,"abstract":"The following paper presents a model of algorithm for primary copy two-phase locking (2PL). To avoid deadlocks of distributed transactions in distributed database management systems is used a timestamps mechanism. From the two strategies for timestamps mechanism for deadlocks avoiding, we consider the \"wound -- wait\" strategy. In the paper is presented a comparative variant of the results from the modelling in GPSS World Personal Version environment of the two algorithms: \"wait-die\" method and \"wound -- wait\".","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134446443","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}
The Automatic Call Distributor (ACD) is responsible for routing calls to a set of call servicing points (workstations). In a multi-site call centre solution eMOSys, the ACDs logic is distributed between nodes. In this paper, we describe a distributed ACD, modelling its behaviour and communication with the other subsystems. A number of properties, such as deadlock freeness, safety and liveness are then verified using the model checker PAT (Process Analysis Toolkit).
{"title":"Modelling of an automatic call distributor in a multi-site call centre","authors":"N. Kostadinov","doi":"10.1145/2516775.2516801","DOIUrl":"https://doi.org/10.1145/2516775.2516801","url":null,"abstract":"The Automatic Call Distributor (ACD) is responsible for routing calls to a set of call servicing points (workstations). In a multi-site call centre solution eMOSys, the ACDs logic is distributed between nodes. In this paper, we describe a distributed ACD, modelling its behaviour and communication with the other subsystems. A number of properties, such as deadlock freeness, safety and liveness are then verified using the model checker PAT (Process Analysis Toolkit).","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127098677","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}
T. Xu, T. Pahikkala, P. Liljeberg, J. Plosila, H. Tenhunen
In this paper, we propose optimized multicore designs for data parallel Fast Fourier Transform (FFT) applications. FFT is widely used in digital systems as a fundamental algorithm. The implementation of FFT on conventional architectures has been studied. However, the evaluation of data parallel FFT in Network-on-Chip (NoC) platforms has not been well addressed. We analyse data parallel FFT in terms of on-chip traffic patterns. NoC designs optimized for FFT are introduced. Experiments show that, the execution times of our optimized designs are 12.1% and 18.3% shorter than the original NoC design.
{"title":"Optimized multicore architectures for data parallel fast Fourier transform","authors":"T. Xu, T. Pahikkala, P. Liljeberg, J. Plosila, H. Tenhunen","doi":"10.1145/2516775.2516808","DOIUrl":"https://doi.org/10.1145/2516775.2516808","url":null,"abstract":"In this paper, we propose optimized multicore designs for data parallel Fast Fourier Transform (FFT) applications. FFT is widely used in digital systems as a fundamental algorithm. The implementation of FFT on conventional architectures has been studied. However, the evaluation of data parallel FFT in Network-on-Chip (NoC) platforms has not been well addressed. We analyse data parallel FFT in terms of on-chip traffic patterns. NoC designs optimized for FFT are introduced. Experiments show that, the execution times of our optimized designs are 12.1% and 18.3% shorter than the original NoC design.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115240704","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}
D. Mihhailov, A. Rjabov, V. Sklyarov, I. Skliarova, A. Sudnitson
Among numerous data processing tasks sorting is considered to be one of the most important. Sorting still poses a big challenge as it actually becomes harder to solve this problem efficiently and fast with the constant demand for processing of larger and larger data sets in a reasonable amount of time. Reconfigurable computing provides an attractive option for implementation of data processing in the context of hardware, as the use of Field Programmable Gate Arrays (FPGAs) allows to eliminate the design constraints of processors and graphics processing units (GPUs) with predefined architectures. In this paper a technique that improves the performance of the address-based data sorting unit with an external DDR3 flag memory is proposed. It is demonstrated that the proposed technique can efficiently reduce the communication penalties associated with the use of external memory.
{"title":"Optimization of address-based data sorting unit with external memory support","authors":"D. Mihhailov, A. Rjabov, V. Sklyarov, I. Skliarova, A. Sudnitson","doi":"10.1145/2516775.2516807","DOIUrl":"https://doi.org/10.1145/2516775.2516807","url":null,"abstract":"Among numerous data processing tasks sorting is considered to be one of the most important. Sorting still poses a big challenge as it actually becomes harder to solve this problem efficiently and fast with the constant demand for processing of larger and larger data sets in a reasonable amount of time. Reconfigurable computing provides an attractive option for implementation of data processing in the context of hardware, as the use of Field Programmable Gate Arrays (FPGAs) allows to eliminate the design constraints of processors and graphics processing units (GPUs) with predefined architectures. In this paper a technique that improves the performance of the address-based data sorting unit with an external DDR3 flag memory is proposed. It is demonstrated that the proposed technique can efficiently reduce the communication penalties associated with the use of external memory.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122637123","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}
In this paper the model PER (Process Entity Relationships) for semantic data modeling is presented, based on process and architectural approach. Terms, symbols and conventions used are explained. The levels of the model were described, and some example models are given.
{"title":"Data PER model","authors":"Hristo Tujarov, S. Kalchev, Vassil Milev","doi":"10.1145/2516775.2516792","DOIUrl":"https://doi.org/10.1145/2516775.2516792","url":null,"abstract":"In this paper the model PER (Process Entity Relationships) for semantic data modeling is presented, based on process and architectural approach. Terms, symbols and conventions used are explained. The levels of the model were described, and some example models are given.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122736301","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}
V. Cantoni, M. Porta, Stefania Ricotti, Francesca Zanin
In this article we present an eye tracking investigation aimed at inspecting the eye behaviour of users while looking at the home page of online newspapers containing ad banners, especially during the first seconds of exposure. In particular, we consider different positions and combinations for banners placed in the masthead region of the page, to verify whether there are solutions that are better than others in catching the early attention of the user. The study involved 50 testers and was carried out on simulated newspaper home pages using a remote eye tracker. Although differences in testers' behaviours were not always statistically significant, some interesting divergences could however be identified, which can be the starting point for more focused studies on the subject.
{"title":"Banner positioning in the masthead area of online newspapers: an eye tracking study","authors":"V. Cantoni, M. Porta, Stefania Ricotti, Francesca Zanin","doi":"10.1145/2516775.2516789","DOIUrl":"https://doi.org/10.1145/2516775.2516789","url":null,"abstract":"In this article we present an eye tracking investigation aimed at inspecting the eye behaviour of users while looking at the home page of online newspapers containing ad banners, especially during the first seconds of exposure. In particular, we consider different positions and combinations for banners placed in the masthead region of the page, to verify whether there are solutions that are better than others in catching the early attention of the user. The study involved 50 testers and was carried out on simulated newspaper home pages using a remote eye tracker. Although differences in testers' behaviours were not always statistically significant, some interesting divergences could however be identified, which can be the starting point for more focused studies on the subject.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132431241","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}
This paper presents an algorithm for identifying the noun phrase antecedents of zero pronouns in Bulgarian. The algorithm applies to syntactic representation in XML format, generated by context-free grammar parser. Like the parser, the algorithm is implemented in Java. The author has tested it on Z-corpora, specially created for the investigation of zero pronouns in Bulgarian. The corpora are manually annotated and contain 1029 zero pronouns occurrences. The algorithm has 84% critical success rate. The algorithm is compared to another approach, which has been proposed in literature. The author's algorithm achieves 3% higher critical success rate.
{"title":"An algorithm for zero pronoun resolution in Bulgarian","authors":"D. Grigorova","doi":"10.1145/2516775.2516787","DOIUrl":"https://doi.org/10.1145/2516775.2516787","url":null,"abstract":"This paper presents an algorithm for identifying the noun phrase antecedents of zero pronouns in Bulgarian. The algorithm applies to syntactic representation in XML format, generated by context-free grammar parser. Like the parser, the algorithm is implemented in Java. The author has tested it on Z-corpora, specially created for the investigation of zero pronouns in Bulgarian. The corpora are manually annotated and contain 1029 zero pronouns occurrences. The algorithm has 84% critical success rate. The algorithm is compared to another approach, which has been proposed in literature. The author's algorithm achieves 3% higher critical success rate.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131964943","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}
Cloud computing is becoming very prevalent in many application areas. However there is still little research in application of software engineering techniques for development of software systems, intended for execution in cloud environments. In this paper we make a deeper look at currently existing architectural tactics for achieving availability in the cloud. A case study at the end of the paper shows that using some of these tactics one may achieve high levels of availability.
{"title":"Software availability in the cloud","authors":"Tsanko Alexandrov, A. Dimov","doi":"10.1145/2516775.2516814","DOIUrl":"https://doi.org/10.1145/2516775.2516814","url":null,"abstract":"Cloud computing is becoming very prevalent in many application areas. However there is still little research in application of software engineering techniques for development of software systems, intended for execution in cloud environments. In this paper we make a deeper look at currently existing architectural tactics for achieving availability in the cloud. A case study at the end of the paper shows that using some of these tactics one may achieve high levels of availability.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114317771","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}
The purpose of this work is to define a methodology for building simple but robust stemmers, without having knowledge of the stemmer's target language. The target stemmer is based on conditional suffix replacement (actually suffix removal) in one or more steps. The building process (that refines the stemmer) uses the arguments of experts against the results of a primary stemmer. Even the experts did not need be speakers of the target language. They have available the original words, their translations (in their native language) and the results (stems) produced by the primary stemmer. The language resources are only a list of suffixes (used in the target language) and the translations of the terms existing in a corpus of texts from the target language.
{"title":"A methodology for building simple but robust stemmers without language knowledge: overview, data model and ranking algorithm","authors":"N. Karanikolas","doi":"10.1145/2516775.2516783","DOIUrl":"https://doi.org/10.1145/2516775.2516783","url":null,"abstract":"The purpose of this work is to define a methodology for building simple but robust stemmers, without having knowledge of the stemmer's target language. The target stemmer is based on conditional suffix replacement (actually suffix removal) in one or more steps. The building process (that refines the stemmer) uses the arguments of experts against the results of a primary stemmer. Even the experts did not need be speakers of the target language. They have available the original words, their translations (in their native language) and the results (stems) produced by the primary stemmer. The language resources are only a list of suffixes (used in the target language) and the translations of the terms existing in a corpus of texts from the target language.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133814863","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}
The article describes a framework for modelling and verification of constraint rules on operations with financial instruments. These constraints are applied on certain attributes of domains of financial objects. A methodology and implementation of automatic constraint analysis in two steps is presented. The first step involves preparation of constraints on specified domains and creation of formulas defining them. The other step consists in waiting for real time transactions and responding to them by alerting the user on newly occurred constraint violations. Computation reduction method is proposed. A satisfaction coefficient is calculated that aids the end user in taking consecutive actions on their portfolio.
{"title":"A constraint-based approach for analysing financial market operations","authors":"Samuil Nikolov, V. Nikolov, A. Antonov","doi":"10.1145/2516775.2516780","DOIUrl":"https://doi.org/10.1145/2516775.2516780","url":null,"abstract":"The article describes a framework for modelling and verification of constraint rules on operations with financial instruments. These constraints are applied on certain attributes of domains of financial objects. A methodology and implementation of automatic constraint analysis in two steps is presented. The first step involves preparation of constraints on specified domains and creation of formulas defining them. The other step consists in waiting for real time transactions and responding to them by alerting the user on newly occurred constraint violations. Computation reduction method is proposed. A satisfaction coefficient is calculated that aids the end user in taking consecutive actions on their portfolio.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114632031","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：