Results 341 to 350 of about 1,206,493 (389)
Some of the next articles are maybe not open access.
Where Shall We Log? Studying and Suggesting Logging Locations in Code Blocks
International Conference on Automated Software Engineering, 2020Developers write logging statements to generate logs and record system execution behaviors to assist in debugging and software maintenance. However, deciding where to insert logging statements is a crucial yet challenging task.
Zhenhao Li, T. Chen, Weiyi Shang
semanticscholar +1 more source
Characterizing the Natural Language Descriptions in Software Logging Statements
International Conference on Automated Software Engineering, 2018Logging is a common programming practice of great importance in modern software development, because software logs have been widely used in various software maintenance tasks.
Pinjia He +3 more
semanticscholar +1 more source
UniLog: Automatic Logging via LLM and In-Context Learning
International Conference on Software EngineeringLogging, which aims to determine the position of logging statements, the verbosity levels, and the log messages, is a crucial process for software reliability enhancement.
Junjielong Xu +11 more
semanticscholar +1 more source
DLFinder: Characterizing and Detecting Duplicate Logging Code Smells
International Conference on Software Engineering, 2019Developers rely on software logs for a wide variety of tasks, such as debugging, testing, program comprehension, verification, and performance analysis.
Zhenhao Li +3 more
semanticscholar +1 more source
2011
Operating systems and applications typically come with mechanisms for reporting errors as well as security-relevant actions such as users logging on and off. These events are reported as entries in log files. The objective of logging is to make these events transparent and comprehensible.
Patrick Schaller +2 more
openaire +2 more sources
Operating systems and applications typically come with mechanisms for reporting errors as well as security-relevant actions such as users logging on and off. These events are reported as entries in log files. The objective of logging is to make these events transparent and comprehensible.
Patrick Schaller +2 more
openaire +2 more sources
International Journal of Mathematical Education in Science and Technology, 2010
We extend the well-known identity, log det A = tr log A, for any square non-singular matrix ...
Christopher S. Withers +1 more
openaire +2 more sources
We extend the well-known identity, log det A = tr log A, for any square non-singular matrix ...
Christopher S. Withers +1 more
openaire +2 more sources
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002
This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive filter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient.
Srinath Hosur +2 more
openaire +2 more sources
This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive filter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient.
Srinath Hosur +2 more
openaire +2 more sources
RUSPACE(log n ) $\subseteq$ DSPACE(log 2 n /log log n )
Theory of Computing Systems, 1998We present a deterministic algorithm running in space O(log2 n /log log n ) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n ) time-bounded algorithm for this problem running on a parallel pointer machine.
Eric Allender, Klaus-Jörn Lange
openaire +2 more sources
q-log-distributions: Log-concavity and log-convexity
The European Physical Journal Plus, 2018Tsallis statistics along with Tsallis distributions have been attracting considerable attention of statisticians in recent years, since applications of the q-distributions can be found in various fields. However, only until recently, in 2018, a q -logarithm transformation has been considered in order to obtain new Tsallis distributions.
openaire +2 more sources
StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) [PDF]
, 1996 We present a deterministic algorithm running in space O (log2n/log log n) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
Eric Allender, Klaus-Jörn Lange
openaire +1 more source