Demo Data from EDBT 2026 / reviewers in the wild / expert
Jih-Shyr Yih
dblp:32/4247
· DBLP profile ↗
10ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorComputer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
4 papers |
Hardware reliability and fault tolerance · 62% Electronic design automation · 34% Integrated circuit design · 4% | |
| Computer networks
1 paper |
Internet architecture and protocols · 56% Network optimization and economics · 44% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware reliability and fault tolerance › memory repair
built-in self-repair |
0.0 | 2 | 1993 | A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 Restructuring of square processor arrays by built-in self-repair circuit · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 |
Electronic design automation › physical design
circuit partitioning |
0.0 | 2 | 1990 | A neural network design for circuit partitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990 A Neural Network Design for Circuit Partitioning · DAC 1989 |
Internet architecture and protocols
local area network |
0.0 | 1 | 1993 | Network Access Fairness Control for Concurrent Traffic in Gigabit LANs · INFOCOM 1993 |
Network optimization and economics
resource allocation |
0.0 | 1 | 1993 | Network Access Fairness Control for Concurrent Traffic in Gigabit LANs · INFOCOM 1993 |
Hardware reliability and fault tolerance › fault-tolerant architecture
fault-tolerant processor arrays |
0.0 | 1 | 1993 | Restructuring of square processor arrays by built-in self-repair circuit · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 |
Hardware reliability and fault tolerance
memory repair |
0.0 | 1 | 1993 | A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 |
Hardware reliability and fault tolerance
reconfiguration |
0.0 | 1 | 1993 | Restructuring of square processor arrays by built-in self-repair circuit · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 |
Electronic design automation › physical design › circuit partitioning
bipartitioning |
0.0 | 1 | 1990 | A neural network design for circuit partitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990 |
Electronic design automation
physical design |
0.0 | 1 | 1990 | A neural network design for circuit partitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990 |
Internet architecture and protocols › local area network
ring network |
0.0 | 1 | 1993 | Network Access Fairness Control for Concurrent Traffic in Gigabit LANs · INFOCOM 1993 |
Hardware reliability and fault tolerance
memory yield enhancement |
0.0 | 1 | 1993 | A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 |
Integrated circuit design › VLSI design
VLSI yield enhancement |
0.0 | 1 | 1993 | A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993 |
Methods — techniques the papers use, named apart from their topics
neural network · 0.0simulation · 0.0maximum matching · 0.0hill-climbing · 0.0backpressure mechanism · 0.0fiduccia-mattheyses algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Data Center Hosting Services Governance Portal and Google Map-Based Collaborations
Jih-Shyr Yih, Yew-Huey Liu |
WISE | 1 |
| 2006 | A practical approach to extracting DTD-conforming XML documents from heterogeneous data sources
Shyh-Kwei Chen, Ming-Ling Lo, Kun-Lung Wu, Jih-Shyr Yih, Colleen Viehrig |
Inf. Sci. | 4 |
| 2004 | A practical experience in workspace separation for developing multiple storefronts on customized commerce engines
Shyh-Kwei Chen, Trieu C. Chieu, Shiwa S. Fu, Yew-Huey Liu, Florian Pinel, Jih-Shyr Yih |
J. Syst. Softw. | 6 |
| 2003 | Unified solution for procurement integration and B2B storesabstractEnterprise suppliers are faced with increasing complex tasks of enabling B2B stores to serve their enterprise customers for direct purchases and to support a large number of protocols in order to interoperate with various procurement systems. In this paper, we present a unified B2B solution that separates the integration process into two protocol-dependent and independent tasks with a 2-tier architecture to simplify the support of commerce functions for diverse access points. The first tier B2B gateway system handles all protocol related tasks such as handshaking with external networks and message format conversion. The second tier commerce engine executes commerce related tasks and provides protocol-independent shopping and ordering support for the B2B stores. Using a single sign-on mechanism and a unified shopping cart format in the commerce engine, our solution has streamlines the administrative processes associated with supporting and boarding new B2B buyers into the commerce engine. Trieu C. Chieu, Shiwa S. Fu, Florian Pinel, Jih-Shyr Yih |
ICEC | 4 |
| 1993 | Network Access Fairness Control for Concurrent Traffic in Gigabit LANsabstractA buffer insertion ring with network access fairness control for gigabit LANs is proposed. The basic buffer insertion ring has the maximum spatial reuse on the multiple ring segments by allowing concurrent traffic, but it suffers from the possibility of station starvation. To solve this problem, a notion of adjustable fairness based on mutual interference between pairs of stations in bandwidth usage is defined. The adjustable fairness definition serves as a basis for conditions to trigger backpressure signals. A cooperative backpressure mechanism is invented for flow regulation. The effectiveness of the proposed network access mechanism is demonstrated by comparisons with other buffer insertion rings based on simulations.> Jih-Shyr Yih, Chung-Sheng Li, Dilip D. Kandlur, Michael S. Yang |
INFOCOM | 1 |
| 1993 | A new built-in self-repair approach to VLSI memory yield enhancement by using neural-type circuitsabstractIt is shown how to represent the objective function of the memory repair problem as a neural-network energy function, and how to exploit the neural network's convergence property for deriving optimal repair solutions. Two algorithms have been developed using a neural network, and their performances are compared with that of the repair most (RM) algorithm. For randomly generated defect patterns, a proposed algorithm with a hill-climbing capability successfully repaired memory arrays in 98% cases, as opposed to RMs 20% cases. It is demonstrated how, by using very small silicon overhead, one can implement this algorithm in hardware within a VLSI chip for built in self repair (BISR) of memory arrays. The proposed auto-repair approach is shown to improve the VLSI chip yield by a significant factor, and it can also improve the life span of the chip by automatically restructuring its memory arrays in the event of sporadic cell failures during the field use.> Pinaki Mazumder, Jih-Shyr Yih |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 1993 | Restructuring of square processor arrays by built-in self-repair circuitabstractThe authors introduce two types of neural networks that can be integrated into array-type very-large-scale integration/wafer-scale integration (VLSI/WSI) chips, allowing them to restructure themselves automatically so that, in the presence of multiple random faults, the array circuits can perform their computations correctly. In the first implementation, the neural network is interconnected and programmed so that it can execute a maximum matching algorithm and thereby substitute appropriate fault-free spare elements for the faulty components. The second implementation rearranges the surviving fault-free processors to restore the logical structure, and it can adjust its interconnection complexity based on the quality of solution (i.e., performance) desired. These two approaches are compared with the traditional reconfiguration algorithms, and by simulation it is shown that the neural network techniques provide superior performance (i.e., higher survivability rates). It is also shown that the intrinsic fault-tolerant nature of neural networks provides a degradable reconfiguration control even in the presence of faulty neural network components.> Pinaki Mazumder, Jih-Shyr Yih |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 1990 | A novel built-in self-repair approach to VLSI memory yield enhancementabstractThe feasibility of implementing electronic neural networks as intelligent hardware for memory array repair is demonstrated. In particular, it is shown that the neural network control possesses a robust and degradable computing capability under various fault conditions. A yield analysis performed on 64K DRAMs shows that the yield can be improved from as low as 20% to near 99% owing to the self-repair design, with an overhead of no more than 7%. Simulation shows that the neural net algorithms are superior to the Repair Most algorithm.> Pinaki Mazumder, Jih-Shyr Yih |
ITC | 2 |
| 1990 | A neural network design for circuit partitioningabstractA neural network model is proposed for circuit bipartitioning. The massive parallelism of neural nets has been successfully exploited to balance the partitions of circuit and to reduce the external wiring between the partitions. The experimental results obtained by neural nets are found to be comparable with those achieved by the C.M. Fiduccia and R.M. Mattheyses (1982) algorithm. The proposed approach can be implemented in hardware to accelerate time-consuming partitioning procedures.> Jih-Shyr Yih, Pinaki Mazumder |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 1989 | A Neural Network Design for Circuit PartitioningabstractThis paper proposes a neural network model for circuit bipartitioning. The massive parallelism of neural nets has been successfully exploited to balance the partitions of a circuit and to reduce the external wiring between the partitions. The experimental results obtained by neural nets are found to be comparable with that achieved by Fiduccia and Mattheyses algorithm. Jih-Shyr Yih, Pinaki Mazumder |
DAC | 1 |