Match Table Research Articles

High-Performance Reconfigurable Pipeline Implementation for FPGA-Based SmartNIC.

As the key module of programmable switches or the SmartNIC card, the packet processing pipeline undertakes the task of packet forwarding and processing. However, the current pipeline for the FPGA-based SmartNIC is inflexible, and the related reconfigurable commercial device designs are closed-source. To solve this problem, this paper proposes a high-performance reconfigurable pipeline design, which has fully reconfigurable match-action units, supporting various network functions by its flexible reconfiguration. The fields of the match key and the size of the match table can be reconfigured without recompiling the HDL code or modifying the hardware. The processing rules and action instructions for the pipeline can be dynamically installed by the configuration module at runtime. We implement our design on the Xilinx Alveo U200 board with a Virtex UltraScale+ XCU200-2FSGD2104E FPGA and show that the designed pipeline supports fast reconfiguration to implement new network functions and that the throughput of the designed pipeline reaches 100 Gbps with low latency.

Managing Safety Risks from Overlapping Construction Activities: A BIM Approach

Addressing safety risks in construction is an ongoing priority, and integrating safety considerations into construction scheduling is a crucial aspect of this effort. A notable challenge is the safety risk posed by concurrent tasks, which has received limited attention in prior research. This study aims to address this research gap by introducing a novel Building Information Modeling (BIM)-based model that assesses the increased hazardousness resulting from overlapping construction activities. Historically, research has predominantly focused on individual task safety, with less emphasis on the risks associated with overlapping activities. Our innovative approach introduces the concept of a ‘source–target’ match, which evaluates the degree of hazardousness escalation when activities overlap. Drawing on data from the Occupational Safety and Health Administration (OSHA) and the National Institute for Occupational Safety and Health (NIOSH) fatal accident reports, we extracted 11 hazardous and 9 susceptibility attributes to build a source–target match table. This table reveals the characteristics of activities that generate hazardous conflicts when overlapping. The key contribution of this research is the assessment, prioritization, and visualization of risk levels in a BIM environment. This framework empowers safety managers to proactively address safety risks resulting from overlapping construction activities, ultimately reducing accidents in the construction industry. By shedding light on this overlooked aspect of construction safety, our research highlights the importance of integrating safety considerations into construction scheduling and provides a practical tool for mitigating risks, enhancing workplace safety, and ultimately improving project outcomes.

A Programmable SRv6 Processor for SFC

A reconfigurable match table (RMT) is a programmable pipeline architecture for packet processing. In order to enable the programmable data plane to support segment routing IPv6 (SRv6) and other network protocols, this paper extends the deparser based on RMT. The paper uses the extended deparser and two RMT pipelines to build a protocol-independent network slice programmable data plane model named as the programmable SRv6 processor. We design it primarily for segment identifier (SID) processing of SRv6. We have proved that it can support SRv6, multiple semantics for SIDs, micro segment ID, multi-protocol label switching, and a service function chain (SFC). This architecture has broad application prospects. Experimental results on an FPGA showed that the extended deparser could achieve 100 Gbps throughput for 512B packets with few resources.

A self-adaptive programming mechanism for reconfigurable parsing and processing

In this paper, we present a self-adaptive programming mechanism (SAP) that targets programming hardware devices of reconfigurable parsing and processing. The SAP programming system locates in software of network data plane and has three features: (1) programmable packet parsing: the packet header format can be customized and new header type can be added; (2) reconfigurable packet processing: the match fields to be handled in each match table can be specified; (3) function-adaptive control: any function control systems can determine the packet processing flow independently without the need of knowing the specifics of the underlying hardware. Finally, we implement a prototype on NetFPGA-10G together with two representative function control systems (router and OpenFlow switch) to demonstrate how SAP works. We believe the data plane of reconfigurable parsing and processing will lead to future switches that provide greater flexibility, and unlock the potential of network function innovation.

The Graph Signature

Querying large data graphs has brought the attention of the research community. Many solutions were proposed, such as Oracle Semantic Technologies, Virtuoso, RDF3X, and C-Store, among others. Although such approaches have shown good performance in queries with medium complexity, they perform poorly when the complexity of the queries increases. In this paper, the authors propose the Graph Signature Index, a novel and scalable approach to index and query large data graphs. The idea is that they summarize a graph and instead of executing the query on the original graph, they execute it on the summaries. The authors' experiments with Yago (16M triples) have shown that e.g., a query with 4 levels costs 62 sec using Oracle but it only costs about 0.6 sec with their index. Their index can be implemented on top of any Graph database, but they chose to implement it as an extension to Oracle on top of the SEM_MATCH table function. The paper also introduces disk-based versions of the Trace Equivalence and Bisimilarity algorithms to summarize data graphs, and discusses their complexity and usability for RDF graphs.

ART2 알고리즘을 이용한 효율적인 스마트폰 어플리케이션 실행 방법

With probably too many smart phone applications downloaded, it is sometimes frustrating to find frequently used applications quickly. In this paper, we propose a learning application that learns what applications a user frequently uses and match them with several signals that user designated. This learning applications uses ART2 algorithm that is good for stable real-time learning. By executing this learning application, a user simply chooses an application that is to be quickly searched and then draw a figure that would match the designated application at the upper left corner of our learning application. The proposed learning application transforms the background with 0`s and the figure with 1`s and normalize them to be used as inputs for ART2 and ART2 does clustering to setup a match table between applications and figures. After learning, a user simply draws a figure to execute one`s frequently used application.

DETERMINING THE TECHNICAL STANDARDS OF PING PONG TABLE BY USING CLOSE RANGE PHOTOGRAMMETRY

Abstract. In the presented study, quality measurements were made regarding three different ping pong tables that were produced with three different materials. Measurements were made on the purpose of confirming whether the tables can be used as a match table that is in the standard of International Table Tennis Federation or not. For this confirmation, bouncing height of the table tennis ball is measured which is approved by ITTF. Average bouncing height that is required by federation standards is minimum 23 cm for free falling table tennis ball from 30 cm. In order to locate the bounce on the tables, the table tennis ball is released from 30cm in free fall with equipment was. In the meantime, 24 video frames videos were shot with a Full HD (1920 × 1080) camera. Each frame of videos that were taken is separated from each other. Each frame is analyzed and highest bounce is measured. As a result of the study, the bouncing heights of the three tables were measured as 23.04 cm, 23.33 cm, 22.91 cm for table1, for table2 and for table3 respectively.

Hierarchical Clustering of Shotgun Proteomics Data

A new result report for Mascot search results is described. A greedy set cover algorithm is used to create a minimal set of proteins, which is then grouped into families on the basis of shared peptide matches. Protein families with multiple members are represented by dendrograms, generated by hierarchical clustering using the score of the nonshared peptide matches as a distance metric. The peptide matches to the proteins in a family can be compared side by side to assess the experimental evidence for each protein. If the evidence for a particular family member is considered inadequate, the dendrogram can be cut to reduce the number of distinct family members.

A New Systematic Method for Optimal Heat Recovery Networks Design with Minimum Area and Exergy Loss

This study presents a new systematic technique for design of heat recoveiy network with minimum area and exergy loss. This method uses payback period as the decision variable to decide the best hot and cold stream matches. Based on the payback period, the minimum heat exchanger networks area which yields the minimum exergy loss will be obtained. The proposed technique begins with the construction of segregated curves on a temperature versus heat load diagram for all process streams to give preliminary information of all possible stream matches. The next step is to set up decision stream match table which uses payback period as the decision variable for streams matching. The final step of the procedure involves optimization the heat exchanger loops and paths. Application of the approach on a case study shows that better results can be achieved in terms of the total cost, utility cost, heat exchanger networks area and exergy loss as compared to the results obtained using conventional Pinch Technique.

무선전용 다중 언어의 번역을 지원하는 변환기의 구현

유선 환경에서 시작한 인터넷에 현재 존재하고 있는 웹 컨텐츠들을 모바일 환경에서 이용할 수 있게 하기 위하여 UP. Link 에서는 자동으로 HTML을 HDML로 번역해주는 기능을 가지고 있다. UP 브라우저에서 HTML 페이지를 억세스할 때 UP.Link 내의 에이전트는 번역기에게 HTML과 HDML 간의 번역을 처리하게끔 한다. I-Mode는 일본의 NTT-Docomo에서 개발 되었으며 이미 여러 가지 서비스를 통해 엄청난 컨텐츠를 보유하고 있다. Stinger 프로젝트에 의해 개발된 ME(Micro Explorer) 또한 많은 부가기능를 가지고 있다. 본 논문에서는 WAP에서 C-HTML과 mHTML의 컨텐츠를 수용할 수 있는 변환기를 설계하고 구현하였다. I-Mode의 C-HTML과 MS사의 ME는 HTML의 간이형으로 컨텐츠 제공 업자들이 다른 언어를 익힐 필요가 없으므로 WAP에 비해 컨텐츠 개발에 유리하다. C-HTML과 WML은 모두 모바일 환경에서 쓰이기 때문에 한 페이지 내에 제한되어 있는 용량 또한 비슷하다. 그러므로 C-HTML을 WML로, mHTML을 WML로 바꾸는 변환기를 개발하기 위해서 먼저 각 언어와 관련된 스펙을 분석하고 각각의 서로 대응되는 element를 찾아 표를 작성하고 난 후에 변환을 위한 알고리즘을 적용하여 변환기를 구현한다. 만약 대응되는 element가 없을 경우에는 WML에서 지원하는 여러 가지의 태그들을 조합하여 최대한 같은 형식으로 디스플레이 해줄 수 있는 방안을 제시한다. 편집기에서는 변환된 WML 소스를 컨텐츠 저작자가 클립 기능을 이용하여 다른 내용을 추가하거나 내용을 바꿀 수 있도록 지원한다. 구현 결과 약 90% 이상의 변환이 가능하다.장 높았고 비만군이 9.840점(표준편차 4.638)로 가장 낮았으며, 남자에서는 과체중군이 14.780점(표준편차 4.601), 여자에서는 저체중군이 12.284점(표준편차 4.604)으로 체형존중감이 가장 높았고, 남(평균 10.166점, 표준편차 4.246), 여(평균 8.772점, 표준편차 5.723) 모두 비만군에서 체형존중감이 가장 낮았다. 4. 비만도와 체형만족도 및 체형존중감과의 상관관계는 비만도와 체형만족도(r= -.2081, p= .000), 비만도와 체형존중감(r= -.2250, p= .000)은 유의한 역상관관계를 나타내어 비만도가 높을수록 체형만족도와 체형존중감이 낮았다. 5. 일반적 특성에 따른 비만상태는 전체에서는 성별(<TEX>$chi^2$</TEX>=88.136, p=.000), 체형에 대한 인식(<TEX>$chi^2$</TEX>=242.371, p= .000)에서, 남자에서는 부의 체형(<TEX>$chi^2$</TEX>=15.11, p= .019), 체형에 대한 인식(<TEX>$chi^2$</TEX>=138.95, p= .000)에서, 여자에서는 모의 학력(<TEX>$chi^2$</TEX>=19.46, p= .022), 체형에 대한 인식(<TEX>$chi^2$</TEX>=143.35, p= .000)에서 유의한 차이가 있었다. 전체에서 성별은 남자에서 비만은 21.4%, 여자에서 비만은 6.6%로 남자가 비만인 경우가 더 많았고, 체형에 대한 인식은 자신의 체형이 말랐다고 인식하는 경우 비만은 0.7%, 보통이라고 인식하는 경우 비만은 9.3%, 비만하다고 인식하는 경우 비만은 64.6%로 나타났다. 남자에서 부의 체형이 마른 경우 실제 비만인 학생은 21.20%, 보통인 경우 UP Link is One of the commercial product which converts HTML to HDML convertor in order to show the internet www contents in the mobile environments. When UP browser accesses HTML pages, the agent in the UP Link controls the converter to change the HTML to the HDML, I-Mode, which is developed by NTT-Docomo of Japan, has many contents through the long and stable commercial service. Micro Explorer, which is developed by Stinger project, also has many additional function. In this paper, we designed and implemented WAP convertor which can accept C-HTML contents and mHTML contents. C-HTML format by I-Mode is a subset of HTML format, mHTML format by ME is similar to C-HTML, So the content provides can easily develop C-HTML contents compared with WAP and the other case. Since C-HTML, mHTML and WML are used under the mobile environment, the limited transmission capacity of one page is also similar. In order to make a match table. After that, we apply conversion algorithm on it. If we can not find matched element, we arrange some tags which only can be supported by WML to display in the best shape. By the result, we can convert over 90% contents.

Cluster analysis of an extensive human breast cancer cell line protein expression map database.

In the current study, the protein expression maps (PEMs) of 26 breast cancer cell lines and three cell lines derived from normal breast or benign disease tissue were visualised by high resolution two-dimensional gel electrophoresis. Analysis of this data was performed with ChiClust and ChiMap, two analytical bioinformatics tools that are described here. These tools are designed to facilitate recognition of specific patterns shared by two or more (a series) PEMs. Both tools use PEMs that were matched by an image analysis program and locally written programs to create a match table that is saved in an object relational database. The ChiClust tool uses clustering and subclustering methods to extract statistically significant protein expression patterns from a large series of PEMs. The ChiMap tool calculates a differential value (either as percentage change or a fold change) and represents these graphically. All such differentials or just those identified using ChiClust can be submitted to ChiMap. These methods are not dependent on any particular commercial image analysis program, and the whole software package gives an integrated procedure for the comparison and analysis of a series of PEMs. The ChiClust tool was used here to order the breast cell lines into groups according to biological characteristics including morphology in vitro and tumour forming ability in vivo. ChiMap was then used to highlight eight major protein feature-changes detected between breast cancer cell lines that either do or do not proliferate in nude mice. Mass spectrometry was used to identify the proteins. The possible role of these proteins in cancer is discussed.