Earticle

Virtualization becomes popular in the computer industry because of its benefit like server consolidation, flexibility, utilization of resources and used to reduce the power consumption. By considering these benefits, changes have made in architecture to support virtualization. Implementation of memory management is one of the difficult parts of the virtualization to improve the performance. Nested Page Table is widely used for page walk in the full virtualization systems. Another software technique for page walk in virtualization environment is shadow paging. Shadow paging technique is suffering from overhead to make synchronization between guest page table and hypervisors page table. Nested page table is also suffering from 24 memory accesses to fetch the data from the memory which leads to high memory latency. In this paper, we are re-evaluating the existing techniques and architectural support made for virtualization environment. We propose hashed page table to reduce the memory accesses from 24 to 2. Proposed methodology is divided into three modules. First one is to give the computational time of hash. Hash function must provide unique values for two different virtual addresses which is included in second module. Third module is to calculate benchmark results on the proposed system.

In pattern recognition, clustering is a powerful technique that can be used to find the identical group of objects from a given dataset. It has proven its importance in various domains such as bioinformatics, machine learning, pattern recognition, document clustering and so on. But, in clustering, it is difficult to determine the optimal cluster centers in a given set of data. So, in this paper, a new method called magnetic charged system search (MCSS) is applied to determine the optimal cluster centers. This method based on the behavior of charged particles. The proposed method employs the electric force and magnetic force to initiate the local search while Newton second law of motion is employed for global search. The performance of the proposed algorithm is tested on several datasets which are taken from UCI repository and compared with the other existing methods like K-Means, GA, PSO, ACO and CSS. The experimental results prove the applicability of the proposed method in clustering domain.

As a variety of services are provided through mobile devices, there have been increasing security threats to mobile platforms and applications. Many mobile application security check methodologies are proposed to deal with such threats, but it is not clear exactly how the security vulnerabilities are inspected, and there is no correct methodology for such. One way to increase the execution rate of vulnerability check is to develop an automation tool that simplifies the process. Therefore, in this study, a work process of Android application vulnerability inspection was designed and a prototype of the automation tool for vulnerability inspection was implemented. Furthermore, the effectiveness of the implemented prototype was assessed through an actual application using the prototype.

Human being’s endless desire for comfort had lead to the invention of computer. Computer became a fundamental element in human life due to its technological development. For mid 1980s, music composition has started with computers. The beginning of computer music was done by a computer named Atari which was used only for musical purposes. After all several softwares for music production was made for desktop computers. It started with softwares for Dos, and latter on programs for Window OS was invented. Nowadays, due to the development of hardware and software capability of computers, the whole process of music production; recording, mixing, autotune, mastering, can be done with a single software. This thesis is research about the most popular MIDI used in popular music majors; Cubase and Logic Pro. Among several functions, this thesis would compare the strength and weakness of sequencing, and special features in an educational perspective

The Clause slicing technique is a static slicing technique. The clause slice criterion is the clause, which is the smallest part of the code line, with the clause number. In this paper, we introduce the “Clauser,” which is a new clause slicing tool for C programs. The Clauser is a slicing tool that divides the program code lines into clauses, depending on certain rules, and then it slices the clauses by applying the rules of clause slicing and returns the slices of the slice criterion. Compared to other static slicing techniques, clause slicing is more accurate because it considers all code phrases that may affect the program flow. Implementation results showed that the Clauser succeeded in automating a part of clause slicing.

Semantic role labeling is typically used to resolve a problem from the perspective of classification by using a corpus. Semantic Role Labeling determines an adequate predicate-argument relation. It can be used to improve performance in various areas of natural language processing. In this paper, automatic semantic role labeling using 10,000 sentences in a semantic role tagged corpus constructed from a Korean syntax tagged corpus was conducted. In Korean, affix, such as josa and eomi, is a very important role in syntactic parsing and semantic role labeling. Semantic role labeling was achieved in this study by improving particle and word ending information, which were insufficiently addressed in previous studies on semantic role labeling, and creating new features. When features based on the affix information created in this study were added to the basic features used in previous studies on semantic role labeling of languages, an F1 score of approximately 80.83% was obtained.

The more competition among industry participants severe, the more companies try to retain their customers and acquire new customers from their competitors. To gain competitive advantage, many companies are adopting and deploying more refined and sophisticated Customer Relationship Management systems. In the marketing area, a personalized marketing paradigm has already been infiltrated into our lives. To support personalized marketing, it is necessary to identify an individual customer’s true value. Various researches on customer value have conducted under the name of Customer Lifetime Value (CLV), Customer Equity, Customer Profitability, and LifeTime Value. In this paper we present issues of calculating individual customer’s lifetime value to deploy more personalized CRM activities. We propose a new method to calculate individual customer’s lifetime value dynamically. The feasibility of the suggested model is illustrated through a case study of the wireless telecommunication industry in Korea. Data mining techniques are used to predict lifetime value of a customer. Marketing implications will be discussed based on the result of individual CLV.

The development of mobile applications becomes increasingly popular in our daily life due to the intensive use of applications in mobile devices like smartphones and tablets. The diversity and variety of mobile operating systems (Android, iOS, Black Berry, Windows Phone, etc.) make software engineers in front of a big challenge to develop the same application for these different platforms. This paper presents a methodology based on the Model Driven Architecture (MDA) to develop mobile applications according to the principle “develops once, use everywhere”. Our approach exploits UML modeling and Acceleo to generate specific code in order to accelerate and facilitate the development of mobile applications.

Data Distribution Service (DDS) is a dependable communication middleware architecture to provide real-time interoperable data exchanges for airborne software. It is important to efficiently detect message races for debugging DDS programs, because it is the most serious type of software faults. Because message races in DDS cause unpredictable results, they must be detected for debugging. However, there has been no report yet on the existence and its confirmation of unintended message races in DDS programs. This paper empirically presents fault cases how it lead to message races on the different order of events. In order to prove it, we show four cases of message races considering the order of two write events and the quality of service (QoS), which lead to nondeterministic results.

Spreadsheets, programs developed by end-user programmers, are used for a variety of important tasks and decisions. However, as the literature indicates, a significant proportion of spreadsheets contain faults. One of the difficulties in understanding and debugging spreadsheets is the invisibility of data dependencies associated with cell formulas. To address this issue, we developed a graph based visualization tool based on the Markov Clustering (MCL) algorithm. The prototype tool, which has been integrated into Microsoft Excel, provides a visualization of a spreadsheet in terms of its data dependency graph using a cluster tree. In addition, it highlights groups of cells that belong to a cluster with unique color and border style on the original spreadsheet. Using the visualization tool, spreadsheet users may narrow their focus to one cluster (i.e., logical unit) at a time. This paper discusses the results of a controlled experiment conducted to investigate the effectiveness and efficiency of the prototype tool. We used cognitive fit theory as the basis for the evaluation of the tool. Among the features of the tool, highlighting of clusters was found to be useful for spreadsheet debugging while data dependency graph based visualization did not improve effectiveness and efficiency of debugging a spreadsheet.

This paper proposes a classification method of commonality and variability for identified services from feature models, since features can express the properties of services. The service is identified by feature organizing, considering the selective and relational attributes of features. Identified services are classified the commonality and variability of services; this involves analyzing the service properties and reuse levels. The service types in a service level are as follows: mandatory, optional, alternative, and or. The suggested method can facilitate service reusability in the product lines of mobile phones.

This paper presents an approach to visualize communication among developers during development. The proposed approach analyzes and visualizes various types of communication flows between developers. The main focus of this approach is on emails, chat archives, bugs and common files extracted from version histories and public communication archives. A tool is developed to realize the approach, VCSD, (Visualizing Communication between Software Developers). The tool provides three views that present the overall different and useful aspects for collaborations. Project managers can get a comprehensive understanding about collaborations between developers as well as contributions of each developer and how they are involved in the development process. The main components are menu bar, three graphical views and the timeline. First view presents the communication evolution. Second view presents system’s evolution and third view presents the modification history.

Interrupts are often used in safety critical control software, however, a system based on interrupts is difficult to analyze, which increases cost and complexity of software quality assurance, because the behavior may vary depending on the order in which interrupts are detected by the sensors. In the previous work on servo motor controls, an interrupt-driven architecture is successfully converted to the interrupt-less architecture by maintaining time stamps of sensor events. In this paper, interrupt-less servo motor controls for pneumatic pump system in medical devices are evaluated and analyzed in terms of behavior correctness as well as the predictability of the system. Experimental results show negligible differences on the main control variable of servo motor compared to the interrupt-driven controls while it provides better predictability by getting rid of interrupts except an internal timer for periodic handling of time stamps by sensor events including motor, pump pusher plate, and buttons in the user interface.

We present the No-SQL based Web service system for sharing of emotion information regarding the individual emotional states and location information of users using by a MongoDB in cloud computing environments. Pre-processed emotion information represents the individual emotional states categorized as a nine domain based on physiological signals recognition within the database system. However, in order to present individual emotional states regarding to pre-processed user’s emotional states and locations on a Web-based map, the computational overload with large amount of data for a location-query process is to be solved for support sharing Web services. Meanwhile, previous RDBMS-based systems are inadequate due to insufficient scalability and processing time of data processing nodes. Therefore, in this paper, we have designed and implemented an emotion sharing web service by reducing the load on the system using NoSQL database. In addition, it was confirmed that it is possible to effectively utilize resources and visualized by using Google’s FusionTable and it is possible to share on a Web map.

The work presented in this paper proposes a formal model of constraints for testing the conformity of an implementation from its specification. The principal idea of our approach is based on an equivalence partitioning of input domains for each method type in an object oriented (OO) paradigm for detecting the different classes of errors. The main contribution of our approach is the use of invalid data which do not satisfy the precondition constraints for testing the robustness of entities in an OO model. Indeed, the first objective of the proposed work is to develop a theoretical model of constraint in order to test the conformity of classes. The second objective of our approach is to detect anomalies in invalid input data which induce valid output constraints. The implementation of this approach is based on a random generation of test data and analysis by formal proof.

Software reuse significantly reduce the costs of software production in the field of open-source software (OSS) development and lead to produce more reliable software systems. Software metrics have been proposed as indicators of software quality factors such as reusability. However, few empirical research papers have validated the relationship between components reusability and software metrics. This research aims to validate Chidamber and Kemerer (CK) metrics as predictors of software reusability. In order to achieve this goal, an empirical study is conducted to validate metrics in classifying two groups of components: library (reuse-prone) and non-library (less reuse-prone). A nearest neighbor’s technique is used to classify library and application components using object-oriented software metrics. The approach is applied to a number of library and application systems available online. The conducted nearest neighbors models have produced acceptable classification. The results provide evidence of using metrics as surrogates of software reusability when models are evaluated using F-measure. CK metrics can be used to measure component reuse-proneness and can be used to differentiate between library and application components. A nearest neighbor’s technique can be used to identify the reuse-prone components in open-source application.

The star graph is an attractive alternative to hypercube. The pancake graph has n! nodes and generates edge using exchange of a symbol that composes a node address like star graph. The half pancake graph is a new network where the network cost of pancake graph is reduced by half. We suggest embedding algorithm among these networks. The half pancake HPn was embedded on pancake Pn with dilation 1 and congestion 1. The half pancake Pn was embedded on star graph Sn with dilation 1.5n-2, average dilation about 0.25n+4, and congestion 6. The pancake Pn was embedded on star graph Sn with dilation 1.5n. All the three of embedding were one-to-one embedding with expansion 1.