共找到 20 条结果
We introduce SENT-Map, a semantically enhanced topological map for representing indoor environments, designed to support autonomous navigation and manipulation by leveraging advancements in foundational models (FMs). Through representing the environment in a JSON text format, we enable semantic information to be added and edited in a format that both humans and FMs understand, while grounding the robot to existing nodes during planning to avoid infeasible states during deployment. Our proposed framework employs a two stage approach, first mapping the environment alongside an operator with a Vision-FM, then using the SENT-Map representation alongside a natural-language query within an FM for planning. Our experimental results show that semantic-enhancement enables even small locally-deployable FMs to successfully plan over indoor environments.
Several of the world's languages are still under-resourced in terms of Natural Language Processing (NLP) tools. This is mostly due to the lack of high-quality datasets to train, develop, and evaluate systems and models for several tasks, such as Machine Translation (MT). We conduct a manual audit of the parallel and monolingual corpora available for Lombard, an under-resourced language continuum from Italy. Our analysis reveals that the perceived abundance of web-scraped data is an illusion, with massive datasets plagued by severe language misidentification, boilerplate text, and non-linguistic noise. Furthermore, we analyze the orthographic composition of the valid Lombard portions across web-scraped datasets, curated corpora, and benchmarks. Our findings show conflicting orthographical systems and severe representational bias across all corpora: high-quality data is heavily skewed towards Western Lombard varieties, with Eastern ones left on the margins. This underscores the need for variety-aware, community-driven data curation rather than purely quantity-driven scraping.
Combined experiments and computational modelling are used to increase understanding of the suitability of the Single-Edge Notch Tension (SENT) test for assessing hydrogen embrittlement susceptibility. The SENT tests were designed to provide the mode I threshold stress intensity factor ($K_{\text{th}}$) for hydrogen-assisted cracking of a C110 steel in two corrosive environments. These were accompanied by hydrogen permeation experiments to relate the environments to the absorbed hydrogen concentrations. A coupled phase-field-based deformation-diffusion-fracture model is then employed to simulate the SENT tests, predicting $K_{\text{th}}$ in good agreement with the experimental results and providing insights into the hydrogen absorption-diffusion-cracking interactions. The suitability of SENT testing and its optimal characteristics (e.g., test duration) are discussed in terms of the various simultaneous active time-dependent phenomena, triaxiality dependencies, and regimes of hydrogen embrittlement susceptibility.
Distant supervision for relation extraction provides uniform bag labels for each sentence inside the bag, while accurate sentence labels are important for downstream applications that need the exact relation type. Directly using bag labels for sentence-level training will introduce much noise, thus severely degrading performance. In this work, we propose the use of negative training (NT), in which a model is trained using complementary labels regarding that ``the instance does not belong to these complementary labels". Since the probability of selecting a true label as a complementary label is low, NT provides less noisy information. Furthermore, the model trained with NT is able to separate the noisy data from the training data. Based on NT, we propose a sentence-level framework, SENT, for distant relation extraction. SENT not only filters the noisy data to construct a cleaner dataset, but also performs a re-labeling process to transform the noisy data into useful training data, thus further benefiting the model's performance. Experimental results show the significant improvement of the proposed method over previous methods on sentence-level evaluation and de-noise effect.
One of the ways in which attackers try to steal sensitive information from corporations is by sending spearphishing emails. This type of emails typically appear to be sent by one of the victim's coworkers, but have instead been crafted by an attacker. A particularly insidious type of spearphishing emails are the ones that do not only claim to come from a trusted party, but were actually sent from that party's legitimate email account that was compromised in the first place. In this paper, we propose a radical change of focus in the techniques used for detecting such malicious emails: instead of looking for particular features that are indicative of attack emails, we look for possible indicators of impersonation of the legitimate owners. We present IdentityMailer, a system that validates the authorship of emails by learning the typical email-sending behavior of users over time, and comparing any subsequent email sent from their accounts against this model. Our experiments on real world e-mail datasets demonstrate that our system can effectively block advanced email attacks sent from genuine email accounts, which traditional protection systems are unable to detect. Moreover, we show
Measurements of a scalar linear Gauss-Markov process are sent over a fading channel. The fading channel is modeled as independent and identically distributed random variables with known realization at the receiver. The optimal estimator at the receiver is the Kalman filter. In contrast to the classical Kalman filter theory, given a random channel, the Kalman gain and the error covariance become random. Then the probability distribution function of expected estimation error and its outage probability can be chosen for estimation quality assessment. In this paper and in order to get the estimation error outage, we provide means to characterize the stationary probability density function of the random expected estimation error. Furthermore and for the particular case of the i.i.d. Rayleigh fading channels, upper and lower bounds for the outage probability are derived which provide insight and simpler means for design purposes. We also show that the bounds are tight for the high SNR regime, and that the outage probability decreases linearly with the inverse of the average channel SNR.
The transmission of digital data is one of the principal tasks in modern wireless communication. Classically, the communication channel consists of one transmitter and one receiver; however, due to the constantly increasing demand in higher transmission rates, the popularity of using several receivers and transmitters has been rapidly growing. In this paper, we combine a number of fairly standard techniques from numerical linear algebra and probability to develop several (apparently novel) randomized schemes for the decoding of digital messages sent over a noisy multivariate Gaussian channel. We use a popular mathematical model for such channels to illustrate the performance of our schemes via numerical experiments.
The theory of General Relativity deals with very accurate measurements that show significant divergences from Newtonian predictions only with speeds near to the velocity of light. An introduction for educational purposes, based on naked eye photometry, deals with the radiation near collapsing star's shells like novae and supernovae. The theme of accuracy is drafted from entry level observations to the precision of professional data, often of public domain on the web. Thousand observations of variable stars, included the type 1a SN2014J, the Nova Del 2013 and the Nova Cen 2013, sent to the AAVSO by the author, with SGQ code, during the period 1998-2015 are analyzed to increase the photometric accuracy, in the occasion of the International Year of Light 2015.
The man is said to be doing well in a Frankfurt hospital
The aim of this article is reproduce and analyze an original article of David Bohm sent to Louis de Broglie in 1951. This article is the older document of David Bohm about his well known hidden variable theory based on the pilot wave interpretation of Louis de Broglie. We analyse the chronology and the history of this fascinating document.
Oumuamua, the first known object of extrasolar origin seen to enter our Solar System, has multiple unusual characteristics that, taken together, are very difficult to explain with conventional astronomical entities like asteroids and comets. Consequently, it has been hypothesized that Oumuamua is an interstellar probe that was constructed by an alien civilization. We demonstrate that the accomplishments that can be achieved with large space telescopes and interferometers in the alien's planetary system will completely quench any motivation for construction and launch of an Oumuamua-like probe. The absence of any such motivation attests that Oumuamua is not an alien creation. The existence of large space telescopes has important implications for a range of topics that include interstellar space travel, the zoo hypothesis, METI, and UFOs.
We discuss quantitatively the complementarity of information transmitted by a quantum system prepared in a basis state in one out of several different mutually unbiased bases (MUBs). We obtain upper bounds on the information available to a receiver who has no knowledge of which MUB was chosen by the sender. These upper bounds imply a complementarity of information encoded via different MUBs and ultimately ensure the security in quantum key distribution protocols.
In a previous paper we formulated a set of necessary conditions for the spherically symmetric weakly charged dust to avoid Big Bang/Big Crunch, shell crossing and permanent central singularities. However, we did not discuss the properties of the energy density, some of which are surprising and seem not to have been known up to now. A singularity of infinite energy density does exist -- it is a point singularity situated on the world line of the center of symmetry. The condition that no mass shell collapses to $R = 0$ if it had $R > 0$ initially thus turns out to be still insufficient for avoiding a singularity. Moreover, at the singularity the energy density $ε$ is direction-dependent: $ε\to - \infty$ when we approach the singular point along a $t =$ const hypersurface and $ε\to + \infty$ when we approach that point along the center of symmetry. The appearance of negative-energy-density regions turns out to be inevitable. We discuss various aspects of this property of our configuration. We also show that a permanently pulsating configuration, with the period of pulsation independent of mass, is possible only if there exists a permanent central singularity.
We consider the stochastic sandpile model with uniform toppling rule on the integer line. During a uniform toppling, with probability $1/3$ one particle is sent to the right of the toppled vertex, with probability $1/3$ one particle is sent to the left, and with probability $1/3$ two particles are sent out, one to the right and one to the left. We calculate exactly the stationary distribution of the stochastic sandpile Markov chain with this toppling rule on finite, connected subsets of the integers, and show that the infinite volume limit exists and is equal to the Dirac measure of the full configuration. For this end, we analyze where the excess mass leaves the system, when stabilizing the full configuration plus one additional particle on finite, connected subsets of the integers.
In this work, we consider "decision" variants of a monogamy-of-entanglement game by Tomamichel, Fehr, Kaniewski, and Wehner [New Journal of Physics '13]. In its original "search" variant, Alice prepares a (possibly entangled) state on registers $\mathsf{ABC}$; register $\mathsf{A}$, consisting of $n$ qubits, is sent to a Referee, while $\mathsf{B}$ and $\mathsf{C}$ are sent to Bob and Charlie; the Referee then measures each qubit in the standard or Hadamard basis (chosen uniformly at random). The basis choices are sent to Bob and Charlie, whose goal is to simultaneously guess the Referee's $n$-bit outcome string $x$. Tomamichel et al. show that the optimal winning probability is $\cos^{2n} {(\fracπ{8})}$, following a perfect parallel repetition theorem. We consider the following "decision" variants of this game: - Variant 1, "XOR repetition": Bob and Charlie's goal is to guess the XOR of all the bits of $x$. Ananth et al. [Asiacrypt '24] conjectured that the optimal advantage over random guessing decays exponentially in $n$. Surprisingly, we show that this conjecture is false, and, in fact, there is no decay at all: there exists a strategy that wins with probability $\cos^2{(\fracπ
Contention resolution addresses the problem of coordinating access to a shared communication channel. Time is discretized into synchronized slots, and a packet can be sent in any slot. If no packet is sent, then the slot is empty; if a single packet is sent, then it is successful; and when multiple packets are sent at the same time, a collision occurs, resulting in the failure of the corresponding transmissions. In each slot, every packet receives ternary channel feedback indicating whether the current slot is empty, successful, or a collision. Much of the prior work on contention resolution has focused on optimizing the makespan, which is the number of slots required for all packets to succeed. However, in many modern systems, collisions are also costly in terms of the time they incur, which existing contention-resolution algorithms do not address. In this paper, we design and analyze a randomized algorithm, Collision Aversion Backoff (CAB), that optimizes both the makespan and the collision cost. We consider the static case where an unknown $n\geq 2$ packets are initially present in the system, and each collision has a known cost $\mathcal{C}$, where $1 \leq \mathcal{C} \leq n^κ$
Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between Alice and Bob. Referee sends Alice a value of a random variable. At the same time, Referee also sends Bob some partial information regarding that value. Here partial information can be defined in the following way. Bob gets the information of a random set which must contain the value of the variable, that is sent to Alice by the Referee, along with other value(s). Alice is not allowed to know what information is sent to Bob by the Referee. Again, Bob does not know which value of the random variable is sent to Alice. Now, the game can be won if and only if Bob can unambiguously identify the value of the variable, that is sent to Alice, with some nonzero probability, no matter what information Bob receives or which value is sent to Alice. However, to help Bob, Alice sends some limited amount of information to him, based on any strategy which is fixed by Alice and Bob before the game begins. We show that if Alice sends limited amount of classical inform
Firstly, the proposed solution provides remotely accessible integrated IoT resources for the safety and security of the building. By using Sha ort Messaging System (SMS), the age is sent to the user by the Global System for Mobile (GSM) system. An SMS alert is sent to the user in case any sensor detects an abnormality in their operation. Secondly, an authentication mechanism is deployed to enable only authorized users to access resources. Thirdly, in case of a malicious approach in accessing IoT resources, a timely alert should be received by the owner. A Network Intrusion Detection System (NIDS) is deployed to detect and real-time information in case of any suspicious activity while accessing the Internet of Things network.
We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity $B$. At any time, the buffer cannot accommodate more than $B$ packets. Packets arrive over time. Each packet is associated with a non-negative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left the buffer will not be reconsidered for delivery any more. In each time step, at most one packet in the buffer can be sent. The order in which the packets are sent should comply with the order of their arrival time. The objective is to maximize the total value of the packets sent in an online manner. In this paper, we study a variant of this FIFO buffering model in which a packet's value is either 1 or $α> 1$. We present a deterministic memoryless 1.304-competitive algorithm. This algorithm has the same competitive ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer Networks 2003). However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches applied for the general model a