Browsing Computer Science by Type "Article"
Now showing items 41-60 of 77
-
The number of valid factorizations of Fibonacci prefixes
(Elsevier, 2019-07-05)We establish several recurrence relations and an explicit formula for , the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci ... -
The number of valid factorizations of Fibonacci prefixes
(Elsevier, 2019-07-05)We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci ... -
On Achieving High Survivability in Virtualized Data Centers
(Institute of Electronics, Information and Communication Engineers, 2014-01-01)As businesses are increasingly relying on the cloud to host their services, cloud providers are striving to offer guaranteed and highly-available resources. To achieve this goal, recent proposals have advocated to offer ... -
On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions
(World Scientific Publishing, 2012-01-01)Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions ... -
On the Number of Trials Needed to Obtain k Consecutive Successes
(Elsevier, 2021-04-30)A sequence of independent Bernoulli trials, each of which is a success with probability p, is conducted. For k ∈ Z+, let Xk be the number of trials required to obtain k consecutive successes. Using techniques from elementary ... -
Password Advice Shouldn't Be Boring: Visualizing Password Guessing Attacks
(IEEE, 2013-09)Users are susceptible to password guessing attacks when they create weak passwords. Despite an abundance of text-based password advice, it appears insufficient to help home users create strong memorable passwords. We propose ... -
Perspectives on software-defined networks: interviews with five leading scientists from the networking community
(SpringerOpen, 2015-10-30)Software defined Networks (SDNs) have drawn much attention both from academia and industry over the last few years. Despite the fact that underlying ideas already exist through areas such as P2P applications and active ... -
Planning and Deployment of Wireless Sensor Networks
(SAGE Publications (UK and US): Creative Commons Attribution, 2014-01-08)Editorial introduction to special issue on Planning and Deployment of Wireless Sensor Networks published in the International Journal of Distributed Sensor Networks, 9(5). 2014. -
Power Diagrams and Sparse Paged Grids for High Resolution Adaptive Liquids
(Association for Computing Machinery, 2017-07-20)We present an efficient and scalable octree-inspired fluid simulation framework with the flexibility to leverage adaptivity in any part of the computational domain, even when resolution transitions reach the free surface. ... -
A Practical Method for High-Resolution Embedded Liquid Surfaces
(Wiley, 2016-05-01)Combining high-resolution level set surface tracking with lower resolution physics is an inexpensive method for achieving highly detailed liquid animations. Unfortunately, the inherent resolution mismatch introduces several ... -
A practical octree liquid simulator with adaptive surface resolution
(Association for Computing Machinery, 2020-07)We propose a new adaptive liquid simulation framework that achieves highly detailed behavior with reduced implementation complexity. Prior work has shown that spatially adaptive grids are efficient for simulating large-scale ... -
Preserving Geometry and Topology for Fluid Flows with Thin Obstacles and Narrow Gaps
(Association for Computing Machinery, 2016-07-01)Fluid animation methods based on Eulerian grids have long struggled to resolve flows involving narrow gaps and thin solid features. Past approaches have artificially inflated or voxelized boundaries, although this sacrifices ... -
Quotient Complexities of Atoms in Regular Ideal Languages
(Institute of Informatics: University of Szeged, 2015)A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ... -
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
(Institute of Informatics: University of Szeged, 2014)A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ... -
Quotient Complexity Of Closed Languages
(Springer, 2014-02-01)A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ... -
Quotient Complexity of Ideal Languages
(Elsevier, 2013-01-28)A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a two-sided ideal if L=Σ∗LΣ∗, and an all-sided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ... -
Quotient Complexity Of Star-Free Languages
(World Scientific Publishing, 2012-09-01)The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ... -
Regional Time Stepping for SPH
(The Eurographics Association, 2014)This paper presents novel and efficient strategies to spatially adapt the amount of computational effort applied based on the local dynamics of a free surface flow, for classic weakly compressible SPH (WCSPH). Using a ... -
Revisiting Password Rules: Facilitating Human Management of Passwords
(IEEE, 2016-06)Password rules were established in the context of past security concerns. Recent work in computer security challenges the conventional wisdom of expert password advice, such as change your passwords often, do not reuse ... -
The Role of Instructional Design in Persuasion: A Comics Approach for Improving Cybersecurity
(Taylor & Francis, 2016-03)Although computer security technologies are the first line of defence to secure users, their success is dependent on individuals’ behaviour. It is therefore necessary to persuade users to practice good computer security. ...