Browsing by Subject "Computer applications"
Now showing 1 - 7 of 7
- Results Per Page
- Sort Options
Item Open Access Attitudes of design students toward computer usage in design(Springer Netherlands, 2006-01) Pektaş, S. T.; Erkip, F.The success of efforts to integrate technology with design education is largely affected by the attitudes of students toward technology. This paper presents the findings of a research on the attitudes of design students toward the use of computers in design and its correlates. Computer Aided Design (CAD) tools are the most widely used computer applications in design. An instrument was developed and applied for the first time to relate computer attitude to design field through CAD. Interior architecture undergraduates of Bilkent University participated in the survey. As a result, students' attitudes toward the use of computers in design were found to be positive. A significant gender difference in attitudes toward computers was observed with males having more positive attitudes than females. The results also revealed that students' attitude toward computer usage in design was highly related to their general attitude toward computers, but it was not correlated with their perception of instructors' attitude toward the use of computers in design. © Springer 2006.Item Open Access Computer aided frequency planning for the radio and TV broadcasts(Institute of Electrical and Electronics Engineers, 1996-06) Altıntaş, Ayhan; Ocalı, O.; Topçu, Satılmış; Tanyer, S. G.; Köymen, HayrettinThe frequency planning of the VHF and UHF broadcasts in Turkey is described. This planning is done with the aid of computer databases and digital terrain map. The frequency offset is applied whenever applicable to increase the channel capacity. The offset assignment is done through simulated annealing algorithm. The international rules and regulations concerning Turkey are also considered.Item Open Access G-free: Defeating return-oriented programming through gadget-less binaries(ACM, 2010-12) Onarlıoğlu, Kaan; Bilge, L.; Lanzi, A.; Balzarotti, D.; Kirda, E.Despite the numerous prevention and protection mechanisms that have been introduced into modern operating systems, the exploitation of memory corruption vulnerabilities still represents a serious threat to the security of software systems and networks. A recent exploitation technique, called Return-Oriented Programming (ROP), has lately attracted a considerable attention from academia. Past research on the topic has mostly focused on refining the original attack technique, or on proposing partial solutions that target only particular variants of the attack. In this paper, we present G-Free, a compiler-based approach that represents the first practical solution against any possible form of ROP. Our solution is able to eliminate all unaligned free-branch instructions inside a binary executable, and to protect the aligned free-branch instructions to prevent them from being misused by an attacker. We developed a prototype based on our approach, and evaluated it by compiling GNU libc and a number of real-world applications. The results of the experiments show that our solution is able to prevent any form of return-oriented programming. © 2010 ACM.Item Open Access Market-driven approach based on Markov decision theory for optimal use of resources in software development(Institution of Engineering and Technology, 2004) Noppen, J.; Aksit, M.; Nicola, V.; Tekinerdogan, B.Changes in requirements may have a severe impact on development processes. For example, if requirements change during the course of a software development activity, it may be necessary to reschedule development activities so that the new requirements can be addressed in a timely manner. Unfortunately, current software development methods do not provide explicit means to adapt development processes with respect to changes in requirements. The paper proposes a method based on Markov decision theory, which determines the estimated optimal development schedule with respect to probabilistic product demands and resource constraints. This method is supported by a tool and applied to an industrial case.Item Open Access Object rigidity and reflectivity identification based on motion analysis(IEEE, 2010) Zang, D.; Schrater P.R.; Doerschner, KatjaRigidity and reflectivity are important properties of objects, identifying these properties is a fundamental problem for many computer vision applications like motion and tracking. In this paper, we extend our previous work to propose a motion analysis based approach for detecting the object's rigidity and reflectivity. This approach consists of two steps. The first step aims to identify object rigidity based on motion estimation and optic flow matching. The second step is to classify specular rigid and diffuse rigid objects using structure from motion and Procrustes analysis. We show how rigid bodies can be detected without knowing any prior motion information by using a mutual information based matching method. In addition, we use a statistic way to set thresholds for rigidity classification. Presented results demonstrate that our approach can efficiently classify the rigidity and reflectivity of an object. © 2010 IEEE.Item Open Access A polyhedral study of multiechelon lot sizing with intermediate demands(Institute for Operations Research and the Management Sciences (I N F O R M S), 2012) Zhang, M.; Küçükyavuz, S.; Yaman, H.In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two-echelon case (2-ULS). Next, we present a family of valid inequalities for m-ULS, show its strength, and give a polynomial-time separation algorithm. We establish a hierarchy between the alternative formulations for 2-ULS. In particular, we show that our valid inequalities can be obtained from the projection of the multicommodity formulation. Our computational results show that this extended formulation is very effective in solving our uncapacitated multi-item two-echelon test problems. In addition, for capacitated multi-item, multiechelon problems, we demonstrate the effectiveness of a branch-and-cut algorithm using the proposed inequalities.Item Open Access Software architecture tool demonstrations(ACM, 2012) Muccini H.; Tekinerdoğan, BekirIn this paper, we describe the short summary of the tool demonstrations session at WICSA/ECSA 2012. The session aimed to attract both tools in practice and research tools. We describe the targeted topics for the tool support, and report on the program. Copyright is held by author/owner(s).