A pattern recognition based intelligent search method and?two?assignment problem case?studies

Numerous papers based on various search methods across a wide variety of applications have appeared in the literature over recent years. Most of these methods apply the following same approach to address the problems at hand: at each iteration of the search, they first apply their search methods to generate new solutions, then they calculate the objective values (or costs) by taking some constraints into account, and finally they use some strategies to determine the acceptance or rejection of these solutions based upon the calculated objective values. However, the premise of this paper is that calculating the exact objective value of every resulting solution is not a must, particularly for highly constrained problems where such a calculation is costly and the feasible regions are small and disconnected. Furthermore, we believe that for newly-generated solutions, evaluating the quality purely by their objective values is sometimes not the most efficient approach. In many combinatorial problems, there are poor-cost solutions where possibly just one component is misplaced and all others work well. Although these poor-cost solutions can be the intermediate states towards the search of a high quality solution, any cost-oriented criteria for solution acceptance would deem them as inferior and consequently probably suggest a rejection. To address the above issues, we propose a pattern recognition-based framework with the target of designing more intelligent and more flexible search systems. The role of pattern recognition is to classify the quality of resulting solutions, based on the solution structure rather than the solution cost. Hence, the general contributions of this work are in the line of “insights” and recommendations. Two real-world cases of the assignment problem, i.e. the hospital personnel scheduling and educational timetabling, are used as the case studies. For each case, we apply neural networks as the tool for pattern recognition. In addition, we present our theoretical and experimental results in terms of runtime speedup.     

Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach

The state space explosion problem in model checking remains the chief obstacle to the practical verification of real-world distributed systems. We attempt to address this problem in the context of verifying concurrent (message-passing) C programs against safety specifications. More specifically, we present a fully automated compositional framework which combines two orthogonal abstraction techniques (operating respectively on data and events) within a counterexample-guided abstraction refinement (CEGAR) scheme. In this way, our algorithm incrementally increases the granularity of the abstractions until the specification is either established or refuted. Our explicit use of compositionality delays the onset of state space explosion for as long as possible. To our knowledge, this is the first compositional use of CEGAR in the context of model checking concurrent C programs. We describe our approach in detail, and report on some very encouraging preliminary experimental results obtained with our tool MAGIC.     

Congregation Formation in Multiagent Systems

We present congregating both as a metaphor for describing and modeling multiagent systems (MAS) and as a means for reducing coordination costs in large-scale MAS. When agents must search for other agents to interact with, congregations provide a way for agents to bias this search towards groups of agents that have tended to produce successful interactions in the past. This causes each agent's search problem to scale with the size of a congregation rather than the size of the population as a whole. In this paper, we present a formal model of a congregation and then apply Vidal and Durfee's CLRI framework [24] to the congregating problem. We apply congregating to the affinity group domain, and show that if agents are unable to describe congregations to each other, the problem of forming optimal congregations grows exponentially with the number of agents. The introduction of labelers provides a means of coordinating agent decisions, thereby reducing the problem's complexity. We then show how a structured label space can be exploited to simplify the labeler's decision problem and make the congregating problem linear in the number of labels. We then present experimental evidence demonstrating how congregating can be used to reduce agents' search costs, thereby allowing the system to scale up. We conclude with a comparison to other methods for coordinating multiagent behavior, particularly teams and coalitions.     

A time-predefined local search approach to exam timetabling problems

In recent years the processing speed of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real-time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of local search where the search time can be set as an input parameter. These two approaches are: a time-predefined variant of simulated annealing and an adaptation of the “great deluge” method. We present a comprehensive series of experiments which show that these approaches significantly outperform the previous best results (in terms of solution quality) on a range of benchmark exam timetabling problems. Of course, there is a price to pay for such better results: increased execution time. We discuss the impact of this trade-off between quality and execution time. In particular we discuss issues involving the proper estimation of the algorithm's execution time and the assessment of its importance.     

Complex chain of momentum transfer of body segments in the baseball pitching motion

Abstract

Baseball pitching requires contributions from and interaction among all limb segments. Most previous investigators have concentrated on the throwing arm itself, but the center of mass (COM) and contribution of all segments in the pitching motion have not been studied. The purpose of this study was to investigate the momentum transfer of all body segments in the pitching motion. The kinematics pitching motion data were captured from three experienced pitchers (one is professional, two are amateurs). A ten‐segment body system was modeled in this study. The results showed that the lowest position of the COM during the pitching cycle occurred around the ball release time and the fastest velocity (2.81±0.18 m/sec) of the COM was in the late cocking phase. The trunk and thigh on the throwing side showed the largest linear momentum among all segments in the late cocking phase. The upper throwing arm and forearm had peak linear momentum in the acceleration phase. The trunk also had the largest angular momentum during the pitching cycle and reached the maximum rotational momentum (4.17±1.22 Kg‐m²/sec) in the late cocking phase and medial bending momentum (9.03±5.78 Kg‐m²/sec) at the end of the late cocking phase. From the time sequence of linear momentum changes, especially in the leading direction, the force transfer from the foot to the trunk then through the upper extremity during the pitching motion was identified. The largest change rate of angular momentum found in the trunk meant that the trunk contributed the largest torque in the pitching motion. Better coordination of the body segments in the pitching motion not only enhances performance but also avoids injury. The coordination of motion by athletes in the pitching motion provides a guideline for better coaching and training.     

Properties and weldability of plasticized polylactic acid films

The objectives of the presented work were to investigate films based on polylactic acid (PLA) and polyethylene glycol (PEG) in order to improve ductility and weldability of PLA films. The effect of plasticizer amount on the thermal, rheological, and mechanical properties of PLA plasticized films was investigated. The PEG content does affect the glass transition and the cold crystallization temperature of PLA in blends, while the melting temperature was not affected by the addition of PEG. The complex viscosity of the neat PLA granules and of plasticized films showed strong temperature and angular velocity dependence. The Young's modulus and tensile strength of plasticized films were improved with increasing plasticizer concentration, while the elongation at break stays rather constant. Plasticized PLA films were furthermore heat welded. These investigations showed that plasticized PLA films can be welded by heat welding. The obtained weld strength is strongly depending on the PEG amount as well as on selected welding parameters. © 2014 Wiley Periodicals, Inc. J. Appl. Polym. Sci. 2014 , 131, 40394.