Number-specification in numeral 'cien'

Topology optimization via sequential integer programming and Canonical relaxation algorithm

پژوهش حاضر به طرح شواهد در حمایت از فرضیۀ فاعل در درون گروه فعلی زبان گیلکی در چارچوب برنامة کمینه­گرا می­پردازد. داده­های این پژوهش کیفی است و از شم زبانی نگارندگان و متون گفتاری و نوشتاری جمع­آوری شده­اند. گرچه گونۀ توصیف و تحلیل شده‌ در مرکز و غرب استان گیلان رایج است اما به نظر می‌رسد نتایج این پژوهش به سایر گونه­های گیلکی نیز تعمیم­پذیر باشد. در این مقاله با طرح شواهدی مانند سور شناور،محدودیت ساخت همپایه، اصطلاح­پاره­ها و ارتقا، به تعیین جایگاه موضوع بیرونی (فاعل) پرداختیم و نشان دادیم که داده­های زبانی گیلکی، فرضیۀ فاعل در درون گروه فعلی را تأیید می­کند. تمام شواهد مؤید آن است که در زبان گیلکی، فاعل در جایگاه مشخصگر گروه فعلی اشتقاق­درپایه می­یابد، و سپس برای ارضای اصل فرافکنی گسترده از جایگاه مشخصگر گروه فعلی (Spec VP) به جایگاه مشخصگر گروه تصریفی (Spec IP) حرکت می­کند. به بیانی دیگر، داده­ها نشان می­دهند که فاعل به همراه سایر موضوع­های فعل در درون گروه فعلی تولید می­شود و موضوع بیرونی واقع در جایگاه مشخصگر گروه تصریفی، یک فاعل اشتقاقی است.

The acquisition of a new bimanual skill depends on several motor coordination constraints. To date, coordination constraints have often been tested relatively independently of one another, particularly with respect to isofrequency and multifrequency rhythms. Here, we used a new paradigm to test the interaction of multiple coordination constraints. Coordination constraints that were tested included temporal complexity, directionality, muscle grouping, and hand dominance. Twenty-two healthy young adults performed a bimanual dial rotation task that required left and right hand coordination to track a moving target on a computer monitor. Two groups were compared, either with or without four days of practice with augmented visual feedback. Four directional patterns were tested such that both hands moved either rightward (clockwise), leftward (counterclockwise), inward or outward relative to each other. Seven frequency ratios (3∶1, 2∶1, 3∶2, 1∶1, 2∶3. 1∶2, 1∶3) between the left and right hand were introduced. As expected, isofrequency patterns (1∶1) were performed more successfully than multifrequency patterns (non 1∶1). In addition, performance was more accurate when participants were required to move faster with the dominant right hand (1∶3, 1∶2 and 2∶3) than with the non-dominant left hand (3∶1, 2∶1, 3∶2). Interestingly, performance deteriorated as the relative angular velocity between the two hands increased, regardless of whether the required frequency ratio was an integer or non-integer. This contrasted with previous finger tapping research where the integer ratios generally led to less error than the non-integer ratios. We suggest that this is due to the different movement topologies that are required of each paradigm. Overall, we found that this visuomotor task was useful for testing the interaction of multiple coordination constraints as well as the release from these constraints with practice in the presence of augmented visual feedback.

In this paper, a topology optimization method based on the element independent nodal density (EIND) is developed for continuum solids with multiple load cases and multiple constraints. The optimization problem is formulated ad minimizing the volume subject to displacement constraints. Nodal densities of the finite element mesh are used a the design variable. The nodal densities are interpolated into any point in the design domain by the Shepard interpolation scheme and the Heaviside function. Without using additional constraints (such ad the filtering technique), mesh-independent, checkerboard-free, distinct optimal topology can be obtained. Adopting the rational approximation for material properties (RAMP), the topology optimization procedure is implemented using a solid isotropic material with penalization (SIMP) method and a dual programming optimization algorithm. The computational efficiency is greatly improved by multithread parallel computing with OpenMP to run parallel programs for the shared-memory model of parallel computation. Finally, several examples are presented to demonstrate the effectiveness of the developed techniques.

Assuming Grosu’s (1973) decomposition of Ross’s (1967) Coordinate Structure Constraint into the Conjunct Constraint and the Element Constraint, this article searches for a principled account for the Conjunct Constraint, rebaptized as the Coordinand Constraint. It defends the proposal that different families of effects of the Coordinand Constraint are related to different factors: (a) the lexical information provided by a coordinator, (b) the economy of syntactic displacement operations, and (c) an interface condition prohibiting self-coordination. These three factors are not primitive, but derive from Chomsky’s (1991) Least Effort Principle. Therefore, the Coordinand Constraint is deduced, ultimately, from the Least Effort Principle.

The article shows that the Coordinate Structure Constraint (CSC) can be violated in a number of languages and establishes a novel cross-linguistic generalization regarding languages that allow violations of the CSC. A phase-based deduction of this generalization is then provided under a particular contextual approach to phases. In addition, based on the cross-linguistic data regarding violations of the CSC, it is argued that the CSC should be separated into two conditions: (i) the ban on extractionofa conjunct, and (ii) the ban on extractionout ofa conjunct. This means that the whole coordinate structure (ConjP) as well as individual conjuncts are islands independently of each other. The article also addresses the long-standing debate regarding where in the grammar the CSC applies, arguing that the two different conditions that result from the separation of the traditional CSC ((i) and (ii) above) are deduced from different mechanisms in the architecture of the grammar: one is a purely syntactic condition, and the other is an interface condition.

QoS multicast aggregation under multiple additive constraints

Since the formulation of the Coordinate Structure Constraint (CSC), extraction from coordinate structures has been observed to be illegitimate, but it is empirically challenged by exceptional cases. Given this, we propose that conjuncts in general are base-generated by Form Set (Chomsky 2020, 2021), being subject to the parallel structure constraint; extraction occurs in an across-the-board mode, capturing the CSC. Concerning the exceptional VP conjuncts where asymmetric extraction is allowed, we argue that they are properly labeled in the mode of syntactic restructuring (Choe 1988; Wurmbrand 2001) (Kim and Park 2021, 2022); accordingly, the requirement of the single event structure (Truswell 2007) is met, feeding sub-extraction. In short, this paper deduces the CSC by resorting to Form Set in tandem with labeling via restructuring.

It has been widely assumed that certain island violations are ameliorated by ellipsis. However, Merchant(2001) argues that the second part of the Coordinate Structure Constraint(CSC) in English is not a PF-island and thus its violations cannot be repaired/ameliorated. This paper aims to investigate the repairability of the CSC in Korean. It is shown that as in English, the second part of the CSC (ban on extraction out of conjuncts) is not repairable by ellipsis in Korean. I first show that constructing relevant data is evasive due to some confounding factors. However, I demonstrate that when these factors are carefully controlled for, the data invariably respect the CSC, yielding no repair effects. Comparing the CSC with the relative clause island, I suggest that while the relative clause may well constitute a PF-island, the CSC does not. I also argue that the relevant data are problematic for the in-situ ellipsis approach

Two-sided assembly line is often designed to produce large-sized high-volume products such as cars, trucks and engineering machinery. However, in real-life production process, besides the elementary constraints in the one-sided assembly line, additional constraints, such as zoning constraints, positional constraints and synchronous constraints, may occur in the two-sided assembly line. In this paper, mathematical formulation of balancing multi-objective two-sided assembly line with multiple constraints is established, and some practical objectives, including maximization of the line efficiency, minimization of the smoothness index and minimization of the total relevant costs per product unit (Tcost), have been considered. A novel multi-objective optimization algorithm based on improved teaching---learning-based optimization (ITLBO) algorithm is proposed to obtain the Pareto-optimal set. In the ITLBO algorithm, teacher and learner phases are modified for the discrete problem, and late acceptance hill-climbing is integrated into a novel self-learning phase. A novel merging method is proposed to construct a new population according to the ordering relation between the original and evolutionary population. The proposed algorithm is tested on the benchmark instances and a practical case. Experimental results, compared with the ones computed by other algorithm and in current literature, validate the effectiveness of the proposed algorithm.

Reliability Optimization Model for Redundant Systems with Multiple Constraints

The formation of the complex network architecture of neural systems is subject to multiple structural and functional constraints. Two obvious but apparently contradictory constraints are low wiring cost and high processing efficiency, characterized by short overall wiring length and a small average number of processing steps, respectively. Growing evidence shows that neural networks are results from a trade-off between physical cost and functional value of the topology. However, the relationship between these competing constraints and complex topology is not well understood quantitatively. We explored this relationship systematically by reconstructing two known neural networks, Macaque cortical connectivity and C. elegans neuronal connections, from combinatory optimization of wiring cost and processing efficiency constraints, using a control parameter , and comparing the reconstructed networks to the real networks. We found that in both neural systems, the reconstructed networks derived from the two constraints can reveal some important relations between the spatial layout of nodes and the topological connectivity, and match several properties of the real networks. The reconstructed and real networks had a similar modular organization in a broad range of , resulting from spatial clustering of network nodes. Hubs emerged due to the competition of the two constraints, and their positions were close to, and partly coincided, with the real hubs in a range of values. The degree of nodes was correlated with the density of nodes in their spatial neighborhood in both reconstructed and real networks. Generally, the rebuilt network matched a significant portion of real links, especially short-distant ones. These findings provide clear evidence to support the hypothesis of trade-off between multiple constraints on brain networks. The two constraints of wiring cost and processing efficiency, however, cannot explain all salient features in the real networks. The discrepancy suggests that there are further relevant factors that are not yet captured here.

This paper investigates how the Second Part of Coordinate Structure Constraint (CSC) behaves in Right Node Raising (RNR) in Korean. We first show that constructing relevant data is evasive due to some confounding factors, and then demonstrate that when the factors are controlled for, RNR exhibits the CSC effect. We argue that it is readily captured by the ellipsis analysis, with the consequence that a violation of CSC is not repairable by ellipsis (Merchant 2001). However, in so doing, we present a puzzle that partly favors the multidominance analysis (Wilder 1999, Citko 2005). To resolve the puzzle, we suggest that the domain of the application of multidominance is restricted to (extractable) maximal constituents. This accounts for why in the context where multidominance is not permitted and ellipsis induces a violation of the CSC, the CSC effect invariably emerges.

In order to solve large-scale lasso problems, screening algorithms have been developed that discard features with zero coefficients based on a computationally efficient screening rule. Most existing screening rules were developed from a spherical constraint and half-space constraints on a dual optimal solution. However, existing rules admit at most two half-space constraints due to the computational cost incurred by the half-spaces, even though additional constraints may be useful to discard more features. In this paper, we present AdaScreen, an adaptive lasso screening rule ensemble, which allows to combine any one sphere with multiple half-space constraints on a dual optimal solution. Thanks to geometrical considerations that lead to a simple closed form solution for AdaScreen, we can incorporate multiple half-space constraints at small computational cost. In our experiments, we show that AdaScreen with multiple half-space constraints simultaneously improves screening performance and speeds up lasso solvers.

Finding disjoint paths between a source and destination node pair under quality of service (QoS) constraints is a significant scheme for improving both the network survivability and the QoS performances. This paper proposed a new algorithm, which aims to find a pair of link-disjoint paths that each of them satisfies two or more additive constraints. Our algorithm is on the basis of SAMCRA and searches solutions according to the varied composition forms of the exact solutions. Comparisons and simulations show that our scheme is capable of getting feasible solutions and optimal solutions with higher probabilities than existing approaches.