The Asia-Pacific Software Engineering Conference (APSEC) is a reputed and a long-running conference which has successfully completed more than two decades as of year 2015. We conduct a bibliometric and scientific publication mining based study to how the conference has evolved over the recent past six years (year 2010 to 2015). Our objective is to perform in-depth examination of the state of APSEC so that the APSEC community can identify strengths, areas of improvements and future directions for the conference. Our empirical analysis is based on various perspectives such as: paper submission acceptance rate trends, conference location, scholarly productivity and contributions from various countries, analysis of keynotes, workshops, conference organizers and sponsors, tutorials, identification of prolific authors, computation of citation impact of papers and contributing authors, internal and external collaboration, university and industry participation and collaboration, measurement of gender imbalance, topical analysis, yearly author churn and program committee characteristics.
In this Section, we present related work and the novel contributions of the study presented in this paper in context to existing work. analyze research papers published in MSR (Mining Software Repositories) series of conferences from @math to @math (a period of @math years) @cite_0 . conduct a bibliometric study consisting of mining @math papers in Requirements Engineering (RE) series of conference of @cite_6 . analyze @math years of RE papers published from the year @math to @math . They study several aspects such as: authorship numbers and scholarly productivity of various countries or regions, interdisciplinarity, topic modeling and categorization, collaboration (university and industry, internal and external) and public and proprietary dataset @cite_6 . conduct a research study on gender imbalance and low participation of women in Computer Science Research (CSR) @cite_11 . They conduct several empirical and statistical analysis consisting of mining thousands of bibliometric entries in DBLP http: dblp.uni-trier.de bibliography data @cite_11 . Their findings reveal that in the broad field of Computer Science, there is a gender balance wherein only @math 740 @math 2001 @math 2010 @math 2010 @math 2015$) through arXiv open access https: arxiv.org .
@cite_0 @cite_6 @cite_11
2317735812 2382843593 1978848845 2000931246
The low participation by women authors in research is an important equity issue in Computer Science Research (CSR). There are various parameters and methodologies that can be used to measure the gender imbalance. In this paper, we present a study on gender gap, imbalance and women participation in CSR. We conduct our experiments on DBLP bibliographical database and analyze several years of publication dataset across various domains of CSR. We perform Exploratory Data Analysis on the bibliographical dataset and study the trend of gender imbalance over several years. We propose eight research questions across various facets and our results shows a significant gender imbalance in different sub-fields within CSR and low rate of women participation across various regions of world. We present insights from a bibliometric analysis and scientific paper publication mining of 551 papers in Requirements Engineering (RE) series of conference (11 years from 2005 to 2015). We study cross-disciplinary and interdisciplinary nature of RE re- search by analyzing the cited disciplines in the reference section of each paper. We apply topic modeling on a corpus consisting of 551 abstracts and extract topics as frequently co-occurring and connected terms. We use topic modeling to study the structure and composition of RE research and analyze popular topics in industry as well as research track. Co-authorship in papers is an indicator of collaboration and interaction between scientists as well as institutions and we analyze co-authorship data to in- vestigate university-industry collaboration, internal and external collaborations. We present results on the distribution of the num- ber of co-authors in each paper as well as distribution of authors across world regions. We present our analysis on the public or proprietary dataset as well as the domain of the dataset used in studies published in Requirements Engineering (RE) series of conferences. T his document is the report of a workshop that convened a group of experts to discuss the recruitment and retention of women in Computer Science and Engineering (CSE) Graduate Programs. (1) Participants included long-time members of the CSE academic and research communities, social scientists engaged in relevant research, and directors of successful retention efforts. (2) The report is a compendium of the experience and expertise of workshop participants, rather than the result of a full-scale, scholarly study into the range of issues. Its goal is to provide departments with practical advice on recruitment and retention in the form of a set of specific recommendations. Women are significantly underrepresented in CSE academic departments [5][40]. As computing technology becomes increasingly pervasive, this underrepresentation translates into a loss of opportunity for individuals, a loss of talent to the workforce, and a loss of creativity in shaping the future of society. While there are many causes of this underrepresentation some rooted in early socialization and primary educational experiences academic departments at the university level nevertheless can have an effect [6][7]. In particular, an improvement at the graduate level in recruitment and retention (and thus in graduation rates) would enable more women to move into visible and influential positions in the CSE community. The increasing presence of these women would provide positive role models and mentors. In order to treat all students fairly, educators must pay attention to gender-based traits. Although in characterizing behaviors one must be careful to acknowledge the existence of individual differences and to avoid stereotyping, there is a large body of information on gender traits. There is strong evidence, for example, that women, even though they perform at the same levels, have less confidence in their abilities and individual accomplishments than men [2][17][36][39][43]. Women are often less aggressive than male students in promoting themselves, attempting new or challenging activities, and pursuing awards or fellowships. There is evidence that females come to computing as only one interest among many, and are thus less single-minded than their male counterparts [27]. Often women report feeling "out of place" in the male-dominated, hacker culture [3] [22] [28]. In light of such differences, some of our recommendations are gender-specific. Most, however, are not. The adoption of our recommendations would improve the educational environment for all students. The recommendations are given in two sections, the first Let f be a random Boolean formula that is an instance of 3-SAT. We consider the problem of computing the least real number k such that if the ratio of the number of clauses over the number of variables of f strictly exceeds k , then f is almost certainly unsatisfiable. By a well-known and more or less straightforward argument, it can be shown that kF5.191. This upper bound was improved by to 4.758 by first providing new improved bounds for the occupancy problem. There is strong experimental evidence that the value of k is around 4.2. In this work, we define, in terms of the random formula f, a decreasing sequence of random variables such that, if the expected value of any one of them converges to zero, then f is almost certainly unsatisfiable. By letting the expected value of the first term of the sequence converge to zero, we obtain, by simple and elementary computations, an upper bound for k equal to 4.667. From the expected value of the second term of the sequence, we get the value 4.601q . In general, by letting the U This work was performed while the first author was visiting the School of Computer Science, Carleton Ž University, and was partially supported by NSERC Natural Sciences and Engineering Research Council . of Canada , and by a grant from the University of Patras for sabbatical leaves. The second and third Ž authors were supported in part by grants from NSERC Natural Sciences and Engineering Research . Council of Canada . During the last stages of this research, the first and last authors were also partially Ž . supported by EU ESPRIT Long-Term Research Project ALCOM-IT Project No. 20244 . †An extended abstract of this paper was published in the Proceedings of the Fourth Annual European Ž Symposium on Algorithms, ESA’96, September 25]27, 1996, Barcelona, Spain Springer-Verlag, LNCS, . pp. 27]38 . That extended abstract was coauthored by the first three authors of the present paper. Correspondence to: L. M. Kirousis Q 1998 John Wiley & Sons, Inc. CCC 1042-9832r98r030253-17 253