College students’ pronunciations of initial c and g were examined in English words and nonwords, both monosyllables and polysyllables. Pronunciations were influenced by adjacent context—whether the following letter was e or i— and by long-distance context—whether the item contained a suffix or spelling pattern characteristic of Latinate words. Pronunciations were also influenced by whether stud...

The paper describes a research on a use of intonation for disambiguating utterance types of Korean spoken sentences. Based on tilt intonation theory [8], two related but separate experiments were performed, both using the Hidden Markov Model training technique. In the first experiment, a system is established so that rough boundary positions of major intonation events are detected. Subsequently...

This paper studies how to train machine-learning models that directly approximate the optimal solutions of constrained optimization problems. is an empirical risk minimization under constraints, which challenging as training must balance optimality and feasibility conditions. Supervised learning methods often approach this challenge by model on a large collection pre-solved instances. takes dif...

The acquisition of German plurals has been the focus of controversy in the last decade. In this paper we claim that degree of productivity (i.e. the capacity of nouns to form potential plurals) plays a key role in determining pace of acquisition. A plural elicitation task was administered to 84 Viennese German-speaking children aged 2;6 to 6;0. Analyses of correct responses showed that the high...

The current study investigates reading aloud (i.e. pronouncing) words in Persian, a language that omits some of its vowels in its script. A word reading task employing a masked priming paradigm did not yield any differences in speech onset latencies between an onset-matching and an onset-mismatching condition. However, eventrelated potentials (ERPs) did reveal a difference in amplitude between ...

We propose a route choice model in which traveler behavior is represented as utility maximizing assignment of flow across an entire network under conservation constraint. Substitution between routes depends on how much they overlap. The estimated considering the full set alternatives, and no generation required. Nevertheless, estimation requires only linear regression very fast. Predictions fro...

In order to satisfy with the individual and various demand of customer, the present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; centers the longest...

Shortest path algorithms optimize the costs of a journey in a network. For route planning algorithms, networks are usually modeled as graphs. Different cost functions are used, like the length of a path, or the travel time. Costs are traditionally attached to edges in the graph. For some important route planning problems costs that are associated with pairs of edges can be identified. For examp...