The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Currently, open source projects receive various kinds of issues daily, because of the extreme openness of Issue Tracking System (ITS) in GitHub. ITS is a labor-intensive and time-consuming task of issue categorization for project managers. However, a contributor is only required a short textual abstract to report an issue in GitHub. Thus, most traditional classification approaches based on detailed...
Because of the rapid growth of open source software, how to choose software from many alternatives becomes a great challenge. Traditional ranking approaches mainly focus on the characteristics of the software themselves. In this paper we investigate the market demands for software engineers, and propose a novel approach for ranking software by analyzing the market requirements for special software...
Open Source Forge (OSF) websites provide information on massive open source software projects, extracting these web data is important for open source research. Traditional extraction methods use string matching among pages to detect page template, which is time-consuming. A recent work published in VLDB exploits redundant entities among websites to detect web page coordinates of these entities. The...
Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for...
It is quite a headache for developers to online detect performance problems in large-scale cloud computing systems. The behavior and the hidden connections among the huge amount of runtime request execution paths in cloud computing systems usually contain useful information for performance problem detection. In this paper, we propose an approach to rapidly diagnose the source of performance degradation...
Participants of a software project have a significant impact on whether the project could achieve success, and the relevant information can reflect some trustworthy properties of software. By studying a large number of OSS projects in SourceForge, the role configuration of these projects is analyzed, and some latent frequent patterns are discovered in this paper. It prepares the ground for quantification...
Most of metrics used in existing OSS evaluation models are difficult to rate and costly to obtain, and the rates of them are tendentiously subjective and inconvincible. This paper tries to find some kinds of data in OSS repositories which can be easily obtained and used as metrics for more practical OSS evaluation. By mining and analyzing nearly 8,000 SourceForge projects, this paper achieves three...
With the appearance and growing application of open systems such as Internet, delegation is a primary mechanism to enforce access control in such systems. This paper distinguishes two kinds of delegation: authority delegation (AUD) and access delegation (ACD), and proposes a first-order logic system SRDL to capture the features of the two kinds of delegation models. SRDL properly describes AUD and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.