Search

The profusion of documents production at an exponential rate over the web has made it difficult for the scientific community to retrieve most relevant information against the query. The research community is busy in proposing innovative mechanisms to ensure the document retrieval in a flexible manner. The document classification is a core concept of information retrieval that classifies the documents into predefined categories. In scientific domain, classification of documents to predefined category (ies) is an important research problem and supports number of tasks such as information retrieval, finding experts, recommender systems, etc. In Computer Science, the Association for Computing Machinery (ACM) categorization system is commonly used for organizing research papers in the topical hierarchy defined by the ACM. Accurately assigning a research paper to a predefined category (ACM topic) is a difficult task especially when the paper belongs to multiple topics. In this paper, we exploit the reference section of a research paper to predict the topics of the paper. We have proposed a framework called Category-Based Category Identification (CBCI) for multi-label research papers classification. The proposed approach extracted references from training dataset and grouped them in a Topic-Reference (TR) pair such as TR {Topic, Reference}. The references of the focused paper are parsed and compared in the pair TR {Topic, Reference}. The approach collects the corresponding list of topics matched with the references in the said pair. We have evaluated our technique for two datasets that is Journal of Universal Computer Science (JUCS) and ACM. The proposed approach is able to predict the first node in the ACM topic (topic A to K) with 74% accuracy for both JUCS and ACM dataset for multi-label classification. [ABSTRACT FROM AUTHOR]

Software Industry is evolving at a very fast pace since last two decades. Many software developments, testing and test case generation approaches have evolved in last two decades to deliver quality products and services. Testing plays a vital role to ensure the quality and reliability of software products. In this paper authors attempted to conduct a systematic study of testing tools and techniques. Six most popular e-resources called IEEE, Springer, Association for Computing Machinery (ACM), Elsevier, Wiley and Google Scholar to download 738 manuscripts out of which 125 were selected to conduct the study. Out of 125 manuscripts selected, a good number approx. 79% are from reputed journals and around 21% are from good conference of repute. Testing tools discussed in this paper have broadly been divided into five different categories: open source, academic and research, commercial, academic and open source, and commercial & open source. The paper also discusses several benchmarked datasets viz. Evosuite 10, SF100 Corpus, Defects4J repository, Neo4j, JSON, Mocha JS, and Node JS to name a few. Aim of this paper is to make the researchers aware of the various test case generation tools and techniques introduced in the last 11 years with their salient features. [ABSTRACT FROM AUTHOR]

Human Pose Estimation (HPE) has received considerable attention during the past years, improving its performance thanks to the use of Deep Learning, and introducing new interesting uses, such as its application in Sport and Physical Exercise (SPE). The aim of this systematic review is to analyze the literature related to the application of HPE in SPE, the available data, methods, performance, opportunities, and challenges. One reviewer applied different inclusion and exclusion criteria, as well as quality metrics, to perform the paper filtering through the paper databases. The Association for Computing Machinery Digital Library, Web of Science, and dblp included more than 500 related papers after the initial filtering, finally resulting in 20. In addition, research was carried out regarding the publicly available data related to this topic. It can be concluded that even if related public data can be found, much more data is needed to be able to obtain good performance in different contexts. In relation with the methods of the authors, the use of general purpose systems as base, such as Openpose, combined with other methods and adaptations to the specific use case can be found. Finally, the limitations, opportunities, and challenges are presented. [ABSTRACT FROM AUTHOR]

The paper presents a bibliometric analysis from 2014 to 2020 of the emerging and engaging field of quantum computing called Quantum Machine Learning (QML). The study discusses the analysis results from the comprehensive high indexed databases worldwide such as Institute of Electrical and Electronics Engineers (IEEE), Scopus, Web of Science (WOS), Google Scholar and the Association for Computing Machinery (ACM). Tools like iMapbuilder, IBM and SPSS Statistics are used to provide meaningful insights and flawless representations of the extracted data. There has been little research to provide a macroscopic overview of renowned authors, subject areas, funding agencies and patent applications related to Quantum Clustering (QC). The result and analysis of this study show an interesting fact, most researchers are now aware of quantum technology from the past few years. The purpose of bibliometric and patentometric analysis papers is to figure out the importance and utility of the QC research area. Most of the countries are taking an initiative to seek attention towards QC but the analysis shows that China and the US are leading. The survey revealed that the maximum numbers of publications of QC are from Physics and Astronomy followed by Computer Science. [ABSTRACT FROM AUTHOR]

We are pleased in this issue to present extended and enhanced versions of four award-nominated papers from the 2016 ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '16). JCDL can lay claim to being I the i preeminent academic conference for digital library research and so the papers in this issue reflect the best of what already is a highly selective group. A smaller group of papers were identified from the conference's papers as candidates for one of the conference's two full paper awards - papers selected either were specifically recommended by program committee members and/or were ones receiving the most positive reviews. [Extracted from the article]

Engineering and manufacturing processes and systems designs involve many challenges, such as dynamism, chaotic behaviours, and complexity. Of late, the arrival of big data, high computational speed, cloud computing and artificial intelligence techniques (like machine learning and deep learning) has reformed how many engineering and manufacturing professionals approach their work. These technologies offer thrilling innovative ways for engineers and manufacturers to tackle real-life challenges. On the other hand, the field of Artificial Intelligence (AI) is extensive. Several diverse theories, algorithms, and methods are available, which presents a challenge and a barrier in choosing the right AI technique for the appropriate engineering process or manufacturing process and environments. Besides, the pertinent literature is disseminated over various journals, conference proceedings, and research communities. Hence, conducting a systematic survey to scrutinise and classify the existing literature is worthwhile. However, it is challenging, but previous review studies have not adequately addressed AI's use and advancement in engineering and manufacturing (EM). Besides, some concentrated on single AI models, and others focused on a specific area in EM. This paper presents a comprehensive systematic review of studies on AI and its application in EM. To limit the scope of the current study, we conducted a keyword search in official publisher websites and academic databases, such as Springer, Elsevier, Scopus, Science Publication, Taylor & Francis, Directory of Open Access Journals (DOAJ), Association for Computing Machinery (ACM), Wiley online library, Inderscience and Google scholar. The search results (173 articles) were filtered according to a proposed framework, which resulted in ninety-one (91) relevant research articles. We reviewed the articles based on a proposed taxonomy (the year of publication, the AI algorithm and machine learning task adopted, the application area in EM, the train and test split of data, the error, and accuracy metrics used, the potential benefits). Our assessment using the proposed taxonomy gave a helpful insight into the literature's anatomy on various AI applications in engineering and manufacturing. Also, we identified opportunities for future research in AI application in the field of EM. [ABSTRACT FROM AUTHOR]

The author reflects on the benefits of presenting articles in "ACM Transactions on Database Systems" (TODS) at the Association for Computing Machinery (ACM) Special Interest Group on Management of Data (SIGMOD) conference. He discusses the differences between journal and conference publications and cites the benefits of presenting TODS articles at the ACM SIGMOD conference including presentation by talk, as poster, or both, funds to attend conference, and increased visibility of the article.

The rise in research work focusing on detection of cyberbullying incidents on social media platforms particularly reflect how dire cyberbullying consequences are, regardless of age, gender or location. This paper examines scholarly publications (i.e., 2011–2022) on cyberbullying detection using machine learning through a systematic literature review approach. Specifically, articles were sought from six academic databases (Web of Science, ScienceDirect, IEEE Xplore, Association for Computing Machinery, Scopus, and Google Scholar), resulting in the identification of 4126 articles. A redundancy check followed by eligibility screening and quality assessment resulted in 68 articles included in this review. This review focused on three key aspects, namely, machine learning algorithms used to detect cyberbullying, features, and performance measures, and further supported with classification roles, language of study, data source and type of media. The findings are discussed, and research challenges and future directions are provided for researchers to explore. [ABSTRACT FROM AUTHOR]

Background: Opinion mining, or sentiment analysis, is a field in Natural Language Processing (NLP). It extracts people's thoughts, including assessments, attitudes, and emotions toward individuals, topics, and events. The task is technically challenging but incredibly useful. With the explosive growth of the digital platform in cyberspace, such as blogs and social networks, individuals and organisations are increasingly utilising public opinion for their decision-making. In recent years, significant research concerning mining people's sentiments based on text in cyberspace using opinion mining has been explored. Researchers have applied numerous opinions mining techniques, including machine learning and lexicon-based approach to analyse and classify people's sentiments based on a text and discuss the existing gap. Thus, it creates a research opportunity for other researchers to investigate and propose improved methods and new domain applications to fill the gap. Methods: In this paper, a structured literature review has been done by considering 122 articles to examine all relevant research accomplished in the field of opinion mining application and the suggested Kansei approach to solve the challenges that occur in mining sentiments based on text in cyberspace. Five different platforms database were systematically searched between 2015 and 2021: ACM (Association for Computing Machinery), IEEE (Advancing Technology for Humanity), SCIENCE DIRECT, SpringerLink, and SCOPUS. Results: This study analyses various techniques of opinion mining as well as the Kansei approach that will help to enhance techniques in mining people's sentiment and emotion in cyberspace. Most of the study addressed methods including machine learning, lexicon-based approach, hybrid approach, and Kansei approach in mining the sentiment and emotion based on text. The possible societal impacts of the current opinion mining technique, including machine learning and the Kansei approach, along with major trends and challenges, are highlighted. Conclusion: Various applications of opinion mining techniques in mining people's sentiment and emotion according to the objective of the research, used method, dataset, summarized in this study. This study serves as a theoretical analysis of the opinion mining method complemented by the Kansei approach in classifying people's sentiments based on text in cyberspace. Kansei approach can measure people's impressions using artefacts based on senses including sight, feeling and cognition reported precise results for the assessment of human emotion. Therefore, this research suggests that the Kansei approach should be a complementary factor including in the development of a dictionary focusing on emotion in the national security domain. Also, this theoretical analysis will act as a reference to researchers regarding the Kansei approach as one of the techniques to improve hybrid approaches in opinion mining. [ABSTRACT FROM AUTHOR]

The article offers information of the Association for Computing Machinery (ACM) International Conference on Multimedia System (MMSys'16) which was held in Klagenfurt, Austria. It mentions information on presentations given by Dieter Schmalstieg, Graz University of Technology, Austria regarding Augmented Reality Systems. It states impact of video quality over client-side adaptation algorithm.

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

Emotion recognition has attracted major attention in numerous fields because of its relevant applications in the contemporary world: marketing, psychology, surveillance, and entertainment are some examples. It is possible to recognize an emotion through several ways; however, this paper focuses on facial expressions, presenting a systematic review on the matter. In addition, 112 papers published in ACM, IEEE, BASE and Springer between January 2006 and April 2019 regarding this topic were extensively reviewed. Their most used methods and algorithms will be firstly introduced and summarized for a better understanding, such as face detection, smoothing, Principal Component Analysis (PCA), Local Binary Patterns (LBP), Optical Flow (OF), Gabor filters, among others. This review identified a clear difficulty in translating the high facial expression recognition (FER) accuracy in controlled environments to uncontrolled and pose-variant environments. The future efforts in the FER field should be put into multimodal systems that are robust enough to face the adversities of real world scenarios. A thorough analysis on the research done on FER in Computer Vision based on the selected papers is presented. This review aims to not only become a reference for future research on emotion recognition, but also to provide an overview of the work done in this topic for potential readers. [ABSTRACT FROM AUTHOR]

Modeling 3D origami pieces using conventional software is laborious due to the geometric constraints imposed by the complicated layered structure. Targeting origami models used in visual content such as CG illustrations and movies, we propose an interactive system that dramatically simplifies the modeling of 3D origami pieces with plausible outer shapes, while omitting accurate inner structures. By focusing on flat origami models with a front‐and‐back symmetry commonly found in traditional artworks, our system realizes easy and quick modeling via single‐view interface; given a reference image of the target origami piece, the user draws polygons of planar faces onto the image, and assigns annotations indicating the types of folding operations. Our system automatically rectifies the manually‐specified polygons, infers the folded structures that should yield the user‐specified polygons with reference to the depth order of layered polygons, and generates a plausible 3D model while accounting for gaps between layers. Our system is versatile enough for modeling pseudo‐origami models that are not realizable by folding a single sheet of paper. Our user study demonstrates that even novice users without the specialized knowledge and experience on origami and 3D modeling can create plausible origami models quickly. [ABSTRACT FROM AUTHOR]

Objective. The aim of this study was to evaluate wound biomodification by assessing antimicrobial properties present within a human-derived composite amnion-chorion membrane (ACM). Methods. Membranes analyzed were the human-derived ACM BioXclude™ and the porcine-derived collagen membrane Bio-Gide®. Paper discs with and without tetracycline served as positive and negative controls, respectively. The same number of colony-forming units per milliliter for each bacterial species (Aggregatibacter actinomycetemcomitans, Streptococcus mutans, and Streptococcus oralis) was inoculated on each of the discs. Discs from each group were removed at 12 and 24 hours and sonicated to remove the bacteria off the membranes. A serial dilution was performed to quantify bacterial growth. Results. The ACM inhibited growth at all time points, with all bacterial strains, identical to the negative control tetracycline discs. The collagen membrane and positive controls did not inhibit growth of any of the bacterial species throughout the 24-hour study period. P<0.05 for microbial growth on ACM or negative control vs. either collagen membrane or positive control. Conclusion. ACM was proven to be as bactericidal as paper discs inoculated with tetracycline at its minimum bactericidal concentration. The ACM bactericidal property may be beneficial in the early wound healing process. [ABSTRACT FROM AUTHOR]

Accurate optic disc (OD) detection is an essential yet vital step for retinal disease diagnosis. In the paper, an approach for segmenting OD boundary without manpower named full-automatic double boundary extraction is designed. There are two main advantages in it. (1) Since the performances and the computational cost produced by iterations of contour evolution of active contour models- (ACM-) based approaches greatly depend on the initialization, this paper proposes an effective and adaptive initial level set contour extraction approach using saliency detection and threshold techniques. (2) In order to handle unreliable information generated by intensity in abnormal retinal images caused by diseases, a modified LIF approach is presented by incorporating the shape prior information into LIF. We test the effectiveness of the proposed approach on a publicly available DIARETDB0 database. Experimental results demonstrate that our approach outperforms well-known approaches in terms of the average overlapping ratio and accuracy rate. [ABSTRACT FROM AUTHOR]

Purpose: With the shift to an information-based society and to the de-centralisation of information, information overload has attracted a growing interest in the computer and information science research communities. However, there is no clear understanding of the meaning of the term, and while there have been many proposed definitions, there is no consensus. The goal of this work was to define the concept of "information overload". In order to do so, a concept analysis using Rodgers' approach was performed. Design/methodology/approach: A concept analysis using Rodgers' approach based on a corpus of documents published between 2010 and September 2020 was conducted. One surrogate for "information overload", which is "cognitive overload" was identified. The corpus of documents consisted of 151 documents for information overload and ten for cognitive overload. All documents were from the fields of computer science and information science, and were retrieved from three databases: Association for Computing Machinery (ACM) Digital Library, SCOPUS and Library and Information Science Abstracts (LISA). Findings: The themes identified from the authors' concept analysis allowed us to extract the triggers, manifestations and consequences of information overload. They found triggers related to information characteristics, information need, the working environment, the cognitive abilities of individuals and the information environment. In terms of manifestations, they found that information overload manifests itself both emotionally and cognitively. The consequences of information overload were both internal and external. These findings allowed them to provide a definition of information overload. Originality/value: Through the authors' concept analysis, they were able to clarify the components of information overload and provide a definition of the concept. [ABSTRACT FROM AUTHOR]

Robust sunflowers are a generalization of combinatorial sunflowers that have applications in monotone circuit complexity Rossman (SIAM J. Comput. 43:256–279, 2014), DNF sparsification Gopalan et al. (Comput. Complex. 22:275–310 2013), randomness extractors Li et al. (In: APPROX-RANDOM, LIPIcs 116:51:1–13, 2018), and recent advances on the Erdős-Rado sunflower conjecture Alweiss et al. (In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC. Association for Computing Machinery, New York, NY, USA, 2020) Lovett et al. (From dnf compression to sunflower theorems via regularity, 2019) Rao (Discrete Anal. 8,2020). The recent breakthrough of Alweiss, Lovett, Wu and Zhang Alweiss et al. (In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC. Association for Computing Machinery, New York, NY, USA, 2020) gives an improved bound on the maximum size of a w-set system that excludes a robust sunflower. In this paper, we use this result to obtain an exp (n 1 / 2 - o (1)) lower bound on the monotone circuit size of an explicit n-variate monotone function, improving the previous best known exp (n 1 / 3 - o (1)) due to Andreev (Algebra and Logic, 26:1–18, 1987) and Harnik and Raz (In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, ACM, New York, 2000). We also show an exp (Ω (n)) lower bound on the monotone arithmetic circuit size of a related polynomial via a very simple proof. Finally, we introduce a notion of robust clique-sunflowers and use this to prove an n Ω (k) lower bound on the monotone circuit size of the CLIQUE function for all k ⩽ n 1 / 3 - o (1) , strengthening the bound of Alon and Boppana (Combinatorica, 7:1–22, 1987). [ABSTRACT FROM AUTHOR]

In the popular imagination, the relevance of Turing's theoretical ideas to people producing actual machines was significant and appreciated by everybody involved in computing from the moment he published his 1936 paper ‘On Computable Numbers’. Careful historians are aware that this popular conception is deeply misleading. We know from previous work by Campbell-Kelly, Aspray, Akera, Olley, Priestley, Daylight, Mounier-Kuhn, Haigh, and others that several computing pioneers, including Aiken, Eckert, Mauchly, and Zuse, did not depend on (let alone were they aware of) Turing's 1936 universal-machine concept. Furthermore, it is not clear whether any substance in von Neumann's celebrated 1945 ‘First Draft Report on the EDVAC’ is influenced in any identifiable way by Turing's work. This raises the questions: (i) When does Turing enter the field? (ii) Why did the Association for Computing Machinery (ACM) honor Turing by associating his name to ACM's most prestigious award, the Turing Award? Previous authors have been rather vague about these questions, suggesting some date between 1950 and the early 1960s as the point at which Turing is retroactively integrated into the foundations of computing and associating him in some way with the movement to develop something that people call computer science. In this paper, based on detailed examination of hitherto overlooked primary sources, attempts are made to reconstruct networks of scholars and ideas prevalent in the 1950s, and to identify a specific group ofactors interested in theorizing about computations in computers and attracted to the idea of language as a frame in which to understand computation. By going back to Turing's 1936 paper and, more importantly, to re-cast versions of Turing's work published during the 1950s (Rosenbloom, Kleene, Markov), I identify the factors that made this group of scholars particularly interested in Turing's work and provided the original vector by which Turing became to be appreciated in retrospect as the father of computer science. [ABSTRACT FROM PUBLISHER]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM PUBLISHER]

The Lisp programming language is often described as the first functional programming language and also as an important early AI language. In the history of functional programming, however, it occupies a rather anomalous position, as the circumstances of its development do not fit well with the widely accepted view that functional languages have been developed through a theoretically-inspired project of deriving practical programming languages from the lambda calculus. This paper examines the origins of Lisp in the early AI programming work of the mid-to-late 1950s, and in particular in the work of Allen Newell, Cliff Shaw and Herbert Simon. Their 1956 program, the Logic Theory Machine, introduced new ideas about data and program structures that were articulated in response to perceived limitations in existing programming technique. Later writers, notably John Backus, have described these features as constituting a 'programming language style' distinct from the traditional style that preceded it. The paper examines the origins of the earlier style in practices of manual computation, analyses the key technical differences between it and the style first manifested in the Logic Theory Machine, and concludes that programming practice and experience play a large and underappreciated role in the development of programming styles and languages. [ABSTRACT FROM AUTHOR]

In this paper, we present a systematic literature review concerning 3D object recognition and classification. We cover articles published between 2006 and 2016 available in three scientific databases (ScienceDirect, IEEE Xplore and ACM), using the methodology for systematic review proposed by Kitchenham. Based on this methodology, we used tags and exclusion criteria to select papers about the topic under study. After the works selection, we applied a categorization process aiming to group similar object representation types, analyzing the steps applied for object recognition, the tests and evaluation performed and the databases used. Lastly, we compressed all the obtained information in a general overview and presented future prospects for the area. [ABSTRACT FROM AUTHOR]

A family of ring-based cryptosystems, including the multilinear maps of Garg, Gentry and Halevi [Candidate multilinear maps from ideal lattices, Advances in Cryptology—EUROCRYPT 2013, Lecture Notes in Comput. Sci. 7881, Springer, Heidelberg 2013, 1–17] and the fully homomorphic encryption scheme of Smart and Vercauteren [Fully homomorphic encryption with relatively small key and ciphertext sizes, Public Key Cryptography—PKC 2010, Lecture Notes in Comput. Sci. 6056, Springer, Berlin 2010, 420–443], are based on the hardness of finding a short generator of a principal ideal (short-PIP) in a number field typically in ℚ ⁢ (ζ 2 s) {\mathbb{Q}(\zeta_{2^{s}})}. In this paper, we present a polynomial-time quantum algorithm for recovering a generator of a principal ideal in ℚ ⁢ (ζ 2 s) {\mathbb{Q}(\zeta_{2^{s}})} , and we recall how this can be used to attack the schemes relying on the short-PIP in ℚ ⁢ (ζ 2 s) {\mathbb{Q}(\zeta_{2^{s}})} by using the work of Cramer et al. [R. Cramer, L. Ducas, C. Peikert and O. Regev, Recovering short generators of principal ideals in cyclotomic rings, IACR Cryptology ePrint Archive 2015, https://eprint.iacr.org/2015/313], which is derived from observations of Campbell, Groves and Shepherd [SOLILOQUY, a cautionary tale]. We put this attack into perspective by reviewing earlier attempts at providing an efficient quantum algorithm for solving the PIP in ℚ ⁢ (ζ 2 s) {\mathbb{Q}(\zeta_{2^{s}})}. The assumption that short-PIP is hard was challenged by Campbell, Groves and Shepherd. They proposed an approach for solving short-PIP that proceeds in two steps: first they sketched a quantum algorithm for finding an arbitrary generator (not necessarily short) of the input principal ideal. Then they suggested that it is feasible to compute a short generator efficiently from the generator in step 1. Cramer et al. validated step 2 of the approach by giving a detailed analysis. In this paper, we focus on step 1, and we show that step 1 can run in quantum polynomial time if we use an algorithm for the continuous hidden subgroup problem (HSP) due to Eisenträger et al. [K. Eisenträger, S. Hallgren, A. Kitaev and F. Song, A quantum algorithm for computing the unit group of an arbitrary degree number field, Proceedings of the 2014 ACM Symposium on Theory of Computing—STOC'14, ACM, New York 2014, 293–302]. [ABSTRACT FROM AUTHOR]

We consider the point location problem in an arrangement of n arbitrary hyperplanes in any dimension d, in the linear decision tree model, in which we only count linear comparisons involving the query point, and all other operations do not explicitly access the query and are for free. We mainly consider the simpler variant (which arises in many applications) where we only want to determine whether the query point lies on some input hyperplane. We present an algorithm that performs a point location query with O (d 2 log n) linear comparisons, improving the previous best result by about a factor of d. Our approach is a variant of Meiser's technique for point location (Inf Comput 106(2):286–303, 1993) (see also Cardinal et al. in: Proceedings of the 24th European symposium on algorithms, 2016), and its improved performance is due to the use of vertical decompositions in an arrangement of hyperplanes in high dimensions, rather than bottom-vertex triangulation used in the earlier approaches. The properties of such a decomposition, both combinatorial and algorithmic (in the standard real RAM model), are developed in a companion paper (Ezra et al. arXiv:1712.02913, 2017), and are adapted here (in simplified form) for the linear decision tree model. Several applications of our algorithm are presented, such as the k-SUM problem and the Knapsack and SubsetSum problems. However, these applications have been superseded by the more recent result of Kane et al. (in: Proceedings of the 50th ACM symposium on theory of computing, 2018), obtained after the original submission (and acceptance) of the conference version of our paper (Ezra and Sharir in: Proceedings of the 33rd international symposium on computational geometry, 2017). This result only applies to 'low-complexity' hyperplanes (for which the ℓ 1 -norm of their coefficient vector is a small integer), which arise in the aforementioned applications. Still, our algorithm has currently the best performance for arbitrary hyperplanes. [ABSTRACT FROM AUTHOR]

In this paper we study the arithmetically Cohen-Macaulay (ACM) property for sets of points in multiprojective spaces. Most of what is known is for ℙ1 × ℙ1 and, more recently, in (ℙ1) r . In ℙ1 × ℙ1 the so called inclusion property characterises the ACM property. We extend the definition in any multiprojective space and we prove that the inclusion property implies the ACM property in ℙm × ℙn. In such an ambient space it is equivalent to the so-called (⋆)-property. Moreover, we start an investigation of the ACM property in ℙ1 × ℙn. We give a new construction that highlights how different the behavior of the ACM property is in this setting. [ABSTRACT FROM AUTHOR]

The problem of yield estimation and optimization of analog circuits is addressed in this paper. Given convex design-space constraints that define the feasible region for the design, we first linearize the feasible region by approximating it with linear constraints. Using the linear constraints approximating the feasible region, we make primarily two contributions in this paper—first we use the concept of parameter importance, introduced in Naidu (20th International conference on VLSI design, 2007. Held jointly with 6th international conference on embedded systems. IEEE, pp 265-270, 2007) and expanded on in Kondamadugula and Naidu (ACM Great Lakes symposium on VLSI. IEEE, pp 452-457, 2016), to partition the design space variables into those that affect yield a lot, and those that have only a marginal impact, and then use this information to speed-up a Monte-Carlo method that searches for a high-yield design point. Specifically, a two-step sampling procedure is devised for the variables where the outer-most loop is dedicated to the "weak" variables while the inner loop is dedicated to the "strong" variables. Thus the given simulation budget is then disproportionately directed towards those design space parameters deemed more important. Since there are likely be only a few variables that impact yield greatly, we can choose to use low-dimensional quasi-Monte-Carlo sequences for sampling in the inner loop which is an added benefit of our technique. For each sample design point, the Monte-Carlo algorithm would need to calculate yield using the Cadence yield estimation tool. This is a costly procedure. For the second application of the concept of parameter importance, we propose a fast procedure for calculating yield that works with a linear approximation of the feasible region, and uses design space information to speed up the calculation of yield. We compare our methodology with the standard one using the Cadence circuit simulator environment in 180 nm technology and show that we obtain superior results in the same amount of simulation time. [ABSTRACT FROM AUTHOR]

Copyright of Brazilian Journal of Information Science is the property of Brazilian Journal of Information Science and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Comparing two sets of documents to identify new topics is useful inmany applications, like discovering trending topics from sets of scientific papers, emerging topic detection in microblogs, and interpreting sentiment variations in Twitter. In this paper, the main topic-modeling-based approaches to address this task are examined to identify limitations and necessary enhancements. To overcome these limitations, we introduce two separate frameworks to discover emerging topics through a filtered latent Dirichlet allocation (filtered-LDA) model. The model acts as a filter that identifies old topics from a timestamped set of documents, removes all documents that focus on old topics, and keeps documents that discuss new topics. Filtered-LDA also genuinely reduces the chance of using keywords from old topics to represent emerging topics. The final stage of the filter uses multiple topic visualization formats to improve human interpretability of the filtered topics, and it presents the most-representative document for each topic. [ABSTRACT FROM AUTHOR]

Social media apps provide analysts with a wide range of data to study behavioral aspects of our everyday lives and to answer societal questions. Although social media data analysis is booming, only a handful of prominent social media apps, such as Twitter, Foursquare/Swarm, Facebook, or LinkedIn are typically used for this purpose. However, there is a large selection of less known social media apps that go unnoticed in the scientific community. This paper reviews 110 social media apps and assesses their potential usability in geospatial research through providing metrics on selected characteristics. About half of the apps (57 out of 110) offer an Application Programming Interface (API) for data access, where rate limits, fee models, and type of spatial data available for download vary strongly between the different apps. To determine the current role and relevance of social media platforms that offer an API in academic research, a search for scientific papers on Google Scholar, the Association for Computing Machinery (ACM) Digital Library, and the Science Core Collection of the Web of Science (WoS) is conducted. This search revealed that Google Scholar returns the highest number of documents (Mean = 183,512) compared to ACM (Mean = 1895) and WoS (Mean = 1495), and that data and usage patterns from prominent social media apps are more frequently analyzed in research studies than those of less known apps. The WoS citation database was also used to generate lists of themes covered in academic publications that analyze the 57 social media platforms that offer an API. Results show that among these 57 platforms, for 26 apps at least some papers evolve around a geospatial discipline, such as Geography, Remote Sensing, Transportation, or Urban Planning. This analysis, therefore, connects apps with commonly used research themes, and together with tabulated API characteristics can help researchers to identify potentially suitable social media apps for their research. Word clouds generated from titles and abstracts of papers associated with the 57 platforms, grouped into seven thematic categories, show further refinement of topics addressed in the analysis of social media platforms. Considering various evaluation criteria, such as provision of geospatial data or the number (i.e., absence) of currently published research papers in connection with a social media platform, the study concludes that among the numerous social media apps available today, 17 less known apps deserve closer examination since they might be used to investigate previously underexplored research topics. It is hoped that this study can serve as a reference for the analysis of the social media landscape in the future. [ABSTRACT FROM AUTHOR]

The paper presents an approach to encrypt the color images using bit-level permutation and alternate logistic map. The proposed method initially segregates the color image into red, green, and blue channels, transposes the segregated channels from the pixel-plane to bit-plane, and scrambles the bit-plane matrix using Arnold cat map (ACM). Finally, the red, blue, and green channels of the scrambled image are confused and diffused by applying alternate logistic map that uses a four-dimensional Lorenz system to generate a pseudorandom number sequence for the three channels. The parameters of ACM are generated with the help of Logistic-Sine map and Logistic-Tent map. The intensity values of scrambled pixels are altered by Tent-Sine map. One-dimensional and two-dimensional logistic maps are used for alternate logistic map implementation. The performance and security parameters histogram, correlation distribution, correlation coefficient, entropy, number of pixel change rate, and unified averaged changed intensity are computed to show the potential of the proposed encryption technique. [ABSTRACT FROM AUTHOR]

In this paper, an alternative active contour model (ACM) driven by an oppositional fruit fly algorithm (OFA) is presented. Unlike the traditional ACM variant, which is frequently caught in a local minimum, this methodology helps the focalizing of control points toward the global least of the energy function. In the proposed system, energy minimization is performed through a fruit fly algorithm, and every control point is compelled in a local search window. As for the local search window, the rectangular-shaped approach has been viewed. The results demonstrated that the fruit fly strategy utilizing polar coordinates is, for the most part, desirable over the fruit fly performed in rectangular shapes. Three performance metrics, such as the Jaccard index, the Dice index, and the Hausdorff distance, were utilized to validate the proposed strategy in real agricultural and synthetic images. From the results, it is clear that the proposed OFA technique shows a great option for the agricultural plant image segmentation process, considering any kind of disease that occurred in plant leaves. [ABSTRACT FROM AUTHOR]