|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 老年病人冠脉搭桥手术的回顾性研究显示文摘本文对新加坡中央医院1992.1~1996.12月期间的62名75岁或以上行冠状动脉搭桥手术的病人进行了回顾性的研究。本组病人的平均年龄为77±2(75~85)岁。男女比例相同。平均搭桥3.1支。使用乳内动脉18例。使用胃网膜右动脉1例。手术成功率95%(59/62)。平均随访时间为2年。84%无症状存活;3例(5%)出院后心绞痛需药物治疗;7例(11%)于随访期间死亡:其中5例与心脏病无关,2例死于心力衰竭。因此,在熟练掌握CABG手术、谨慎选择病人的情况下,老年人行冠脉搭桥手术是安全的,其合并症和死亡率是可以接受的。 | 陶凉 陈廷毅 陈言森 蔡耀龙 S.Shankar 陈鸿义 | 1998 | 中国介入心脏病学杂志1998，6，2： | 1 |
| 2 | Arsenic and iron removal from water using constructed soil filter-a novel approach显示文摘 | Pravin Nemade Avinash M.Kadam Hariharan S.Shankar | | 0，，05： | 1 |
| 3 | Ensemble Based Learning with Accurate Motion Contrast Detection显示文摘Recent developments in computer vision applications have enabled detection of significant visual objects in video streams.Studies quoted in literature have detected objects from video streams using Spatiotemporal Particle Swarm Optimization(SPSOM)and Incremental Deep Convolution Neural Networks(IDCNN)for detecting multiple objects.However,the study considered opticalflows resulting in assessing motion contrasts.Existing methods have issue with accuracy and error rates in motion contrast detection.Hence,the overall object detection performance is reduced significantly.Thus,consideration of object motions in videos efficiently is a critical issue to be solved.To overcome the above mentioned problems,this research work proposes a method involving ensemble approaches to and detect objects efficiently from video streams.This work uses a system modeled on swarm optimization and ensemble learning called Spatiotemporal Glowworm Swarm Optimization Model(SGSOM)for detecting multiple significant objects.A steady quality in motion contrasts is maintained in this work by using Chebyshev distance matrix.The proposed system achieves global optimization in its multiple object detection by exploiting spatial/temporal cues and local constraints.Its experimental results show that the proposed system scores 4.8%in Mean Absolute Error(MAE)while achieving 86%in accuracy,81.5%in precision,85%in recall and 81.6%in F-measure and thus proving its utility in detecting multiple objects. | M.Indirani S.Shankar | 2023 | Intelligent Automation & Soft Computing2023，，2： | 0 |
| 4 | Semantic Based Greedy Levy Gradient Boosting Algorithm for Phishing Detection显示文摘The detection of phishing and legitimate websites is considered a great challenge for web service providers because the users of such websites are indistinguishable.Phishing websites also create traffic in the entire network.Another phishing issue is the broadening malware of the entire network,thus highlighting the demand for their detection while massive datasets(i.e.,big data)are processed.Despite the application of boosting mechanisms in phishing detection,these methods are prone to significant errors in their output,specifically due to the combination of all website features in the training state.The upcoming big data system requires MapReduce,a popular parallel programming,to process massive datasets.To address these issues,a probabilistic latent semantic and greedy levy gradient boosting(PLS-GLGB)algorithm for website phishing detection using MapReduce is proposed.A feature selection-based model is provided using a probabilistic intersective latent semantic preprocessing model to minimize errors in website phishing detection.Here,the missing data in each URL are identified and discarded for further processing to ensure data quality.Subsequently,with the preprocessed features(URLs),feature vectors are updated by the greedy levy divergence gradient(model)that selects the optimal features in the URL and accurately detects the websites.Thus,greedy levy efficiently differentiates between phishing websites and legitimate websites.Experiments are conducted using one of the largest public corpora of a website phish tank dataset.Results show that the PLS-GLGB algorithm for website phishing detection outperforms stateof-the-art phishing detection methods.Significant amounts of phishing detection time and errors are also saved during the detection of website phishing. | R.Sakunthala Jenni S.Shankar | 2022 | Computer Systems Science & Engineering2022，41，5： | 0 |
| 5 | Decision Tree Based Key Management for Secure Group Communication显示文摘Group communication is widely used by most of the emerging network applications like telecommunication,video conferencing,simulation applications,distributed and other interactive systems.Secured group communication plays a vital role in case of providing the integrity,authenticity,confidentiality,and availability of the message delivered among the group members with respect to communicate securely between the inter group or else within the group.In secure group communications,the time cost associated with the key updating in the proceedings of the member join and departure is an important aspect of the quality of service,particularly in the large groups with highly active membership.Hence,the paper is aimed to achieve better cost and time efficiency through an improved DC multicast routing protocol which is used to expose the path between the nodes participating in the group communication.During this process,each node constructs an adaptive Ptolemy decision tree for the purpose of generating the contributory key.Each of the node is comprised of three keys which will be exchanged between the nodes for considering the group key for the purpose of secure and cost-efficient group communication.The rekeying process is performed when a member leaves or adds into the group.The performance metrics of novel approach is measured depending on the important factors such as computational and communicational cost,rekeying process and formation of the group.It is concluded from the study that the technique has reduced the computational and communicational cost of the secure group communication when compared to the other existing methods. | P.Parthasarathi S.Shankar | 2022 | Computer Systems Science & Engineering2022，42，8： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员