An ITS Automated Vehicle is a vehicle equipped with an autopilot system, which is capable of driving from one point to another without input from a human operator (Driver). It is a proposed system depends on infrastructure-based guidance systems (i.e. systems embedded in or near the road itself), while more advanced systems propose to simulate human perception and decision-making during steering of a car via advanced computer software linked to a range of sensors such as cameras, radar and GPS. This paper tells us the architecture for the computer software used for ITS automated vehicle. This architecture helps to get indication to avoid collision from the front as well as from rear. It also helps for the lane Departure prevention and Blind spot Intervention of the vehicle. In this software architecture GPS system is used to get the actual position of the vehicle.
{"title":"Architecture for intelligent transport system for automated vehicle","authors":"N. Sanduja, P. Kaur","doi":"10.1145/2007052.2007096","DOIUrl":"https://doi.org/10.1145/2007052.2007096","url":null,"abstract":"An ITS Automated Vehicle is a vehicle equipped with an autopilot system, which is capable of driving from one point to another without input from a human operator (Driver). It is a proposed system depends on infrastructure-based guidance systems (i.e. systems embedded in or near the road itself), while more advanced systems propose to simulate human perception and decision-making during steering of a car via advanced computer software linked to a range of sensors such as cameras, radar and GPS. This paper tells us the architecture for the computer software used for ITS automated vehicle. This architecture helps to get indication to avoid collision from the front as well as from rear. It also helps for the lane Departure prevention and Blind spot Intervention of the vehicle. In this software architecture GPS system is used to get the actual position of the vehicle.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133764986","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}
The problem of agreement has been widely studied by many research groups in crash-stop as well as Byzantine model for distributed transaction systems. In one of our previous works [12], we assumed a trustworthy Transaction Manager, TM amenable to the job of view creation, detection of faulty primary as well as backup replicas, and to evacuate them from the transaction processing system. The TM provides an efficient failure-resiliency in the protocol; however, to eliminate the dependency on a single TM, later, we introduced the concept of Distributed Transaction Manager DTM [13], which distributes the responsibilities of TM among 3f+1(f are faulty) replicas. Both of the above mentioned protocols employ proactive approaches that is, essentially, preemptive in nature. It acts, in advance, in order to mitigate the tentative failures in the transaction processing system. The present article insinuates a system model to optimize the performance of DTM in terms of overall message overhead, latency, and throughput. A deterministic solution has been proposed to synchronize the processes via eventual bisource where the connecting links (incoming and outgoing) of at least one non-faulty process with all other processes is eventually timely.
{"title":"Efficient fault tolerant consensus using preemptive token","authors":"P. Saini, Awadhesh Kumar Singh","doi":"10.1145/2007052.2007064","DOIUrl":"https://doi.org/10.1145/2007052.2007064","url":null,"abstract":"The problem of agreement has been widely studied by many research groups in crash-stop as well as Byzantine model for distributed transaction systems. In one of our previous works [12], we assumed a trustworthy Transaction Manager, TM amenable to the job of view creation, detection of faulty primary as well as backup replicas, and to evacuate them from the transaction processing system. The TM provides an efficient failure-resiliency in the protocol; however, to eliminate the dependency on a single TM, later, we introduced the concept of Distributed Transaction Manager DTM [13], which distributes the responsibilities of TM among 3f+1(f are faulty) replicas. Both of the above mentioned protocols employ proactive approaches that is, essentially, preemptive in nature. It acts, in advance, in order to mitigate the tentative failures in the transaction processing system. The present article insinuates a system model to optimize the performance of DTM in terms of overall message overhead, latency, and throughput. A deterministic solution has been proposed to synchronize the processes via eventual bisource where the connecting links (incoming and outgoing) of at least one non-faulty process with all other processes is eventually timely.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116077499","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}
This paper presents a novel approach for Design Space Exploration (DSE) of integrated scheduling, allocation and binding in High Level Synthesis based on user specified power consumption and execution time constraints using multi structure Genetic Algorithm (GA). A pioneering effort has been made to explore the power-performance tradeoffs related to design of VLSI applications. The new cost function comprising of execution time is useful for data pipelined applications since it considers latency, cycle time (resulting from initiation interval) and number of sets of pipelined data. The GA based DSE initiates with a novel seeding process for parents as proposed in this paper which guarantees that the final solution will be optimal/near optimal. The proposed approach when verified for number of benchmarks yielded superior results in terms of power optimization and latency compared to a recent GA based approach. Moreover, the efficiency of the proposed approach was demonstrated by the fact that the experimental results also indicated the optimized performance (or execution time for pipelined data) as well as the optimal clock frequency for implementation which the current approach was unable to find.
{"title":"Integrated design space exploration based on power-performance trade-off using genetic algorithm","authors":"A. Sengupta, R. Sedaghat, Pallabi Sarkar","doi":"10.1145/2007052.2007068","DOIUrl":"https://doi.org/10.1145/2007052.2007068","url":null,"abstract":"This paper presents a novel approach for Design Space Exploration (DSE) of integrated scheduling, allocation and binding in High Level Synthesis based on user specified power consumption and execution time constraints using multi structure Genetic Algorithm (GA). A pioneering effort has been made to explore the power-performance tradeoffs related to design of VLSI applications. The new cost function comprising of execution time is useful for data pipelined applications since it considers latency, cycle time (resulting from initiation interval) and number of sets of pipelined data. The GA based DSE initiates with a novel seeding process for parents as proposed in this paper which guarantees that the final solution will be optimal/near optimal. The proposed approach when verified for number of benchmarks yielded superior results in terms of power optimization and latency compared to a recent GA based approach. Moreover, the efficiency of the proposed approach was demonstrated by the fact that the experimental results also indicated the optimized performance (or execution time for pipelined data) as well as the optimal clock frequency for implementation which the current approach was unable to find.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124766094","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}
Network as well as Host security has become an essential requirement to guard important network resources against unauthorized and unauthenticated access. The reason is that due to technology advancements, the threats and attacks are becoming all the more intelligent and insensitive to existing security measures implemented by an Network Intrusion Detection System or Network Intrusion Detection and Prevention System (NIDS/NIDPS). The paper aims to describe how a novice approach helps to implement quota-based security policy for applications running inside the network. It also helps to identify applications as an attacker or a victim and provide elaborate logging to help administrator thwart an attack. Our system introduces three main modules: Event Collector, Network Interceptor and Administrative Server. Together, they identify an attack with help of NIDS along with the name and version of the attacker and victim applications that we try to protect. This paper describes the work we have done in the application connection and event logging part. In the connection log, we maintain application connection information. The connection log information contains start and release time of connection, upload and download data. This information is used to implement a quota-based application access policy with the organization. In this way, we achieve network access control. In the event logger, we first classify an application as an attacker and a victim. When an application attacks a vulnerable client or server on the network, our system identifies this threat and maintains an event log of the same. In addition, if any host from our network tries to land an attack on any application outside the network, our system identifies such applications as threat to the network. An event log is also maintained for such attacker applications within the network. The event log contains information such as Source and Destination IP, application name and version, timestamp etc. This event log is used to generate administrative reports. The administrator, to take corrective measures for such applications, uses these reports.
{"title":"Security policy implementation using connection and event log to achieve network access control","authors":"Shalvi Dave, J. Mahadevia, Bhushan Trivedi","doi":"10.1145/2007052.2007059","DOIUrl":"https://doi.org/10.1145/2007052.2007059","url":null,"abstract":"Network as well as Host security has become an essential requirement to guard important network resources against unauthorized and unauthenticated access. The reason is that due to technology advancements, the threats and attacks are becoming all the more intelligent and insensitive to existing security measures implemented by an Network Intrusion Detection System or Network Intrusion Detection and Prevention System (NIDS/NIDPS). The paper aims to describe how a novice approach helps to implement quota-based security policy for applications running inside the network. It also helps to identify applications as an attacker or a victim and provide elaborate logging to help administrator thwart an attack. Our system introduces three main modules: Event Collector, Network Interceptor and Administrative Server. Together, they identify an attack with help of NIDS along with the name and version of the attacker and victim applications that we try to protect. This paper describes the work we have done in the application connection and event logging part. In the connection log, we maintain application connection information. The connection log information contains start and release time of connection, upload and download data. This information is used to implement a quota-based application access policy with the organization. In this way, we achieve network access control. In the event logger, we first classify an application as an attacker and a victim. When an application attacks a vulnerable client or server on the network, our system identifies this threat and maintains an event log of the same. In addition, if any host from our network tries to land an attack on any application outside the network, our system identifies such applications as threat to the network. An event log is also maintained for such attacker applications within the network. The event log contains information such as Source and Destination IP, application name and version, timestamp etc. This event log is used to generate administrative reports. The administrator, to take corrective measures for such applications, uses these reports.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115971573","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}
In Cloud Computing Architecture, Brokers are responsible for providing applications to end user from Clouds. To manage Broker Cloud Communication, an efficient management infrastructure is required which also take care for cost and time to get application services. In this paper, an Efficient Broker Cloud Management (BCM), a system which works in Broker Cloud Communication Paradigm (BCCP) has been proposed to find a communication link with minimum cost of link uses between broker and cloud. An algorithm, Optimum Route Cost Finder (ORCF) has been proposed for finding optimum route between broker and cloud on the behalf of cost factor. Different VM Scheduling and VMM Allocation policies are analyzed in here which help in executing Cloudlets over VMs to select best policy for BCM System. Furthermore, this paper provided the analysis of processing cost and total execution cost on the bases of Hops Count, Bandwidth, Network Delay or Combined Approach. By using Bandwidth-Delay Product (BDP), It also analyze the link capacity. ORCF help in analyzing the processing cost and link uses cost of executing whole task and identify the total execution cost for broker.
在云计算体系结构中，代理负责从云向最终用户提供应用程序。为了管理Broker Cloud通信，需要一个有效的管理基础设施，它还需要考虑获得应用程序服务的成本和时间。本文提出了一种高效的Broker Cloud Management (BCM)系统，它是一种基于Broker Cloud Communication Paradigm (BCCP)的系统，用于在Broker和Cloud之间寻找链路使用成本最小的通信链路。提出了一种基于成本因子寻找代理与云之间最优路由的算法——最优路由成本查找器(ORCF)。本文分析了不同的VM调度和VMM分配策略，这些策略有助于在VM上执行Cloudlets，从而为BCM系统选择最佳策略。在此基础上，给出了基于跳数、带宽、网络延迟或组合方法的处理成本和总执行成本分析。利用带宽延迟积(BDP)对链路容量进行了分析。ORCF有助于分析执行整个任务的处理成本和链接使用成本，并确定代理的总执行成本。
{"title":"An efficient broker cloud management system","authors":"G. Raj","doi":"10.1145/2007052.2007067","DOIUrl":"https://doi.org/10.1145/2007052.2007067","url":null,"abstract":"In Cloud Computing Architecture, Brokers are responsible for providing applications to end user from Clouds. To manage Broker Cloud Communication, an efficient management infrastructure is required which also take care for cost and time to get application services. In this paper, an Efficient Broker Cloud Management (BCM), a system which works in Broker Cloud Communication Paradigm (BCCP) has been proposed to find a communication link with minimum cost of link uses between broker and cloud. An algorithm, Optimum Route Cost Finder (ORCF) has been proposed for finding optimum route between broker and cloud on the behalf of cost factor. Different VM Scheduling and VMM Allocation policies are analyzed in here which help in executing Cloudlets over VMs to select best policy for BCM System. Furthermore, this paper provided the analysis of processing cost and total execution cost on the bases of Hops Count, Bandwidth, Network Delay or Combined Approach. By using Bandwidth-Delay Product (BDP), It also analyze the link capacity. ORCF help in analyzing the processing cost and link uses cost of executing whole task and identify the total execution cost for broker.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116418409","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}
Text mining is a field that automatically extracts previously unknown and useful information from unstructured textual data. It has strong connections with natural language processing. NLP has produced technologies that teach computers natural language so that they may analyze, understand and even generate text. Topic tracking is one of the technologies that has been developed and can be used in the text mining process. The main purpose of topic tracking is to identify and follow events presented in multiple news sources, including newswires, radio and TV broadcasts. It collects dispersed information together and makes it easy for user to get a general understanding. In this paper, a survey of recent topic tracking techniques is presented.
{"title":"Topic tracking techniques for natural language processing","authors":"K. Kaur","doi":"10.1145/2007052.2007066","DOIUrl":"https://doi.org/10.1145/2007052.2007066","url":null,"abstract":"Text mining is a field that automatically extracts previously unknown and useful information from unstructured textual data. It has strong connections with natural language processing. NLP has produced technologies that teach computers natural language so that they may analyze, understand and even generate text. Topic tracking is one of the technologies that has been developed and can be used in the text mining process. The main purpose of topic tracking is to identify and follow events presented in multiple news sources, including newswires, radio and TV broadcasts. It collects dispersed information together and makes it easy for user to get a general understanding. In this paper, a survey of recent topic tracking techniques is presented.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"72 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130315266","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}
Ant algorithms and swarm intelligence systems have been offered as a novel computational approach that replaces the traditional emphasis on control, preprogramming and centralization with designs featuring autonomy, emergence and distributed functioning. These designs provide scalable, flexible and robust, able to adapt quickly changes to changing environments and to continue functioning even when individual elements fail. These properties make swarm intelligence very attractive for mobile ad hoc networks. These algorithms also provide potential advantages for conventional routing algorithms. Ant Colony Optimization is popular among other Swarm Intelligence Techniques.In this paper a detailed comparison of different Ant based algorithms is presented. The comparative results will help the researchers to understand the basic differences among various existing Ant colony based routing algorithms.
{"title":"Analysis of various swarm-based & ant-based algorithms","authors":"A. Gupta, A. Verma, H. Sadawarti","doi":"10.1145/2007052.2007061","DOIUrl":"https://doi.org/10.1145/2007052.2007061","url":null,"abstract":"Ant algorithms and swarm intelligence systems have been offered as a novel computational approach that replaces the traditional emphasis on control, preprogramming and centralization with designs featuring autonomy, emergence and distributed functioning. These designs provide scalable, flexible and robust, able to adapt quickly changes to changing environments and to continue functioning even when individual elements fail. These properties make swarm intelligence very attractive for mobile ad hoc networks. These algorithms also provide potential advantages for conventional routing algorithms. Ant Colony Optimization is popular among other Swarm Intelligence Techniques.In this paper a detailed comparison of different Ant based algorithms is presented. The comparative results will help the researchers to understand the basic differences among various existing Ant colony based routing algorithms.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127498200","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}
The progression of interleaved domains like software engineering, natural language processing, artificial intelligence, programming languages and cloud computing has resulted in evolution of concept called semantic computing. Semantic computing is responsible drilling out the requisite information and semantically analyzes the same for efficient machine training and logic development purposes. Ontology based semantic web services are indispensible for the success of the semantic computing. One can deploy cloud computing to bridge gap between distributed data sources and their use through web services
{"title":"Semantic web services in clouds for semantic computing","authors":"G. S. Kang, Jaiteg Singh, M. Khanna","doi":"10.1145/2007052.2007100","DOIUrl":"https://doi.org/10.1145/2007052.2007100","url":null,"abstract":"The progression of interleaved domains like software engineering, natural language processing, artificial intelligence, programming languages and cloud computing has resulted in evolution of concept called semantic computing. Semantic computing is responsible drilling out the requisite information and semantically analyzes the same for efficient machine training and logic development purposes. Ontology based semantic web services are indispensible for the success of the semantic computing. One can deploy cloud computing to bridge gap between distributed data sources and their use through web services","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124647293","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}
Pub Date : 1900-01-01DOI: 10.1007/978-3-031-24349-3_8
M. Evrard
{"title":"Transformers in Automatic Speech Recognition","authors":"M. Evrard","doi":"10.1007/978-3-031-24349-3_8","DOIUrl":"https://doi.org/10.1007/978-3-031-24349-3_8","url":null,"abstract":"","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125522713","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}
Pub Date : 1900-01-01DOI: 10.1007/978-3-031-24349-3_6
François Yvon
{"title":"Transformers in Natural Language Processing","authors":"François Yvon","doi":"10.1007/978-3-031-24349-3_6","DOIUrl":"https://doi.org/10.1007/978-3-031-24349-3_6","url":null,"abstract":"","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131264320","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：