{"title":"Developing a real-time inference approach for rule-based reasoning systems","authors":"Ying Qiao, Chang Leng, Hongan Wang, Jian Liu","doi":"10.1145/2513228.2513303","DOIUrl":"https://doi.org/10.1145/2513228.2513303","url":null,"abstract":"Rule-based reasoning systems play importance roles for many real-time intelligent systems that need to take time-critical actions in response to the continuously arriving events. In this paper, we propose a novel inference approach, called RTINF to make the reasoning system meet its hard deadlines. A series of simulation studies are conducted to evaluate the performance of RTINF.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126586990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Global network connectivity assessment via local data exchange for underwater acoustic sensor networks","authors":"M. M. Asadi, A. Ajorlou, A. Aghdam, S. Blouin","doi":"10.1145/2513228.2516925","DOIUrl":"https://doi.org/10.1145/2513228.2516925","url":null,"abstract":"This paper studies the problem of distributed connectivity assessment for a network of underwater sensors in a data aggregation mission. Motivated by a sufficient condition for asymptotic almost sure consensus in a network defined over a random digraph, vertex connectivity of the expected communication graph is used as a measure for the connectivity of the underwater sensor network. A distributed update scheme is proposed in which the sensors update their perception of the expected communication graph. The expected communication graph can be characterized by its associated probability matrix. A learning algorithm is employed by each sensor to update its belief on the probabilities using the broadcast messages it receives. Each sensor uses a polynomial-time algorithm to estimate the degree of vertex connectivity of the expected graph based on its perception of the network graph. The proposed algorithms can also handle changes in the topology of the network such as node addition, node deletion, and time-varying probabilities. The performance of the proposed algorithms is validated in simulation.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A distortion estimation based packet scheduling strategy for H.264 video over wireless networks","authors":"Danyang Zhang, Fan Li, Zhou Su","doi":"10.1145/2513228.2513326","DOIUrl":"https://doi.org/10.1145/2513228.2513326","url":null,"abstract":"To improve the end-to-end QoS guarantee for video applications, this paper presents a content-aware packet scheduling scheme for the pre-encoded video over wireless networks. The scheme can be used with the wireless standard such as HSDPA. A distortion based estimation method (EM) is proposed to measure the contribution of each packet in terms of received quality, with the packet quality contribution index (PQCI). We consider both the complex error concealment techniques and the quality distortion, made for current frame and the frames related with it. Simulation results show that the proposed EM scheme provides a viable and useful approach for pre-encoded video streams and it can significantly outperform other existing algorithms.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125261300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The BGP monitoring and alarming system to detect and prevent anomaly IP prefix advertisement","authors":"Jekuk Yun, Beomseok Hong, Yanggon Kim","doi":"10.1145/2513228.2513292","DOIUrl":"https://doi.org/10.1145/2513228.2513292","url":null,"abstract":"The Border Gateway Protocol (BGP) is the routing protocol that enables large IP networks to form a single Internet. The main objective of BGP is to exchange Network Layer Reachability Information (NLRI) between Autonomous Systems (ASes) so that a BGP speaker can announce their IP prefix and find a path to the destination of packets. However, a BGP hijacker can pretend to be any third BGP speaker because BGP itself doesn't have the functionality of validating BGP messages. In order to solve this problem, BGP speaker needs to validate messages coming from other BGP speakers. In this paper, we propose the BGP Monitoring and Alarm System (BGPMAS) which monitors incoming announcements and starts to make sounds of the alarm if the BGPMAS detects an invalid announcement. In addition, the BGPMAS provides AS administrators with web service to show where the invalid message is coming from so that the administrators can rapidly deal with the IP prefix hijacking by ignoring the malicious BGP router's prefix. In order to set this environment, the BGPMAS needs to be connected to the BGP router and the AS administrator needs the Alarm Application (AA) which will make sounds of the alarm and the AA receives a signal from the BGPMAS when the BGPMAS detect an invalid announcement. As a result, the BGP routers can easily have the RPKI-based origin validation function with the BGPMAS.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132743501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Combining principal component analysis, decision tree and naïve Bayesian algorithm for adaptive intrusion detection","authors":"Zhi-Guo Chen, Sung-Ryul Kim","doi":"10.1145/2513228.2513281","DOIUrl":"https://doi.org/10.1145/2513228.2513281","url":null,"abstract":"In this paper, a new learning algorithm for adaptive network intrusion detection using principal component analysis, decision tree and Naïve Bayesian classifier is presented. First we use PCA (Principal Component Analysis) to remove unimportant information like the noise in the data sets, to reduce the dimension, and to retain the important information as much as possible. Then we use the Decision tree and Naive Bayesian algorithm to make Intrusion Detection Model. We have tested the performance of our proposed algorithm on the KDD99 benchmark intrusion detection dataset. The experimental result prove that the proposed algorithm achieved high detection rates (DR), low false positive (FP) and low false negative (FN) for different types of network intrusions.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"73 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Function matching-based binary-level software similarity calculation","authors":"Yeo Reum Lee, Boojoong Kang, E. Im","doi":"10.1145/2513228.2513300","DOIUrl":"https://doi.org/10.1145/2513228.2513300","url":null,"abstract":"This paper proposes a method to calculate similarities of software without any source code information. The proposed method can be used for various applications such as detecting the source code theft and copyright infringement, as well as locating updated parts of software including malware. To determine the similarities of software, we used an approach that matches similar functions included in software. Our function-based matching process is composed of two steps. In step 1, the structural information of call graph in binary file is used to match functions, and the matched functions are not processed in step 2 to reduce the number of detailed matching. In step 2, by using instruction mnemonics, N-gram similarity-based matching is performed. Using the structural matching proposed in this paper, about 30% improvement in the matching performance is achieved with the four-tuple matching which also reduces the false positive rate compared to previous studies. Our other experimental results showed that, in comparison to source code-based approaches, our proposed method has only about 3% difference in similarity calculation with real software samples. Therefore, we argue that our proposed method makes a contribution in the field of binary-based software similarity calculation.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132244509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Image enhancement and post-processing for low-resolution compressed video","authors":"M. Kim, Beomsu Kim, Min-Cheol Hong","doi":"10.1145/2513228.2513257","DOIUrl":"https://doi.org/10.1145/2513228.2513257","url":null,"abstract":"This research paper recommends the PSF (Point Spread Function) prediction technique based on the POCS (Projection On to Convex Set) and regularization to acquire low resolution images. As the environment for the production of YouTube videos (one of the contents on the Internet) becomes widespread, resolution reduction and image distortion occurs, failing to satisfy users who desire high quality images. Accordingly, this research neutralizes the coding artifact through POCS and regularization processes by: 1) factoring the local characteristics of the image when it comes to the noise that results during the DCT and quantization process; and 2) removing the blocking and ring phenomena which are problems with existing video compression. Moreover, this research predicts the PSF in order to obtain low resolution images using the above--mentioned methods in order to suggest a method for minimizing the errors found among the predicted interpolation pixels. Low-resolution image quality obtained through the experiment demonstrates that significant enhancement was made on the visual level compared to the original image.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133045469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Barón, Margareth Alfonso, Pedro Enrique Jimenez
{"title":"Electronic systems integration of a locomotion rehabilitation platform with ANFIS simulation","authors":"A. Barón, Margareth Alfonso, Pedro Enrique Jimenez","doi":"10.1145/2513228.2513298","DOIUrl":"https://doi.org/10.1145/2513228.2513298","url":null,"abstract":"Locomotive medical devices that are used for performing non-invasive treatments on patients can achieve positive or negative effects on disease recovery; therefore controlling the monitoring of this equipment becomes the basic objective to achieve a successful physical recovery. This paper first shows how the hardware and software design of a Platform for Human Locomotion Rehabilitation allows for the construction of a compact and reliable machine to rehabilitate people with knee osteoarthritis, and it describes how the \"embedded programming\" is applied on the platform monitoring system itself. It then expounds on the development of combined Neural Networks and Fuzzy Systems to monitor and control the Rehabilitation Locomotive Platform. We conclude relating variables such as weight-bearing on a patient, the treadmill speed system and the ECG patient's heart rate which must be integrated in the programming process performed by ANFIS and the embedded software using digital processors DSPs.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116087215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Graph based M2M optimization in an IoT environment","authors":"Anand Paul","doi":"10.1145/2513228.2513287","DOIUrl":"https://doi.org/10.1145/2513228.2513287","url":null,"abstract":"In this paper, a graph based M2M optimization in an IoT environment is presented. A parallel reconfigurable M2M architecture with multiple dynamic reconfigurable unit in an IoT scenario is modeled using a directed acyclic graph (DAG) to represent the whole environment. Parallel M2M establish communication within the network and are partitioned and reconfigured dynamically for large scale network such as IoT. Simulation were performed for multiple M2M array for different state, timing and power consumption along with the scheduling scheme are considered.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Finding overlaps within regular expressions with variable-length gaps","authors":"Juan Mendivelso, Y. Pinzón, Inbok Lee","doi":"10.1145/2513228.2513299","DOIUrl":"https://doi.org/10.1145/2513228.2513299","url":null,"abstract":"Regular expressions play an important role in various fields in computer science. However, handling many regular expressions in parallel requires huge computation resources. Therefore, it is necessary to find and eliminate overlapping regular expressions. In this paper, we consider a special type of regular expressions: expressions comprised of characters and variable-length gaps between such characters. Specifically, we propose a bit-parallel solution to determine whether the languages of two expressions <i>X</i> and <i>Y</i> with variable-length gaps have a common string. The time complexity of our algorithm is <i>O</i> (min (<i>L</i><sub><i>X</i></sub> <sup>2</sup>|Σ|, <i>L</i><sub><i>X</i></sub> <i>L</i><sub><i>Y</i></sub>)/<i>w</i>) where Σ is the alphabet from which <i>X</i> and <i>Y</i> are drawn, <i>L</i><sub><i>X</i></sub> and <i>L</i><sub><i>Y</i></sub> are the lengths of the longest strings that respectively match <i>X</i> and <i>Y</i>, and <i>w</i> is the size of the computer word.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125003449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}