With the rapid growth of wireless medical sensor networks (WMSNs) based healthcare applications, protecting both the privacy and security from illegitimate users, are major concern issues since patient’s precise info...
详细信息
A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many dis...
详细信息
ISBN:
(纸本)9783959773225
A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e., distinct strings of the form UU, a string of length n can contain as fragments. It turns out that this is always O(n), and the bound cannot be improved to sublinear in n [Fraenkel and Simpson, JCTA 1998]. Several similar questions about repetitions in strings have been considered, and by now we seem to have a good understanding of their repetitive structure. For higher-dimensional strings, the basic concept of periodicity has been successfully extended and applied to design efficient algorithms – it is inherently more complex than for regular strings. Extending the notion of repetitions and understanding the repetitive structure of higher-dimensional strings is however far from complete. Quartics were introduced by Apostolico and Brimkov [TCS 2000] as analogues of squares in two dimensions. Charalampopoulos, Radoszewski, Rytter, Waleń, and Zuba [ESA 2020] proved that the number of distinct quartics in an n × n 2D string is O(n2 log2 n) and that they can be computed in O(n2 log2 n) time. Gawrychowski, Ghazawi, and Landau [SPIRE 2021] constructed an infinite family of n × n 2D strings with Ω(n2 log n) distinct quartics. This brings the challenge of determining asymptotically tight bounds. Here, we settle both the combinatorial and the algorithmic aspects of this question: the number of distinct quartics in an n × n 2D string is O(n2 log n) and they can be computed in the worst-case optimal O(n2 log n) time. As expected, our solution heavily exploits the periodic structure implied by occurrences of quartics. However, the two-dimensional nature of the problem introduces some technical challenges. Somewhat surprisingly, we overcome the final challenge for the combinatorial bound using a result of Marcus and Tardos [JCTA 2004] for permuta
In the realm of remote control, my preference is computer manipulation through hand gestures. Recent strides in technology showcase the feasibility of using manual gestures on Arduino platforms, facilitated by cloud c...
详细信息
The study address the challenge of forecasting per unit energy prices in a microgrid environment consisting of solar and hydro power resources under multi-seasonal *** deep learning techniques such as LSTM,GRU and ESN...
详细信息
The Supreme Court plays an extremely critical role in ensuring adherence to the rule of law and in strengthening the democracy. Due to this reason, modeling and analysis of small group interactions in t...
详细信息
Deep learning models, notably convolutional neural networks (CNNs), demonstrate great promise in medical image processing. Nonetheless, CNNs frequently encounter challenges in capture holistic context and long- range ...
详细信息
Sustainable smart agriculture forms one of the focal points in Society 5.0. We propose an AI-IOT enabled framework capable of processing multi-modal data for apple orchard monitoring. Real-time data acquisition is don...
详细信息
Text recognition in natural scenes presents a significant challenge in computer vision despite its widespread applications in real-life scenarios. Deep learning advancements have notably enhanced the precision of scen...
详细信息
The fast and convenient demultiplex of optical vortex(OV) mode is crucial for its further application. We propose a novel approach that combines classic Young's doublet with an OV source to effectively identify th...
详细信息
The fast and convenient demultiplex of optical vortex(OV) mode is crucial for its further application. We propose a novel approach that combines classic Young's doublet with an OV source to effectively identify the OV mode through the analysis of interference patterns. The interference patterns of the OV source incident on the double slits can be perfectly illustrated by using both the classical double-slit interference method and the Huygens–Fresnel principle. The interference fringes will twist along the negative or positive direction of x axis when topological charge(TC)l>0 or l<0, and the degree of the movement varies with the TC, allowing for a quantitative display of the OV characteristics through the interference patterns. Additionally, we deduce analytically that the zeroth-order interference fringe has a linear relationship with the TC and the vertical position. These findings highlight the ability to identify the OV mode by analyzing the interference patterns produced by Young's doublet.
Nowadays, crime has become a way to get people and people into trouble. Rising crime has fueled unrest at polling stations across the country. Understanding crime patterns is necessary to identify and respond to these...
详细信息
暂无评论