Search

The emergence of edge computing allows the processing of data at the source of data. By combining edge computing with the cloud and the Internet of Things (IoT), data collection, processing, and storage can be managed effectively. This combined architecture has given hope for an automated surveillance system. This paper presents an edge–cloud – IoT-based Surveillance System that uses computer vision algorithms in the edge devices to process the video feed captured by cameras and store the required video backup in the cloud through IoT. This paper discusses the protocols used, task scheduling methods, metrics used to analyze the quality of service, and security and privacy issues. The dataset is collected from the SRMIST, Kattankulathur campus. The architecture is tested on the students' activities and is found efficient. [ABSTRACT FROM AUTHOR]

At the present time "chaotic nonlinear dynamical systems" is the most popular branch of the mathematical modeling. Many of real life phenomena are nonlinear. In the present paper we investigate the simulations of fractal figures by computer programming. Fractals are strictly dependence with the nonlinear phenomena. There was scientific view that every real phenomenon is regular or stable at the time of Isaac Newton. Later Poincare [2] observed many of the real phenomena are not regular i.e. they are "chaotic". At first time fractal figures observed on the computer by Benoit Mandelbrot with several programmers of at the company IBM in 1980. Later appears the set of Mandelbrot [4] which is fractal, the most important tool of the sets of Julia [1] and strictly depends on the irregular phenomenon. In this paper we learn the developing computer program to obtain fractal figures which applicable to many areas of natural phenomena. [ABSTRACT FROM AUTHOR]

Image recognition plays a very important role in the application of computer vision, but there is a problem that object tracking is not ideal. The previous recognition method could not solve the problem of object tracking in the field of computer vision, and the recognition was inaccurate. Therefore, this paper proposes an artificial intelligence technology for object tracking image recognition and analysis. they used to process the image information, and the indicators are divided according to the requirements of artificial intelligence processing to reduce them Interference factors in image recognition. Then, the theory of human intelligence processes the image artificial intelligence, forms an artificial intelligence processing scheme, and recognizes the results of the image Conduct a comprehensive analysis. The revised results show that the calculation process in this paper is relatively good, and it is suitable for practical theoretical analysis, which has high significance and function, and can be used for later comprehensive judgment. [ABSTRACT FROM AUTHOR]

The traditional microblog recommendation algorithm has the problems of low efficiency and modest effect in the era of big data. In the aim of solving these issues, this paper proposed a mixed recommendation algorithm with user clustering. This paper first introduced the situation of microblog marketing industry. Then, this paper elaborates the user interest modeling process and detailed advertisement recommendation methods. Finally, this paper compared the mixed recommendation algorithm with the traditional classification algorithm and mixed recommendation algorithm without user clustering. The results show that the mixed recommendation algorithm with user clustering has good accuracy and recall rate in the microblog advertisements promotion. [ABSTRACT FROM AUTHOR]

Most of the mobile robot path planning is estimated to reach its predetermined aim through the shortest path and avoiding the obstacles. This paper is a survey on path planning algorithms of various current research and existing system of Unmanned Ground Vehicles (UGV) where their challenging issues to be intelligent autonomous robot. The focuses are some short reviews on individual papers for UGV in the known environment. Methods and algorithms in path planning for the autonomous robot had been discussed. From the reviews, we obtained that the algorithms proposed are appropriate for some cases such as single or multiple obstacles, static or movement obstacle and optimal shortest path. This paper also describes some pros and cons for every reviewed paper toward algorithms improvement for further work. [ABSTRACT FROM AUTHOR]

Today, the study of the distribution of emissions in the atmosphere is quite an urgent task, because harmful substances, getting into the surrounding atmosphere, cause harm to the health of people, flora and fauna. In this paper, the results of simulation of the distribution of emissions from the Ekibastuz TPP (GRES 1) are presented. For simulations the model of turbulence was chosen. Simulations were performed by using the ANSYS 16.0 software package. Previously, the model and numerical algorithm were tested using a model problem and the results were compared with the experimental data. [ABSTRACT FROM AUTHOR]

The paper deals with humanoid robots and its interaction inside open areas. The major part of the paper presents the space scanning algorithm which corrects movement imperfections of humanoid robot during exploration of space. Algorithm utilizes visual confirmation retrieved from data collected by robot, what allows to make robot movement much more precise in specific space. [ABSTRACT FROM AUTHOR]

Computer graphics is the Visual Presentation of diagram, photographs that we draw on a surface with the help of Computer. We can transform the data or information in visual form and can represent that on any display device. Numerous drawing algorithms have been used in computer graphics for rasterizing the screen. This paper deals with a new way to reduce the error in the accessible Midpoint Circle Drawing Algorithm. In this approach, we have measured two dissimilar values of h as (1 and 0.1) in the first quadrant of a circle. For h=1, every one of the outcomes of Midpoint Circle Drawing Algorithm have been confirmed and for different values of h it is seen that as the value of h diminishes, the quantity of cycle increments yet the errors between the points created and the first circle points diminishes and the other way around. Finally by doing symmetry a whole circle is been drawn. [ABSTRACT FROM AUTHOR]

Computer graphics is the illustration and representation of image data by a computer employing several technologies to construct and operate images. Visualization, graphical user interface, graphical display and presentation, manipulation of mathematical objects and rendering, motion capture, etc. are some of the important subjects involved in computer graphics. A number of drawing algorithms have been developed so far. Their underlying principle is to capacitate visually presentable images in a minimal time. This is ultimately accomplished by lessening the calculations to a minimum. Ellipse is one of the forms of the Circle, when we stretch the circle then the resulted figure is known as Ellipse. In this paper we have used a new method to generalize the Midpoint Ellipse Drawing Algorithm which reduces the error in the existing one. In this method, we have considered different values of h as (1, 0.1). MPEDA is verified for the all results when h=1, and the values of h is decreased for other values of h, in this the error between points are generated when the number of iterations increased. Similarly the Ellipse points decreases and vice versa. [ABSTRACT FROM AUTHOR]

Nowadays in India, due to the increase in the number of accidents vehicles are being automated using a variety of Computer vision algorithms. This paper focuses on the detection of tail signals of cars under different illumination circumstances. This system is implemented using FAST and SIFT algorithm which helps to extract features from the images. The obtained features were optimized by using K-Means Clustering Algorithm. This huge feature vector is converted into 8 clusters. These optimized feature vectors were trained on five different classifiers as Decision Tree, SVM(RBF), Random Forest, and Voting Classifier. The trained data set used in this algorithm contains around 9052 images. The obtained accuracy results of different classifiers are as follows, Decision tress has 76.36%, SVM(RBF) has 77.91%, Random Forest has 87.52%, KNN has 89.72%, the Voting classifier has 86.52%. It is observed that KNN gives the highest accuracy among the five used classifiers. This has, to the best of the authors' knowledge, not been presented in literature before. [ABSTRACT FROM AUTHOR]

In this paper, we used the fractional collocation method based on the B-spline basis to derive the numerical solutions for a special form of fractional delay differential equations (DFDEs). The fractional derivative used is defined in the sense of Caputo. So, we can represent the DFDE under consideration into a matrix form that can be solved using matrix operations and tools from linear algebra. As a result, we get algebraic equations with unknown coefficients that can be solved efficiently using a computer algorithm. To illustrate the validity and efficiency of the method, exact and approximate solutions are compared, and absolute errors are found using an example. The numerical results, which are backed up by simulation, reveal that the absolute error is very small and that the approach is extremely efficient. [ABSTRACT FROM AUTHOR]

With increasing number of applications of Unmanned Aerial Vehicles (UAVs) in civilian sectors, enthusiasts are finding ways to build their own UAV which can be used for jobs that are too dull, dirty or dangerous for humans. Design of UAVs may vary according to their respective mission and payload requirements. The algorithm asks for the specific requirements of the user such as payload weight & volumetric dimensions, maximum speed at which UAV is supposed to fly etc. The process includes aerodynamic analysis of numerous airfoils and selecting the optimum one, calculating wing-span required with the selected airfoil cross section to attain required lift, reducing drag, maintaining stability of aircraft etc. This process is iterative and can take lot of time. Here arose a need to make this process automatic with the help of computer by developing an algorithm which can save lot of time for the people who have to work from scratch in order to make an UAV. In this research paper an effort is made to establish a computer-based algorithm for design and development of a flying wing UAV using MATLAB. [ABSTRACT FROM AUTHOR]

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers. [ABSTRACT FROM AUTHOR]

The article discusses how to leverage generative design to optimize the aircraft structures and variousaircraft performance estimation techniques available today. Both of these are inter connected, becauseoptimization of aircraft structures would automatically improve aircraft performance. The technique is demonstrated by taking into consideration several case studies directly from aerospace research studies. The paper offers a useful explanation of the workflow and capabilities of generative methodand algorithms to provide a number of potential solutions to a static structural design challenge. In the end we will discuss the possible improvement of GD with the integration of technologies like cloud, multidisciplinary optimization. Generative design is a combination of computer algorithms that tends to satisfy a given set of boundary condition, the converged solution is our optimized parts. Our design criteria will always be weight reduction and improvement of stress loads, this will automatically optimize the aircraft's performance. [ABSTRACT FROM AUTHOR]

The whole gamut of Genetic data is ever increasing exponentially. The human genome in its base format occupies almost thirty terabyte of data and doubling its size every two and a half year. It is well-know that computational resources are limited. The most important resource which genetic data requires in its collection, storage and retrieval is its storage space. Storage is limited. Computational performance is also dependent on storage and execution time. Transmission capabilities are also directly dependent on the size of the data. Hence Data compression techniques become an issue of utmost importance when we confront with the task of handling such giganticdatabases like GenBank. Decompression is also an issue when such huge databases are being handled. This paper is intended not only to provide genetic data compression but also partially decompress the genetic sequences. [ABSTRACT FROM AUTHOR]

Secure encryption of data in Internet of Things is especially important as many information is exchanged every day and the number of attack vectors on IoT elements still increases. In the paper a novel symmetric encryption method is proposed. The idea bases on the one-time pad technique. The proposed solution applies double memory concept to secure transmitted data. The presented algorithm is considered as a part of communication protocol and it has been initially validated against known security issues. [ABSTRACT FROM AUTHOR]

In this paper, we discussed a literature on blood collection-distribution that based on vehicle routing problem. This problem emergence when the process from collection to stock up must be completed in timely manner. We also modified the mathematical model so that it will suited to general collection of blood. A discussion on its algorithm and solution methods are also pointed out briefly in this paper. [ABSTRACT FROM AUTHOR]

To protect the privacy of sensitive data, an encrypted and decrypted file system based on USBKey and hardware code is designed and implemented in this paper. This system uses USBKey and hardware code to authenticate a user. We use random key to encrypt file with symmetric encryption algorithm and USBKey to encrypt random key with asymmetric encryption algorithm. At the same time, we use the MD5 algorithm to calculate the hash of file to verify its integrity. Experiment results show that large files can be encrypted and decrypted in a very short time. The system has high efficiency and ensures the security of documents. [ABSTRACT FROM AUTHOR]

Collaborative filtering is one of the most widely used recommendation technologies, but the data sparsity and cold start problem of collaborative filtering algorithms are difficult to solve effectively. In order to alleviate the problem of data sparsity in collaborative filtering algorithm, firstly, a weighted improved SimRank algorithm is proposed to compute the rating similarity between users in rating data set. The improved SimRank can find more nearest neighbors for target users according to the transmissibility of rating similarity. Then, we build trust network and introduce the calculation of trust degree in the trust relationship data set. Finally, we combine rating similarity and trust to build a comprehensive similarity in order to find more appropriate nearest neighbors for target user. Experimental results show that the algorithm proposed in this paper improves the recommendation precision of the Collaborative algorithm effectively. [ABSTRACT FROM AUTHOR]

The Collaborative filtering recommendation algorithm is one of the most widely used recommendation algorithm in personalized recommender systems. The key is to find the nearest neighbor set of the active user by using similarity measure. However, the methods of traditional similarity measure mainly focus on the similarity of user common rating items, but ignore the relationship between the user common rating items and all items the user rates. And because rating matrix is very sparse, traditional collaborative filtering recommendation algorithm is not high efficiency. In order to obtain better accuracy, based on the consideration of common preference between users, the difference of rating scale and score of common items, this paper presents an improved similarity measure method, and based on this method, a collaborative filtering recommendation algorithm based on similarity improvement is proposed. Experimental results show that the algorithm can effectively improve the quality of recommendation, thus alleviate the impact of data sparseness [ABSTRACT FROM AUTHOR]

Because of the standard particle swarm optimization algorithm (Particle Swarm Optimization PSO) has slow convergence speed and easy to fall into the local minimum problem, in order to solve these problems, this paper proposes a multi-objective particle swarm optimization method based on improved culture. The simulation results show that the proposed algorithm is better in convergence speed and local minimum value, which shows that the improved particle swarm optimization algorithm has a good reference value [ABSTRACT FROM AUTHOR]

Fuzzy topological topographic mapping (FTTM) is a set of topological spaces and algorithms which is applied in solving neuro magnetic inverse problem. The special characteristic of FTTM, namely the homeomorphisms between its components, allow the construction of new FTTM from components of different of FTTM. These generated FTTMs can be represented in the form of a pseudo graph. A graph of pseudo degree zero is a special type of pseudo graph where each of the FTTM components version differ to components adjacent to it. Previous studies have investigated combinations of graph with pseudo degree zero for n number of components and k number of version by using a computer algorithm. In this paper one conjecture from the previous study namely the conjecture on the number of graphs with pseudo degree zero generated by a sequence of FTTM with three versions is proven analytically by using new definitions of FTTM namely FTTM grid as an alternative to FTTM sequence of polygon. This paper highlights some new theorems derived from the new definitions. [ABSTRACT FROM AUTHOR]

With the rapid development of mobile smart devices, there are increasing number of data traffic which will consume large amounts of energy. In this paper, we investigate a renewable energy allocation scheme in a multi-node edge-computing system. Specifically, several renewable power suppliers (RPSs) cooperate with each other to provide each node with green energy resources to the base station (BS) in the backhaul are considered. These RPSs supplying energy to each backhaul node have a complementary relationship, and the game between them is modeled as "successive Coordinated Cournot". Assuming that the RPSs offer undifferentiated renewable energy and, the energy storage are produced in the fixed proportions, the equilibrium prices for the whole system are characterized by a system of linear equations. The theoretical analysis and simulation results show that the proposed pricing scheme can increase the profits of the RPSs. In addition, the factors that influence the equilibrium selling prices and profits are studied, and the simulation results show how the quantity of RPSs influences the equilibrium price and the renewable energy production capacity [ABSTRACT FROM AUTHOR]

With the gradual advancement of industrial production, overhead cranes have been widely used in industrial sites such as steel works, ports, warehouses, etc., and underactuated overhead crane system has also become one of the hot topic in the automation field. To make the overhead crane positioning accurately and anti-swing quickly, the paper design a positioning and anti-swing controller based on PSO algorithm optimization PID parameter. Compile PSO algorithm procedures and the invoking procedures which link Matlab and Simulink, combine with crane’s hanging weight system model in Simulink, and realize the PSO-PID control system of the hanging weight simulation. The simulation results show that the trolley can positioning accurately and the swing of hanging weight system can be restrained quickly and effectively [ABSTRACT FROM AUTHOR]

In the future information warfare, cruise missiles will be an important means of combating enemy high-value military targets, showing the characteristics of precise guidance, strong penetration capability and high power, since cruise missiles can match terrain with ultra-low altitude flight and radar reflection area is small, it is difficult to track. In order to effectively solve the tracking problem, this paper proposes a tracking algorithm based on IMM-Singer model, which integrates IMM model and Singer model. It can effectively solve the problems of low precision, large amount of calculation, and time lag of Singer model. The results of Monte Carlo simulation show that the IMM-Singer model algorithm has stronger tracking ability than single IMM model algorithm, and has better stability, stronger anti-interference ability and higher tracking accuracy, which greatly improves the Tracking performance for the cruise missile. [ABSTRACT FROM AUTHOR]

With the development of society, the proportion of sitting time in people's daily life and working environment is increasing. However, Most of the sitting posture is improper sitting posture in most of the time. Improper sitting posture for a long time is one of the main causes of a series of skeletal muscle diseases. In this paper, a CNN sitting posture recognition model based on human pressure data is proposed. The model is constructed by collecting a large number of pressure data of human-chair contact surface and using these training to get sitting posture recognition algorithm. Experiments show that the algorithm can accurately identify eight kinds of human sitting posture. Its accuracy rate is as high as 95.6%, and the recall rate is 95.5% at same time. The sitting position recognition system constructed by this algorithm can monitor and distinguish the bad sitting posture of human body in real time, and it has the many advantages such as high accuracy, high robustness, high availability and high security [ABSTRACT FROM AUTHOR]

In this paper, a novel hardware-friendly reinforcement learning algorithm based on memristive spiking neural networks (MSNN-RL) is proposed. Neurons for spike coding are designed specifically to complete transformation between analog data and discrete spikes. Then, remote supervised method (ReSuMe) is used to combine SNN with basic reforcement learing (Sarsa). Besides, bionic memristive snynapses are designed to speed up ReSuMe. Furthermore, the circuit scheme of MSNN-RL is designed with modulation of memristor synapses. Finally, the application of MSNN-RL in acrobot system is discussed. Simulation results and analysis verify the effectiveness of the proposed algorithm (MSNN-RL) and show it is superior to traditional apporach [ABSTRACT FROM AUTHOR]

Several control algorithms for autonomous mobile robot navigation have been proposed in the literature. Recently, the employment of non-analytical methods of computing such as fuzzy logic, evolutionary computation, and neural networks has demonstrated the utility and potential of these paradigms for intelligent control of mobile robot navigation. In this paper, Mamdani fuzzy system for an autonomous mobile robot is developed. The paper begins with the discussion on the conventional controller and then followed by the description of fuzzy logic controller in detail. [ABSTRACT FROM AUTHOR]

Search engines on the Internet are used daily to access and find information. While these services are providing an easy way to find information globally, they are also suffering from artificially created false results. This paper describes two techniques that are being used to manipulate the search engines: spam pages (used to achieve higher rankings on the result page) and cloaking (used to feed falsified data into search engines). This paper also describes two proposed methods to fight this kind of misuse, algorithms for both of the formerly mentioned cases of spamdexing. [ABSTRACT FROM AUTHOR]

The paper investigates the scalability of a parallel Euler solver, using the Vijayasundaram method, on CPU and GPU clusters. The aim of this research is to develop efficient parallel CFD codes on unstructured meshes. We present the relevant algorithms and some benchmark results, which show overall efficiency of the solver. [ABSTRACT FROM AUTHOR]

This paper presents a conjugate gradient-based algorithm for feedback min-max optimal control of nonlinear systems. The algorithm has a backward-in-time recurrent structure similar to the back propagation through time (BPTT) algorithm. The control law is given as the output of the one-layer neural network. Main contribution of the paper includes the integration of BPTT techniques, conjugate gradient methods, Adams method for solving ODEs and automatic differentiation (AD), to provide an effective, novel algorithm for solving numerically optimally min-max control problems. The proposed algorithm is applied to the rotational/translational actuator (RTAC) nonlinear benchmark problem with control and state vector constraints. [ABSTRACT FROM AUTHOR]

In this paper, a novel optimization algorithm, named group search optimizer (GSO), is used to truss structure topology optimization. The group search optimizer is improved in two aspects which including using harmony memory and adhering to the boundary. Two topology methods, such as heuristic topology and discretization of topology variables, are incorporated with GSO to make sure that the topology optimization works well. In the end of the paper, two numerical examples were used to test the improved GSO. Calculation results show that the improved GSO is feasible and robust for truss topology optimization. [ABSTRACT FROM AUTHOR]

An algorithm for modeling of diffusion, thermal conductivity and viscosity is presented in the paper. Its purpose is demonstration of the transport phenomena in fluids and some basic results in statistical physics in the physics education. The realization of the algorithm as computer program is simple permitting its application by students with only basic knowledge in programming. At the same time the results from the model describe correctly the studied phenomena. [ABSTRACT FROM AUTHOR]

The paper deals with the concept of tensegrity structures and applications thereof, particularly in mobile robotics. The authors considered a certain approach to the design of tensegrity robots, namely, iterative design based on an artificial intelligence algorithm using computer simulation. The focus is on an icosahedron-shaped six-rod tensegrity robot with three active rods fitted with electromechanical actuators at the ends and three passive rods. The robot has 24 elastic cables to maintain its structure; it also has six rigid cables whose contraction and release enable the robot to roll from one face to another by shifting its mass center. A platform carrying the payload is secured in the central part of the robot using elastic cables. A simulation model of a six-rod mobile tensegrity robot has been developed in the Simulink package of MATLAB environment using the Simscape Multibody library. One-step movement of the robot has been simulated. Conclusions have been drawn regarding the advantages and disadvantages of MATLAB application for tensegrity robot simulation and design compared to the other environments available. [ABSTRACT FROM AUTHOR]

A pedestrian detection and tracking method using modified SURF(Speed Up Robust Feature) algorithm is proposed in this paper. In calculating the location of pedestrian, the zeroth and first order moments are used with the discrete probability image. Experiments on a set image sequence data are performed for evaluation of the proposed method. The preliminary results show that the proposed tracking method can be a promising alternative over existing method based on Meanshift algorithm in terms of tracking accuracy with real time tracking speed. [ABSTRACT FROM AUTHOR]

We present a case study that demonstrates a bio-inspired approach in the process of finding optimal parameters for GSM fault model. This model is constructed using Petri Nets approach it represents dynamic model of GSM network environment in the suburban areas of Ostrava city (Czech Republic). We have been faced with a task of finding optimal parameters for an application that requires high amount of data transfers between the application itself and secure servers located in datacenter. In order to find the optimal set of parameters we employ bio-inspired algorithms such as Differential Evolution (DE) or Self Organizing Migrating Algorithm (SOMA). In this paper we present use of these algorithms, compare results and judge their performance in fault probability mitigation. [ABSTRACT FROM AUTHOR]

In this paper, a novel algorithm is proposed. Firstly, the edge of cover image is detected with Canny operator and secret data is embedded in edge pixels. Sorting method is used to randomize the edge pixels in order to enhance security. Coherent bit length L is determined by relevant edge pixels. Finally, the method of 2k correction is applied to achieve better imperceptibility in stego image. The experiment shows that the proposed method is better than LSB-3 and Jae-Gil Yu's in PSNR and capacity. [ABSTRACT FROM AUTHOR]

With the digitalization of music, the number of collection of music increased largely and there is a need to create lists of music that filter the collection according to user preferences, thus giving rise to the Automatic Playlist Generation Problem (APGP). Previous attempts to solve this problem include the use of search and optimization algorithms. If a music database is very large, the algorithm to be used must be able to search the lists thoroughly taking into account the quality of the playlist given a set of user constraints. In this paper we perform an evolutionary meta-heuristic optimization algorithm, Differential Evolution (DE) using different combination of parameter values and select the best performing set when used to solve four standard test functions. Performance of the proposed algorithm is then compared with normal Genetic Algorithm (GA) and a hybrid GA with Tabu Search. Numerical simulations are carried out to show better results from Differential Evolution approach with the optimized parameter values. [ABSTRACT FROM AUTHOR]

The classical method of finding associations in the data matrix with the given support and reliability may not lead to finding all relevant facts in the data. This paper deals with a modified method of searching for so called aggregated associations, which can also find other non-trivial facts. The paper describes an algorithm that finds hypotheses of the form of aggregated associations and demonstrates its use in a practical example. [ABSTRACT FROM AUTHOR]

Vehicle-mounted panoramic system is important safety assistant equipment for driving. However, traditional systems only render fixed top-down perspective view of limited view field, which may have potential safety hazard. In this paper, a texture mapping algorithm for 3D vehicle-mounted panoramic system is introduced, and an implementation of the algorithm utilizing OpenGL ES library based on Android smart platform is presented. Initial experiment results show that the proposed algorithm can render a good 3D panorama, and has the ability to change view point freely. [ABSTRACT FROM AUTHOR]

In this paper, we represent a novel algorithm for point cloud feature detection. Firstly, the algorithm estimates the local feature for each sample point by computing the ratio of the distance from the inner voronoi pole and the outer voronoi pole to the surface. Then the surface global saliency feature is detected by adding the results of the difference of Gaussian for local feature under different scales. Compared with the state of the art methods, our algorithm has higher computing efficiency and more accurate feature detection for sharp edge. The detected saliency features are applied as the weights for surface mesh simplification. The numerical results for mesh simplification show that our method keeps the more details of key features than the traditional methods. [ABSTRACT FROM AUTHOR]

The paper presents two different approaches to reduce the time of computer calculation of reachability sets. First of these two approaches use different data structures for storing the reachability sets in the computer memory for calculation in single-threaded mode. Second approach is based on using parallel algorithms with reference to the data structures from the first approach. Within the framework of this paper parallel algorithm of approximate reachability set calculation on computer with SMP-architecture is proposed. The results of numerical modelling are presented in the form of tables which demonstrate high efficiency of parallel computing technology and also show how computing time depends on the used data structure. [ABSTRACT FROM AUTHOR]

The Extreme Learning Machine (ELM) algorithm conventionally suffers from the inferior batch training performance. In this paper, a new approach to combine ELM outputs is proposed with a view to further develop a persistent IDS. Specifically, this paper proposes the application of an Extreme Learning Machine based approach to the network-based intrusion detection system (IDSs). Good performance is achieved and preliminary results are reported in this paper. [ABSTRACT FROM AUTHOR]

This paper attempts to undertake the study of Restored Gaussian Blurred Images by using four types of techniques of deblurring image viz., Wiener filter, Regularized filter, Lucy Richardson deconvolution algorithm and Blind deconvolution algorithm with an information of the Point Spread Function (PSF) corrupted blurred image. The same is applied to the scanned image of seven months baby in the womb and they are compared with one another, so as to choose the best technique for restored or deblurring image. This paper also attempts to undertake the study of restored blurred image using Regualr Filter(RF) with no information about the Point Spread Function (PSF) by using the same four techniques after executing the guess of the PSF. The number of iterations and the weight threshold of it to choose the best guesses for restored or deblurring image of these techniques are determined. [ABSTRACT FROM AUTHOR]

In this paper the robust optimization for production planning is considered. The most important objectives of introduced research include: to analyze a capacitated lot-sizing problem (CLSP) on a rolling horizon basis, to prove the uniqueness of worst-case demand distribution in terms of competitive analysis, to construct a method to calculate a competitive ratio of online algorithms with different length of rolling horizon interval. To describe the process of production, mathematical model of CLSP was chosen (includes associated production and holding costs) [1]. In this paper we consider the rolling horizon approach for the optimization. To measure the effectiveness of the algorithm and guarantee the robust solution, we use terms 'online and offline algorithms' and the concept of competitive ratio from competitive analysis [2]. [ABSTRACT FROM AUTHOR]

The existing parsing methods of scattered context grammar usually expand nonterminals deeply in the pushdown. This expansion is implemented by using either a linked list, or some kind of an auxiliary pushdown. This paper describes the parsing algorithm of an LL(1) scattered context grammar. The given algorithm merges two principles together. The first approach is a table-driven parsing method commonly used for parsing of the context-free grammars. The second is a delayed execution used in functional programming. The main part of this paper is a proof of equivalence between the common principle (the whole rule is applied at once) and our approach (execution of the rules is delayed). Therefore, this approach works with the pushdown top only. In the most cases, the second approach is faster than the first one. Finally, the future work is discussed [ABSTRACT FROM AUTHOR]

This research paper presents a new concept of using a single tool to associate syntax of various programming languages, algorithms and basic coding techniques. A simple framework has been programmed in Python that helps students learn skills to develop algorithms, and implement them in various programming languages. The tool provides an innovative and a unified graphical user interface for development of multimedia objects, educational games and applications. It also aids collaborative learning amongst students and teachers through an integrated mechanism based on Remote Procedure Calls. The paper also elucidates an innovative method for code generation to enable students to learn the basics of programming languages using drag-n-drop methods for image objects. [ABSTRACT FROM AUTHOR]

This paper presents a novel sensing and balancing method for bipedal walking robot. The proposed method involves the design of semi-rigid ankle joint to facilitate the responsive and accurate measurement of the sideway (sagittal) instability of the walking robot. The use of double balancing mass and the developed control algorithms provide a constant sideway stability of the robot while it walks in forward direction. The smooth legs trajectory planning then can be implemented successfully regardless of the robot sideway stability condition. The developed method is able to decouple the walking algorithms from the robot stability issues. Furthermore, the use of two different masses for the balancing helps to improve response time and efficiency of the balancing system. In this paper, the proposed method is tested on the simplified model of a robot balancing on its single leg and the feasibility of the method is confirmed by the simulation results obtained with MATLAB Simulink tools. [ABSTRACT FROM AUTHOR]

The authors of this paper embarked on a research to find an effective mechanism or algorithm to determine the optimal data packet size for efficient underwater acoustic (UWA) data transmission. In the course of the research the authors have identified some of the UWA channel parameters that play an important role in determining the suitable data packet size for efficient data transfer. These include the distance between a source and a sink, bit error rate, type of protocol, energy per useful bit, and the throughput. In this paper the authors present the findings on the relationship between data packet size, the throughput, the bit error rate (BER), and the distance between a source-sink pair by keeping the type of protocol and the energy per useful bit parameters constant. These findings represent the preliminary contribution in parts to the final induction of the algorithm for data packet size optimization. The results obtained are based on simulation using the MIRACLE (Multi-InteRfAce Cross-Layer Extension library) package running on standard ns2 network simulator. [ABSTRACT FROM AUTHOR]

License Plate Recognition (LPR) systems commonly have framework of processing steps such as: Detection of number plate, Segmentation of plate characters and Recognition of each character. Number plate detection is a challenging task due to diversity of plate formats and environmental conditions during the image acquisition. Accuracy of character segmentation and recognition rely on the efficiency of plate detection. Various algorithms are developed for this work. Purpose of this paper is to categorize and brief them. [ABSTRACT FROM AUTHOR]