Search

One of the major challenges of the twenty-first century is climate change, evidenced by rising sea levels, melting glaciers, and increased storm frequency. Accurate temperature forecasting is vital for understanding and mitigating these impacts. Traditional data-driven models often use recurrent neural networks (RNNs) but face limitations in parallelization, especially with longer sequences. To address this, we introduce a novel approach based on the FocalNet Transformer architecture. Our Focal modulation Attention Encoder (FATE) framework operates in a multi-tensor format, utilizing tensorized modulation to capture spatial and temporal nuances in meteorological data. Comparative evaluations against existing transformer encoders, 3D CNNs, LSTM, and ConvLSTM models show that FATE excels at identifying complex patterns in temperature data. Additionally, we present a new labeled dataset, the Climate Change Parameter dataset (CCPD), containing 40 years of data from Jammu and Kashmir on seven climate-related parameters. Experiments with real-world temperature datasets from the USA, Canada, and Europe show accuracy improvements of 12\%, 23\%, and 28\%, respectively, over current state-of-the-art models. Our CCPD dataset also achieved a 24\% improvement in accuracy. To support reproducible research, we have released the source code and pre-trained FATE model at \href{https://github.com/Tajamul21/FATE}{https://github.com/Tajamul21/FATE}.

In the wake of dwindling Moore's Law, to address the rapidly increasing complexity and cost of fabricating large-scale, monolithic systems-on-chip (SoCs), the industry has adopted dis-aggregation as a solution, wherein a large monolithic SoC is partitioned into multiple smaller chiplets that are then assembled into a large system-in-package (SiP) using advanced packaging substrates such as silicon interposer. For such interposer-based SiPs, there is a push to realize on-interposer inter-chiplet communication bandwidth of multi-Tb/s and end-to-end communication latency of no more than 10ns. This push comes as the natural progression from some recent prior works on SiP design, and is driven by the proliferating bandwidth demand of modern data-intensive workloads. To meet this bandwidth and latency goal, prior works have focused on a potential solution of using the silicon photonic interposer (SiPhI) for integrating and interconnecting a large number of chiplets into an SiP. Despite the early promise, the existing designs of on-SiPhI interconnects still have to evolve by leaps and bounds to meet the goal of multi-Tb/s bandwidth. However, the possible design pathways, upon which such an evolution can be achieved, have not been explored in any prior works yet. In this paper, we have identified several design pathways that can help evolve on-SiPhI interconnects to achieve multi-Tb/s aggregate bandwidth. We perform an extensive link-level and system-level analysis in which we explore these design pathways in isolation and in different combinations of each other. From our link-level analysis, we have observed that the design pathways that simultaneously enhance the spectral range and optical power budget available for wavelength multiplexing can render aggregate bandwidth of up to 4Tb/s per on-SiPhI link., Comment: Under review (ACM JETC)

In this paper we have presented the effects of path mtu discovery in IPv4 & IPv6 in mathematical, logical and graphical representation. We try to give a mathematical model to the working of path mtu discovery and calculated its behaviour using a transmission of a packet. We analysed the time consumed to transmit a single packet from source to destination in IPv6 network in the presence of PMTUD and similarly in IPv4 network with DF bit 1. Based on our analysis, we concluded that the communication time increases with the varying MTU of the intermediate nodes. Moreover, we formulated the mathematical model to determine the communication delay in a network. Our model shows that the asymptotic lower bound for time taken is $\Omega(n)$ and the asymptotic upper bound is $\Theta(n^2)$, using PMTUD. We have find that the packet drop frequency follows the Bernoulli's trials and which helps to define the success probability of the packet drop frequency, which shows that the probability is higher for packet drop rate for beginning $2\%$ of the total nodes in the path. We further found that $^{n}C_{a}$ possible number of a-combinations without repetitions that can be formed for a particular number of packet drop frequency. The relation between summation (acts as a coefficient in the time wastage equation) of each combination and their frequency resulted in symmetric graph and also mathematical and statistical structures to measure time wastage and its behaviour. This also helps in measuring the possible relative maximum, minimum and average time wastage. We also measured the probability of relative maximum, min and average summation for a given value of packet drop frequency and number of nodes in a path., Comment: 16 pages, 14 figures

With an increase in the number of internet users and the need to secure internet traffic, the unreliable IPv4 protocol has been replaced by a more secure protocol, called IPv6 for Internet system. The IPv6 protocol does not allow intermediate routers to fragment the on-going IPv6 packet. Moreover, due to IP tunneling, some extra headers are added to the IPv6 packet, exceeding the packet size higher than the maximum transmission unit (MTU), resulting in increase in packet drops. One probable solution is to find the MTU of every link in advance using the Internet Control Message Protocol (ICMP) packets and accordingly fragment the packets at the source itself. However, most of the intermediate routers and the network firewalls do not allow ICMP packets to traverse through their network, resulting in network black holes, where we cannot know the MTU of some links in advance. This method tries to handle the packet drops in IPv6 network by proposing a DMTU scheme where we dynamically adjust the MTU of each link depending upon the original size of the IPv6 packet, thereby reducing the number of packet drops by a significant amount. Using mathematical and graphical analysis, our scheme proves to be much more efficient than the state-of-the-art PMTUD scheme. In this paper the method, mathematical and graphical representations are focusing solely in IPv6 Internet communication., Comment: 28 pages, 11 figures. Journal of King Saud University Computer and Information Sciences (2021)