检索结果-内蒙古大学图书馆

IEEE workshop on High Performance Switching and Routing

作者： theophilus Wellem Yu-Kuen Lai Chao-Yuan Huang Wen-Yaw Chung Department of Informatics Satya Wacana Christian University Salatiga Indonesia Department of Electronic Engineering Chung Yuan Christian University Zhongli Taiwan Department of Electrical Engineering Chung Yuan Christian University Zhongli Taiwan

ISBN: (纸本)9781479989515

Sketch-based data streaming algorithms are used in many network traffic monitoring applications to obtain accurate estimates of traffic flow. However, the flexibility is limited as hardware implementation of sketch counters may not be re-used for different measurement tasks. In this paper, we develop a generic hardware infrastructure for collecting flow statistics. the purpose is to achieve the goal of adopting various sketch-based algorithms with arbitrary flow aggregations for monitoring applications and measurement tasks in a flexible manner. Multiple-choice hashing with linear probing scheme is utilized for high-speed counter update process. Simulation results based on real traffic traces for monitoring applications are presented. the proposed hardware infrastructure is implemented on the NetFPGA-10G platform. the system is capable of processing network traffic at 53 Gbps in a worst-case scenario of 64-byte minimum-sized Ethernet frame.

关键词： Radiation detectors Monitoring Probes Hardware Random access memory data structures IP networks

来源：评论

学校读者我要写书评

暂无评论

Crystal structures of carbonates Cs₂Sr₂(CO₃)₃ and Rb₂Sr₂(CO₃)₃ from powder data

引用

POWDER DIFFRACTION 2010年第3期25卷 S2-S6页

作者： Jin, S. F. Li, M. Guo, J. G. Wang, W. Y. Xu, Y. P. Chen, X. L. Chinese Acad Sci Beijing Natl Lab Condensed Matter Phys Inst Phys Beijing 100190 Peoples R China

Two carbonates Cs2Sr7(CO3)(3) and Rb2Sr2(CO3)(3) were synthesized by solid-state reaction at high temperatures, and their crystal structures were determined from X-ray powder diffraction data. Because of the presence of heavy atoms and heavy peak overlapping, proper restrains on light-atom groups were found essential to obtain satisfactory results. the title compounds are isostructural to an early reported compound Cs2Ba7(CO3)(3) and crystallize in cubic space group I2(1)3, with unit-cell dimensions a=-10.072 64(2) angstrom for the cesium phase and a=9.855 56(7) angstrom for the rubidium phase. Unlike most carbonates, the title compounds feature in mutually perpendicular CO3 atomic groups. Our results also indicate that the global instability index is a more sensitive parameter in evaluating the structure rationality over the agreement factors. Moreover, differential thermal analysis and thermogravimetric analysis measurements reveal that Cs2Sr7(CO3)(3) and Rb2Sr2(CO3)(3) are stable in air up to 796 and 880 degrees C, respectively. (C) 2010 international Centre for Diffraction data. [DOI: 10.1154/1.3478410]

关键词： carbonate X-ray diffraction Rietveld refinement thermal behavior

来源：评论

学校读者我要写书评

暂无评论

Clustering Alexa Internet data using Auto Encoder Network and Affinity Propagation

Clustering Alexa Internet Data using Auto Encoder Network an...

引用

international eConference on Computer and Knowledge Engineering (ICCKE)

作者： Ali Risheh Ashkan Goharfar Nastooh Taheri Javan Artificial Intelligence Laboratory AmirKabir university Tehran Iran

ISBN: (数字)9781728185668

ISBN: (纸本)9781728185675

Non-linear mapping is one of the most popular solutions for complex data structures and distinct patterns to cluster data. Auto encoder Networks (AENs) are widely used in clustering as they improve data representation. In this paper, we collect *** data by crawling popular websites profiles, where dataset has 84 columns with type number and array of words. Next, an AEN architecture is presented to identify specific websites with exceptional patterns and the encoded data expresses new feature space of our original data. (Our) Encoded data is clustered by Affinity Propagation which is a partitioning algorithm without the need for specifying the number of clusters. there are important results based on 194 clusters and exemplars which are filtered and analyzed. One remarkable fact about results is that the first 11 columns as raw data are not clustered by Affinity Propagation a which re considered all as outlier. the results are summarized by selecting the best option w.r.t. the statistics and charts. Some of the obtained results are useful for website owners and provide some suggestions and solutions for Search Engine Optimization (SEO). Finally, we propose our crawler application which crawls and records data over 4 days. It must be added that the proposed web crawler faces challenges and their solutions can be helpful in most commonly used web crawling algorithms and libraries.

关键词： Clustering algorithms Feature extraction Search engines Crawlers Optimization Internet Encoding

来源：评论

学校读者我要写书评

暂无评论

PSRna: Prediction of small RNA secondary structures based on reverse complementary folding method

引用

JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY 2016年第4期14卷 1643001-1643001页

作者： Li, Jin Xu, Chengzhen Wang, Lei Liang, Hong Feng, Weixing Cai, Zhongxi Wang, Ying Cong, Wang Liu, Yunlong Harbin Engn Univ Coll Automat Harbin Peoples R China Indiana Univ Sch Med Ctr Computat Biol & Bioinformat 410 West 10th StSuite 5000 Indianapolis IN 46202 USA

Prediction of RNA secondary structures is an important problem in computational biology and bioinformatics, since RNA secondary structures are fundamental for functional analysis of RNA molecules. However, small RNA secondary structures are scarce and few algorithms have been specifically designed for predicting the secondary structures of small RNAs. Here we propose an algorithm named "PSRna" for predicting small-RNA secondary structures using reverse complementary folding and characteristic hairpin loops of small RNAs. Unlike traditional algorithms that usually generate multi-branch loops and 50 end self-folding, PSRna first estimated the maximum number of base pairs of RNA secondary structures based on the dynamic programming algorithm and a path matrix is constructed at the same time. Second, the backtracking paths are extracted from the path matrix based on backtracking algorithm, and each backtracking path represents a secondary structure. To improve accuracy, the predicted RNA secondary structures are filtered based on their free energy, where only the secondary structure with the minimum free energy was identified as the candidate secondary structure. Our experiments on real data show that the proposed algorithm is superior to two popular methods, RNAfold and RNAstructure, in terms of sensitivity, specificity and Matthews correlation coefficient (MCC).

关键词： Small RNA PSRna reverse complementary fold secondary structure path matrix

来源：评论

学校读者我要写书评

暂无评论

Efficient compositing strategies for automotive HMI systems

Efficient compositing strategies for automotive HMI systems

引用

international Symposium on Industrial Embedded Systems

作者： Simon Gansel Stephan Schnitzer Riccardo Cecolin Frank Dürr Kurt Rothermel Christian Maihöfer System Architecture and Platforms Department Mercedes-Benz Cars Division Daimler AG Germany Institute of Parallel and Distributed Systems University of Stuttgart Germany

the relevance of graphical functions in vehicular applications has increased significantly during the last years. Modern cars are equipped with multiple displays used by different applications such as speedometer, navigation system, or media players. the rendered output of the applications is stored in so-called off-screen buffers and then bitblitted to the screen buffer at the respective window sizes and positions. To guarantee the visibility of the potentially overlapping windows, the compositing has to match the z-order of the windows. To this end, two common compositing strategies Tile compositing and Full compositing are used, each having performance issues depending on how windows overlap. Since automotive embedded platforms are restricted in power consumption, installation space, and hardware cost, their performance is limited which effectuates the need for highly efficient bitblitting. In order to increase the performance in compositing the windows, we propose Hybrid Compositing which predicts the required bitblitting time and chooses the most efficient strategy for each pair of overlapping windows. Using various scenarios we show that our approach is faster than the other strategies. In addition, we propose CacheHybrid Compositing which reduces the CPU execution time of our approach by up to 66 %. In case of an automotive scenario we show that our optimized approach saves up to 51% bitblitting time compared to existing approaches.

关键词： data structures Hardware Libraries Graphics Graphics processing units Predictive models Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-Assisted Resonance Response Prediction With data Augmentation

Machine Learning-Assisted Resonance Response Prediction With...

引用

international Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE)

作者： Qipeng Wang Zhongxuan Pang Di Gao Peng Liu Xuewei Zhang Xiaoyu Pang Xiaoxing Yin AVIC Research Institute for Special Structures of Aeronautical Composites Jinan China State Key Laboratory of Millimeter Waves Southeast University Nanjing China

ISBN: (数字)9798331533922

ISBN: (纸本)9798331533939

In this paper, a machine learning-assisted prediction model with data augmentation (DA-MLAP) is proposed for accurate resonance response prediction. Traditional multi-layer perceptrons (MLPs) normally struggle to accurately predict S-parameters in regions close to resonant frequencies due to limited data availability. To address this limitation, the DA-MLAP incorporates interpolation-based data augmentation to enhance the quality and diversity of the training dataset, particularly in resonance regions. Initially, a conventional MLP is employed to establish baseline predictions for the frequency and reflection coefficient (ISn!). Subsequently, an augmented dataset created through interpolation is used for a second prediction phase with the MLP. the effectiveness of the approach is validated by comparing predictions with actual| S11| values. Experiments are conducted using a probe-fed patch antenna and a cross-shaped slot frequency selective surface (FSS). Results indicate that the DA-MLAP significantly improves the prediction accuracy of resonant responses compared to traditional MLPs, offering a reliable method for applications in resonant filter, antenna, and single-layer frequency selective surface design.

关键词： Microwave antennas Frequency selective surfaces Accuracy Machine learning algorithms Patch antennas Resonant frequency data augmentation Prediction algorithms Resonance Microwave filters

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Frequent Pattern-Growth Algorithm with Dual Pruning using Modified Anti-Monotone Support

An Enhanced Frequent Pattern-Growth Algorithm with Dual Prun...

引用

IEEE international Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management

作者： Roseclaremath A. Caroro Ariel M. Sison Ruji P. Medina Technological Institute of the Philippines Graduate Program Quezon City Philippines Emilio Aguinaldo College School of ComputerStudies Manila Philippines

Pattern discovery does not only end when a process obtained a certain pattern. It also requires careful evaluation to show whether the pattern is significant enough to support any decision-making. Generating interesting frequent pattern is important to remove uninteresting and weak rules. the study, Dual Pruned Frequent Pattern-Growth (2P FP-Growth), enhanced the FP-Growth algorithm by performing the dual pruning of the itemsets before generating frequent patterns. the 2P FP-Growth algorithm first removed the itemsets not satisfying the minimum support count, which represent the first pruning. Consequently, the algorithm constructed the FP tree. Secondly, the 2P FP-Growth traverses each subtree, removing the nodes in a subtree that do not satisfy the minimum support count, constituting the second pruning. the second pruning process used the modified anti-monotone support constraint which removes the nodes in a subtree that do not meet with the minimum support count, but not the entire subtree. the confidence measure of the resulting frequent patterns of the 2P FP-Growth showed the most interesting frequent patterns with a confidence measure of 1.0, while obtaining the interdependency result of less than 1.0. the comparative result implies that the association rule's performance is negatively interdependent to its predicted response.

关键词： Itemsets data mining Classification algorithms Urban areas data structures

来源：评论

学校读者我要写书评

暂无评论

Interoperable Encoding and 3D Printing of Anatomical structures 23

Interoperable Encoding and 3D Printing of Anatomical Structu...

引用

Proceedings of the 2023 10th international Conference on Bioinformatics Research and Applications

作者： Amaury Fierens thibault Gregoir Sebastien Jodogne Institute for Information and Communication Technologies Electronics and Applied Mathematics (ICTEAM) UCLouvain Belgium Louvain School of Engineering (EPL) UCLouvain Belgium

ISBN: (纸本)9798400708152

the rendering and printing of 3D models of anatomical structures offers a wide range of promising applications in multiple medical disciplines, in the training of medical students, as well as in patient education. the growing use of such 3D models in the clinical routine will soon imply great challenges in terms of data management, data archiving, and data exchange, since the commonplace file formats for 3D printing are not designed to store medical information, or to refer to other medical resources. this paper explores the use of the DICOM standard so that 3D models can be stored alongside standard medical images, inside a unified hospital information system, with full medical traceability and technical interoperability. A free and open-source software pipeline is introduced to generate 3D models either from binary bitmap volumes that were produced by artificial intelligence algorithms, or from contours that were manually delineated by physicians, then to encapsulate the generated models as DICOM instances. Our pipeline also features a lightweight Web viewer that is suitable for rendering DICOM STL instances by any Web browser. the results demonstrate the effectiveness of the proposed approach, highlighting successful 3D model generation and printing.

关键词： 3D printing 3D visualization DICOM Organ segmentation

来源：评论

学校读者我要写书评

暂无评论

Point Enclosure Problem for Homothetic Polygons 1

引用

34th international workshop on Combinatorial algorithms (IWOCA)

作者： Akram, Waseem Saxena, Sanjeev Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 Uttar Pradesh India

ISBN: (数字)9783031343476

ISBN: (纸本)9783031343469;9783031343476

In this paper, we investigate the following problem: "given a set S of n homothetic polygons, preprocess S to efficiently report all the polygons of S containing a query point." A set of polygons is said to be homothetic if each polygon in the set can be obtained from any other polygon of the set using scaling and translating operations. the problem is the counterpart of the homothetic range search problem discussed by Chazelle and Edelsbrunner (Chazelle, B., and Edelsbrunner, H., Linear space data structures for two types of range search. Discrete & Computational Geometry 2, 2 (1987), 113-126). We show that after preprocessing a set of homothetic polygons with constant number of vertices, the queries can be answered in O(log n+k) optimal time, where k is the output size. the preprocessing takes O(n log n) space and time. We also study the problem in dynamic setting where insertion and deletion operations are also allowed.

关键词： Geometric Intersection algorithms data structures Dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

On-line hierarchy of general linear models for selecting and ranking the best predicted protein structures

On-line hierarchy of general linear models for selecting and...

引用

Annual international Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Hani Zakaria Girgis Jason J. Corso Daniel Fischer State University of New York University at Buffalo USA Computer Science Department Johns Hopkins University Baltimore MD USA Department of Computer Science and Engineering University of Buffallo Buffalo NY USA Department of Computer Science and Engineering State University of New York University at Buffalo Buffalo NY USA

To predict the three dimensional structure of proteins, many computational methods sample the conformational space, generating a large number of candidate structures. Subsequently, such methods rank the generated structures using a variety of model quality assessment programs in order to obtain a small set of structures that are most likely to resemble the unknown experimentally determined structure. Model quality assessment programs suffer from two main limitations: (i) the rank-one structure is not always the best predicted structure; in other words, the best predicted structure could be ranked as the 10th structure (ii) no single assessment method can correctly rank the predicted structures for all target proteins. However, because often at least some of the methods achieve a good ranking, a model quality assessment method that is based on a consensus of a number of model quality assessment methods is likely to perform better. We have devised the STPdata algorithm, a consensus method based on five model quality assessment programs. We have applied it to build an on-line ldquocustom-trainedrdquo hierarchy of general linear models to select and rank the best predicted structures. By ldquocustom-trainedrdquo, we mean for each target protein the STPdata algorithm trains a unique model on data related to the input target protein. To evaluate our method we participated in CASP8 as human predictors. In CASP8, the STPdata algorithm has trained 128 hierarchical models for each of the 128 target proteins. Based on the official results of CASP8 our method outperformed the best server by 6% and won the fourth position among human predictors. Our CASP results are purely based on computational methods without any human intervention.

关键词： Predictive models Quality assessment Protein engineering Humans Machine learning algorithms Computer science Testing USA Councils Drugs Food industry

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：