Standards Research Data
This dataset presents real-world VPN encrypted traffic flows captured from five applications that belong to four service categories, which reflect typical usage patterns encountered by everyday users.
Our methodology utilized a set of automatic scripts to simulate real-world user interactions for these applications, to achieve a low level of noise and irrelevant network traffic.
The dataset consists of flow data collected from four service categories:
- Categories:
102 Views
This dataset contains information about code smell, which is a very important issue in software engineering.
It is built by collecting the method having code smell from GitHub using the SonarCloud tool.
There are 5 code smells and 1 normal class with 500 examples each.
the metadata: method (function),smellkey, smellid
Smell Type
ID
Description
Reference
java:S100
0
- Categories:
291 Views
This data set includes GAMS codes for the manuscript titled "Optimizing Unmanned Air Vehicle (UAV) Base Locations: A multi-objective optimization approach". There are four mixed integer programming models (M1, M2, M3 and M4) and one multi-objective algorithm (Alg1) coded in GAMS. The data used for the models are embeded in the codes. The codes should be run in GAMS environment. Each code gives the optimal solution for the associated model in which optimal objective function and decision variables values are provided.
- Categories:
116 Views
The dataset used was derived from a frequency tunable high power vacuum electron devices (HPVED) optimization task using a simple genetic algorithm (SGA). This device has the topology with 44 optimization parameters and 2 tuning parameters. Each of the two tuning parameters has 6 and 7 discrete adjustment values, respectively. The population size is set to 54, and each individual requires 42 simulations to evaluate its tunability.
- Categories:
389 Views
Spectroscopic ellipsometry measurements were conducted to determine optical constants of CdSexTe1-x (CST) compounds deposited through co-evaporation, with the composition parameter (x) ranging from 0 to 1. The dielectric function spectra obtained from these thin films were interpolated using an energy-shift algorithm to develop a comprehensive optical library for the CST compound with x ranging from 0 to 1 with a 0.001 step.
- Categories:
89 Views
This dateset is mainly used to submit simulation files and code related to the paper.
The title of the paper”An Efficient and Versatile Conformal Aperture Inverse Design Framework Based on IDMBSA“.
- Categories:
281 Views
The ocular diseases rising from vascular endothelial growth factors (VEGF) is rising on an alarming rate. Mostly the complex retinal disorders are resulted from overexpression of VEGF. Common ocular complications such as age related macular edema (AMD) (over 196 million), diabetic retinopathy (DR) (over 103.12 million) and retinal vein occlusion can result to permanent vision loss if not treated early. Early treatment of such complications is inhibiting the VEGF signaling cascade via anti-VEGF therapy.
- Categories:
102 Views
Fiber Bragg grating (FBG) is a key component in high-power fiber lasers. Mirror FBGs can act as cavity mirrors for fiber oscillators, and chirped and tilted fiber Bragg gratings (CTFBGs) can be used as all-fiber spectral filters to suppress nonlinear effects such as stimulated Raman scattering (SRS). Here a pair of mirror FBGs at 1080 nm are inscribed in fibers with a core diameter of 30 μm by femtosecond (fs) -lasers, and a high-power all-fiber oscillator is constructed based on the fs-written mirror FBGs.
- Categories:
107 Views
Forecasting the winning matches of professional tennis players has a wide range of practical applications. We introduced an innovative approach to quantify and combine strategic and psychological momentum using the entropy weight method and analytic hierarchy process, and tested its effectiveness. Utilizing data from the Wimbledon Championship 2023, we constructed a support vector machine model to predict the turning point and winner of each point, and optimized it using particle swarm optimization.
- Categories:
171 Views
Single-source shortest path (SSSP) discovery, one of a shortest path problem in algorithmic graph theory, is a combinatorial optimization problem. Most propositions solving the SSSP problem rely on Dijkstra’s algorithm. Although theoretically inferior in asymptotic upper bound time complexity, Dijkstra’s algorithm Binary variant outperforms Fibonacci variant empirically, in SSSP computations for real-world datasets, especially on sparse input graphs.
- Categories:
62 Views