نتایج جستجو برای: locating
تعداد نتایج: 12620 فیلتر نتایج به سال:
An application is vulnerable to attacks if it exhibits incorrect behavior while it reads and processes the contents of a specially crafted malicious file. These vulnerabilities are often caused due to programming bugs in the routines that parse and utilize the fields of a file. In this paper, we propose a solution for the discovery of this kind of vulnerabilities, using an approach that is base...
This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in a testing process for information systems. CLAs extend ordinary locating arrays to make them applicable to testing of systems that have constraints on test parameters. Such constraints are common in real-world systems; thus CLA enhances the applicability of lo...
NGC 7538 is known to host a 6.7 and 12.2 GHz methanol maser cospatial with a Ultra Compact (UC) H region,
The paper generalizes the notion of locating-chromatic number of a graph such that it can be applied to disconnected graphs as well. In this sense, not all the graphs will have finite locating-chromatic numbers. We derive conditions under which a graph has a finite locating-chromatic number. In particular, we determine the locatingchromatic number of a uniform linear forest, namely a disjoint u...
The paper describes an optimization problem of identifying heart ischemia using ECG measurements on the torso surface. Heart ischemia is a condition of reduced blood supply to cardiac tissue and can lead to heart infarctions. In the simulations, we model the cardiac electrical activity by a stationary form of the bidomain equations. These are solved using an adaptive finite element method on a ...
As part of a larger project evaluating aspects of offender profiling, an initial study was undertaken of the geographic aspects of approximately 300 sexual offences carried out by 79 stranger rapists. The objective was to focus further research on the topic into potentially useful channels, but information thought to be of immediate use to investigating officers was also produced. It was ascert...
As part of research into transparent execution of computational services in a distributed environment, two problems we have encountered are how to manage and locate information about service availability and the status of server machines. The key observation about these two problems is that they are not isolated problems, but each is an instance from a class of distributed information problems....
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as refer...
In 2012 Seager introduced a new variant of the Cops and Robbers game, in which a cop searches for a moving robber on a graph using distance probes. The robber on his turn can either remain still or move to an adjacent vertex, while the cop on her turn probes any vertex and learns the robber’s distance from the probed vertex. Carraher, Choi, Delcourt, Erickson and West later showed that for any ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید