Search

A growing number of studies in the computer science and engineering communities are addressing mood, an affective phenomenon related but not equivalent to emotion. While emotion has been investigated intensely in the affective computing domain, the characteristics and applications of mood are relatively unexplored. Through a bottom-up approach, this paper aims to identify in which areas and for what purposes computer scientists and other researchers in the ACM and IEEE communities are studying mood. Based on a literature review of 1,264 peer-reviewed publications, this paper proposes a taxonomy of mood research in affective computing. Despite a wide range of applications and domains, core themes of mood research relate to identifying users' mood, influencing it, or helping users to communicate their mood to others. The conceptualization and definition of mood, however, vary between the studies surveyed and sometimes can fall considerably far from the psychological concept of mood in affect research. In several instances, researchers use the terms mood and emotion interchangeably and do not sufficiently discuss the implications both for their measurements and for the design of affective-computing systems as well. With our study, we aim to contribute a clearer conceptualization of mood research and to provide researchers with a broad overview of the research as well as areas of applications in which mood is addressed.

Various scientometric indices have been proposed in an attempt to express the quantitative and qualitative characteristics of scientific output. In this paper, we revisit several scientometrics indicators and apply the Rainbow Ranking method [1] [2] to categorize the academic personnel of the Departments of Informatics (Computer Science and Engineering) of Greek Universities. The dataset consists of ~700 Greek university professors along with all the relevant data and metadata about their publications and citations as identified in Microsoft Academic Search.

In order to understand the structure and folding of proteins, Hydrophobic-Polar (HP) model on 2D square lattice is one of the most explored models but parity problem of square lattice make it inefficient for biological applications. This work is dedicated to solve parity issues in 2D square lattice model. This work proposes a revised energy function and presents a case study for protein structure prediction (PSP). A novel approach to evaluate the structure modeling and protein folding problem over HP model is presented in this paper. This evaluation approach may enhance the quality and effectiveness of the computational approaches developed to address the PSP at coarse level.

From Last two decades internet technology is at top position. Due to internet technology, it is easy for communication, data transfer or sharing files. Internet technology is one of the major parts of computer science and engineering & electronics and telecommunication. There are many techniques and different subject of Computer Science & Engineering, Information Technology, and Electronics & Telecommunication contribute to develop educational technology. Such as, Data structure, discrete mathematics, database management system, operating system, computer networks, communication engineering, digital signal processing, computer organization, etc. This core subject generally used for making the applications with help of languages and tools like different programming languages, matlab, Xilinx, structure query language, Mongo DB, etc. In this research paper, evaluation & statistical analysis of modern tools and education technology in Student outcomes of C.S.E, I.T. and E&TC engineering graduates using T-test is explained.

We aimed to assess which factors correlate with collaborative behavior and whether such behavior associates with scientific impact (citations and becoming a principal investigator). We used the R index which is defined for each author as log(Np)/log(I1), where I1 is the number of co-authors who appear in at least I1 papers written by that author and Np are his/her total papers. Higher R means lower collaborative behavior, i.e. not working much with others, or not collaborating repeatedly with the same co-authors. Across 249,054 researchers who had published ≥30 papers in 2000-2015 but had not published anything before 2000, R varied across scientific fields. Lower values of R (more collaboration) were seen in physics, medicine, infectious disease and brain sciences and higher values of R were seen for social science, computer science and engineering. Among the 9,314 most productive researchers already reaching Np ≥ 30 and I1 ≥ 4 by the end of 2006, R mostly remained stable for most fields from 2006 to 2015 with small increases seen in physics, chemistry, and medicine. Both US-based authorship and male gender were associated with higher values of R (lower collaboration), although the effect was small. Lower values of R (more collaboration) were associated with higher citation impact (h-index), and the effect was stronger in certain fields (physics, medicine, engineering, health sciences) than in others (brain sciences, computer science, infectious disease, chemistry). Finally, for a subset of 400 U.S. researchers in medicine, infectious disease and brain sciences, higher R (lower collaboration) was associated with a higher chance of being a principal investigator by 2016. Our analysis maps the patterns and evolution of collaborative behavior across scientific disciplines.

We examine factors contributing to the gender gap in employment in science, technology, engineering, and math (STEM) among men and women with bachelor’s degrees in computer science and engineering, the two largest and most male-dominated STEM fields. Data come from the National Science Foundation’s (NSF) Scientists and Engineers Statistical Data System (SESTAT) from 1995 to 2008. Different factors are associated with persistence in STEM jobs among computer science and engineering degree holders. Conditional on receiving a degree in computer science, women are 14 percentage points less likely to work in STEM than their male counterparts. Controlling for demographic and family characteristics did little to change this gender gap. Women with degrees in engineering are approximately 8 percentage points less likely to work in STEM than men, although about half of this gap is explained by observed differences between men and women. We document a widening gender gap in STEM employment in computer science, but this gender gap narrows across college cohorts among those with degrees in engineering. Among recent computer science graduates, the gender gap in STEM employment for white, Hispanic, and black women relative to white men is even larger than for older graduates. Gender and race gaps in STEM employment for recent cohorts of engineering graduates are generally small, though younger Asian women and men no longer have an employment advantage relative to white men. Our results suggest that a one-size-fits-all approach to increasing women’s representation in the most male-dominated STEM fields may not work.

Hardware-based courses, like Robotics, require a lot of laboratory practice. Traditional laboratory exercises on a robotics course are held in a robotics laboratory equipped with proper hardware. Today, besides this kind of traditional laboratories, modern trends are virtual and remote laboratories where simulators are used. In this paper our experiences on the Robotics course, at the Faculty of Computer Science and Engineering in Skopje, with respect to using both traditional and modern laboratories, is presented. This Robotics course is introduced and in more detail the hands-on activities students have on the course are described. We have observed that students' hands-on experience in the laboratory improves their overall score on the course. The results of their performances that support this statement are given in this paper. Also their hands-on experience improves their ability and skills for their independent work on robotics projects. Some examples of the students' projects are presented here.

Due to rapid changes in requisites, universities face the challenge of being relevant. As such, it is pertinent to identify the attributes of successful universities and future learning environments for universities to steer themselves in achieving success. This study explores the perspectives of respondents pertaining to attributes of successful universities and future learning environments. Data were collected using a specially designed survey during the academic year 2015/2016. The sample size was 64 international science discipline (including computer science and engineering) academics. The results underscore critical attributes, management elements, component measures and dominant pedagogical and technological trends. The outcome of study highlights key perspectives that can be used as a basis for more in-depth research to assist in formulating possible strategies towards achieving successful university status and in equipping universities with learning and teaching environments of the future.

Building on prior psychological and sociological research on the power of local environments to shape gendered outcomes in STEM fields, this study focuses on the critical stage of adolescence to explore the potential negative impact of exposure to exclusionary messages from peers within girls’ science classrooms, as well as the positive potential impact of inclusionary messages. Specifically, utilizing longitudinal data from a diverse sample of adolescent youth, analyses examine how the presence of biased male peers, as well as confident female peers, shape girls’ subsequent intentions to pursue different STEM fields, focusing specifically on intentions to pursue the male-dominated fields of computer science and engineering, as well as more gender equitable fields. Results reveal that exposure to a higher percentage of 8th grade male peers in the classroom who endorsed explicit gender/STEM stereotypes significantly and negatively predicted girls’ later intentions to pursue a computer science/engineering (CS/E) major. Yet results also reveal that exposure to a higher percentage of confident female peers in the science classroom positively predicted such intentions. These results were specific to CS/E majors, suggesting that peers are an important source of messages regarding whether or not girls should pursue non-traditional STEM fields. This study calls attention to the importance of examining both positive and negative sources of influence within the local contexts where young people live and learn. Limitations and directions for future research are also discussed.

Approximately 10% of computer science and engineering majors have a disability of some kind. Students with disabilities are more likely to drop out of the major than those without disabilities. At the K-12 level, many tools used to teach computing are inaccessible to students with disabilities. This BOF will bring together individuals who are interested in increasing the representation of students with disabilities in computing and improving their success. Participants will share strategies and promising practices to help each other do a better job of including these students in our classes and research projects. Resources, including those produced by AccessComputing and AccessCSforAll (formally AccessCS10K) will be shared. Handouts and stickers will be given out.

This paper discusses the content and impact of a new first-year experience (FYE) course for at-risk students in the Computer Science and Engineering department at Shippensburg University, a mid-sized teaching university. The initial results from the new course are quite promising: DFW rates (grade of D, grade of F, and withdrawal) for the first and second semesters were cut in half and retention rates were dramatically improved.

We describe our experience designing and delivering a general education technological fluency course that frames the discussion of computer science and engineering technology (electronics and programming) in the context of sound-art: art that uses sound as its medium. This course is aimed at undergraduate students from a wide variety of backgrounds and is designed to fit into the ``Intellectual Explorations'' area of a general undergraduate program. The goal is to introduce computer engineering and computational principles to non-CS students through an exploration of sound-art, experimental and electronic music, noise-making circuits, hardware hacking, and circuit bending.

At the current time, there are several fundamental changes in the way computing systems are being developed, deployed and used. They are becoming increasingly large, heterogeneous, uncertain, dynamic and decentralised. These complexities lead to behaviours during run time that are difficult to understand or predict. One vision for how to rise to this challenge is to endow computing systems with increased self-awareness, in order to enable advanced autonomous adaptive behaviour. A desire for self-awareness has arisen in a variety of areas of computer science and engineering over the last two decades, and more recently a more fundamental understanding of what self-awareness concepts might mean for the design and operation of computing systems has been developed. This draws on self-awareness theories from psychology and other related fields, and has led to a number of contributions in terms of definitions, architectures, algorithms and case studies. This paper introduces some of the main aspects of self-awareness from psychology, that have been used in developing associated notions in computing. It then describes how these concepts have been translated to the computing domain, and provides examples of how their explicit consideration can lead to systems better able to manage trade-offs between conflicting goals at run time in the context of a complex environment, while reducing the need for a priori domain modelling at design or deployment time.

Supervisors: Sanasam Ranbir Singh & Sukumar Nandi, Analysis of complex network has emerged as a booming research area since last decade. Social network, a type of complex network, has gained attention from the contemporary researchers, due to the abundance of social network data in the Web in recent times. Rapid increase in the number of subscribers to the social platforms (such as blogs, dating sites, friends making sites) provided by the Web has revealed unseen human relationships, and motivated the researchers to make good use of this. This thesis deals with an important problem of social network analysis (also of complex network analysis): link prediction. Given a social network, the link prediction problem predicts new relationships which will appear in future. Homophily, i.e., similarity between two individuals influences new connections. This work models homophily by combining link strength and structure of the network towards link prediction. Link strength is encoded in link weight in several ways, which is derived from pattern of dyadic interaction between two nodes. Structural homophily is captured by traditional proximity based link prediction methods like common neighbor, Jaccard's coeffcient, Adamic/Adar etc.

Now a days, there is rapid development is Computer Science and Engineering Technology as well as data has been increasing wildly and it is a major problem for users to quickly find the most relevant (or useful) information or data from large amount of data being stored in databases. To solve this problem so many researchers are found that the feature selection algorithms (or methods) are best methods to identify to useful data (or information) from large amount of data present in databases. Feature Selection algorithm is useful in identifying (or selecting) most useful information from the entire large original set of features to improve accuracy. Feature Selection specifies a task that selects a subset of features and those are useful to solve domain problems. There are several important algorithms (or methods) are available for selecting the relevant features from large set of features to improve accuracy of the results. This paper explains performance of various feature selection algorithms to find most relevant features from the entire set of features.

Various grafts or combination of bone substitute materials have been used in sinus lift procedures. Currently, ongoing developments in several disciplines, from molecular biology and chemistry to computer science and engineering, have contributed to the understanding of biological processes leading to bone healing after the use of bone substitute materials (BSBs) and therefore of the behavior of BSBs. The understanding of the properties of each graft enables individual treatment concepts and therefore allows shift from a simple replacement material to the modern concept of an individually created composite biomaterial. Indeed, the choice of the best BSB still remains crucial for success in maxillary sinus augmentation procedures. The present article provides an overview of most of the materials currently available for sinus lift, with a specific focus on their histological, molecular, cellular and pharmaceutical aspects.

Supervisor: Arijit Sur, With the huge advancement in Internet technology as well as the availability of low cost 3D display devices, 3D image, and video transmission becomes popular in recent times. Since watermarking has been regarded as one of the potential digital right management (DRM) tools in the last decade; 3D image and video watermarking becomes an emerging research topic. In recent times, depth image based rendering (DIBR)-3D and depth based multi view 3D representation (MVD) are two popular 3D representations. In this dissertation, the entire thesis is primarily motivated to propose robust 3D image or video watermarking schemes for DIBR-3D and MVD representations against different hostile and non-hostile attacks.In the first work, watermarking issues against 3D-HEVC compression and the view synthesis attack have been considered. It is observed from the literature that the most of the existing 3D video watermarking schemes not suit well against 3D-HEVC compression which is a state-of-art MVD based 3D video compression scheme. In the first phase of our first contributory chapter, a 3D video watermarking scheme has been proposed which can resist 3D-HEVC compression by employing independent view regions (Z-axis) based embedding. In the later part of this chapter, the proposed scheme has been extended to resist view synthesis attacks by exploiting the shift invariance property of the dual tree discrete wavelet transform (DT-DWT) for embedding.

The ever increasing demand for high bandwidth, low latency multimedia applications on mobile devices is set to pose an enormous challenge on the bandwidth allocation and multiplexing mechanisms in Long Term Evolution (LTE) and future wireless networks. In order to face this challenge, these cellular network infrastructures must be empowered with sophisticated but low overhead online radio resource allocation mechanisms to efficiently serve a variety of heterogeneous user equipments (mobile phones, laptops, tablets etc.) such that the Quality of Service (QoS)/Quality of Experience (QoE) demands of all flows/end-users are met. In addition to satisfying QoS/QoE, the resource scheduling mechanisms may also need to simultaneously cater to other practical constraints/objectives like limited power budget, maximizing spectral efficiency and graceful degradation in times of overload, in the face of ever changing network dynamics, user mobility etc. In this dissertation, we present a few novel scheduling methodologies for system level as well as client centric QoS/QoE management corresponding to multimedia streaming over cellular networks in general, and LTE based systems in particular., Supervisors: Arnab Sarkar and Arijit Sur

S. V. Rao, In a rare event detection application, asynchronous sleep/wake scheduling is energy efficient because of overhead involved for synchronization in synchronous sleep/wake scheduling. As sensor nodes wake-up independently, asynchronous sleep/wake scheduling increases delay. For such an application, satisfying delay constraint and lifetime requirement with minimum deployment cost is a challenging problem. Specifically, in a rare event-detection application, like fire or disastrous event detection, an event detected close to the central facility needs to reach faster than an event detected far away. In our first contribution, we address the problem of finding a minimum cost WSN for a set of spatially differentiated QoS requirements. First, we use a stochastic approach to calculate the expected e2e delay for a given sensor density. We use this analysis to find the critical expected sensor density that satisfies given e2e delay constraint and lifetime requirement. Later we extended this analysis to find the minimum cost network for a set of spatially differentiated delay constraints and the lifetime requirement. We also verified our mathematical expressions using Monte Carlo simulation and show effectiveness in NS2 simulation.

The following interview with Wentao Wang, Senior User-Experience Designer at Baidu, Beijing, China (see Fig. 6.1) occurred via Skype on 22 November 2015 by book co-author Prof. Xiaojuan Ma, Assistant Professor, HCI Program, Department of Computer Science and Engineering, University of Science and Technology, Hong Kong, China.

Supervisors: Benny George K.and Kalpesh Kapoor, Word combinatorics is a field which aims to study on the languages of words over some alphabet containing symbols, to understand the properties, counting of these languages with respect to the concatenation, insertion, deletion of symbols. The most important problem in the field of Word combinatorics is primitive words, their properties and robustness on primitive words. We investigate the effect on primitive words of point mutations (inserting or deleting symbols, substituting a symbol for another one), of morphisms, and of the operation of taking prefixes. A word is said to be primitive if this cannot be written as proper power of a smaller word. It is a long standing important open problem whether the language of primitive words is a context-free language. Various primitive words and robustness on them are studied: 1. Some primitive words are the words that remains primitive on the operations, viz. substitution of any arbitrary symbol from the primitive words, deletion or insertion of a symbol in the primitive words or exchange of consecutive symbols. The properties of the languages of such primitive words are also discussed. 2. A word is L-primitive if it is not a proper power of a shorter word from the language L. We find the property of language L such that the set QL, language of L-primitive words over an alphabet is reflective. We also find the shortest language L such that QL = Q. We discuss that the robustness on the language of L-primitive words. 3 Many study is done on Pseudo-primitive words and quasi-primitive words in last one decade. Robustness on the language of pseudo-primitive words with a morphic involution. It is proved that a language of ins-robust pseudo-primitive words is not regular for an involution morphism.

Supervisor: Santosh Biswas, The rapid increase in complexity of VLSI circuits with the advent of Deep Sub-Micron (DSM) technology causes development of faults during their normal operation. Such faults cannot be detected by off-line test or Built-In-Self- Test (BIST) techniques, thus, On-line Testing (OLT) is becoming an essential part in Design for Testability (DFT). Most of the existing works presented in the literature on OLT of digital circuits have emphasized on the followings:--non-intrusiveness, totally self-checking, low area overhead, high fault coverage, low detection latency, etc. However,in DSM era, several other factors need to be considered, namely flexibility, coverage for advanced fault models, scalability, handling asynchronous circuits, etc. Considering all these facts, the main objective of this thesis is to design and develop efficient OLT schemes for detection of faults on-the-fly in digital VLSI circuits. In the first contribution of the thesis, we propose an Ordered Binary Decision Diagram (OBDD) based OLT scheme for digital circuits by considering “number of tap points” as a new design parameter to provide flexibility in the OLT perspective. Experimentally, it is seen that minimization of tap points (i.e., measurement limitation) has minimal impact on fault coverage and detection latency but it reduces area overhead of the on-line tester significantly. In the second contribution of the thesis, we propose an OBDD based OLT scheme for both feedback and non-feedback bridging faults. Experimentally, we have seen that consideration of feedback bridging faults along with non-feedback ones, improves fault coverage with marginal increase in the area overhead compared to schemes only involving nonfeedback faults. In the third contribution of the thesis, we propose a High Level Decision Diagram (HLDD) based OLT scheme at Register Transfer Level (RTL) model of circuits in order to improve the scalability.

This article represents an effort to help PhD students in computer science and engineering to generate good original ideas for their PhD research. Our effort is motivated by the fact that most PhD programs nowadays include several courses, as well as the research component, that should result in journal publications and the PhD thesis, all in a timeframe of 3–6 years. In order to help PhD students in computing disciplines to get focused on generating ideas and finding appropriate subject for their PhD research, we have analyzed some state-of-the-art inventions in the area of computing, as well as the PhD thesis research of faculty members of our department, and came up with a proposal of 10 methods that could be implemented to derive new ideas, based on the existing body of knowledge in the research field. This systematic approach provides guidance for PhD students, in order to improve their efficiency and reduce the dropout rate, especially in the area of computing.

"This book is a comprehensive reference source that provides innovative perspectives on the need for diversity in computer science and engineering disciplines and examines best practices to build upon students' knowledge bases. Featuring coverage on an expansive number of topics and perspectives, such as, computational algorithmic thinking, STEM diversity, and distributed mentorship"

Supervisor: T. Venkatesh, Many critical e-commerce and nancial services are deployed on geo-distributed data centers (GDCs) for scalability and availability. Recent market surveys show that failures are common in the data centers and this results in a huge nancial loss. Designing data centers for high availability includes spare capacity provisioning across the data centers. The work in this thesis addresses the problems of cost- aware capacity provisioning and load balancing in fault-tolerant GDCs (to mask the failures at a site). We propose optimization models for cost-e ective planning and operation of the GDCs and propose algorithms for solving these. First, we propose an optimization model to distribute the servers across the GDC such that, the total cost of ownership (TCO) for an operator is minimized. The model identi es the optimal server distribution and optimal request routing policy to exploit the spatio- temporal variation in the electricity prices and user demand for minimizing the TCO. Next, we extend the optimization model for capacity planning in GDCs collocated with renewable energy sources. Using this model, the operators can reduce their carbon footprint by maximizing the green energy usage, while minimizing the TCO. We also extend this model to consider GDCs powered by both brown and green energy sources. In such a case, we use an objective to minimize the total cost while ensuring that a certain percentage of green energy is always used.

Supervisors: Arijit Sur & Prabin Kumar Bora, With the increased popularity of High Definition (HD) and beyond HD videos (4K × 2K, 8K × 4K) and the emergence of the High Efficiency Video Coding (H.265/HEVC) compression standard for HD and beyond-HD video formats, security issues like copyright protection, content authentication etc. of HD videos have become an important research field. In this research work, video watermarking is considered as the tool for ensuring secure HD video transmission. In the first contributory chapter, a compressed domain robust watermarking scheme is proposed using one of the side information (intra prediction mode) of H.265/HEVC compressed video. Since the probability of the mode change during re-compression has been increased in H.265/HEVC with the previous standards, the existing mode-based watermarking schemes (for previous standards like H.264/AVC) are not robust enough if they are applied on HEVC videos. As a countermeasure, first the 4 × 4 luma Prediction Block (PB)s of intra frame are chosen for embedding based on the sustaining probability after re-compression. Further, the robustness is increased by grouping of the intra prediction modes of H.265/HEVC in a fashion such that the embedded mode-change due to re-compression can be closed within a group. In next chapter, the robustness of the above scheme is enhanced by embedding the watermark in the transform coefficients of 4 × 4 transform blocks of the HEVC video sequence. To maintain visual quality, temporally homogeneous blocks with similar texture in the consecutive Intra frame are first found out using only the compress domain parameters. As these blocks have similar number of nonzero transform coefficients, a robust watermarking is embedded by the minimal perturbing of the transform coefficients. Both of the proposed schemes are well suited for the re-compression attack but not resilient to the drift errors. So, a compressed domain watermarking scheme is proposed in the third contributory chapter of this dissertation for H.265/HEVC video which can handle drift error propagation both for the intra and the inter prediction processes and improves visual quality of the watermarked video.The intra drift error prevention is achieved by excluding those residual coefficients which are used in the intra prediction process. The inter frame drift error has been prevented by predicting current block from a spatial homogeneous block which has high spatial correlation with the watermarked block. In the final contributory chapter, a watermarking scheme is presented which is robust against video the camcording attack. During camcording attack, the embedded watermark suffers from several geometric distortions and temporal desynchronizations. In the proposed scheme, the required temporal synchronization is done by segmenting the cover video into shot segments using the geometric invariant Scale-Invariant Feature Transform (SIFT) features. Further, the 3D-Discrete wavelet transformation (DWT) and SIFT are used to find watermark embedding regions which are robust against geometric distortions and the frame blending attack. Finally, the dissertation concludes by briefly summarizing the work presented in dissertation and explaining the future research directions.

raphs are considered as an excellent modeling tool which is used to model many type of relations amongst any physical situation. Many problems of real world can be represented by graphs. This paper explores different concepts involved in graph theory and their applications in computer science to demonstrate the utility of graph theory. These applications are presented especially to project the idea of graph theory and to demonstrate its objective and importance in computer science engineering.

This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected ∙제1저자 : 김영균 ∙교신저자 : 전창호 ∙투고일 : 2014. 6. 18, 심사일 : 2014. 7. 21, 게재확정일 : 2014. 8. 8. * 안산대학교 인터넷정보과 (Dept. of Internet Information, Ansan University) ** 한양대학교 ERICA 캠퍼스 컴퓨터공학과 (Dept. of Computer Science and Engineering, Hanyang University ERICA Campus) 64 Journal of The Korea Society of Computer and Information August 2014 sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm. ▸

In this paper, we design a smart phone UX/UI and a tap pattern recognition algorithm that can recognize tap patterns from a tapping user's fingers on the screen, and implement an application that provides user-customizable smart phones’s services from the tap patterns. A user can generate a pattern by tapping the input pad several times and register it by using a smart phone’s favorite program. More specifically, when the user inputs a tap pattern on the input pad, the proposed ∙제1저자 : 김영빈 ∙교신저자 : 김유희 ∙투고일 : 2014. 5. 20, 심사일 : 2014. 6. 23, 게재확정일 : 2014. 8. 8. * 동국대학교 컴퓨터공학과(Department of Computer Science and Engineering, Dongguk University) ** 신한대학교 IT융합공학부 컴퓨터공학전공(Department of Computer Science and Engineering, Shinhan University) 96 Journal of The Korea Society of Computer and Information August 2014 application searches a stored similar tap pattern and can run a service registered on it by measuring tap pattern similarity. Our experimental results show that the proposed method helps to guarantee the higher recognition rate and shorter input time for a variety of tap patterns. ▸

Learning computer programming is a prominent issue in the fields of computer science and education. This paper is an attempt to address this issue by investigating the experiences of undergraduate university students who studied computer programming. A total of 260 computer science and engineering students (210 males and 50 females) were recruited from three geographically distant campuses. They were surveyed with a questionnaire that exhibited good internal reliability. Eventually, a learning model emerged from the data. It consisted of three independent structures that included most of the study times under focus. The study times creatively and dynamically interact stimulated by learning needs and sustained by learning passion. In addition, while some indices of confirmatory factor analysis indicated that the learning model is an adequate fit, others suggested that it needs improvement, which should be considered by future research.

Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world scenarios the problem is partially known, imprecise and dynamic such that some effects of actions are undesired and/or several un-foreseen incidences or changes can occur. Whereas expressivity, efficiency and optimality have been the typical goals in the area, there are several issues regarding robustness that have a clear relevance in dynamic Constraint Satisfaction Problems (CSP). However, there is still no clear and common definition of robustness-related concepts in CSPs. In this paper, we propose two clearly differentiated definitions for robustness and stability in CSP solutions. We also introduce the concepts of recoverability and reliability, which arise in temporal CSPs. All these definitions are based on related well-known concepts, which are addressed in engineering and other related areas., This work has been partially supported by the research project TIN2013-46511-C2-1 (MINECO, Spain). We would also thank the reviewers for their efforts and helpful comments.

in Complex Fluid M. Agop, L. Ochiuz, D. Timofte, V. Barlescu, M.N. Danila , L. Gheorghita , V.P. Paun, L.G. Solovastru and C. Popa Lasers, Atoms and Molecules Physics Laboratory, University of Science and Technology, Villeneuve d'Ascq 59655, Lille, France Department of Physics, Gh. Asachi Technical University, D. Mangeron str. 67, Ia3i 700050, Romania Faculty of Pharmacy, Department of Pharmaceutical Technology, University of Medicine and Pharmacy, Gr. T. Popa University, Independentei 16, Ia3i 700115, Romania Surgery Department, Hospital Sf. Spiridon , University of Medicine and Pharmacy, Gr. T. Popa University, Independentei 16, Ia3i 700115, Romania Department of Computer Science and Engineering, Gh. Asachi Technical University, D. Mangeron str. 27, Ia3i 700050, Romania Faculty of Physics, Alexandru Ioan Cuza University of Iasi, Bd-ul Carol I no. 11, Iasi 700506, Romania Department of Physics I, Faculty of Applied Science, Politehnica University of Bucharest, 313 Splaiul Independentei Str., 060042, Bucharest, Romania Department of Dermatology, University of Medicine and Pharmacy Gr. T. Popa University, Independentei 16, Ia3i 700115, Romania Dentistry Department, University of Medicine and Pharmacy Gr. T. Popa University, Independentei 16, Iasi 700115, Romania

The concept of distance learning has been more and more articulated during the past few years and is expected to shortly turn into a practical education system within current high level learning institutions. The chances are that distance learning would transparently extend colleges and institutes of education, and could plausibly overtake and turn into a preferred choice of higher education, especially for adult and working students. In a supportive effort towards faster distance learning implementation and consideration, we are presenting through this material a sequence of projects that have been developed at University of Bridgeport and can serve very well in the process of distance learning education ranging from simple “hobby” style training to professional guidance material. The projects have an engineering / laboratory flavor, are part of an ongoing work of the faculty and students of the Computer Science and Engineering Department of the university, and are being presented in an arbitrary order, topics ranging from vision and sensing to engineering design, scheduling, remote control and operation.

The past 20 years have seen dramatic advances in personality science, both in theory and methodology. Some of these advances reflect a natural but incremental conceptual evolution in a maturing science, but others can be attributed in part to the ever cheaper, more ubiquitous, powerful, and mobile computing. As a result, personality science in the 21st century is a fast-moving field poised to answer important questions across diverse areas, but it is also facing increasingly complex challenges related to assessing and summarizing the important features of human behavior. Computer science and engineering may hold the key to the next advances in personality science. In what is intended to serve as a complement to Vinciarelli and Mohammadi's Survey on Personality Computing , contemporary thinking and research in personality are summarized, the mounting importance of computing in personality research is highlighted, and an outline for future directions in personality computing is offered.

Intelligence Fusion cluster is a interdisciplinary program which consists of school of electrical, electronics, and communication, school of computer science and engineering, school of architecture and architectural engineering, and department of industrial design engineering. To make an effective management plan for intelligence fusion cluster, we surveyed students and faculty members who belong to the cluster. A management plan was derived based on this survey. The plan was presented in two ways: by curriculum improvement and research vitalization.

Software-defined radio is a rapidly developing field that is driving the development of and innovation in communications technology, and promises to significantly impact all communications sectors. Entities developing these SDR systems require a trained workforce that has been prepared with the mindset, knowledge, skills, and tools required to address both the system (breadth) and technical (depth) aspects of SDR systems. Developing SDRs necessarily involves a collection of disciplines including, but not limited to, electromagnetics, radio-frequency engineering, communications, digital signal processing, embedded systems, computer programming, and systems engineering. Whereas electrical engineering and computer science and engineering curricula at the university level may include courses in all of these areas, a student?s typical curriculum does not; nor does it usually involve the integration of all these topics. However, SDR can be employed as an integrative construct that facilitates systems thinking and cross-domain learning via peers. In this article, we present several significant educational efforts across six U.S. universities that have developed integrated curricula in SDR, most including a significant laboratory component.

In this paper, the propagation effect of power supply uncertainty on the output of class-F power amplifier has been estimated. Also, a 1.9 GHz, 10 watt class-F power amplifier was measured to verify the estimation and to find the optimal biasing point. By approxi-mating the propagation theory of uncertainties, the propagation effect of bias uncertainty was mathmatically calculated. As a result, the DC biases have propagated uncertainties of 15`70 mW. However, at the optimized bias point, the uncertainty in the output power could be dropped less than 15 mW while the output power has dropped by 0.37 dB.Key words: Uncertainty, Power Amplifier, Propagation of Uncertainty k lm 2013no 6pqp 5nrrslmt V[ %0 u vj.w 6pqp 5nr x=nZ(Department of Electronics Engineering, Hankuk University of Foreign Studies) *yS5nrz{|=nZ(Department of Computer Science and Engineering, Hyupsung University)Manuscript received November 15, 2013 ; Revised January 22, 2014 ; Accepted January 22, 2014. (ID No. 20131115-113)Corresponding Author: Youngcheol Park (e-mail

Mining data streams has recently become an important active research work and more widespread in several fields of computer science and engineering. It has proven successfully in many domains such as wireless sensor networks, ATM transactions, search engines, web analysis and weather monitoring. Data steams can be considered a subfield of machine learning, data mining and knowledge discovery. Data Mining is a step in the process of knowledge discovery from large amount of data. Traditional data mining techniques can not be easily applied to the data stream mining due to unique characteristics of data streams. In this research work, we will survey the main techniques and applications of data mining and data stream mining. We then study, the computational and miming challenges in particular, on-line mining of continuous, high-speed massive data streams.

In recent years, much attention has been paid to the development of intelligent vehicles that integrate automotive technology into the information technology, with the aim of improving user friendliness and stability. The representative function is a autonomous driving and a cruise control. In designing such vehicles, it is critical to address the real-time issues (i.e., real-time vehicle control and timely response). However, previous research excluded the real-time scheduling. We develop a model car with unmanned cruise control, design the real-time scheduler using cyclic executive to easily adapt the model car, and provide some insight into potential solutions based on various experiments. ∙제1저자 : 이재면 ∙교신저자 : 노동건 ∙투고일 : 2013. 10. 05, 심사일 : 2013. 10. 25, 게재확정일 : 2013. 11. 15. * 한양대학교 컴퓨터공학과(Dept. of Computer Science and Engineering, Hanyang University) ** 숭실대학교 정보통신전자공학부(School of Electronic Engineering, Soongsil University) 본 논문은 2011년도 정부(교육과학기술부)의 재원으로 한국연구재단의 지원을 받아 수행된 과제임 (NRF-2011-0012996) 2 Journal of The Korea Society of Computer and Information January 2014 ▸

David Hicks is an Associate Professor with the Institute for Electronic Systems at Aalborg University. Previously he has served as Department Head for the Department of Computer Science and Engineering at Aalborg University's Esbjerg campus. He has also held positions in international research labs in the US as well as Europe, and spent time as a senior researcher in the software industry. He has served in a variety of capacities in the hypertext community including Vice Chair for SIGWEB.

Citations and referencing accuracy play a crucial role for readers. The aim of this study was to analyse inaccuracies of citations and referencing in the international journal of computer science and engineering published in 2015 (volume no. 7, issue nos. 1–12). This study was an experiment-based and results revealed that referencing errors of volume 7 in issue no. 1 has the highest error rate of 5% and on the other hand, issue nos. 6 and 8 have the lowest error rate of 1.4%. Similarly, in the issue no. 2, error rate is 2.5%; issue nos. 3 and 4, error rate are 2.3%; issue no. 5, error rate is 2.5%; issue no. 7, error rate is 1.7%; issue no. 9, error rate is 1.5%; issue no. 10, error rate is 3.1%; issue no. 11 and 12, error rate are 3% and 1.7% respectively. However, the results also shown that citation errors in volume 7 for the issue nos. 3, 5, 7, and 12 do not have any errors, nevertheless, issue no. 4 has the highest error rate of 3.7%, followed by 3.6% (issue no. 9), 1.3% (issue nos. 1, 6, and 11), 1.2% (issue no. 8), and 1.1% (issue no. 2). This study recommends for academics and researchers to use reference management software tools, namely, EndNote, Mendeley, RefWorks, etc. to avoid errors and redundancy in order to make more accurate citations and referencing than manual systems.

The need for health informatics professionals has been on the rise. Existing health informatics programs in the USA do not adequately equip students with relevant skills to address field-specific challenges. Thus, a skills gap arises between graduating health informatics professionals, and typical job requirements in many health informatics fields; and this gap has traditionally been addressed by employing graduates with computer science and engineering degrees. Moreover, graduate programs in many health informatics fields consistently offer less credits in computer science and information technology, compared to other informatics fields. This article provides a basic analysis of both undergraduate and graduate programs in health informatics in the USA. It highlights the differences across common informatics programs in medical sciences, and proposes more STEM-focused undergraduate degree options to complement existing undergraduate programs to have an immediate effect, which could provide students proper training to help narrow this technology-specific skills gap.

Dr. Raj Jain is a Fellow of IEEE, a Fellow of ACM, a Fellow of AAAS, a winner of ACM SIGCOMM Test of Time award, CDAC-ACCS Foundation Award 2009 and ranks among the top 90 in Citeseer’s list of Mos...

Local stereo algorithms are preferred for real-time applications due to their computational efficiency. Deciding the size of the required local support region is a challenging task. It fails to estimate accurate disparity for small support region and introduces fattening effect for big support region. Hence, a shape adaptive local support region is necessary to achieve accurate disparity. This paper proposes an anchor-diagonal-based shape adaptive support region construction for stereo matching. The proposed algorithm dynamically constructs local support region, and the aggregated matching cost is used for Normalized Cross-Correlation-based similarity measure. The algorithm is evaluated using benchmarked Middlebury stereo evaluation, and the obtained disparities are efficient as compared to state-of-the-art methods.

In this paper, a novel system is presented for the allocation of final year projects for the Computer Science and Engineering Department at the University of Mauritius. Earlier works had concentrated only on the allocation of projects to students. The system not only performs project allocation but it also allows academics to rate projects, examiners to bid for projects they wish to examine, students to propose their own projects, students to submit project deliverables, supervisors to follow projects more closely and allows projects coordinators to have a heuristic view of the whole system. The system captures the preferences of examiners as well as students and allocates projects to them in order to maximise the number of students who gets their first choice in their preference list and to keep the load of supervisors and examiners within a reasonable range. The percentage of students who obtained their first choice is 82% on 30 projects proposed by 15 supervisors for 11 teams. The simulation results demonstrate that this new system will allow deadlines for all the different project phases to be met.

The culture must change to encourage women throughout their education to pursue computer science and engineering and to welcome and support female technology workers in industry, academia, and government.