341 research outputs found
An approach to represent time series forecasting via fuzzy numbers
This paper introduces a new approach for estimating the uncertainty in the forecast through the construction of Triangular Fuzzy Numbers (TFNs). The interval of the proposed TFN presentation is generated from a Fuzzy logic based Lower and Upper Bound Estimator (FLUBE). Here, instead of the representing the forecast with a crisp value with a Prediction Interval (PI), the level of uncertainty associated with the point forecasts will be quantified by defining TFNs (linguistic terms) within the uncertainty interval provided by the FLUBE. This will give the opportunity to handle the forecast as linguistic terms which will increase the interpretability. Moreover, the proposed approach will provide valuable information about the accuracy of the forecast by providing a relative membership degree. The demonstrated results indicate that the proposed FLUBE based TFN representation is an efficient and useful approach to represent the uncertainty and the quality of the forecast
An enhanced fuzzy linguistic term generation and representation for time series forecasting
This paper introduces an enhancement to linguistic forecast representation using Triangular Fuzzy Numbers (TFNs) called Enhanced Linguistic Generation and Representation Approach (ElinGRA). Since there is always an error margin in the predictions, there is a need to define error bounds in the forecast. The interval of the proposed presentation is generated from a Fuzzy logic based Lower and Upper Bound Estimator (FLUBE) by getting the models of forecast errors. Thus, instead of a classical statistical approaches, the level of uncertainty associated with the point forecasts will be defined within the FLUBE bounds and these bound can be used for defining fuzzy linguistic terms for the forecasts. Here, ElinGRA is proposed to generate triangular fuzzy numbers (TFNs) for the predictions. In addition to opportunity to handle the forecast as linguistic terms which will increase the interpretability, ElinGRA improved forecast accuracy of constructed TFNs by adding an extra correction term. The results of the experiments, which are conducted on two data sets, show the benefit of using ElinGRA to represent the uncertainty and the quality of the forecast
A Template-Based Design Methodology for Graph-Parallel Hardware Accelerators
Graph applications have been gaining importance in the last decade due to emerging big data analytics problems such as Web graphs, social networks, and biological networks. For these applications, traditional CPU and GPU architectures suffer in terms of performance and power consumption due to irregular communications, random memory accesses, and load balancing problems. It has been shown that specialized hardware accelerators can achieve much better power and energy efficiency compared to the general purpose CPUs and GPUs. In this paper, we present a template-based methodology specifically targeted for hardware accelerator design of big-data graph applications. Important architectural features that are key for energy efficient execution are implemented in a common template. The proposed template-based methodology is used to design hardware accelerators for different graph applications with little effort. Compared to an application-specific high-level synthesis methodology, we show that the proposed methodology can generate hardware accelerators with up to 18Γ better energy efficiency and requires less design effort
Hardware accelerator design for data centers
As the size of available data is increasing, it is becoming inefficient to scale the computational power of traditional systems. To overcome this problem, customized application-specific accelerators are becoming integral parts of modern system on chip (SOC) architectures. In this paper, we summarize existing hardware accelerators for data centers and discuss the techniques to implement and embed them along with the existing SOCs. Β© 2015 IEEE
Architectural requirements for energy efficient execution of graph analytics applications
Intelligent data analysis has become more important in the last decade especially because of the significant increase in the size and availability of data. In this paper, we focus on the common execution models and characteristics of iterative graph analytics applications. We show that the features that improve work efficiency can lead to significant overheads on existing systems. We identify the opportunities for custom hardware implementation, and outline the desired architectural features for energy efficient computation of graph analytics applications. Β© 2015 IEEE
Leptin and resistin levels in serum of patients with hematologic malignancies: correlation with clinical characteristic
Aim:To evaluate leptin and resistin levels in patients with various hematologic malignancies. Methods: We included 21 patients with lymphoma, 14 with multiple myeloma (MM), 14 with acute leukemia, 13 with chronic lymphocytic leukemia (CLL), and 25 healthy control subjects into our study. The subjectsβ body mass indexes (BMI) were calculated; hematological and acute phase response parameters, serum lipid were determined; serum leptin and resistin levels were determined by ELISA. Results: Serum leptin level was significantly increased in CLL and MM groups when compared to the control group (p < 0.01). Resistin level was significantly higher in lymphoma patients than in CLL, acute leukemia and control groups (p < 0.01). In the control group, leptin level was negatively correlated with hemoglobin level (r = β0.44, p = 0.047); and in all patients with hematologic malignancies, leptin level was correlated with BMI (r = 0.32, p = 0.02). Leptin in lymphoma subjects correlated with hemoglobin level (r = 0.64, p = 0.005), resistin level correlated with the platelet count in patients with hematologic malignancies (r = 0.26, p = 0.044). In addition, leptin level had negative correlations with international prognostic score (IPS) in Hodgkin lymphoma (r = β0.9, p = 0.002) and with international prognostic index (IPI) in non-Hodgkin lymphoma (r = β0.77, p = 0.03). In CLL patients, leptin level had a correlation with the poor prognostic marker β CD38 level (r = 0.68, p = 0.03). Conclusion: We found higher leptin levels in MM and CLL patients, and higher resistin levels in lymphoma patients: this fact demonstrates that changes in adipose tissue and metabolism occur in these disease states.Π¦Π΅Π»Ρ: ΠΎΠΏΡΠ΅Π΄Π΅Π»ΠΈΡΡ ΡΡΠΎΠ²Π½ΠΈ ΡΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΡ Π»Π΅ΠΏΡΠΈΠ½Π° ΠΈ ΡΠ΅Π·ΠΈΡΡΠΈΠ½Π° Π² ΡΡΠ²ΠΎΡΠΎΡΠΊΠ΅ ΠΊΡΠΎΠ²ΠΈ Π±ΠΎΠ»ΡΠ½ΡΡ
Ρ ΡΠ°Π·Π»ΠΈΡΠ½ΡΠΌΠΈ ΠΎΠ½ΠΊΠΎΠ³Π΅ΠΌΠ°ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠΌΠΈ
Π·Π°Π±ΠΎΠ»Π΅Π²Π°Π½ΠΈΡΠΌΠΈ. ΠΠ΅ΡΠΎΠ΄Ρ: ΠΎΠ±ΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ 21 Π±ΠΎΠ»ΡΠ½ΠΎΠΉ Π»ΠΈΠΌΡΠΎΠΌΠΎΠΉ, 14 β ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π΅Π½Π½ΠΎΠΉ ΠΌΠΈΠ΅Π»ΠΎΠΌΠΎΠΉ (ΠΠ), 14 β ΠΎΡΡΡΠΎΠΉ Π»Π΅ΠΉΠΊΠ΅ΠΌΠΈΠ΅ΠΉ,
13 β Ρ
ΡΠΎΠ½ΠΈΡΠ΅ΡΠΊΠΎΠΉ Π»ΠΈΠΌΡΠΎΡΠΈΡΠ°ΡΠ½ΠΎΠΉ Π»Π΅ΠΉΠΊΠ΅ΠΌΠΈΠ΅ΠΉ (Π₯ΠΠ), ΠΈ 25 Π·Π΄ΠΎΡΠΎΠ²ΡΡ
Π΄ΠΎΠ½ΠΎΡΠΎΠ². Π£ ΠΏΠ°ΡΠΈΠ΅Π½ΡΠΎΠ² ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Ρ ΡΠ°ΠΊΠΈΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ:
ΠΈΠ½Π΄Π΅ΠΊΡ ΠΌΠ°ΡΡΡ ΡΠ΅Π»Π° (ΠΠΠ’), Π³Π΅ΠΌΠ°ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΡ, ΡΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅ Π»ΠΈΠΏΠΈΠ΄ΠΎΠ² Π² ΡΡΠ²ΠΎΡΠΎΡΠΊΠ΅ ΠΊΡΠΎΠ²ΠΈ. Π‘ΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅ Π»Π΅ΠΏΡΠΈΠ½Π° ΠΈ ΡΠ΅Π·ΠΈΡΡΠΈΠ½Π°
Π² ΡΡΠ²ΠΎΡΠΎΡΠΊΠ΅ ΠΊΡΠΎΠ²ΠΈ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΠ»ΠΈ ΠΈΠΌΠΌΡΠ½ΠΎΡΠ΅ΡΠΌΠ΅Π½ΡΠ½ΡΠΌ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠΌ. Π Π΅Π·ΡΠ»ΡΡΠ°ΡΡ: ΡΡΠΎΠ²Π΅Π½Ρ Π»Π΅ΠΏΡΠΈΠ½Π° Π² ΡΡΠ²ΠΎΡΠΎΡΠΊΠ΅ ΠΊΡΠΎΠ²ΠΈ Π±ΡΠ»
Π·Π½Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎ Π²ΡΡΠ΅ Ρ Π±ΠΎΠ»ΡΠ½ΡΡ
Ρ Π₯ΠΠ ΠΈ ΠΠ, ΡΠ΅ΠΌ ΡΠ°ΠΊΠΎΠ²ΠΎΠΉ Ρ ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΠΎΠΉ Π³ΡΡΠΏΠΏΡ (Ρ < 0,01). Π£ΡΠΎΠ²Π΅Π½Ρ ΡΠ΅Π·ΠΈΡΡΠΈΠ½Π° Π±ΡΠ» Π·Π½Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎ
Π²ΡΡΠ΅ Π² Π³ΡΡΠΏΠΏΠ΅ Π±ΠΎΠ»ΡΠ½ΡΡ
Ρ Π»ΠΈΠΌΡΠΎΠΌΠ°ΠΌΠΈ ΠΏΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΡ Ρ Π₯ΠΠ, ΠΎΡΡΡΠΎΠΉ Π»Π΅ΠΉΠΊΠ΅ΠΌΠΈΠ΅ΠΉ ΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΠΎΠΉ Π³ΡΡΠΏΠΏΠ°ΠΌΠΈ (Ρ < 0,01). Π ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΠΎΠΉ
Π³ΡΡΠΏΠΏΠ΅ ΡΡΠΎΠ²Π΅Π½Ρ Π»Π΅ΠΏΡΠΈΠ½Π° ΠΎΡΡΠΈΡΠ°ΡΠ΅Π»ΡΠ½ΠΎ ΠΊΠΎΡΡΠ΅Π»ΠΈΡΠΎΠ²Π°Π» Ρ ΡΡΠΎΠ²Π½Π΅ΠΌ Π³Π΅ΠΌΠΎΠ³Π»ΠΎΠ±ΠΈΠ½Π° (r = β0,44, Ρ = 0,047), Π° Π²ΠΎ Π²ΡΠ΅Ρ
Π³ΡΡΠΏΠΏΠ°Ρ
Π±ΠΎΠ»ΡΠ½ΡΡ
ΡΡΠΎΠ²Π΅Π½Ρ Π»Π΅ΠΏΡΠΈΠ½Π° ΠΊΠΎΡΡΠ΅Π»ΠΈΡΠΎΠ²Π°Π» Ρ ΠΠΠ’ (r = 0,32, Ρ = 0,02). Π£ΡΠΎΠ²Π΅Π½Ρ Π»Π΅ΠΏΡΠΈΠ½Π° ΠΏΡΠΈ Π»ΠΈΠΌΡΠΎΠΌΠ°Ρ
ΠΊΠΎΡΡΠ΅Π»ΠΈΡΠΎΠ²Π°Π» Ρ ΡΡΠΎΠ²Π½Π΅ΠΌ Π³Π΅ΠΌΠΎΠ³Π»ΠΎΠ±ΠΈΠ½Π°
(r = 0,64, Ρ = 0,005), ΡΡΠΎΠ²Π΅Π½Ρ ΡΠ΅Π·ΠΈΡΡΠΈΠ½Π° ΠΊΠΎΡΡΠ΅Π»ΠΈΡΠΎΠ²Π°Π» Ρ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²ΠΎΠΌ ΡΡΠΎΠΌΠ±ΠΎΡΠΈΡΠΎΠ² Ρ Π±ΠΎΠ»ΡΠ½ΡΡ
Π²ΡΠ΅Ρ
Π³ΡΡΠΏΠΏ (r = 0,26, Ρ = 0,044). ΠΡΠΈ
Π»ΠΈΠΌΡΠΎΠΌΠ΅ Π₯ΠΎΠ΄ΠΆΠΊΠΈΠ½Π° Π²ΡΡΠ²Π»Π΅Π½Π° ΠΎΡΡΠΈΡΠ°ΡΠ΅Π»ΡΠ½Π°Ρ ΠΊΠΎΡΡΠ΅Π»ΡΡΠΈΡ ΠΌΠ΅ΠΆΠ΄Ρ ΡΡΠΎΠ²Π½Π΅ΠΌ Π»Π΅ΠΏΡΠΈΠ½Π° ΠΈ Π²Π΅Π»ΠΈΡΠΈΠ½ΠΎΠΉ ΠΌΠ΅ΠΆΠ΄ΡΠ½Π°ΡΠΎΠ΄Π½ΠΎΠΉ ΠΏΡΠΎΠ³Π½ΠΎΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ
ΡΠΊΠ°Π»Ρ (r = -0,9, Ρ = 0,002), ΠΏΡΠΈ Π½Π΅Ρ
ΠΎΠ΄ΠΆΠΊΠΈΠ½ΡΠΊΠΎΠΉ Π»ΠΈΠΌΡΠΎΠΌΠ΅ β Π²Π΅Π»ΠΈΡΠΈΠ½ΠΎΠΉ ΠΌΠ΅ΠΆΠ΄ΡΠ½Π°ΡΠΎΠ΄Π½ΠΎΠ³ΠΎ ΠΏΡΠΎΠ³Π½ΠΎΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΈΠ½Π΄Π΅ΠΊΡΠ° (r = β0,77,
Ρ = 0,03), Ρ Π±ΠΎΠ»ΡΠ½ΡΡ
Π₯ΠΠ β Ρ ΡΡΠΎΠ²Π½Π΅ΠΌ ΡΠΊΡΠΏΡΠ΅ΡΡΠΈΠΈ CD38 (r = 0,68, Ρ = 0,03). ΠΡΠ²ΠΎΠ΄Ρ: Ρ Π±ΠΎΠ»ΡΠ½ΡΡ
ΠΠ ΠΈ Π₯ΠΠ Π²ΡΡΠ²Π»Π΅Π½ Π²ΡΡΠΎΠΊΠΈΠΉ
ΡΡΠΎΠ²Π΅Π½Ρ Π»Π΅ΠΏΡΠΈΠ½Π°, Π° Ρ Π»ΠΈΠΌΡΠΎΠΌΠ°ΠΌΠΈ β Π²ΡΡΠΎΠΊΠΈΠΉ ΡΡΠΎΠ²Π΅Π½Ρ ΡΠ΅Π·ΠΈΡΡΠΈΠ½Π°: ΡΡΠΎΡ ΡΠ°ΠΊΡ ΡΠΊΠ°Π·ΡΠ²Π°Π΅Ρ Π½Π° ΡΠΎ, ΡΡΠΎ Ρ Π±ΠΎΠ»ΡΠ½ΡΡ
ΡΠΊΠ°Π·Π°Π½Π½ΡΠΌΠΈ ΠΎΠ½ΠΊΠΎΠ³Π΅ΠΌΠ°ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠΌΠΈ
Π·Π°Π±ΠΎΠ»Π΅Π²Π°Π½ΠΈΡΠΌΠΈ ΠΌΠΎΠ³ΡΡ Π²ΠΎΠ·Π½ΠΈΠΊΠ°ΡΡ ΠΈΠ·ΠΌΠ΅Π½Π΅Π½ΠΈΡ Π² ΡΡΡΡΠΊΡΡΡΠ΅ ΠΆΠΈΡΠΎΠ²ΠΎΠΉ ΡΠΊΠ°Π½ΠΈ ΠΈ ΠΎΠ±ΠΌΠ΅Π½Π΅ Π²Π΅ΡΠ΅ΡΡΠ²
Energy Efficient Architecture for Graph Analytics Accelerators
Specialized hardware accelerators can significantly improve the performance and power efficiency of compute systems. In this paper, we focus on hardware accelerators for graph analytics applications and propose a configurable architecture template that is specifically optimized for iterative vertex-centric graph applications with irregular access patterns and asymmetric convergence. The proposed architecture addresses the limitations of the existing multi-core CPU and GPU architectures for these types of applications. The SystemC-based template we provide can be customized easily for different vertex-centric applications by inserting application-level data structures and functions. After that, a cycle-accurate simulator and RTL can be generated to model the target hardware accelerators. In our experiments, we study several graph-parallel applications, and show that the hardware accelerators generated by our template can outperform a 24 core high end server CPU system by up to 3x in terms of performance. We also estimate the area requirement and power consumption of these hardware accelerators through physical-aware logic synthesis, and show up to 65x better power consumption with significantly smaller area. Β© 2016 IEEE
Graph Analytics Accelerators for Cognitive Systems
Hardware accelerators are known to be performance and power efficient. This article focuses on accelerator design for graph analytics applications, which are commonly used kernels for cognitive systems. The authors propose a templatized architecture that is specifically optimized for vertex-centric graph applications with irregular memory access patterns, asynchronous execution, and asymmetric convergence. The proposed architecture addresses the limitations of existing CPU and GPU systems while providing a customizable template. The authors' experiments show that the generated accelerators can outperform a high-end CPU system with up to 3 times better performance and 65 times better power efficiency. Β© 1981-2012 IEEE
- β¦