ppxscal/embedding_network huggingface dataset:
Smart Nonlinear Diffusion: A Probabilistic Approach
Authors: Yufang Bao, Hamid Krim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, a stochastic interpretation of nonlinear diffusion equations used for image filtering is proposed. This is achieved by relating the problem of evolving/smoothing images to that of tracking the transition probability density functions of an underlying random process. We show that such an interpretation of, e.g., Perona-Malik equation, in turn allows additional insight and sufficient flexibility to further investigate some outstanding problems of nonlinear diffusion techniques. In particular, upon unraveling the limitations as well as the advantages of such an equation, we are able to propose a new approach which is demonstrated to improve performance over existing approaches and, more importantly, to lift the longstanding problem of a stopping criterion for a nonlinear evolution equation with no data term constraint. Substantiating examples in image enhancement and segmentation are provided.
Software-based self-test and diagnosis for processors and system-on-chips
Authors: Li Chen
Venue:  (2003)

The rising cost of high-end testers and the need for systematic test generation methods capable of achieving high fault coverage drive the microprocessor industry's migration from functional test to structural test approaches such as scan testing. At the same time, the practice of at-speed functional test remains an irreplaceable part of microprocessor tests due to its unique benefits in testing speed defects, but cannot be continued in its present form due the associated high cost. To address this problem, we propose a new self-test paradigm, Software-Based Self-Test (SBST), for testing microprocessors and System-on-Chips (SoCs) containing embedded processors. To allow at-speed tests using low-cost testers, SBST enables processor self-test using a software tester embedded in the on-chip memory. The software tester consists of processor instructions and is generated using a divide-and-conquer approach that enables the systematic generation of instruction-level tests with high coverage on structural faults. We achieve this goal by (i) partitioning the processor-under-test into modules manageable by automatic test pattern generation (ATPG) algorithms, (ii) generating tests at the module level targeting at structural faults, and (iii) delivering tests to the module-under-test (MUT) using processor instructions. The use of instruction-imposed constraints bridges the gap between instruction-level test application and module-level test generation, while a novel simulation-based method is used to extract the constraints, requiring no architectural knowledge of the processor-under-test. We have automated the entire test generation process and successfully demonstrated it on two processors, including a commercial state-of-the-art embedded processor, the Xtensa&trade; processor from Tensilica Inc. In addition to detecting stuck-at faults within the processor, we extend the application of SBST in two directions. (i) We explore the fault diagnosis capability of SBST by systematically constructing a large number of diagnosis test programs capable of achieving a high diagnostic resolution on an overwhelming majority of faults in the processor. (ii) We extend SBST to test for crosstalk errors on system-level interconnects by utilizing the signal transitions occurring on the interconnects during the execution of instructions. The two extensions of SBST have been successfully demonstrated on a processor example and a processor-memory system.
Resource management and allocation in computer and communication networks
Authors: Ding Zhu Du
Venue:  (2003)

This thesis focuses on the design and application of approximation algorithms in computer and communication systems. Many problems in these computer and communication systems are known as NP-hard in combinatorial computation complexity theory. Several of them can be solved approximately using a common approximation theory approach: the combination of greedy, linear programming and randomization. We first extended the known approximation techniques and then applied the technique to several chosen problems. Multifiber wavelength assignment problem is in optical communication infrastructure area, we applied the combined technique above and ran simulation based on the NSFNet and a randomly generated topology. Criticality driven session admission in Enterprise Resource Management Software is another example in computer software system that benefits from the proposed technique. Further, we applied the technique in communication network protocol design area and obtained best know result so far in balancing the cost and performance in minimum cost QoS multicasting. Finally, we proposed a new polynomial time approximation algorithm to solve the operational version of Wavelength Assignment Problem. The new algorithm is in graph coloring form but is based on the core of Dantzig's simplex method: optimal is within the extreme points. We show that the computation complexity of this approach is O(N2W), which is as good as the existing sequential greedy algorithm in theory. Further, the simulation on randomly generated data set as well as NSFNet data set support the conclusion that the approximation factor of the proposed algorithm is close to that of the existing one.
Causality tracking in causal message-logging protocols
Authors: Lorenzo Alvisi, Karan Bhatia, Keith Marzullo
Venue: Distributed Computing (2002)

Casual message-logging protocols have several attractive properties: they introduce no blocking, send no additional messages over those sent by the application, and never create orphans. Causal message logging, however, does require the casual effects of the deliveries of messages to be tracked. The information concerning causality tracking is piggybacked on application messages, and the amount of such information can become large.In this paper we study the cost of tracking causality in causal message-logging protocols. One can track causality as accurately as possible, but to do so requires piggybacking a considerable amount of additional information. One can reduce the amount of piggybacked information on each message by reducing the accuracy of causality tracking. But then, causal message logging may piggyback the reduced amount of information on more messages.We specify six different methods of tracking causality, each representing a natural choice based on the specification of causal message logging. We describe how these six methods can be implemented and compare them in terms of how large of a piggyback load they impose. This load depends on the application that is using causal message logging. We characterize some applications for which a given method has the smallest piggyback load, and study using simulation the size of the piggyback load for two different models of applications.
HyperThesis: the gRNA spell on the curse of bioinformatics applications integration
Authors: Sourav S. Bhowmick, Vivek Vedagiri, Amey Laud
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper, we describe a graphical workflow management system called HyperThesis to address the challenges of integrating bioinformatics applications. HyperThesis is an integral component of the Genomics Research Network Architecture (gRNA). The gRNA was designed and developed to address the challenges of developing new bioinformatics applications. Specifically, HyperThesis makes constructing workflows (pipelines of execution of applications) in the gRNA fast and intuitive for biologists and bio-programmers alike. It provides a large repository of interconnectable, parameterized workflow components for processing and relating diverse biological data and software programs. It also enables us to add new workflow components as new algorithms develop in ones area of interest. HyperThesis has been fully implemented using Java.
Modeling the adaptive visual system: a survey of principled approaches
Authors: Lars Schwabe, Klaus Obermayer
Venue: Neural Networks (2003)

Modeling the visual system can be done at multiple levels of description ranging from computer simulations of detailed biophysical models to firing rate and so-called 'black-box' models. Re-introducing David Marr's analysis levels for the visual system, we motivate the use of more abstract models in order to answer the question of what the visual system is computing. The approaches we selected to review in this article concentrate on modeling the changes of sensory representations. The considered time-scales, range from the developmental time-scale of receptive field formation to fast transient neuronal dynamics during a single stimulus presentation. Common to all approaches is their focus on providing functional interpretations, instead of 'only' explanations in terms of mechanisms. Although the concrete approaches can be distinguished along different lines, a common theme is emerging which may qualify as a paradigm for providing functional interpretations for changes of receptive field properties, i.e. the dynamic adjustment of sensory representations to varying external or internal conditions.
Fractional Rate Dataflow Model for Efficient Code Synthesis
Authors: Hyunok Oh, Soonhoi Ha
Venue: Journal of VLSI Signal Processing Systems (2004)

Automatic code synthesis from dataflow program graphs is a promising high-level design methodology for rapid prototyping of multimedia embedded systems. Memory efficient code synthesis from dataflow models has been an active research subject to reduce the gap in terms of memory requirements between the synthesized code and the hand-optimized code. However, existent dataflow models have inherent difficulty of efficiently handling data structures. In this paper, we propose a new dataflow extension called fractional rate dataflow (FRDF) in which fractional number of samples can be produced and consumed. In the proposed FRDF model, a constituent data type is considered as a fraction of the composite data type. Existent integer rate dataflow models can be easily extended to incorporate the fractional rates without loosing analytical properties. In this paper, the SDF model is extended to include FRDF, which can reduce the buffer memory requirements significantly, up to 70%, for some multimedia applications. Extended SDF model with fractional rate has been implemented in our system design environment called PeaCE(Ptolemy extension as Codesign Environment).
Identification and Modeling of Nonlinear Dynamic Behavior in Analog Circuits
Authors: Xiaoling Huang, H. Alan Mantooth
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a new approach for identifying nonlinear dynamic behavior in analog circuits. The approach facilitates the creation of models that more accurately reflect the dynamic behavior of a circuit. It has been used in a fully automated, behavioral modeling tool,Ascend, that starts from the netlist description of the circuit and generates differential algebraic equation (DAE) based behavioral models. The underlying modeling approach is overviewed to provide a context for this research. Some demonstrative test results illustrate the effectiveness of the new method.
ARTiFACIAL: automated reverse turing test using FACIAL features
Authors: Yong Rui, Zicheg Liu
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Web services designed for human users are being abused by computer programs (bots). The bots steal thousands of free email accounts in a minute; participate in online polls to skew results; and irritate people by joining online chat rooms. These real-world issues have recently generated a new research area called Human Interactive Proofs (HIP), whose goal is to defend services from malicious attacks by differentiating bots from human users. In this paper, we propose a new HIP algorithm based on detecting human face and facial features. Human faces are the most familiar object to humans, rendering it possibly the best candidate for HIP. We conducted user studies and showed the ease of use of our system to human users. We designed attacks using the best existing face detectors and demonstrated the difficulty to bots.
Fonctions de partitions &#x00E0; parit&#x00E9; p&#x00E9;riodique
Authors: Houda Lahouar
Venue: European Journal of Combinatorics (2003)

Let N be the set of positive integers and A a subset of N. For n ∈ N, let p(A, n) denote the number of partitions of n with parts in A. In the paper J. Number Theory 73 (1998) 292, Nicolas et al. proved that, given any N ∈ N and B ⊂ {1, 2,...,N}, there is a unique set A = A0(B, N), such that p(A, n) is even for n > N. Soon after, Ben Saïd and Nicolas (Acta Arith. 106 (2003) 183) considered σ (A, n) = Σd\n,d ∈ Ad, and proved that for all k ≥ 0, the sequence (σ(A, 2kn) mod 2k+1)n≥1 is periodic on n. In this paper, we generalise the above works for any formal power series f in F2[z] with f (0) = 1, by constructing a set A such that the generating function fA of A is congruent to f modulo 2, and by showing that if f = P/Q, where P and Q are in F2[z] with P(0) = Q(0) = 1, then for all k ≥ 0 the sequence (σ (A, 2kn) mod 2k+1)n≥1 is periodic on n.
Matching planar maps
Authors: Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
Venue: Journal of Algorithms (2003)

The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic information systems, etc. More precisely, we define feasible distance measures that reflect how close a given pattern H is to some part of a larger pattern G. These distance measures are generalizations of the well-known Fréchet distance for curves. We first give an efficient algorithm for the case that H is a polygonal curve and G is a geometric graph. Then, slightly relaxing the definition of distance measure, we give an algorithm for the general case where both, H and G, are geometric graphs.
Towards Trusted Online Dissemination of Consumer Information
Authors: Mohamed Eltoweissy, M. Hossain Heydari, Linda Morales, I. Hal Sudborough
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Given the growing number of electronic services and their applications in many existing andevolving domains, such as e-tail and e-medicine, much recent attention has been focused on the collection, maintenance, and dissemination of personal information by electronic service providers (ESPs). Often, information is gathered without the active involvement of the consumers, who may be unaware of the nature of the data collected or the purposes for which these data will be used. Techniques such as cookies generally are implemented on the browsers without permission from the targeted consumer. In this paper, we propose a newframework for information dissemination to ESPs using secure communication of consumer-controlled information via trusted information distribution (TID) services. A TID service gathers information based on consumer consent and consumer-controlled profile thendisseminates relevant information to targeted groups of ESPs. Using encryption and a group key management scheme, our communications mechanism securely and discriminately disseminates information to dynamic groups of ESPs that subscribe to the TID service.
Integration of SiOC air gaps in copper interconnects
Authors: L. G. Gosset, V. Arnal, Ph. Brun, M. Broekaart, C. Monget, N. Casanova, M. Rivoire, J. C. Oberlin, J. Torres
Venue: Microelectronic Engineering (2003)

The formation of air gaps by means of a non-conformal chemical vapor deposition (CVD) on patterned wafers was successfully demonstrated using SiOC (K=2.9) as inter-level metal dielectric. This paper presents the results on physical characterization and electrical performance evaluation of integrated SiOC air gaps in a three-metal level Cu/SiOC interconnect module. The influence of the air gaps shape on parasitic coupling capacitance between copper lines was also discussed in accordance with mask design rules and processing steps.
Developing an Instrument for Measuring User Satisfaction with Knowledge Management Systems
Authors: Chorng-Shyong Ong, Jung-Yu Lai
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The shift from a product-based to a knowledge-based economy results in an increased demand for knowledge workers who are capable of higher-order thinking and reasoning to solve intricate problems in the work place. This requires organizations to introduce knowledgemanagement systems (KMS) to employees. The purpose of this paper is to develop a validated instrument, which argues that current models and instruments are not fully applicable for evaluating user satisfaction with knowledge management systems. Based on a survey of 120 in Taiwan suggests a 21-item instrument that measures five dimensions of user satisfaction with knowledge management systems (USKMS) is well-validated. The instrument and comprehensive model proposed in this paper would be valuable to researchers and practitioners interested in designing, implementing, and managing knowledge management systems.
Low-leakage asymmetric-cell SRAM
Authors: Navid Azizi, Farid N. Najm, Andreas Moshovos
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

We introduce a novel family of asymmetric dual-Vt static random access memory cell designs that reduce leakage power in caches while maintaining low access latency. Our designs exploit the strong bias toward zero at the bit level exhibited by the memory value stream of ordinary programs. Compared to conventional symmetric high-performance cells, our cells offer significant leakage reduction in the zero state and, in some cases, also in the one state, albeit to a lesser extent. A novel sense amplifier, in combination with dummy bitlines, allows for read times to be on par with conventional symmetric cells. With one Cell design, leakage is reduced by 7 × (in the zero state) with no performance degradation, but with a stability degradation of 6%. Another cell design reduces leakage by 2 × (in the zero state) with no performance or stability loss. An alternative cell design reduces leakage by 58 × (in the zero state) with a performance degradation of 1% and an area increase of 2.4% and no stability degradation.
Addressing Timeliness/Accuracy/Cost Tradeoffs in Information Collection for Dynamic Environments
Authors: Qi Han, Nalini Venkatasubramanian
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

In this paper, we focus on addressing the tradeoffs betweentimeliness, accuracy and cost for applications requiringreal-time information collection in distributed real-timeenvironments. In this scenario, information consumers requiredata from information sources at varying levels of accuracyand timeliness. To accommodate the diverse characteristicsof information sources and varying requirementsfrom information consumers, we use an information mediatorto coordinate and facilitate communication between informationsources and consumers. We develop algorithmsfor real-time request scheduling and directory service maintenanceand compare our techniques with several other proposedstrategies. Our studies indicate that the judiciouscomposition of our proposed intelligent policies can improvethe overall efficiency of the system. Furthermore, theproposed policies perform very well as the system scales inthe number of information sources and consumer requests.
The real stakes of virtual publishing: the transformation of E-biomed into PubMed central
Authors: Rob Kling, Lisa B. Spector, Joanna Fortuna
Venue: Journal of the American Society for Information Science and Technology (2004)

In May 1999, National Institutes of Health (NIH) Director Harold Varmus proposed an electronic repository for biomedical research literature server called "E-biomed." E-biomed reflected the visions of scholarly electronic publishing advocates: It would be fully searchable, be free to readers, and contain full-text versions of both preprint and postpublication biomedical research articles. However, within 4 months, the E-biomed proposal was radically transformed: The preprint section was eliminated, delays were instituted between article publication and posting to the archive, and the name was changed to "PubMed Central." This case study examines the remarkable transformation of the E-biomed proposal to PubMed Central by analyzing comments about the proposal that were posted to an online E-biomed forum created by the NIH, and discussions that took place in other face-to-face forums where E-biomed deliberations took place. We find that the transformation of the E-biomed proposal into PubMed Central was the result of highly visible and highly influential position statements made by scientific societies against the proposal. The literature about scholarly electronic publishing usually emphasizes a binary conflict between (trade) publishers and scholars/scientists. We conclude that: (1)scientific societies and the individual scientists they represent do not always have identical interests in regard to scientific e-publishing; (2) stakeholder politics and personal interests reign supreme in e-publishing debates, even in a supposedly status-free online forum; and (3) multiple communication forums must be considered in examinations of e-publishing deliberations.
Uprooting Software Defects at the Source
Authors: Seth Hallem, David Park, Dawson Engler
Venue: Queue (2003)

Source code analysis is an emerging technology in the software industry that allows critical source code defects to be detected before a program runs. Although the concept of detecting programming errors at compile time is not new, the technology to build effective tools that can process millions of lines of code and report substantive defects with only a small amount of noise has long eluded the market. At the same time, a different type of solution is needed to combat current trends in the software industry that are steadily diminishing the effectiveness of conventional software testing and quality assurance. These trends include: