Algorithmic Decomposition of Shuffle on Words

We investigate shuffle-decomposability into two words. We give an algorithm which takes as input a DFA M (under certain conditions) and determines the unique candidate decomposition into words u and v such that L(M) = u v ifM is shuffle decomposable, in time O(|u| + |v|). Even though this algorithm does not determine whether or not the DFA is shuffle decomposable, the sublinear time complexity of only determining the two words under the assumption of decomposability is surprising given the complexity of shuffle, and demonstrates an interesting property of the operation. We also show that for given words u and v and a DFA M we can determine whether u v ⊆ L(M) in polynomial time

From Helmut Jürgensen's Former Students: The Game of Informatics Research

Personal reflections are given on being students of Helmut Jürgensen. Then, we attempt to address his hypothesis that informatics follows trend-like behaviours through the use of a content analysis of university job advertisements, and then via simulation techniques from the area of quantitative economics

On the Shuffle Automaton Size for Words

We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u shuffled with v requires an exponential number of states. We also show some conditions for the words u and v which ensure a quadratic upper bound on the state size of u shuffled with v. Moreover, switching only two letters within one of u or v is enough to trigger the change from quadratic to exponential

Alcohol consumption and cardiovascular outcomes in patients with nonalcoholic fatty liver disease: A population-based cohort study

Low-level alcohol consumption is associated with reduced cardiovascular disease (CVD) in the general population. It is unclear whether this association is seen in patients with nonalcoholic fatty liver disease (NAFLD) who have an increased risk of CVD. We examined the association between alcohol consumption and CVD-related outcomes in subjects with NAFLD from a general population cohort. Subjects participating in the 1994-1995 Busselton Health survey underwent clinical and biochemical assessment. NAFLD was identified using the Fatty Liver Index of \u3e60, and alcohol consumption quantified using a validated questionnaire. CVD hospitalizations and death during the ensuing 20 years were ascertained using the Western Australian data linkage system. A total of 659 of 4,843 patients were diagnosed with NAFLD. The average standard drinks per week was 8.0 for men and 4.0 for women. Men consuming 8-21 drinks per week had a 38% (hazard ratio [HR] 0.62, 95% confidence interval [CI] 0.43-0.90) lower risk of CVD hospitalization as compared with men consuming 1-7 drinks per week. With both men and women combined, consumption of 8-21 drinks per week was associated with a 32% (HR 0.68, 95% CI 0.49-0.93) reduction in CVD hospitalization in minimally adjusted and 29% (HR 0.71, 95% CI 0.51-0.99) in fully adjusted models. No protective association was observed with binge drinking. There was no association between alcohol consumption and CVD death. Conclusion: Low to moderate alcohol consumption is associated with fewer CVD hospitalizations but not CVD death in subjects with NAFLD

SPARK Linking Ready Kids to Ready Schools: A Report on Policy Insights from the Governors' Forum Series

Each year too many children start kindergarten unprepared to learn. Many will never catch up. The reasons for this are complex, but this much is clear: The multiple systems – from family to schools to government – that should be supporting young children too often are failing to do so. The W.K. Kellogg Foundation seeks to change that, and to permanently improve systems that affect children's learning.As policymakers look for ways to improve student outcomes by creating "seamless" systems of education starting at preschool, communities have been getting it done. SPARK (Supporting Partnerships to Assure Ready Kids) — a fiveyear initiative funded by the Kellogg Foundation — has contributed a unique, community-based perspective to the national conversation on what it takes to effectively link learning systems. In particular, SPARK examines what it takes at the beginning of the education pipeline to link early learning to the early grades. The goal is to make sure that children are ready for school and that schools are ready for them — a formula critical for a lifetime of successful learning.SPARK efforts are deeply anchored in the community and are designed to assure that children are successful both before and after they enter school. The strategy of working with schools, early care and education providers, families and community partners has yielded a set of proven ways to align local systems of education — approaches that have been tested in diverse rural and urban communities in Florida, Georgia, Hawaii, Mississippi, New Mexico, North Carolina, Ohio and Washington, D.C. What SPARK community-based sites have done to create connections across local systems of learning stands to influence larger school reform issues and state policy discussions about what is needed to create a more holistic learning experience for children — one that results in academic success at grade three and beyond

The complexity of approximating conservative counting CSPs

We study the complexity of approximately solving the weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, there is a classification known for the case in which the domain of functions in F is Boolean. In this paper, we give a classification for the more general problem where functions in F have an arbitrary finite domain. We define the notions of weak log-modularity and weak log-supermodularity. We show that if F is weakly log-modular, then #CSP(F)is in FP. Otherwise, it is at least as difficult to approximate as #BIS, the problem of counting independent sets in bipartite graphs. #BIS is complete with respect to approximation-preserving reductions for a logically-defined complexity class #RHPi1, and is believed to be intractable. We further sub-divide the #BIS-hard case. If F is weakly log-supermodular, then we show that #CSP(F) is as easy as a (Boolean) log-supermodular weighted #CSP. Otherwise, we show that it is NP-hard to approximate. Finally, we give a full trichotomy for the arity-2 case, where #CSP(F) is in FP, or is #BIS-equivalent, or is equivalent in difficulty to #SAT, the problem of approximately counting the satisfying assignments of a Boolean formula in conjunctive normal form. We also discuss the algorithmic aspects of our classification.Comment: Minor revisio

Graph-Controlled Insertion-Deletion Systems

In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computational power is strictly increased when using a control graph: computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a contextual or in a context-free manner and with the control graph having only four nodes.Comment: In Proceedings DCFS 2010, arXiv:1008.127

The Grizzly, December 4, 1981

Dealing With Financial Pressure • EcBA Department Interviews for New Positions • Freshman Relates Pre-Collegiate Experiences in Japan • Union Evaluation Prompts Improvement • Campus-wide Planning Meeting Sets Competitive Goals for UC • Residents Fix Up Curtis Hall • Lucas Named To PaCIE • \u27Messiah\u27 Rehearsal Open to Public • Jarvis and Rutherford in Last Coffeehouse • Best Albums of 1981 • Senior Poet Honored Nationally • New Wrestlers Lead the Way • Girls B-Ball Prime for Opener • Baseball Team Has New Skipper • Men\u27s Swimmers Take Third Place • Hoopsters Off to Slow Start • Gymnasts Pleasing • Women\u27s Swim Team Prepares for Tough Schedule • Mike Fagan All-MAChttps://digitalcommons.ursinus.edu/grizzlynews/1069/thumbnail.jp