Search

In software testing through reverse engineering, the programming semiotics are to be transformed to Unified Modeling Language (UML) semiotics. This process needs the abstraction of UML syntactics, semantics from the programming system. As a preamble, this paper attempts to develop an automated methodology to abstract object oriented technology (OOT) components required for the class diagram from the programming system to be tested for its correctness & completeness. The methodology comprises of initial classing & slicing the programming system on the referenced attributes of the entry with no defined attributes and then using the sole referenced entry and sole defined entry on these sliced programming units the candidate key/s are identified which are used to find individual object structure of the class in our classing technique. The programming system is sliced based on individual class structure and then these slices are used to obtain the object methods through whose nature of the parameters we identify the interrelationship between the classes and their types. The intermediate clairvoyant study of parameter indicates the visibility of the object methods. This paper contains the detailed procedure for each method of our automated methodology. Therefore, their correctness and completeness is self evident. The proposed procedures are based on sound logical positivism and implicitly incorporate good database design and good software engineering principles. This paper reengineers the programming system into various appropriate UML design diagrams so as to reduce the enormity of the syntactics and semantics of programming language into limited syntactics and semantics. This enables to develop the correct and complete software testing methodology. [ABSTRACT FROM AUTHOR]

Integer Factorization is a vital number theoretic problem frequently finding application in public-key cryptography like RSA encryption systems, and other areas like Fourier transform algorithm. The problem is computationally intractable because it is a one-way mathematical function. Due to its computational infeasibility, it is extremely hard to find the prime factors of a semi prime number generated from two randomly chosen similar sized prime numbers. There has been a recently growing interest in the community with regards to evolutionary computation and other alternative approaches to solving this problem as an optimization task. However, the results still seem to be very rudimentary in nature and there's much work to be done. This paper emphasizes on such approaches and presents a critic study in details. The paper puts forth criticism and ideas in this aspect. [ABSTRACT FROM AUTHOR]

Due to the increasing amount of data, knowledge aggregation, representation and reasoning are highly important for companies. In this paper, knowledge aggregation is presented as the first step. In the sequel, successful knowledge representation, for instance through graphs, enables knowledge-based reasoning. There exist various forms of knowledge representation through graphs; some of which allow to handle uncertainty and imprecision by invoking the technology of fuzzy sets. The paper provides an overview of different types of graphs stressing their relationships and their essential features. An example is included for didactical reasons. [ABSTRACT FROM AUTHOR]

Employability is somebody's prospective for gaining and maintaining employment. Basically employability depends on basic three parameters and these parameters are as education, understanding power and personal development. It is the capability to achieve the preliminary employment, to continue it and to obtain different one, if it is required. This paper introduced an innovative knowledgeable system for valuation of employability through some fuzzy rules. The purpose and scope of this concern research is to observe the optimal valuation for employability. This concern research considers three employability skills as an input namely Education, Understanding power and Personal development and find out a novel crisp value for employability which is basically characterize the ability of employee. This paper uses twenty seven fuzzy rules, by using Mamdani type fuzzy inference system in Mat-lab for catches solitary value of output named as employability. [ABSTRACT FROM AUTHOR]

The notion of time is an important element in such systems as real-time embedded systems. Real-time systems have strict timing constraints, and their complexity is continuously increasing, making their design very challenging. This paper concerns a very high level of requirements specification used for system understanding and communication among stakeholders and as a base for development. It introduces a diagrammatic description of functional behavior of a system with nonfunctional constraints including timing plan. Specifically, this paper explores the presentation of time at this level of system description. The usability and feasibility of the proposed method are illustrated by applying it to examples. [ABSTRACT FROM AUTHOR]

Mastering the programming is no easy job because proper science of software does not yet exist. Solid and fundamental theories that apply universally are needed. Universalities ease mastering any kind of job. To ease mastering the programming, software science must answer what are the universal main concepts in programming, and the categories of token. This paper proposes punctuator and qualifier as two supplementary concepts of programming. Together with value, operation, type, and object; punctuator and universal serve as six main concepts of programming. This paper shows the six main concepts of programming serves as universal categories of tokens. The new theory for code-translation takes into account the universal categories for tokens. [ABSTRACT FROM AUTHOR]

Constraints that express relationships among objects are used to model and solve various problems arising from fields such as artificial intelligence, software, and computer graphics. Soft constraints are often important for applications that involve complex relationships among objects. This paper proposes a new method for solving soft constraints. The method treats soft nonlinear con- straints with hierarchical preferences, and computes solutions that satisfy as many constraints with strong preferences as possible. It adopts the method of Lagrange multipliers to enable the accurate computation of local solutions. The paper also presents the result of a preliminary experiment using a simple geometric example. [ABSTRACT FROM AUTHOR]

The Business Process (BP) requirements is specified in the form of software requirements specification (SRS). This SRS serves as a base for software development. The software needs to be developed in a syllogized software development life cycle (SDLC) stages. The SRS which denote the requirements of BP is used as input to the analysis stage from which the paradigm dependent components are to be abstracted. Hither to the components are abstracted manually with the exception of hiatuses of semi-automated methods for few of the components. The SRS is construed with reference to the specific paradigm through which the design is to be developed. Unfortunately, no complete automated methodology exists for the abstraction of all paradigm dependent components. The automated methodology eliminates the possible human errors which would have ripple effect to damage the entire software. This paper develops an innovative, unique methodology to resurrect the SRS statements as modular statements. Further develops an automated methodology for abstraction of control and data flow graphs. Further it develops an automated methodology for abstraction of useful components required for the class diagram. The class diagram emphasizes both structural and behavioral aspects. This facility is effectively used to abstract object class attributes, object methods, visibility, signature, return type etc. Information systems are developed through software projects which use the specific software requirements specification (SRS) provided for them as the base. The SRS contains details of the information system through which appropriate software can be developed. The information systems are also viewed perceptively with different pragmatics like work, work process or usecase. The usecase is one of the prime perspective views whose sum forms the information system. In this paper, an attempt is made to abstract object class, object class attributes, object methods, interrelationships between object classes and starting with/ending with actor from unformatted, unstructured SRS text. This is achieved through our own developed classing and slicing techniques to identify respectively the class structure & object methods. Then usecase is developed through the interrelationships between object methods of different classes and start with or end with the actor. The stages involve moulding the SRS, designing control flow graph for the SRS & data flow table for the SRS statements, developing appropriate classing and slicing criteria, creating actor & actors’ interface attributes table, create slicing criteria for each usecase and then slice relevant statements for each usecase. Here, we have attempted to use Weiser modified algorithm 1 to abstract exact usecase. The slicing criterion is obtained through the intersection of actor's interface attributes and the referenced/defined attributes present between two consecutive actors. Attempts have been made to resolve synonyms & heteronyms present in the SRS. The correctness & completeness of the proposed methodology depends on the realization of actor & actors’ interface attributes. [ABSTRACT FROM AUTHOR]

The primary cause for the slowness of the Border Gateway Protocol (BGP) convergence delay is the Minimum Route Advertisement Interval (MRAI). The MRAI is a timer with a default value of 30 seconds, which forces the BGP routers to wait for at least that amount of time before sending an advertisement for the same prefix. This process can delay important BGP advertisements. To date, there has been no specific value used by all the networks around the Internet. This paper aims to find the optimum value for the MRAI timer that maximally reduces the convergence time without increasing the number of advertisement messages. The optimal MRAI value founded by this paper reduced the convergence time by minimum 45%. [ABSTRACT FROM AUTHOR]

Enterprise Information Systems maintain data with respect to various business processes. These processes consist of business operations restricted by business rules expressed as preconditions and post-conditions. Each rule must be considered and enforced throughout the system, from user interface to persistence storage. Such rule evaluation in multiple contexts results in both significant rule restatement and high maintenance complexity, as there is no single focal point for capturing and reusing these rules. In this paper, we apply the Aspect-Oriented Design Approach to the persistence layer to simplify business rules management, enforce business rules throughout the system and consequently decrease development and maintenance efforts. Our preliminary results show that it is possible to define business rules in a single place and then apply them automatically in a persistence layer. We retrieve data sets restricted by given operation post-conditions with respect to current execution context without any manual rule restatement. This paper provides a small case study emphasizing the benefits and future challenges. [ABSTRACT FROM AUTHOR]

In computer science, robustness is the ability of a computer system to cope with errors during execution. Robust codes are new nonlinear systematic error detecting codes that provide uniform protection against all errors, whereas classical linear error detection code detects only a certain class of errors. Therefore, defence by the linear codes can be ineffective in many channels and environments, when error distribution is unknown. The probability of error masking can increase depending on codeword distribution. However, mapping the most probable codewords to a predefined set can reduce the maximum of the error masking distribution. The algorithm proposed in this paper is based on the second-order wavelet decomposition of B-splines under non-uniform nets. In this paper, we propose a general approach to the algorithm construction of spline-wavelet decompositions of linear space over an arbitrary field. This approach is based on the generalization of calibration relations and functional systems, which are biorthogonal to basic systems of relevant space. The obtained results permit the construction of second-order spline-wavelet robust code. [ABSTRACT FROM AUTHOR]

The Flower Pollination Algorithm (FPA) is a novel bio-inspired optimization algorithm that mimics the real life processes of the flower pollination. In this paper, we review the applications of the Single Flower Pollination Algorithm (SFPA), Multi-objective Flower Pollination Algorithm an extension of the SFPA and the Hybrid of FPA with other bio-inspired algorithms. The review has shown that there is still a room for the extension of the FPA to Binary FPA. The review presented in this paper can inspire researchers in the bio-inspired algorithms research community to further improve the effectiveness of the PFA as well as to apply the algorithm in other domains for solving real life, complex and nonlinear optimization problems in engineering and industry. Further research and open questions were highlighted in the paper. [ABSTRACT FROM AUTHOR]

In this paper we have presented validation of proposed usability driven web based software process model (UdWbM) through simulation. We have used Software Engineering gaming tool SimSE for making simulation of a system (taken as case study) by following the steps proposed by the model. Simulation was also developed for some existing models using the same constraints. UdWbM is then compared with some existing models to show the results. Paper also shows comparative study of existing models with UdWbM through literature. [ABSTRACT FROM AUTHOR]

Big data is an ocean of data sets. The revolution of big data can transform the world and business overnight. The data and information can be outsourced to an untrusted cloud while maintaining the velocity and veracity of big data. Big data helps in decision making. It also laid foundation for advancement in science, medicine and Business. Mapreduce and Hadoop frameworks are used to improve the processing speed of data. Can big data really revolutionize our world? This research paper explores how the explosion of information will impact on our lives? This paper illustrates the power of big data. Big data may lead to more accurate analyses. The combination of cloud and Big data is a beginning of a beautiful friendship. E-commerce companies take advantage of the wide variation in sales tax and local taxes by operating from low geographical regions like Flipkart. Big data analytics can improve efficiency and effectiveness across the broad range of government responsibilities, by improving existing processes and operations and enabling completely new ones. Moreover it is used in the areas of medicine, crime, education and business. It increases the storage capacity, processing power and also risk of security. So big data is not only a volume, it refers as technology. [ABSTRACT FROM AUTHOR]

Due to the self configuring and infra-structure less nature of MANET(Mobile Ad-hoc Network) optimization crunches, QOS(Quality of Service) contention and security breaches tend to occur. So, to rivet security of the mobile ad-hoc networks the proposed algorithm sifted in this paper cogitate biometric perception as the most innovative solution which incorporates exclusive iris features elicited by iris image procurement and perception system. QOS based issues of MANET are elucidated by genetic algorithm in this approach which results in optimized performance of the network. Significance of the approach conferred in the paper is stated through improved and better results compared with conventional secured approach of MANET. [ABSTRACT FROM AUTHOR]

Abstract: An assurance case is a body of evidence organized into an argument demonstrating that some claim about a system holds, i.e., is assured. Assurance cases are used to comment about system safety and it serves as a mean to show that the systems acceptably satisfy their safety properties. Assurance cases perform rigorous security analysis on safety-critical complex systems. In this paper, the analysis done is an approach to documenting an assurance case for system security, i.e., a security assurance case. The paper deals with the Assurance cases for Generic Avionic Mission Control Computer system, by constructing tangible claims and investigating potential vulnerabilities. [Copyright &y& Elsevier]

Compression can be used to reduce the size of files and speeding up the transmission time over networks. However, not all compression techniques have the same features and capabilities to improve the performance of transmission over networks. This paper shows a comparison between different compression algorithms in order to improve the performance of web-services over the Internet. Nowadays, Service Oriented Architecture (SOA) being used heavily between applications as interaction between loosely coupled services, which are function independently. Therefore, fast and efficient services offered through the web services are needed. Enhancing performance of web services, would improve overall system's performance. As a result, compressing and reducing the size of SOAP messages traveling over the network, improves the webs-service performance. This paper compares the performance of web-services by compressing SOAP messages using Tagged Sub-optimal Code (TSC) and Huffman Encoding Algorithms. Experimental results show that web-services compressed using TSC speeds up the performance of web-services compared to normal web-services and web-services compressed using Huffman encoding. [ABSTRACT FROM AUTHOR]

With increasing numbers of organizations automating their business processes by using workflow systems, security aspects of workflow systems has become a heavily researched area. Also, most workflow processes nowadays need to be adaptive, i.e., constantly changing, to meet changing business conditions. However, little attention has been paid to integrating Security and Adaptive Workflow. In this paper, we investigate this important research topic, with emphasis on Role-Based Access Control (RBAC) in Adaptive Workflow. Based on our earlier work on a 3-tier adaptive workflow architecture, we present the design of a similar 3-tier RBAC infrastructure, and we show that it conceptually mirrors our adaptive workflow architecture. We also describe the mappings between them, and we show how this mapping can be used to manage organizational RBAC constraints when the workflows are being adapted continuously. We illustrate our ideas throughout the paper with a simple yet non-trivial example. [ABSTRACT FROM AUTHOR]

Security threats are becoming very sophisticated and pervasive everywhere. Phishing threats in particular has a changeable nature and short life cycle that complicates the detection process. In this paper, we introduce a Multi-Agent System (MAS) as an adaptive intelligent technique that acts on top of distributed Case-Based Reasoning (CBR) Phishing Detection Systems (CBR-PDSs) as a Phishing Detection System Architecture (PDSA) that runs on large scale globally to constitute a robust worldwide Phishing Threat Intelligence (PTI) environment. The global collaborations of PTI introduces a proactive phishing detection technique, quarantines phishing threats via global threats sharing, and minimizes users’ susceptibilities to hard-to-detect spear or advanced phishing attacks. Also, combining two intelligent systems in a unified interactive architecture facilitates the prediction process, increases the accuracy rate, easily tackles the dynamic and changeable behaviors of advanced phishing threats, and minimizes the false negative rate as well. The proposed architecture illustrates the consolidated interaction between intelligent agents and distributed CBR-PDSs in a PTI framework. [ABSTRACT FROM AUTHOR]

The problem of user privacy enforcement in online social networks (OSN) cannot be ignored and, in recent years, Facebook and other providers have improved considerably their privacy protection tools. However, in OSN’s the most powerful data protection “weapons” are the users themselves. The behavior of an individual acting in an OSN highly depends on her level of privacy attitude: an aware user tends not to share her private information, or the private information of her friends, while an unaware user could not recognize some information as private, and could share it without care to her contacts. In this paper, we experimentally study the role of the attitude on privacy of an individual and her friends on information propagation in social networks. We model information diffusion by means of an extension of the Susceptible-Infectious-Recovered (SIR) epidemic model that takes into account the privacy attitude of users. We employ this diffusion model in stochastic simulations on a synthetic social network, designed for miming the characteristics of the Facebook social graph. [ABSTRACT FROM AUTHOR]

Search Engine Optimization (SEO) is a collection of techniques that allow a site to get more traffic from search engines. Page Ranking is the fundamental concept of SEO and defines as a weighted number that represent the relative importance of the page based on the number of inbound and outbound links. In this paper, I proposed a new type of web page search which is based on the competitive intelligence. It use link-based ranking evolutionary scheme to accommodate users’ preferences. I implemented the prototype system and demonstrate the feasibility of the proposed web page search scheme. [ABSTRACT FROM AUTHOR]

In statistics, Mixture distribution model is a stochastic model for a measured data set to express existence of the subpopulation in a population, without requiring that the subpopulation to whom each observational data belongs should be identified. Formally, Mixture distribution model is equivalent to expressing the probability distributions of observational data in a population. However, it is although it is related to the problem relevant to Mixture distribution pulling out a population's characteristic out of subpopulation. Mixture distribution model is used without subpopulation's identity information in order to make the statistical inference about the characteristic of the subpopulation who was able to give only the observational data about a population simultaneously. This paper considered these matters from the similarity of the linear combination of an element function with estimation problem of a density function which used the Kernel function, and estimation problem of the density function using a Spline function. How to take Translate in arrangement of knots of estimation problem of the density function using the method of Bandwidth picking in estimation problem of the density function using a Kernel function and a Spline function and Wavelets analysis and Scale has a related thing. [ABSTRACT FROM AUTHOR]

Cricket is an extremely popular game. More than a million cricketers play cricket daily in India alone and aspire to become professional cricketers. Cricket Talent identification and enhancement is a challenging problem due to lack of quality coaches, meagre infrastructural facilities, and poor linkages of coaching academies & cricket authorities. In India, the problem is even tougher as the majority of the population resides in villages. Many of talented players do not get timely recognition of cricket boards’ authorities thus amounting to waste of talent. Many keep on pursuing cricket despite of being non-talented. Due to lack of application of appropriate scientific methods the selection process is also criticized as biased by many. In this paper, we present a web based system viz. Cricket Talent Identification, Enhancement and Selection (C-TIES) for addressing the above issues. C-TIES utilize a cricket talent knowledgebase of experts’ opinions aggregated by applying OWA Aggregation Operator and Relative Fuzzy Linguistic Quantifier (RFLQ). The C-TIES system classifies the cricket talent level of an enthusiast into five different classes by applying Normalized Adequacy Coefficient (NAC). The Talent Enhancement and Talent Selection subsystems also uses appropriate algorithms based on OWA, RFLQ and NAC to respectively enable identification of weaknesses in a player and select most talented n-players from a larger group of players. Thus, system reduces the time for identifying weaknesses and also provides a relatively better unbiased selection method for short listing players. The system has been developed using Struts 2.0, Hibernate, J2EE, Ajax, MySql are used. [ABSTRACT FROM AUTHOR]

Defining security requirements is of prime importance for all systems; we usually study the generic ones like confidentiality, integrity, availability, authentication, non-repudiation and privacy. It is thus imperative to evaluate all the possible extended requirements. A literature review has shown that there are various and different security requirements models, some of which are examined and others are neglected. Moreover, security lacks a unified taxonomy of security requirements. In this paper, we refer to the variety of security requirements models from the literature to drive an aggregate model and move away from the individualistic proposed taxonomy to a hierarchical and standard security requirement model. We define and propose a novel and holistic security requirement taxonomy at two levels of abstraction that incorporates 13 basic and standard requirements and then refined in layers into 31 security requirements sub-factors. These requirements are discussed in the open literature. Our taxonomy offers a good understanding of security constraints relevant to the system functions in the field of computer security. When it comes to decision making, it is recommended to establish which security measures should be relevant to the entire security requirements taxonomy. [ABSTRACT FROM AUTHOR]

Software Testing is one of the expensive activities in Software development lifecycle but it used in to assure the quality of the Software. One of the important focuses in software engineering process is lessen the effort of software testing and cut down the cost & time of testing. This paper presents a unified method for reducing the test cases by adopting the hypothesis of Genetic algorithm such as crossover, mutation and crowding distance to elucidate the given problem and results in the minimum set of test cases with the ability to cover all the faults in minimum time. [ABSTRACT FROM AUTHOR]

The paper presents an ANN-based mechanism to model inter-related visual kinematics relations, which are an important fragment of visual servo closed loop system. The primary goal is to visually servo a 6-DOF robot arm, from an initial location toward a desired posture using only image data from a scene provided during the arm maneuver. Arm movements, dynamics, and kinematics were simulated with Matlab Robotics Tool Box. The arm is equipped with a CCD camera, where the visual CCD part is modeled and simulated with Matlab Epipolar Geometry Toolbox. The main issue that hinders visual servo system is related to the variant feature Jacobian matrix. The methodology used is based on the concept of integrating a multilayer ANN with an Image Based Visual Servoing system. ANN was used to learn, approximate, and map the highly complex relations that relate a scene movements to an arm movement through a visual servo. The proposed technique has proven to be an effective approach, that has resulted in reducing computational time. [ABSTRACT FROM AUTHOR]

In software development perspective, dealing with software faults is a vital and foremost important task. Presence of faults not only reduces the quality of the software, but also increases its development cost. A large number of models have been presented in the past to predict the fault proneness of the software system. However, most of them provide inadequate information and thus make the task of fault prediction difficult. In this paper, we present an approach to predict the number of faults in the given software system using the Genetic Programming (GP). We validate the proposed approach using an experimental investigation where we use the fault datasets of the ten software projects available in the PROMISE data repository. The Error rate, Recall and Completeness of the fault prediction model are used to evaluate the performance of the proposed approach. The results show that GP based models have produced the significant results for the number of faults prediction. [ABSTRACT FROM AUTHOR]

Time Division Multiplexing (TDM) over Packet Switched Network (PSN) is a pseudo wire technology for emulating TDM Circuits over Packet Networks. Conceptually, the important ingredients of the above technology are to implement the following, in the PSN (i) Quality of Service (QoS) which is implemented through scheduling at the intermediate nodes that gives priority to packets containing’TDM’ payload (ii) timing and synchronization and (iii) scheduling in the jitter buffer for minimum output variance. Among these, this paper addresses (iii) as a first step assuming that the PSN provisions the “unacknowledged virtual circuit” (the main components of’virtual circuit’ are QoS and connection-oriented service). This work targets to implement a scheduling algorithm (service intervals) in jitter buffer at the receiver, such that the variance of inter-departure intervals of TDM stream is minimized. This is accomplished by the buffer modelled as M/G/1 queueing system with Auto-Regressive AR (1) correlations within service intervals. The motivation for the above correlation structure is two-fold. First, given the correlations within the service intervals, such a correlation results in reduction of variance in the inter-departure interval. The other is that the analysis of such a correlated queue is analytically tractable. The variance of the inter-departure time is presented. The analysis of the departure process, the waiting times of incoming packets of this correlated queue aids in determining the correlation parameter that are sub-optimal in the context of TDMoPSN. Our study also includes a M/G/1 queue with AR (1) cross-correlations between the inter-arrival and the service times. A G/G/1 queue in which the inter arrivals are correlated, and with AR (1) correlations of the above two types are also studied. Extensive simulations demonstrate our analytical and approximation results. [ABSTRACT FROM AUTHOR]

Transition state between being awake and asleep is called drowsiness. When driver is in this state he can cause accidents because his reaction time is slower, his attentiveness is reduced, and his information processing is less efficient. Driver Fatigue Detection System (called FDS) has been proposed by the authors in a recent work. The FDS aims to monitor the driver and the alertness to prevent them from falling asleep at the wheel. In the present paper, the FDS software is modified to be run in smartphone instead of Laptop which is very hard to fixed in a car and use all advantages of smartphone like camera and late weight. The proposed system will solve this problem by using a mobile phone camera; the phone will be put on a stand in the car to make the driver feels comfortable. The proposed system has hardware and software components such as mobile camera and Android SDK. Both components are integrated together to record real video for the driver, and then processing it for real-time eye tracking. This system has reserve all advantages in FDS like fast and real-time face and eye tracking, external illumination interference is limited, more robustness and accuracy allowance for fast head/face movement. The Main goals of this system are to ensure that the driver is staying awake during his drive, make the driver feels comfortable and to help decrease the number of accidents. [ABSTRACT FROM AUTHOR]

From traditional approach to scientific approach and then Scientific Management to Modern phase; methodology, principles and approaches have reached its current stage. Taylor, the originator of scientific management brought a revolution in the twentieth century by introducing scientific aspects of formulating patterns and disciplines within project management. Scientific management emphasizes on profit maximization by utilizing the workers through controlled mechanism, training, monetary incentives under managers, however it has been scrutinized and criticized highly for its short term focus on profit, treating workers as a machine like forms which eventually argued to result negative performance in the long run. Therefore, a drift towards behavioral study emerged and social factors have been included to address the challenges which Taylor's method neglected. This paper through an extensive literature review showed that, the advancement of technology and globalization stimulated the modern management approach to adjust and complement the scientific management by supplementing the human factor and their contributions within an organization rather than substituting the traditional approach. Therefore together with productive activities and completion of defined tasks, a successful modern day project management model highly values employee contribution and feedbacks at all level. [ABSTRACT FROM AUTHOR]

Ontologies have become core components of many large applications. It's part of the Semantic Web framework. Many disciplines now develop standardized ontologies that domain experts can use to share and annotate information in their fields. Arabic is still not well supported. Designing and developing Arabic Ontologies need more than what is provided by keyword-based and more than analysing the morphology and grammar of the traditional Arabic language A few works on Arabic Semantic Web applications are derived from the traditional Arabic language and not in the specialized science. However, available search engines supporting Arabic language are typically limited to keyword searches and do not take in consideration the underlying semantics of the content. In this research, we propose a model for representing Arabic financial accounting knowledge in the Computer Technology domain using Ontologies. This paper addresses an Arabic financial ontology and presents a methodology for creating ontologies based on declarative knowledge representation systems. [ABSTRACT FROM AUTHOR]

Several mapping techniques are in use for the storage of objects in Network Database Management System (NDBMS). Though there is a generation gap between the evolution of NDBMS and Object Oriented Technology (OOT), both are either analogous or complementary to each other. Therefore the mapping technique to map class diagram onto Bachman diagram has been evolved. Host program accessing the database and accessing the independent data file may differ in the number and use of attributes and classes. Hence along with the mapping techniques, the implementation subsets of structural and behavioral aspect are to be considered. Moreover, the persistent closure (connected dependent objects) is to be maintained during the storage and retrieval of the objects. Thus, the mere mapping technique is not sufficient for the storage and retrieval of objects as the host program has to establish the relevancy of the database with respect to its authorized subset. In this paper, we have made an attempt to develop a guidelines to assist the programmer to determine the closure of every mapped class and accordingly to design the persistent constructor and loader for the storage and retrieval of the objects respectively. The persistent closure is determined by the type of interrelationship (degree of cohesion) between objects (classes) is identified. For illustrative portion of the class diagram depicting the business process and its implementation in the NDBMS, a table containing the implemented classes with their connected classes is prepared, and then the guidelines are proposed to integrate object oriented host program to access the database through NDBMS. [ABSTRACT FROM AUTHOR]

Given the varied benefits of using the simulation packages such as; cost efficiency, time, risk mitigation, greater insights and user friendliness of systems. It has been extensively used in many application domains such as defense, airports, manufacturing, engineering, and healthcare. Currently, due to the increasing numbers of simulation software packages available in the market, it is often challenging to choose a suitable package that meets users’ demands. Researchers have leveraged many assessment methods and techniques to facilitate the evaluation and selection process of the simulation packages. This paper provides a survey corroborated from researcher's contributions to simplify the selection process of simulation packages. Also, discerns the evaluation methods and techniques for simulation packages found in the literature. [ABSTRACT FROM AUTHOR]

Visual block-based programming is useful for various users such as novice programmers because it provides easy operations and improves the readability of programs. Also, in programming education, it is known to be effective to initially present basic language features and then gradually make more advanced features available. However, the cost of implementing such visual block-based languages remains a challenge. In this paper, we present a programming environment for providing visual block-based domain- specific languages (visual DSLs) that are translatable into various programming languages. In our environment, programs are built by combining visual blocks expressed in a natural language. Blocks represent program elements such as operations and variables. Tips represent snippets, and macro blocks represent procedures. Using Tips and macros make code more abstract, and reduce the number of blocks in code. Visual DSLs can be a front-end for various languages. It can be easily restricted and extended by adding and deleting blocks. We applied our programming environment to Processing, an educational programming language for media art. We show that the environment is useful for novice programmers who learn basic concepts of programming and the features of Processing. [ABSTRACT FROM AUTHOR]

The proliferation of the modern technologies has caused data overload over the Internet. The huge data over the World Wide Web has increased the problems for the users to extract the exact information. Variousrecommendation techniques are being used to help the customers in purchasing the desired items for online shopping. In this paper, we propose a recommendation method for books. We use positional aggregation based scoring (PAS) technique to score the books recommended by top ranked universities and assigned weights to these scores using fuzzy quantifiers. We apply Ordered Weighted Averaging (OWA) aggregation operator over these scores to find the top books. Finally top ranked books are recommended. [ABSTRACT FROM AUTHOR]

Spider Monkey Optimization (SMO) technique is most recent member in the family of swarm optimization algorithms.SMO algorithm fall in class of Nature Inspired Algorithm (NIA). SMO algorithm is good in exploration and exploitation of local search space and it is well balanced algorithm most of the times. This paper presents a new strategy to update position of solution during local leader phase using fitness of individuals. The proposed algorithm is named as Fitness based Position Update in SMO (FPSMO) algorithm as it updates position of individuals based on their fitness. The anticipated strategy enhances the rate of convergence. The planned FPSMO approach tested over nineteen benchmark functions and for one real world problem so as to establish superiority of it over basic SMO algorithm. [ABSTRACT FROM AUTHOR]

The prevalent application of domain-specific modeling languages (DSMLs) requires developers to initially specify the require- ments for a software product as a domain-specific model then transform that model to a high-level language for subsequent ex- ecution. An alternative is to realize behavior directly by executing the models using a specialized interpreter. One category of interpreted domain-specific modeling languages (DSMLs) derives behavior from changes to models at runtime. These are termed interpreted DSMLs or simply i-DSMLs . Existing interpreters for i-DSMLs exhibit tight coupling between the implicit model of execution (MoE) and the semantics of the domain. The interweaving of these two concerns compounds the challenge of developing interpreters for new i-DSMLs without a significant investment in resources. This paper introduces a generalized approach to developing i-DSML interpreters by utilizing a generic framework that is loosely coupled to the domain-specific knowledge as swappable framework extensions. We present a prototype as validation of our ap- proach implemented using a metamodel based architecture to instantiate the interpreter for two distinct cyber-physical domains. [ABSTRACT FROM AUTHOR]

In the domain of process systems, quantification of the magnitude of resilience is still elusive. This paper provides general formulae for quantification of system resilience properties for an amine regeneration column, used in regeneration of Di-ethanol amine solvent in a Gas Sweetening Unit. The modulus of resilience (Ur) is found to be 8.0 KJ/m 3 -sec for variation of mass in-flow rate of sour feed gas into the upstream absorber column. Computer simulation technique has been used for evaluation of the resilience properties. Regenerator operating capacity range of 80%-100% is found to be the most thermodynamically efficient flow regime. Moreover, like a material, resilience modulus (Ur) of the regenerator is found to vary inversely with its modulus of elasticity (Esys). [ABSTRACT FROM AUTHOR]

Existing literature on designing Context-aware Mobile Patient Monitoring Frameworks (CMPMF) in the biomedical informatics domain recognizes the need to identify the common requirements of the domain. However, the literature on this topic is fragmented and the domain requirements of Context-aware Mobile Patient Monitoring Systems (CMPMS), which are required to develop CMPMF, have not been identified. To address this gap in knowledge, a domain model of CMPMS is implemented and validated in this paper. The domain model is validated by consultant physicians as domain experts and three CaMPaMS prototypes for monitoring patients with hypertension, epilepsy, or diabetes. The validated domain model provides significant results which can be used to enhance the design of CMPMF. The majority of the medical experts consulted agreed that the proposed domain model is complete, correct, and representative of the domain requirements. In addition, the model meets practical requirements for monitoring chronic diseases such as hypertension, diabetes and epilepsy. The results contribute to the improvement of software engineering practices and enhance productivity by increasing our understanding of the CMPMS domain. [ABSTRACT FROM AUTHOR]

Human action recognition from video has several potential to apply in different real-life applications, but the most cases in this field suffer from the variation in viewpoint. Most of published methods in this area are considered the performance of each single camera, therefore the change in the viewpoints significantly decrease the recognition rate. In this paper, multiple views are considered together and a method has proposed to recognize human action depicted in multi-view image sequences. In the first step, the border of the human body's silhouette is extracted and distance signal is calculated. In the next step, the wavelet transform is applied to extract coefficients of single-view features, and then the extracted features are combined to compose multi-view features. Finally a hierarchical classifier using support vector machine and Naïve Bayes classifiers is implemented to classify the actions. The average of overall action recognition accuracy for 12 actions using 5 different angles of views on the IXMAS dataset is 88.22. The results of experiments on the popular multi-view dataset have shown the proposed method achieves high and state-of-the-art success rates. In other word, combination of single-view extracted features from the wavelet approximation coefficients and composing the multi-view features can be used as the multi-view features. Further, the hierarchical classifier can be applied to recognize actions in multi-view human action recognition area. [ABSTRACT FROM AUTHOR]

Aspect Oriented Software Development is gaining wide attention because of its key feature modularization. Aspect Oriented paradigm supports the separation of concerns that are scattered over the system which helps in achieving modularity. Aspect Oriented Software Development encompasses software engineering abstractions and complexity at new and different dimensions. So Aspect Oriented Software Development requires models to assess its external quality attributes. The quality attribute maintainability is vital, because maintenance tasks employs major chunk of the total software development cost. The quality, maintainability is indicated using metrics. This paper proposes a framework to build maintainability model for aspect oriented systems using already defined software measures. [ABSTRACT FROM AUTHOR]

Nowadays, knowledge is the key to success in all software engineering processes. This valuable knowledge, obtained through analysis, design, development, and maintenance processes of the system, should be saved and reused in designing and developing current and similar systems. Using pre-existing knowledge is a practical approach which reduces design complexity, improves software architecture design and manages software quality. In this paper, we describe an approach to create architecture design knowledge using a hierarchical structure of architectural styles based on quality attributes. Knowledge is most importance asset of our approach that reuses similar domains, correlates architectures and reduces complexity by using and composing rules. Finally, we executed our approach on a standard case study. [ABSTRACT FROM AUTHOR]

Automated program repair (APR) techniques locate and fix faults automatically. In order to fix faults, APR applies a set of program modification operators (PMOs) to modify faulty programs. A potential repair is found when APR applies a PMO that fixes a fault. A brute-force search algorithm applies all PMOs in a predefined order until a potential repair is found. Brute-force can guarantee a fix but lowers APR performance, especially when it uses many PMOs. Stochastic search algorithms, such as a genetic algorithm, efficiently search the modifications space for a PMO that fixes a fault. In this paper, we conduct a comprehensive evaluation of the impact on APR effectiveness, APR performance, and the quality of potential repairs of three stochastic search algorithms:(1) a genetic algorithm (GA), (2) a genetic algorithm without a crossover operator (GAWoCross), and (3) a random search (RS). Our evaluation using 41 faulty versions of six different C programs shows that RS improves APR effectiveness and performance, but GA and GAWoCross improve the quality of potential repairs by generating more validated repairs, and potential repairs that failed fewer regression tests compared to RS. [ABSTRACT FROM AUTHOR]

This paper describes an approach to formulate queries in the language of first order logic over data from disparate sources distributed over a network. The data sources are treated as if they were all in a common database. The data sources may incorporate different stored or computed methods of providing data– web services and REST APIs, XML/JSON repositories, web pages, full featured databases, flat files, etc. We describe the technical foundations and benefits of this approach and compare it to other extant solutions to this problem. This approach enables end users to formulate ad-hoc queries in logic to correlate the data sources. For programmers creating applications, using a logic-based language to specify correlation criteria shortens the development life cycle and reduces cost of maintenance, compared to manually coding the equivalent correlation algorithms in procedural languages. [ABSTRACT FROM AUTHOR]

In this paper, an enhanced adaptive impulsive noise cancellation technique based on State Space Recursive Least Square (SSRLS) algorithm is proposed. The technique is applied to the Electrocardiogram (ECG) signal, where impulsive noise affects the ECG analysis. Due to state space model-dependent recursive parameters, the presented scheme does not require the reference signal and exhibits better impulsive noise cancellation in ECG signal when compared with existing Normalized Least Mean Square (NLMS) and, Recursive Least Square (RLS) techniques. The fastest convergence and excellent tracking characteristics of proposed scheme demonstrated by the simulation results in mean square error (MSE) sense proved it to be the effective solution of impulsive noise cancellation in ECG signals. [ABSTRACT FROM AUTHOR]

The power cost of running a data center is a significant portion of its total annual operating budget. With the aim of reducing power bills of data centers, “Green Computing” has emerged with the primary goal of making software more energy efficient without compromising the performance. Developers play an important role in controlling the energy cost of data center software while writing code. In this paper, we show how software developers can contribute to energy efficiency of servers by choosing energy efficient APIs (Application Programming Interface) with the optimal choice of parameters while implementing file reading, file copy, file compression and file decompression operations in Java; that are performed extensively on large scale servers in data centers. We performed extensive measurements of energy cost of those operations on a Dell Power Edge 2950 machine running Linux and Windows servers. Measurement results show that energy costs of various APIs for those operations are sensitive to the bu ff er size selection. The choice of a particular Java API for file reading with different buffer sizes has significant impact on the energy cost, giving an opportunity to save up to 76%. To save energy while copying files, it is important to use APIs with tunable buffer sizes, rather than APIs using fixed size buffers. In addition, there is a trade off between compression ratio and energy cost: because of more compression ratio, xz compression API consumes more energy than zip and gzip compression APIs. Finally, we model the energy costs of APIs by polynomial regression to avoid repeated measurements. [ABSTRACT FROM AUTHOR]

The software testing practices generate test cases manually, that affects both the effectiveness and efficiency. In aerospace and safety critical domains, software quality assurance is strict to rules and regulations such as DO-178B standard. To resolve these issues, concolic testing generates test suite that can attain high coverage using an automated technique based on Branch Coverage. In this paper, we propose a framework to compute branch coverage percentage for test case generation. To achieve an increase in branch coverage, we transform the input Java program, P , into its transformed version, P t , using JPCT. Then we use JCUTE to generate test cases and find branch coverage percentage. Our experimental studies on branch coverage percentage consists of two steps: the first observation is made without using Java program code transformer, the second observation is made by using Java program code transformer. The Java program code transformer adds additional conditional statements for each decision that causes variation in branch coverage. We quantify this variation in the form of branch coverage percentage. This approach resolves some of the bottleneck issues associated with traditional concolic testers. The experimental studies show that our approach achieves 20.146% of average increase in branch coverage. This increase in branch coverage percentage is achieved in an average computation time of 33837.6 milli seconds. [ABSTRACT FROM AUTHOR]

Time dependent models have become increasingly important in formal modeling and verification of software systems. In this paper, we investigate the expressiveness of real-time iterative arrays and trees in the context of language recognition. Such synchronous parallel models of computation must meet high dependability requirements in performing complex interactions in a real-time envi- ronment. Furthermore, we present timed event alternating automata which do not only describe a theoretical model framework for formal languages but establishes strong relationships and foundations to timed propositional temporal logic through two embedded powerful metaphors – alternation and time. [ABSTRACT FROM AUTHOR]

Significant advancement in mobile devices coupled with high speed networks have shifted personal computing towards pervasive environments. Mobile devices currently offer many value-added applications and services such as emailing, messaging, navigation, social networking, finance, and entertainment. Typically, such value-added applications have access to users’ personal information and are capable of gathering and transmitting trust sensitive information, hence posing security risks and/or privacy concerns. In this paper, we propose a context-based analytic hierarchy process (AHP) framework for eliciting context information and adapting this information with network access control measures for mobile devices. The framework enforces the execution of mobile applications inside security incubators to control the communication between mobile applications and mobile device resources. Mobile applications’ access requests are analyzed based on user's context information collected from the mobile device sensors and the application network access control configuration. We use the Facebook mobile application, as a test case, to evaluate our proposed framework. Evaluation results have demonstrated the efficacy of the framework in providing network access control measures based on real-time assessment of user's context. [ABSTRACT FROM AUTHOR]