نتایج جستجو برای: before discovering computer
تعداد نتایج: 1040667 فیلتر نتایج به سال:
In a distributed system, it is often important to detect the causal relationships between events, where event e1 is causally before event e2 if e1 happened before e2 and could possibly have aaected the occurrence of e2. In this paper we argue that it can be essential to security that a process determine, in the face of malicious attack, how two events are causally related. We formulate attacks ...
In this article, we present a particle filter (PF)-based track-before-detect (PF TBD) procedure for detection of extended objects whose shape is modeled by an ellipse. By incorporating of an existence variable and the target shape parameters into the state vector, the proposed algorithm performs joint estimation of the target presence/ absence, trajectory and shape parameters under unknown nuis...
The aim is the study on the impact of Pethedine 4 hours before labor on newborn. Data was gathered based on the Apgar scores in first and fifth minutes after birth. Three groups of mothers were selected: without any use of Pethedine, use of Pethedine less than 4 hours before labor and use of Pethedine more than 4 hours before labor. The data was analyzed by using computer programs. There was ...
This paper presents the Dynamic Relational Topic Model, a new dynamic topic model that incorporates both document text and relationships for discovering the underlying topics in document collections and their evolution over time. We derive an approximate variational inference algorithm for our model and demonstrate its effectiveness over previous approaches by analyzing papers in Computer Scien...
We discuss the progress (or lack of it) that has been made in discovering algorithms for computation on a quantum computer. Some possible reasons are given for the paucity of quantum algorithms so far discovered, and a short survey is given of the state of the field.
Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the symbolic computation tools, DISCOVERER and QEPCAD, to some interesting examples. keywords: Program Verification, Loop Termination, Ranking Function, Polynomial Programs, Semi-Algebraic Systems, Computer Algebra, DISCOVERER, QEPCAD
Computer-assisted interactive visualization has become a valuable tool for discovering the underlying meaning of tabular data, including categorical tabular data. The capabilities of the more traditionally mundane kinds of pictures like scatter plots can be expanded to usefully depict categorical tabular data by incorporating annotations and transforms, and by integrating the extensions into an...
Discovering the governing equations of evolving systems from available observations is essential and challenging. In this paper, we consider a different scenario: discovering streaming data. Current methods struggle to discover differential with considering measurements as whole, leading failure handle task. We propose an online modeling method capable handling samples one by sequentially data ...
Many distributed applications demand the underlying distributed systems to accommodate their needs. Matching requirements of distributed applications compels the prompt identification of momentary characteristics of an underlying distributed system. Thus, a method is needed to promptly derive a momentary state of a distributed system by identifying a set of events occurred across hosts and occu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید