With the rapid rise in global population and technological progress, energy consumption is increasing at an unprecedented rate, making the selection of reliable and sustainable energy sources essential. Solar energy, among various renewable options, stands out as a viable and widely accessible solution to address long-term energy challenges. However, selecting the most suitable solar energy generation system involves complex, multi-criteria decision-making under uncertainty. To address this, the study utilizes intuitionistic fuzzy (IF) sets, which extend classical fuzzy sets by incorporating membership, non-membership, and hesitation degrees. A modified Combined Compromise Solution (CoCoSo) method is proposed within the IF environment to evaluate and rank solar systems effectively. This includes a novel IF similarity measure, validated through numerical examples for pattern recognition. Additionally, new parameter-based weighted averaging and geometric aggregation operators are introduced to improve IF information aggregation. A new score function enhances the consistency of IF number ranking, while a double normalization-based integration function further improves ranking accuracy. The effectiveness and applicability of the proposed method are demonstrated through a solar energy system selection case study, supported by sensitivity and comparative analyses, confirming the method’s robustness, stability, and practical utility in real-world decision-making contexts.

Sun and Wu investigated the lower bound of higher-order nonlinearity of the niho Boolean function f(x)=Tr1n(λxd) over ᵓ2n; where λ∈F2n*,d=2n−12+23n−14−1 when n ≡ 3 mod 4 in second case of Theorem 3.6 of the paper titled higher-order nonlinearity of niho functions published in Fundamenta Informatica e 137 (2015) 403–412. Unfortunately, the proof of finding the lower bound of higher-order nonlinearities of the niho Boolean function f(x) is not correct in the above mentioned paper. In this paper the author gives the correct proof of lower bound of higher-order nonlinearities of the niho Boolean function f(x).

This paper presents K-Feed (Knowledge Feed), a platform for real-time application performance analysis and provisioning in the cloud. K-Feed can perform at scale monitoring, analysis, and provisioning of cloud applications. We explain the components, the implementation and the validation of the K-feed platform. To illustrate its feasibility, we use it to monitor and build a performance model of a clustered web application. To model the application, we use off the shelf components.

The HDMI open drain transmitter is designed to harvest power from the receiver, through the termination impedances during signaling. There is no local power supply needed at the transmitter side, neither any power is taken from the receiver apart from whatever power comes out of it during standard signaling. The zero power HDMI Transmitter capable of datarate 4.95Gbps, i.e. 1.65Gbps per Channel is designed in 65nm technology.

In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form ${\rm f}({\rm x}) = {\rm Tr}_{1}^{{\rm n}}(\rmalpha_{1}{\rm x}^{{\rm d}_{1}} + \rmalpha_{2}{\rm x}^{{\rm d}_{2}})$, where d 1 and d 2 are Niho exponents. A lower bound of the second-order nonlinearities of these Boolean functions can also be obtained by using a recent result of Li, Hu and Gao (eprint.iacr.org/2010 /009.pdf). It is shown in Section 3, by a direct computation, that for large values of n, the lower bound obtained in this paper are better than the lower bound obtained by Li, Hu and Gao.

Clustering is a well-known technique to improve the implementation of single register file VLIW processors. Many previous studies in clustering adhere to an inter-cluster communication means in the form of copy operations. This paper, however, identifies and evaluates five different inter-cluster communication models, including copy operations, dedicated issue slots, extended operands, extended results, and broadcasting. Our study reveals that these models have a major impact on performance and implementation of the clustered VLIW. We found that copy operations executed in regular VLIW issue slots significantly constrain the scheduling freedom of regular operations. For example, in the dense code for our four cluster machine the total cycle count overhead reached 46.8% with respect to the unicluster architecture, 56% of which are caused by the copy operation constraint. Therefore, we propose to use other models (e.g. extended results or broadcasting), which deliver higher performance than the copy operation model at the same hardware cost.