• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.42.1-42.1
• /
• 2021

In this study, we present a visual explanation of a deep learning solar flare forecast model and its relationship to physical parameters of solar active regions (ARs). For this, we use full-disk magnetograms at 00:00 UT from the Solar and Heliospheric Observatory/Michelson Doppler Imager and the Solar Dynamics Observatory/Helioseismic and Magnetic Imager, physical parameters from the Space-weather HMI Active Region Patch (SHARP), and Geostationary Operational Environmental Satellite X-ray flare data. Our deep learning flare forecast model based on the Convolutional Neural Network (CNN) predicts "Yes" or "No" for the daily occurrence of C-, M-, and X-class flares. We interpret the model using two CNN attribution methods (guided backpropagation and Gradient-weighted Class Activation Mapping [Grad-CAM]) that provide quantitative information on explaining the model. We find that our deep learning flare forecasting model is intimately related to AR physical properties that have also been distinguished in previous studies as holding significant predictive ability. Major results of this study are as follows. First, we successfully apply our deep learning models to the forecast of daily solar flare occurrence with TSS = 0.65, without any preprocessing to extract features from data. Second, using the attribution methods, we find that the polarity inversion line is an important feature for the deep learning flare forecasting model. Third, the ARs with high Grad-CAM values produce more flares than those with low Grad-CAM values. Fourth, nine SHARP parameters such as total unsigned vertical current, total unsigned current helicity, total unsigned flux, and total photospheric magnetic free energy density are well correlated with Grad-CAM values.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.111-118
• /
• 2024

The concept of social stratification and hierarchy among human dates back to the origin of human race. Presently, the growing reputation of social networks has given us with an opportunity to analyze these well-studied phenomena over different networks at different scales. Generally, a social network could be defined as a collection of actors and their interactions. In this work, we concern ourselves with a particular type of social networks, known as trust networks. In this type of networks, there is an explicit show of trust (positive interaction) or distrust (negative interaction) among the actors. In other words, an actor can designate others as friends or foes. Trust networks are typically modeled as signed networks. A signed network is a directed graph in which the edges carry an edge weight of +1 (indicating trust) or -1 (indicating distrust). Examples of signed networks include the Slashdot Zoo network, the Epinions network and the Wikipedia adminship election network. In a social network, actors tend to connect with each other on the basis of their perceived social hierarchy. The emergence of such a hierarchy within a social community shows the manner in which authority manifests in the community. In the case of signed networks, the concept of social hierarchy can be interpreted as the emergence of a tree-like structure comprising of actors in a top-down fashion in the order of their ranks, describing a specific parent-child relationship, viz. child trusts parent. However, owing to the presence of positive as well as negative interactions in signed networks, deriving such "trust hierarchies" is a non-trivial challenge. We argue that traditional notions (of unsigned networks) are insufficient to derive hierarchies that are latent within signed networks In order to build hierarchies in signed networks, we look at two interpretations of trust namely presence of trust (or "good") and lack of distrust (or "not bad"). In order to develop a hierarchy signifying both trust and distrust effectively, the above interpretations are combined together for calculating the overall trustworthiness (termed as deserve) of actors. The actors are then arranged in a hierarchical fashion based on these aggregate deserve values, according to the following hypothesis: actor v is assigned as a child of actor u if: (i) v trusts u, and (ii) u has a higher deserve value than v. We describe this hypothesis with additional qualifiers in this thesis.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.2
• /
• pp.78-87
• /
• 2008

Received signal strength indicator (RSSI) is used as one of the ranging techniques to locate dynamic sensor nodes in wireless sensor network. Before it can be used for position estimation, RSSI values must be converted to distances using path loss model. These distances among sensor nodes are combined using trilateration method to find position. This paper presents an idea which attempts to integrate both path loss model and trilateration as one algorithm without going through RSSI-distance conversion. This means it is not simply formulas combination but a whole new model was developed. Several advantages were found after integration: it is able to reduce processing load, and ensure that all values do not exceed the maximum range of 16-bit signed or unsigned numbers due to antilog operation in path loss model. The results also show that this method is able to reduce estimation error while inaccurate environmental parameters are used for RSSI-distance conversion.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.252-256
• /
• 2014

Traditional block cipher Advanced Encryption Standard (AES) is widely used in the field of network security, but it has high overhead on each operation. In the 15th international workshop on information security applications, a novel lightweight and low-power encryption algorithm named low-power encryption algorithm (LEA) was released. This algorithm has certain useful features for hardware and software implementations, that is, simple addition, rotation, exclusive-or (ARX) operations, non-Substitute-BOX architecture, and 32-bit word size. In this study, we further improve the LEA encryptions for cloud computing. The Web-based implementations include JavaScript and assembly codes. Unlike normal implementation, JavaScript does not support unsigned integer and rotation operations; therefore, we present several techniques for resolving this issue. Furthermore, the proposed method yields a speed-optimized result and shows high performance enhancements. Each implementation is tested using various Web browsers, such as Google Chrome, Internet Explorer, and Mozilla Firefox, and on various devices including personal computers and mobile devices. These results extend the use of LEA encryption to any circumstance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.337-339
• /
• 2005

By definition of RFC 2018, each segments block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts occur we note that the limitation of maximum available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit packets that have actually been received but not carried related information in SACK option field. For overcoming this restriction, in this paper, a new solution is designed to further improve the performance of TCP SACK and prevent those unwanted retransmissions. Simulation result shows that the implementation of our proposal is effective.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1039-1046
• /
• 2005

TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.