Cover Vol.1, No.1, April 2004

Journal of Information and Computing Science, JIC, Vol1 2006 No1

( , ) k s SAT − is the propositional satisfiable problem restricted to instances where each clause has exactly k distinct literals and every variable occurs at most s times. It is known that there exits an exponential function f such that for ( ) s f k ≤ , all ( , ) k s SAT − instances are satisfiable, but ( , ( ) 1) k f k SAT + − is already NPcomplete ( 3 k ≥ ). Therefore, we call the function...

Journal of Information and Computing Science, JIC, Vol1 2006 No1, ISSN 1746-7659

Abstract. Time Petri Nets (TPNs) are a popular Petri net model for specification and verification of real-time systems. A widely applied method for analyzing Petri nets is component-level reduction analysis. The existing technique for component-level reduction analysis transforms a TPN component to a constant size of simple one while maintains the net external observable timing properties, but ...

Cover Vol.3, No.1, April 2006

Cover Vol 16, No. 2, April 2019

New Books April 2004

Background: Two distinct classes of regulators have been implicated in regulating neuronal gene expression and mediating neuronal identity: transcription factors such as REST/NRSF (RE1 silencing transcription factor) and CREB (cAMP response element-binding protein), and microRNAs (miRNAs). How these two classes of regulators act together to mediate neuronal gene expression is unclear. Results: ...

The NEBLINE, April 2004