Kinematic design of mechanisms in a computer aided design environment

Download

index.pdf

Date

2005

Author

Demir, Eralp

Metadata

Show full item record

Item Usage Stats

208
views

96
downloads

CADSYN (Computer Aided Design SYNthesis) is a visual, interactive computer program working under Computer Aided Design (CAD) enviroment, which accomplishes the synthesis and analysis of planar four-bar mechanisms. The synthesis tasks are motion generation, path generation and function generation. During synthesis, the dyadic approach is utilized which introduces vector pairs and complex number algebra to model the motion. The possible solutions can be limited for link dimensions, the center circle point curves within a certain region, transmission angle characteristics, branch and order defects. The designed mechanism can be analyzed for velocity, acceleration and transmission angle and any of the data can be exported to Excel® for further analysis. The software is designed to provide the user maximum feasible number of solutions. In four multiply separated position synthesis, if there is flexibility in the value(s) of one or any number of input parameter(s), designer can obtain different Burmester curves by changing those parameter(s). Designer can also simulate the kinematics of the mechanism by using drawing functions that are available from the CAD enviroment at any time. Drawing parts in the design plane can be attached to any link of the mechanism and can be simulated throughout the motion as part of the link it is attached. As a whole, this computer program is designed to satisfy the needs of mechanism designers while working in CAD enviroment.

Subject Keywords

Databases.

URI

http://etd.lib.metu.edu.tr/upload/12606012/index.pdf
https://hdl.handle.net/11511/15047

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Using fuzzy Petri nets for static analysis of rule-bases Bostan-Korpeoglu, B; Yazıcı, Adnan (2004-01-01) We use a Fuzzy Petri Net (FPN) structure to represent knowledge and model the behavior in our intelligent object-oriented database environment, which integrates fuzzy, active and deductive rules with database objects. However, the behavior of a system can be unpredictable due to the rules triggering or untriggering each other (non-termination). Intermediate and final database states may also differ according to the order of rule executions (non-confluence). In order to foresee and solve problematic behavior...
An attempt to classify Turkish district data : K-Means and Self-Organizing Map (SOM) algorithms Aksoy, Ece; Işık, Oğuz; Department of Geodetic and Geographical Information Technologies (2004) There is no universally applicable clustering technique in discovering the variety of structures display in data sets. Also, a single algorithm or approach is not adequate to solve every clustering problem. There are many methods available, the criteria used differ and hence different classifications may be obtained for the same data. While larger and larger amounts of data are collected and stored in databases, there is increasing the need for efficient and effective analysis methods. Grouping or classific...
Qualitative behavior of solutions of dynamic equations on time scales Mert, Raziye; Ağacık, Zafer; Department of Mathematics (2010) In this thesis, the asymptotic behavior and oscillation of solutions of dynamic equations on time scales are studied. In the first part of the thesis, asymptotic equivalence and asymptotic equilibrium of dynamic systems are investigated. Sufficient conditions are established for the asymptotic equivalence of linear systems and linear and quasilinear systems, respectively, and for the asymptotic equilibrium of quasilinear systems by unifying and extending some known results for differential systems and diffe...
A new hybrid multi-relational data mining technique Toprak, Seda Dağlar; Toroslu, İ. Hakkı; Department of Computer Engineering (2005) Multi-relational learning has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. As patterns involve multiple relations, the search space of possible hypotheses becomes intractably complex. Many relational knowledge discovery systems have been developed employing various search strategies, search heuristics and pattern language limitations in order to cope with the complexity of hypothesis space. In this w...
The strong partial transitive-closure problem: Algorithms and performance evaluation Toroslu, İsmail Hakkı (1996-08-01) The development of efficient algorithms to process the different forms of transitive-closure (To) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values...

Citation Formats

E. Demir, “Kinematic design of mechanisms in a computer aided design environment,” M.S. - Master of Science, Middle East Technical University, 2005.