Effects of semantic and syntactic complexities and aspectual class on past tense production

This paper reports results from a series of experiments that investigated whether semantic and/or syntactic complexity influences young Dutch children’s production of past tense forms. The constructions used in the three experiments were (i) simple sentences (the Simple Sentence Experiment), (ii) complex sentences with CP complements (the Complement Clause Experiment) and (iii) complex sentences with relative clauses (the Relative Clause Experiment). The stimuli involved both atelic and telic predicates. The goal of this paper is to address the following questions. Q1. Does semantic complexity regarding temporal anchoring influence the types of errors that children make in the experiments? For example, do children make certain types of errors when a past tense has to be anchored to the Utterance Time (UT), as compared to when it has to be anchored to the matrix topic time (TT)? Q2. Do different syntactic positions influence children’s performance on past-tense production? Do children perform better in the Simple Sentence Experiment compared to complex sentences involving two finite clauses (the Complement Clause Experiment and the Relative Clause Experiment)? In complex sentence trials, do children perform differently when the CPs are complements vs. when the CPs are adjunct clauses? (Lebeaux 1990, 2000) Q3. Do Dutch children make more errors with certain types of predicate (such as atelic predicates)? Alternatively, do children produce a certain type of error with a certain type of predicates (such as producing a perfect aspect with punctual predicates)? Bronckart and Sinclair (1973), for example, found that until the age of 6, French children showed a tendency to use passé composé with perfective events and simple present with imperfective events; we will investigate whether or not the equivalent of this is observed in Dutch

Random matrix analysis for gene interaction networks in cancer cells

Investigations of topological uniqueness of gene interaction networks in cancer cells are essential for understanding this disease. Based on the random matrix theory, we study the distribution of the nearest neighbor level spacings $P(s)$ of interaction matrices for gene networks in human cancer cells. The interaction matrices are computed using the Cancer Network Galaxy (TCNG) database, which is a repository of gene interactions inferred by a Bayesian network model. 256 NCBI GEO entries regarding gene expressions in human cancer cells have been selected for the Bayesian network calculations in TCNG. We observe the Wigner distribution of $P(s)$ when the gene networks are dense networks that have more than $\sim 38,000$ edges. In the opposite case, when the networks have smaller numbers of edges, the distribution $P(s)$ becomes the Poisson distribution. We investigate relevance of $P(s)$ both to the size of the networks and to edge frequencies that manifest reliance of the inferred gene interactions.Comment: 22 pages, 7 figure

Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints

We study the problem of allocating indivisible items to agents with additive valuations, under the additional constraint that bundles must be connected in an underlying item graph. Previous work has considered the existence and complexity of fair allocations. We study the problem of finding an allocation that is Pareto-optimal. While it is easy to find an efficient allocation when the underlying graph is a path or a star, the problem is NP-hard for many other graph topologies, even for trees of bounded pathwidth or of maximum degree 3. We show that on a path, there are instances where no Pareto-optimal allocation satisfies envy-freeness up to one good, and that it is NP-hard to decide whether such an allocation exists, even for binary valuations. We also show that, for a path, it is NP-hard to find a Pareto-optimal allocation that satisfies maximin share, but show that a moving-knife algorithm can find such an allocation when agents have binary valuations that have a non-nested interval structure.Comment: 21 pages, full version of paper at AAAI-201

Hedonic Games with Graph-restricted Communication

We study hedonic coalition formation games in which cooperation among the players is restricted by a graph structure: a subset of players can form a coalition if and only if they are connected in the given graph. We investigate the complexity of finding stable outcomes in such games, for several notions of stability. In particular, we provide an efficient algorithm that finds an individually stable partition for an arbitrary hedonic game on an acyclic graph. We also introduce a new stability concept -in-neighbor stability- which is tailored for our setting. We show that the problem of finding an in-neighbor stable outcome admits a polynomial-time algorithm if the underlying graph is a path, but is NP-hard for arbitrary trees even for additively separable hedonic games; for symmetric additively separable games we obtain a PLS-hardness result

Non-Standard Spelling in Wattpad Comments

Non-standard spelling on social media refers to the use of unconventional spelling and grammar. This article explores the non-standars spelling used by Wattpad readers in their comments. The study employs descriptive approach. The data are comments posted by Wattpad reader in reaction to a story by Shin_an Yuki's story Haf Soul Part 17: Takdir Yang Aneh. The finding shows that Wattad readers employ spoken-like spelling, repetition of letters and punctuations, shortening, and letters deletion in their comments

A Homologous Series of Cobalt, Rhodium, and Iridium Metalloradicals

We herein present a series of d7 trimethylphosphine complexes of group 9 metals that are chelated by the tripodal tetradentate tris(phosphino)silyl ligand [SiP^(iPr)_3]H ([SiP^(iPr)_3] = (2_(-i)Pr_2PC_6H_4)_3Si^–). Both electron paramagnetic resonance (EPR) simulations and density functional theory (DFT) calculations indicate largely metalloradical character. These complexes provide a rare opportunity to compare the properties between the low-valent metalloradicals of the second- and third-row transition metals with the corresponding first-row analogues

Cooperative Games with Bounded Dependency Degree

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational problems associated with many of these solution concepts tend to be intractable---NP-hard or worse. In this paper, we incorporate complexity measures recently proposed by Feige and Izsak (2013), called dependency degree and supermodular degree, into the complexity analysis of cooperative games. We show that many computational problems for cooperative games become tractable for games whose dependency degree or supermodular degree are bounded. In particular, we prove that simple games admit efficient algorithms for various solution concepts when the supermodular degree is small; further, we show that computing the Shapley value is always in FPT with respect to the dependency degree. Finally, we note that, while determining the dependency among players is computationally hard, there are efficient algorithms for special classes of games.Comment: 10 pages, full version of accepted AAAI-18 pape

On Parameterized Complexity of Group Activity Selection Problems on Social Networks

In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igarashi et al. have initiated the study of group activity selection problems on social networks (gGASP): a group of players can engage in the same activity if the members of the group form a connected subset of the underlying communication structure. Igarashi et al. have primarily focused on Nash stable outcomes, and showed that many associated algorithmic questions are computationally hard even for very simple networks. In this paper we study the parameterized complexity of gGASP with respect to the number of activities as well as with respect to the number of players, for several solution concepts such as Nash stability, individual stability and core stability. The first parameter we consider in the number of activities. For this parameter, we propose an FPT algorithm for Nash stability for the case where the social network is acyclic and obtain a W[1]-hardness result for cliques (i.e., for classic GASP); similar results hold for individual stability. In contrast, finding a core stable outcome is hard even if the number of activities is bounded by a small constant, both for classic GASP and when the social network is a star. Another parameter we study is the number of players. While all solution concepts we consider become polynomial-time computable when this parameter is bounded by a constant, we prove W[1]-hardness results for cliques (i.e., for classic GASP).Comment: 9 pages, long version of accepted AAMAS-17 pape

Teaching Writing in Blended Environment

The article aims to describe the implementation blended learning environment in teaching writing skills. The research is based on the blended learning framework that integrates face-to-face methods and online learning methods. The face-to-face method is given to see students' activeness in delivering ideas and brainstorming before writing essays. The online learning method is used to see students' ability to elaborate ideas from drafting to become a complete essay. Thus, students can be effective in learning in class to discuss their draft an essay and not spend much time writing. The implementation of blended learning was distributed to three session: brainstorming, drafting, and final writing. The evaluation was done for each cycle. After the evaluation, students get feedback for their performance in the previous session. The result post-test shows that students in the experimental class have indicated a significant improvement in essay writing performance with significance 0,06>0,05 with an average score of 76,35. The result of the research is very important as a framework to develop learning models for teaching writing at universities