nformation systems development methods (ISDMs) produce a product, the application, by following a development process model. We argue that in failing to produce the application process model that supports the application product, ISDMs only address part of the IS development problem. Additionally, we show that there is, in fact, a range of abstractions of the application product and process and...

I construct a POVM which has 2d rank-one elements and which is informationally complete for generic pure states in d dimensions, thus confirming a conjecture made by Flammia, Silberfarb, and Caves (quant-ph/0404137). I show that if a rank-one POVM is required to be informationally complete for all pure states in d dimensions, it must have at least 3d − 2 elements. I also show that, in a POVM wh...

The set of complete groups is a complete co-analytic subset of the standard Borel space of countably infinite groups.

We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy tolerances on fuzzy complete lattices and prove they are in one-to-one correspondence with extensive isotone Galois connections. Finally, we prove that fuzzy complete lattice, factorized by a complete fuzzy tolerance, is agai...

We study the computational complexity of a packing puzzle Fillmat, which is a type of pencil-and-paper puzzles made by Japanese puzzle publisher Nikoli. We show that the problem to decide if a given instance of Fillmat has a solution is NP-complete by a reduction from the circuit-satisfiability problem (Circuit-SAT). Our reduction is carefully designed so that we can also prove ASP-completeness...

We show that a P-complete language can be described by using the shuffle operator, shufle closure, union, concatenation, ICleene star and intersection on a finite alphabet.

We study the complexity of deciding whether a modular discrete event system is detectable (resp. opaque, A-diagnosable). Detectability arises in the state estimation of discrete event systems, opacity is related to the privacy and security analysis, and A-diagnosability appears in the fault diagnosis of stochastic discrete event systems. Previously, deciding weak detectability (opacity, A-diagn...