The problem of the growing semantic gap between mankind and the Digital Universe is formulated and explained by the help algorithmic information theory. We use The Digital Universe as not only the largest collection of information but as it is the anytime best approximation of the Universal Reference Machine. We demonstrate in a simple model how the information quantity of queries and answers can be estimated under the condition that the content of the database is known. Also, we can estimate the effect of database growth on the length of queries and answers. The problem of "What", Where" and "When" is addressed with some remarks on Big Data hype.
{"title":"The digital universe - an information theoretical analyses","authors":"A. Benczúr","doi":"10.1145/2516775.2516776","DOIUrl":"https://doi.org/10.1145/2516775.2516776","url":null,"abstract":"The problem of the growing semantic gap between mankind and the Digital Universe is formulated and explained by the help algorithmic information theory. We use The Digital Universe as not only the largest collection of information but as it is the anytime best approximation of the Universal Reference Machine. We demonstrate in a simple model how the information quantity of queries and answers can be estimated under the condition that the content of the database is known. Also, we can estimate the effect of database growth on the length of queries and answers. The problem of \"What\", Where\" and \"When\" is addressed with some remarks on Big Data hype.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"154 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":"122838265","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 the paper virtual drill tools measuring algorithm applied on 3D objects has been described and its programming model, developed for training purposes, has been presented. The work with the model will enable students to measure virtual 3D drill tools and it will be also used to check and assess their knowledge.
{"title":"3D virtual learning and measuring drill tools","authors":"Galina Ivanova, A. Ivanov, Kaloyan Kolarov","doi":"10.1145/2516775.2516779","DOIUrl":"https://doi.org/10.1145/2516775.2516779","url":null,"abstract":"In the paper virtual drill tools measuring algorithm applied on 3D objects has been described and its programming model, developed for training purposes, has been presented. The work with the model will enable students to measure virtual 3D drill tools and it will be also used to check and assess their knowledge.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"32 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":"128990550","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}
Quality of deliveries is often a major problem in industry data integration projects. The issues stem from the very narrow definition of quality which is often used when ETL systems are delivered using external consulting engagements. In this paper we define a quality-of-experience (QoX) model for near-real time ETL processes loosely based on the quality factors from ISO 25010. We discuss its relevance for each of the 34 ETL subsystems defined by Kimball Group based on the experience of Adastra Corp.
{"title":"A QoX model for ETL subsystems: theoretical and industry perspectives","authors":"I. Pavlov","doi":"10.1145/2516775.2516778","DOIUrl":"https://doi.org/10.1145/2516775.2516778","url":null,"abstract":"Quality of deliveries is often a major problem in industry data integration projects. The issues stem from the very narrow definition of quality which is often used when ETL systems are delivered using external consulting engagements. In this paper we define a quality-of-experience (QoX) model for near-real time ETL processes loosely based on the quality factors from ISO 25010. We discuss its relevance for each of the 34 ETL subsystems defined by Kimball Group based on the experience of Adastra Corp.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"4 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":"129092342","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 paper proposes an accessible method for emotion recognition from facial dynamics in video streams. The emotions considered are anger, disgust, fear, happiness, sadness, surprise, and the neutral expression as well. The method is based on the Facial Action Coding System (FACS) that regards individual action units (AU) as features for the recognition of emotions. On the basis of FACS we propose an a'priori juxtaposition between the well known Candide model vertexes and the landmarks selected in each individual video frame with human face. We use a Linear Discriminant Analysis (LDA) approach to define an emotion classifier. To this end our approach is facilitated by some assumptions like the need of well defined start and peak frames for each emotion under recognition. The experiments show that the method we propose can be successfully further developed for most of the real cases of face emotion recognition.
{"title":"Emotion recognition by face dynamics","authors":"Svetoslav Nedkov, D. Dimov","doi":"10.1145/2516775.2516794","DOIUrl":"https://doi.org/10.1145/2516775.2516794","url":null,"abstract":"The paper proposes an accessible method for emotion recognition from facial dynamics in video streams. The emotions considered are anger, disgust, fear, happiness, sadness, surprise, and the neutral expression as well. The method is based on the Facial Action Coding System (FACS) that regards individual action units (AU) as features for the recognition of emotions. On the basis of FACS we propose an a'priori juxtaposition between the well known Candide model vertexes and the landmarks selected in each individual video frame with human face. We use a Linear Discriminant Analysis (LDA) approach to define an emotion classifier. To this end our approach is facilitated by some assumptions like the need of well defined start and peak frames for each emotion under recognition. The experiments show that the method we propose can be successfully further developed for most of the real cases of face emotion recognition.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"93 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":"130291851","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 Pseudo Random Sequences (PRSs) have been widely used for encrypting sensitive data in wireless networks, communication systems and other. The balance property of the previously proposed p-ary Generalized Self-Shrinking Generator (pGSSG) is examined. The theoretical value of the balance property of the sequences produced by the pGSSG is established and proven. Test results for it are compared to the theoretical ones. It is shown that the pGSSG sequences have the needed properties to be considered as balanced.
{"title":"About balance property of the p-ary generalized self-shrinking generator sequence","authors":"Antoniya Tasheva, Ognian Nakov, Zhaneta Tasheva","doi":"10.1145/2516775.2516786","DOIUrl":"https://doi.org/10.1145/2516775.2516786","url":null,"abstract":"The Pseudo Random Sequences (PRSs) have been widely used for encrypting sensitive data in wireless networks, communication systems and other. The balance property of the previously proposed p-ary Generalized Self-Shrinking Generator (pGSSG) is examined. The theoretical value of the balance property of the sequences produced by the pGSSG is established and proven. Test results for it are compared to the theoretical ones. It is shown that the pGSSG sequences have the needed properties to be considered as balanced.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"3 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":"125401658","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. Datcu, Marina-Anca Cidotã, S. Lukosch, L. Rothkrantz
The current paper presents a comparative study on the influence of different face regions for contactless extraction of the heart rate by computer vision in visible spectrum. A second novelty of our research is the use of Active Appearance Models for computing the shape of the face and of the facial features. Following an experimental setup, we determine that forehead and cheek face regions are more relevant for computing the heart rate. This outcome leads to an optimized face scanning method, faster processing times and better pulse detection results. The findings were implemented in an automatic system prototype for noncontact face analysis. Our methods were tested and validated using video recordings of people in laboratory setup.
{"title":"Noncontact automatic heart rate analysis in visible spectrum by specific face regions","authors":"D. Datcu, Marina-Anca Cidotã, S. Lukosch, L. Rothkrantz","doi":"10.1145/2516775.2516805","DOIUrl":"https://doi.org/10.1145/2516775.2516805","url":null,"abstract":"The current paper presents a comparative study on the influence of different face regions for contactless extraction of the heart rate by computer vision in visible spectrum. A second novelty of our research is the use of Active Appearance Models for computing the shape of the face and of the facial features. Following an experimental setup, we determine that forehead and cheek face regions are more relevant for computing the heart rate. This outcome leads to an optimized face scanning method, faster processing times and better pulse detection results. The findings were implemented in an automatic system prototype for noncontact face analysis. Our methods were tested and validated using video recordings of people in laboratory setup.","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":"129570297","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 term "Big Data" became a buzzword and is widely used in both research and industrial worlds. Typically the concept of big data assumes a variety of different sources of information and velocity of complex analytical processing, rather than just a huge and growing volume of data. All variety, velocity, and volume create new research challenges, as nearly all techniques and tools commonly used in data processing have to be re-considered. Variety and uncertainty of big data require a mixture of exact and similarity search and grouping of complex objects based on different attributes. High-level declarative query languages are important in this context due to expressiveness and potential for optimization. In this talk we are mostly interested in an algebraic layer for complex query processing which resides between user interface (most likely, graphical) and execution engine in layered system architecture. We analyze the applicability of existing models and query languages. We describe a systematic approach to similarity handling of complex objects, simultaneous application of different similarity measures and querying paradigms, complex searching and querying, combined semi-structured and unstructured search. We introduce the adaptive abstract operations based on the concept of fuzzy set, which are needed to support uniform handling of different kinds of similarity processing. To ensure an efficient implementation, approximate algorithms with controlled quality are required to enable quality versus performance trade-off for timeliness of similarity processing. Uniform and adaptive operations enable high-level declarative definition of complex queries and provide options for optimization.
{"title":"Querying big data","authors":"Boris Novikov, N. Vassilieva, A. Yarygina","doi":"10.1145/2383276.2383278","DOIUrl":"https://doi.org/10.1145/2383276.2383278","url":null,"abstract":"The term \"Big Data\" became a buzzword and is widely used in both research and industrial worlds. Typically the concept of big data assumes a variety of different sources of information and velocity of complex analytical processing, rather than just a huge and growing volume of data. All variety, velocity, and volume create new research challenges, as nearly all techniques and tools commonly used in data processing have to be re-considered. Variety and uncertainty of big data require a mixture of exact and similarity search and grouping of complex objects based on different attributes. High-level declarative query languages are important in this context due to expressiveness and potential for optimization.\u0000 In this talk we are mostly interested in an algebraic layer for complex query processing which resides between user interface (most likely, graphical) and execution engine in layered system architecture. We analyze the applicability of existing models and query languages. We describe a systematic approach to similarity handling of complex objects, simultaneous application of different similarity measures and querying paradigms, complex searching and querying, combined semi-structured and unstructured search. We introduce the adaptive abstract operations based on the concept of fuzzy set, which are needed to support uniform handling of different kinds of similarity processing. To ensure an efficient implementation, approximate algorithms with controlled quality are required to enable quality versus performance trade-off for timeliness of similarity processing. Uniform and adaptive operations enable high-level declarative definition of complex queries and provide options for optimization.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124467110","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}
Silvestru Catalin Ionut, N. Florentin, Intorsureanu Iulian, Bere Ramona Camelia, Orzan Mihai Cristian, D. Maria
Blogs are becoming increasing presences in consumers' habits and many of them base their opinions on information found online. As a result, companies need to include them in their branding and marketing research efforts. But out of the millions of weblogs on the Internet which should be used and which not? And should companies start to use their own (corporate) blogs as part of online marketing strategies? In this paper we report a survey aimed at findings which are the assets of a successful blog, using consumers' perspective and we present an empirical blog success model based on them.
{"title":"An empirical model of corporate blog impact in marketing communications","authors":"Silvestru Catalin Ionut, N. Florentin, Intorsureanu Iulian, Bere Ramona Camelia, Orzan Mihai Cristian, D. Maria","doi":"10.1145/2383276.2383326","DOIUrl":"https://doi.org/10.1145/2383276.2383326","url":null,"abstract":"Blogs are becoming increasing presences in consumers' habits and many of them base their opinions on information found online. As a result, companies need to include them in their branding and marketing research efforts. But out of the millions of weblogs on the Internet which should be used and which not? And should companies start to use their own (corporate) blogs as part of online marketing strategies? In this paper we report a survey aimed at findings which are the assets of a successful blog, using consumers' perspective and we present an empirical blog success model based on them.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126652175","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 directory management is an essential part of the file systems. The carefully designed directory's internal structures can have major impact on the performance. The modern file systems tend to support millions of files per directory and the file name indexing is a milestone. Two main approaches exist -- b-trees and hashing. The current paper proposes a modification of the b-tree which combines the features of both. It is presented the modification -- the so-called bh-tree and an approach to index and maintain the file names in a directory. The aim is fast and parallelizable management of the indexed file names.
{"title":"An approach for indexing file names in a directory","authors":"Ivaylo Atanassov","doi":"10.1145/2383276.2383315","DOIUrl":"https://doi.org/10.1145/2383276.2383315","url":null,"abstract":"The directory management is an essential part of the file systems. The carefully designed directory's internal structures can have major impact on the performance. The modern file systems tend to support millions of files per directory and the file name indexing is a milestone. Two main approaches exist -- b-trees and hashing. The current paper proposes a modification of the b-tree which combines the features of both. It is presented the modification -- the so-called bh-tree and an approach to index and maintain the file names in a directory. The aim is fast and parallelizable management of the indexed file names.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129827570","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}
Facial expressions play an important role in human communication. Accurate recognition of facial expressions is important to understand nonverbal communication. Many tools have been developed but to recognize facial impressions in real life communications independent of lighting conditions, posture, occlusion and different intensities is still an unsolved problem. In the underlying paper we researched facial movements in daily interaction by tracking painted markers on the face to assess the displayed facial expressions. We analysed recordings of text based communication and computed the dictionary of emotional facial expressions and nonverbal grammatical rules.
{"title":"Automatic assessment of facial expressions using fiducial points","authors":"A. Wojdel, L. Rothkrantz","doi":"10.1145/2383276.2383319","DOIUrl":"https://doi.org/10.1145/2383276.2383319","url":null,"abstract":"Facial expressions play an important role in human communication. Accurate recognition of facial expressions is important to understand nonverbal communication. Many tools have been developed but to recognize facial impressions in real life communications independent of lighting conditions, posture, occlusion and different intensities is still an unsolved problem. In the underlying paper we researched facial movements in daily interaction by tracking painted markers on the face to assess the displayed facial expressions. We analysed recordings of text based communication and computed the dictionary of emotional facial expressions and nonverbal grammatical rules.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522203","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
扫码关注我们
求助内容：
应助结果提醒方式：