ppxscal/embedding_network huggingface dataset:
The Power of Collaboration: Using Internet-Based Tools to Facilitate Networking and Benchmarking Within a Consortium of Academic Health Centers
Authors: Eli J. Korner, Michael J. Oinonen, Robert C. Browne
Venue: Journal of Medical Systems (2003)

The University Health System Consortium (UHC) represents a strategic alliance of 169 academic health centers and associated institutions engaged in knowledge sharing and idea-generation. The use of the Internet as a tool in the delivery of UHC's products and services has increased dramatically over the past year and will continue to increase during the foreseeable future. This paper examines the current state of UHC-member institution driven tools and services that utilize the Web as a fundamental component in their delivery. The evolution of knowledge management at UHC, its management information and reporting tools, and expansion of e-commerce provide real world examples of Internet use in health care delivery and management. Health care workers are using these Web-based tools to help manage rising costs and optimize patient outcomes. Policy, technical, and organizational issues must be resolved to facilitate rapid adoption of Internet applications.
Corner block list: an effective and efficient topological representation of non-slicing floorplan
Authors: Xianlong Hong, Gang Huang, Yici Cai, Jiangchun Gu, Sheqin Dong, Chung Kuan Cheng, Jun Gu
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, a corner block list -- a new efficient topological representation for non-slicing floorplan is proposed with applications to VLSI floorplan and building block placement. Given a corner block list, it takes only linear time to construct the floorplan. Unlike the O-tree structure, which determines the exact floorplan based on given block sizes, corner block list defines the floorplan independent of the block sizes. Thus, the structure is better suited for floorplan optimization with various size configurations of each block. Based on this new structure and the simulated annealing technique, an efficient floorplan algorithm is given. Soft blocks and the aspect ratio of the chip are taken into account in the simulated annealing process. The experimental results demonstrate the algorithm is quite promising.
Extended Self Organizing Feature Map: A Tagged Potential Field Approach
Authors: Nazife Baykal, Aydan M. Erkmen
Venue: Neural Processing Letters (1999)

This paper proposes an escape methodology to the local minima problem of self organizing feature maps generated in the overlapping regions which are equidistant to the corresponding winners. Two new versions of the Self Organizing Feature Map are derived equipped with such a methodology. The first approach introduces an excitation term, which increases the convergence speed and efficiency of the algorithm, while increasing the probability of escaping from local minima. In the second approach, we associate a learning set which specifies the attractive and repulsive field of output neurons. Results indicate that accuracy percentile of the new methods are higher than the original algorithm while they have the ability to escape from local minima.
Correlation properties of an improved summation generator with 2-bit memory
Authors: Chi-Kwong Chan, L. M. Cheng
Venue: Signal Processing (2002)

Recently, Lee and Moon proposed an improved summation generator with 2-bit memory. By adding an extra bit of memory in the nonlinear combining function, the proposed generator is claimed to be secure against correlation attacks that the original summation generator suffers. In this paper, we show that the improved generator is still vulnerable to correlation attacks since there exists a high correlation between the input sequences and the output sequences.
Designing and Implementing a Fast Crossbar Scheduler
Authors: Pankaj Gupta, Nick McKeown
Venue: IEEE Micro (1999)

Crossbar switches are frequently used as the internal switching fabric of high-performance network switches and routers. However, an intelligent centralized scheduler is needed to configure the crossbar fairly and with high utilization. In this paper, we describe the design and implementation of a scheduling algorithm for configuring crossbars in input-queued switches that support virtual output queues and multiple precedence (priority) levels of unicast and multicast traffic). This design was carried out for the Tiny Tera prototype at Stanford University, a fast label-swapping packet switch supporting 32 ports, each operating at 10 Gb/s (OC192 line rate). The scheduler is designed to configure a crossbar once every 51ns. The scheduler implements the ESLIP scheduling algorithm which consists of multiple round-robin arbiters.
Application of Bipartite Graphs for Achieving Race-Free State Assignments
Authors: Chin-Long Wey, Jun-Woo Kang, P. David Fisher
Venue: IEEE Transactions on Computers (1995)

Achieving race-free state assignments is an important objective in the synthesis of asynchronous sequential logic circuits (ASLCs). Traditionally, adjacency diagrams are used to help identify and resolve race conditions; however, this approach has a high degree of computational complexity. This paper presents an efficient state assignment algorithm that utilizes a pattern matching technique to predict races and to eliminate the need for enumerative searches. More specifically, the race-free state assignment problem is formulated as the embedding of a bipartite connected graph onto an n-cube and achieves a near minimum number of state variables. This algorithm has been evaluated using several representative examples. Results show that the developed algorithm provides better performance than existing algorithms. Due to the simplicity of the bipartite representation of an n-cube, the developed algorithm is suitable for ASLC synthesis that may involve a relatively large number of states.
Status Report: Software Reusability
Authors: Rubén Prieto-Díaz
Venue: IEEE Software (1993)

It is argued that the problem with software engineering is not a lack of reuse, but a lack of widespread, systematic reuse. The reuse research community is focusing on formalizing reuse because it recognizes that substantial quality and productivity payoffs will be achieved only if reuse is conducted systematically and formally. The history of reuse, which is characterized by this struggle to formalize in a setting where pragmatic problems are the norm and fast informal solutions usually take precedence, is reviewed. Several reuse methods are discussed.
Selective Branch Inversion: Confidence Estimation for Branch Predictors
Authors: Artur Klauser, Srilatha Manne, Dirk Grunwald
Venue: International Journal of Parallel Programming (2001)

This paper describes a family of branch predictors that use confidence estimation to improve the performance of an underlying branch predictor. This method, referred to as Selective Branch Inversion (SBI), uses a confidence estimator to determine when the branch direction prediction is likely to be incorrect; branch decisions for these low-confidence branches are inverted. SBI with an underlying Gshare branch predictor outperforms other equal sized predictors such as the best history length Gshare predictor, as well as equally complex McFarling and Bi-Mode predictors. Our analysis shows that SBI achieves its performance through conflict detection and correction, rather than through conflict avoidance as some of the previously proposed predictors such as Bi-Mode and Agree. We also show that SBI is applicable to other underlying predictors, such as the McFarling Combined predictor. Finally we show that Dynamic Inversion Monitoring (DIM) can be used as a safeguard to turn off SBI in cases where it degrades the overall performance.
A Per Model of Secure Information Flow in Sequential Programs
Authors: Andrei Sabelfeld, David Sands
Venue: Higher-Order and Symbolic Computation (2001)

This paper proposes an extensional semantics-based formal specification of secure information-flow properties in sequential programs based on representing degrees of security by partial equivalence relations (pers). The specification clarifies and unifies a number of specific correctness arguments in the literature and connections to other forms of program analysis. The approach is inspired by (and in the deterministic case equivalent to) the use of partial equivalence relations in specifying binding-time analysis, and is thus able to specify security properties of higher-order functions and &ldquo;partially confidential data&rdquo;. We also show how the per approach can handle nondeterminism for a first-order language, by using powerdomain semantics and show how probabilistic security properties can be formalised by using probabilistic powerdomain semantics. We illustrate the usefulness of the compositional nature of the security specifications by presenting a straightforward correctness proof for a simple type-based security analysis.
Verification and Validation of Knowledge-Based Systems
Authors: Wei-Tek Tsai, Rama Vishnuvajjala, Du Zhang
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Knowledge-based systems (KBS) are being used in many applications areas where their failures can be costly because of the losses in services, property, or even life. To ensure their reliability and dependability, it is therefore important that these systems are verified and validated before they are deployed. This paper provides perspectives on issues and problems that impact the verification and validation (V&V) of KBS. Some of the reasons V&V of KBS is difficult are presented. The paper also provides an overview of different techniques and tools that have been developed for performing V&V activities. Finally, some of the research issues that are relevant for future work in this field are discussed.
PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry
Authors: S. R. Kulkarni, S. K. Mitter, J. N. Tsitsiklis, O. Zeitouni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An extension of the standard probably approximately correct (PAC) learning model that allows the use of generalized samples is introduced. A generalized sample is viewed as a pair consisting of a functional on the concept class together with the value obtained by the functional operating on the unknown concept. It appears that this model can be applied to a number of problems in signal processing and geometric reconstruction to provide sample size bounds under a PAC criterion. A specific application of the generalized model to a problem of curve reconstruction is considered, and some connections with a result from stochastic geometry are discussed.
Generalized Measures of Fault Tolerance in n-Cube Networks
Authors: A. D. Oh, H. A. Choi
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

It is shown that for a given p (math), the n-cube network can tolerate up to p2/sup(n-p)/-1 processor failures and remains connected provided that at most p neighbors of any nonfaulty processor are allowed to fail. This generalizes the result for p=n-1,obtained by A.-M Esfahanian (1989). It is also shown that the n-cube network withn greater than or equal to 5 remains connected provided that at most two neighbors of any processor areallowed to fail.
Building Agile Systems with Mobile Code
Authors: Todd Papaioannou, John Edwards
Venue: Autonomous Agents and Multi-Agent Systems (2001)

Mobile code has been championed as a solution to a plethora of software problems. This paper describes investigative work undertaken in order to evaluate the mobile code abstractions of Mobile Agents and Mobile Objects, and to understand the implications of using these abstractions to build distributed systems.We describe two systems built to support the Sales Order Process of a distributed manufacturing enterprise, using IBM's Aglets Software Development Kit. The Sales Order Process model and the requirements for agility used as the basis for these implementations are derived from data collected in an industrial case study.Both systems are evaluated using the Goal/Question/Metric methodology. Two new metrics for Semantic Alignment and Change Capability are presented and used to evaluate each system with respect to the degree of system agility supported. The systems are evaluated through a set of scenarios generated during the case study in an attempt to see if they support system integration and agility in the manufacturing domain. Further we examine the implications of using a mobile code abstraction when compared with the abstraction offered by traditional distribution technology.The work described provides evidence that both Mobile Agent and Mobile Object systems have inherent properties that can be used to build agile distributed systems. Further, Mobile Agents with their additional autonomy provide marginally greater support.
Evaluation of a Diagnosis Algorithm for Regular Structures
Authors: Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi
Venue: IEEE Transactions on Computers (2002)

The problem of identifying the faulty units in regularly interconnected systems is addressed. The diagnosis is based on mutual tests of units, which are adjacent in the "system graph" describing the interconnection structure. This paper evaluates an algorithm named EDARS (Efficient Diagnosis Algorithm for Regular Structures). The diagnosis provided by this algorithm is provably correct and almost complete with high probability. Diagnosis correctness is guaranteed if the cardinality of the actual fault set is below a "syndrome-dependent bound," asserted by the algorithm itself along with the diagnosis. Evaluation of EDARS relies upon extensive simulation which covered grids, hypercubes, and cube-connected cycles (CCC). Simulation experiments showed that the degree of the system graph has a strong impact over diagnosis completeness and affects the "syndrome-dependent bound," ensuring correctness. Furthermore, a comparative analysis of the performance of EDARS, with hypercubes and CCCs on one side and grids of the same size and degree on the other side, showed that diameter and bisection width of the system graph also influence the diagnosis correctness and completeness.
Hybrid-WSI: A Massively Parallel Computing Technology?
Authors: Claus M. Habiger, R. Mike Lea
Venue: Computer (1993)

It is argued that although it is not yet clear which of the two wafer scale integration (WSI) forms, monolithic or hybrid, will gain the lead to an enabling technology for second-generation massively parallel computers (MPCs), there are noticeably more backers for hybrid-WSI. The application requirements, implementation problems, and engineering issues of MPCs are discussed. In particular, the associative string processor (ASP) modules, which comprise building blocks for second-generation MPC configurations, are described. The progress reported in developing ASP modules is quantitatively extrapolated to other MPC implementations.
Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning
Authors: T. R. N. Rao, G. L. Feng, M. S. Kolluru, J. C. Lo
Venue: IEEE Transactions on Computers (1993)

Totally self-checking (TSC) Berger code checker designs are presented. The generalized Berger check partitioning is derived. It is proven that a TSC Berger code checker can be constructed from a TSC m-out-of-n checker. For a TSC Berger code checker design, no two-output checker exists for information length 2/sup r-1/, for any positive nonzero r. The presented approach solves this open problem.
Partial t-Spreads in PG(2t+1,q)
Authors: Klaus Metsch, L. Storme
Venue: Designs, Codes and Cryptography (1999)

This article first of all discusses the problem of the cardinality of maximal partial spreads in PG(3,q), q square, q>4. Let r be an integer such that 2r \leq q+1 and such that every blocking set of PG(2,q) with at most q+r points contains a Baer subplane. If S is a maximal partial spread of PG(3,q) with q^2+1-r lines, then r=s(\sqrt q+1) for an integer s\ge 2 and the set of points of PG(3,q) not covered byS is the disjoint union of s Baer subgeometriesPG(3,\sqrt{q}) . We also discuss maximal partial spreads in PG(3,p^3), p=p_0^h, p_0 prime, p_0 \geq 5, h \geq 1, p \neq 5. We show that if p is non-square, then the minimal possible deficiency of such a spread is equal to p^2+p+1, and that if such a maximal partial spread exists, then the set of points of PG(3,p^3) not covered by the lines of the spread is a projected subgeometryPG(5,p) in PG(3,p^3). In PG(3,p^3),p square, for maximal partial spreads of deficiency\delta \leq p^2+p+1 , the combined results from the preceding two cases occur. In the final section, we discuss t-spreads in PG(2t+1,q), q square or q a non-square cube power. In the former case, we show that for small deficiencies \delta, the set of holes is a disjoint union of subgeometries PG(2t+1,\sqrt{q}), which implies that \delta\equiv 0 \pmod{\sqrt{q}+1} and, when (2t+1)(\sqrt{q}-1) <q-1, that \delta \geq 2(\sqrt{q}+1). In the latter case, the set of holes is the disjoint union of projected subgeometries PG(3t+2,\sqrt[3]{q}) and this implies \delta \equiv 0 \pmod{q^{2/3}+q^{1/3}+1}. A more general result is also presented.
Three Decades of HDLs: Part II, Conlan Through Verilog
Authors: Dominique Borrione, Robert Piloty, Dwight Hill, Karl J. Lieberherr, Philip Moorby
Venue: IEEE Design Test (1992)

For pt.1 see ibid., June 1992. Current hardware description languages (HDLs) benefit from the efforts of designers of VHDLs in the mid-1970s through the late 1980s. The developers of four HDLs discuss their motivations and their views of how their work relates to the present very-high-speed integrated circuit HDLs (VHDLs). The languages discussed are Conlan, ADLIB/SABLE, Zeus, and Verilog.
Computationalism: New Directions
Authors: Matthias Scheutz
Venue:  (2002)

:Classical computationalism-the view that mental states are computational states-has come under attack in recent years. Critics claim that in defining computation solely in abstract, syntactic terms, computationalism neglects the real-time, embodied, real-world constraints with which cognitive systems must cope. Instead of abandoning computationalism altogether, however, some researchers are reconsidering it, recognizing that real-world computers, like minds, must deal with issues of embodiment, interaction, physical implementation, and semantics. This book lays the foundation for a successor notion of computationalism. It covers a broad intellectual range, discussing historic developments of the notions of computation and mechanism in the computationalist model, the role of Turing machines and computational practice in artificial intelligence research, different views of computation and their role in the computational theory of mind, the nature of intentionality, and the origin of language.
Dynamic Network Construction and Updating Techniques for the Diagnosis of Acute Abdominal Pain
Authors: G. M. Provan, J. R. Clarke
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Computing diagnoses in domains with continuously changing data is difficult but essential aspect of solving many problems. To address this task, a dynamic influence diagram (ID) construction and updating system (DYNASTY) and its application to constructing a decision-theoretic model to diagnose acute abdominal pain, which is a domain in which the findings evolve during the diagnostic process, are described. For a system that evolves over time, DYNASTY constructs a parsimonious ID and then dynamically updates the ID, rather than constructing a new network from scratch for every time interval. In addition, DYNASTY contains algorithms that test the sensitivity of the constructed network's system parameters. The main contributions are: (1) presenting an efficient temporal influence diagram technique based on parsimonious model construction; and (2) formalizing the principles underlying a diagnostic tool for acute abdominal pain that explicitly models time-varying findings.
On-the-Fly Rounding (Computing Arithmetic)
Authors: M. D. Ercegovac, T. Lang
Venue: IEEE Transactions on Computers (1992)

In implementations of operations based on digit-recurrence algorithms such as division, left-to-right multiplication and square root, the result is obtained in digit-serial form, from most significant digit to least significant. To reduce the complexity of the result-digit selection and allow the use of redundant addition, the result-digit has values from a signed-digit set. As a consequence, the result has to be converted to conventional representation, which can be done on-the-fly as the digits are produced, without the use of a carry-propagate adder. The authors describe three ways to modify this conversion process so that the result is rounded. The resulting operation is fast because no carry-propagate addition is needed. The schemes described apply also to online arithmetic operations.
Single-Chip H.324 Videoconferencing
Authors: Jeremiah Golston
Venue: IEEE Micro (1996)

The TMS320C82 is a powerful DSP optimized for multimedia processing in the cost-sensitive consumer and PC markets. This article provides an overview of the C82 architecture and briefly describes a C82 implementation of the ITU H.324 standard for videoconferencing over analog phone lines. The C82 provides system vendors the integration required by cost-sensitive markets while retaining the flexibility to add proprietary enhancements and adapt quickly to new standards.
Drug release from silicon polymer matrices containing an asmotic agent or a water-swelling additive
Authors: M. J. Abdekhodaie
Venue: Iranian Journal of Science and Technology (2002)

Potassium chloride, as an osmotic agent and poly methacrylic acid, as a water-swelling additive have been incorporated in polydimethyl siloxane. By using caffeine as a model drug, the results of release experiments from two systems have been compared. Because of osmotic rupturing pseudo-zero-order release kinetics preceded by marked burst effect were observed. Since osmotic pressure of PMAA is higher than that of KCl, drug release rate from PMAA-PDMS matrices is higher than that from KCl-PDMS matrices. Since KCl is release along with the drug, but PMAA is not, therefore water-swelling additives may provide efficient drug release without releasing undesirable substances.
Non-cooperative routing in loss networks
Authors: Eitan Altman, Rachid El Azouzi, Vyacheslav Abramov
Venue: Performance Evaluation (2002)

The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding to the case of a finite number of agents (such as service providers) that take routing decisions, and the Wardrop equilibrium, in which routing decisions are taken by a very large number of individual users. We show that these equilibria do not fall into the standard frameworks of non-cooperative routing games. As a result, we show that uniqueness of equilibria or even of utilizations at equilibria may fail even in the case of simple topology of parallel links. However, we show that some of the problems disappear in the case in which the bandwidth required by all connections is the same. For the special case of a parallel link topology, we obtain some surprisingly simple way of solving the equilibrium for both cases of Wardrop as well as Nash equilibrium.