Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Computer Engineering
Network Analysis With Stochastic Grammars, Alan C. Lin
Network Analysis With Stochastic Grammars, Alan C. Lin
Theses and Dissertations
Digital forensics requires significant manual effort to identify items of evidentiary interest from the ever-increasing volume of data in modern computing systems. One of the tasks digital forensic examiners conduct is mentally extracting and constructing insights from unstructured sequences of events. This research assists examiners with the association and individualization analysis processes that make up this task with the development of a Stochastic Context -Free Grammars (SCFG) knowledge representation for digital forensics analysis of computer network traffic. SCFG is leveraged to provide context to the low-level data collected as evidence and to build behavior profiles. Upon discovering patterns, the analyst …
Predicting Cross-Gaming Propensity Using E-Chaid Analysis, Eunju Suh, Matt Alhaery
Predicting Cross-Gaming Propensity Using E-Chaid Analysis, Eunju Suh, Matt Alhaery
UNLV Gaming Research & Review Journal
Cross-selling different types of games could provide an opportunity for casino operators to generate additional time and money spent on gaming from existing patrons. One way to identify the patrons who are likely to cross-play is mining individual players’ gaming data using predictive analytics. Hence, this study aims to predict casino patrons’ propensity to play both slots and table games, also known as cross-gaming, by applying a data-mining algorithm to patrons’ gaming data. The Exhaustive Chi-squared Automatic Interaction Detector (E-CHAID) method was employed to predict cross-gaming propensity. The E-CHAID models based on the gaming-related behavioral data produced actionable model accuracy …
Automatic Classification Of Harmonic Data Using $K$-Means And Least Square Support Vector Machine, Hüseyi̇n Eri̇şti̇, Vedat Tümen, Özal Yildirim, Belkis Eri̇şti̇, Yakup Demi̇r
Automatic Classification Of Harmonic Data Using $K$-Means And Least Square Support Vector Machine, Hüseyi̇n Eri̇şti̇, Vedat Tümen, Özal Yildirim, Belkis Eri̇şti̇, Yakup Demi̇r
Turkish Journal of Electrical Engineering and Computer Sciences
In this paper, an effective classification approach to classify harmonic data has been proposed. In the proposed classifier approach, harmonic data obtained through a 3-phase system have been classified by using $k$-means and least square support vector machine (LS-SVM) models. In order to obtain class details regarding harmonic data, a $k$-means clustering algorithm has been applied to these data first. The training of the LS-SVM model has been realized with the class details obtained through the $k$-means algorithm. To increase the efficiency of the LS-SVM model, the regularization and kernel parameters of this model have been determined with a grid …
A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
A Theory Of Name Resolution, Pierre Néron, Andrew Tolmach, Eelco Visser, Guido Wachsmuth
Computer Science Faculty Publications and Presentations
We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two-stage problem. First a language-independent scope graph is constructed using language-specific rules from an abstract syntax tree. Then references in the scope graph are resolved to corresponding declarations using a language-independent resolution process. We introduce a resolution calculus as a concise, declarative, and language- independent specification of name resolution. We develop a resolution algorithm that is sound and complete with respect to the calculus. Based on the resolution calculus we …