ppxscal/embedding_network huggingface dataset:
On a Conjecture of R. P. Stanley; Part I—Monomial Ideals
Authors: Joachim Apel
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

In 1982 Richard P. Stanley conjectured that any finitely generated \Bbb Zn-graded module M over a finitely generated \Bbb Nn-graded \Bbb K-algebra R can be decomposed in a direct sum M &equals; &oplus;i &equals; 1t &nu;iSi of finitely many free modules &nu;iSi which have to satisfy some additional conditions. Besides homogeneity conditions the most important restriction is that the Si have to be subalgebras of R of dimension at least depth M.We will study this conjecture for the special case that R is a polynomial ring and M an ideal of R, where we encounter a strong connection to generalized involutive bases. We will derive a criterion which allows us to extract an upper bound on depth M from particular involutive bases. As a corollary we obtain that any monomial ideal M which possesses an involutive basis of this type satisfies Stanley's Conjecture and in this case the involutive decomposition defined by the basis is also a Stanley decomposition of M. Moreover, we will show that the criterion applies, for instance, to any monomial ideal of depth at most 2, to any monomial ideal in at most 3 variables, and to any monomial ideal which is generic with respect to one variable. The theory of involutive bases provides us with the algorithmic part for the computation of Stanley decompositions in these situations.
User-Interface Development Tools
Authors: Ed Lee
Venue: IEEE Software (1990)

A brief description is given of three approaches to user-interface development: tool kits, user-interface management systems (UIMS), and interactive design tools. Six selected tools are then introduced, in separate presentations, by their originating organization. They provide a cross-section of work in progress today. The tools selected represent a combination of traditional UIMs and new interactive design tools, although they all call themselves UIMs. The tools covered are: UIMX; Jam; Speedcode Universe; Serpent; Framer; and Mode.
Parameter Selection for Server-Aided RSA Computation Schemes
Authors: J. Burns, C. J. Mitchell
Venue: IEEE Transactions on Computers (1994)

The security, complexity, and application of two schemes for using an untrusted auxiliary processor to aid smart card RSA signature computations are reviewed, including detailed analysis of possible methods of attack. Guidance is given on practical, secure use of these schemes.
Microprocessor Memory Management Units
Authors: Milan Milenkovic
Venue: IEEE Micro (1990)

This tutorial describes the current crop of commercial memory management units (MMUs) for 32-bit microprocessors. The discussion includes both complex- and reduced-instruction-set computers (CISCs and RISCs). The rationale, principles, and issues related to hardware support for memory management and virtual memory are reviewed. The design and features of high-end microprocessor MMUs are reviewed and compared with respect to a common set of criteria. Special attention is paid to Unix requirements and multiprocessor, multiple MMU considerations. The MMUs covered are Intel 80386, i486, and i860; Motorola's 68851 (MMU for the 68020), 68030, 68040, and 88200 (MMU for the 88000 series); the Fujitsu MB86920 (Sparc MMU); and the MIPS R2000/R3000.
Performance Trade-Offs for Microprocessor Cache Memories
Authors: Donald B. Alpert, Michael J. Flynn
Venue: IEEE Micro (1988)

Design trade-offs for integrated microprocessors caches are examined. A model of cache utilization is introduced to evaluate the effects on cache performance of varying the block size. By considering the overhead cost of sorting address tags and replacement information along with data, it is found that large block sizes lead to more cost-effective cache designs than predicted by previous studies. When the overhead cost is high, caches that fetch only partial blocks on a miss perform better than similar caches that fetch entire blocks. This study indicates that lessons from mainframe and minicomputer design practice should be critically examined to benefit the design of microprocessors.
Coverage Estimation Using Statistics of the Extremes for When Testing Reveals No Failures
Authors: Lori M. Kaufman, Barry W. Johnson, Joanne Bechta Dugan
Venue: IEEE Transactions on Computers (2002)

The existing classes of fault coverage models require an a priori distribution for collected data in their analysis. Using these models, analyses can be performed using various assumed distributions. The assumed distributions may not accurately reflect the behavior of the collected data and, as a result, the coverage values predicted by the models may be inaccurate, especially if testing yields little or no failure data. Since the occurrence of an uncovered fault in an ultra-dependable system is a rare event, then statistics of the extremes can be used to quantify uncoverage estimates in such systems. Statistics of the extremes provides for an analysis of rare event data without requiring any a priori knowledge of its distribution. It classifies most distributions into one of three asymptotic families; that is, in the limit, most distributions converge to one of three forms. Using statistics of the extremes, a coverage model is developed for when testing reveals no failures. From this model, the number of fault injection experiments required to demonstrate that a desired coverage level can be met is derived, as is the probability that this coverage estimate can be met.
How to identify new high-payoff information systems for the organization
Authors: Ken Peffers, Charles E. Gengler
Venue: Communications of the ACM (2003)

Viewing users as partners and their personal knowledge of the organization as a strategic asset helps CIOs justify project proposals with the greatest promise for achieving organizational goals.
Software Cultures and Evolution
Authors: Václav Rajlich, Norman Wilde, Michelle Buckellew, Henry Page
Venue: Computer (2001)

Working effectively with legacy code requires understanding a legacy computer program's culture: the combination of programmer background, hardware environment, and programming techniques that guided its creation. Software systems typically pass through a series of stages. During the development stage, software developers create a functioning version of the code. An evolution stage follows, during which developmental efforts focus on extending system capabilities to meet user needs. The servicing stage restricts development to minor repairs and simple functional changes. The phase-out stage essentially freezes the system, but it still produces value. Finally, in the close down stage, developers withdraw the system and possibly replace it.Effective comprehension requires viewing a legacy program as an artifact of the circumstances in which it was developed. This information can be important in determining appropriate strategies for the program's transition from the evolution stage to the servicing or phase-out stage.
Selecting and Using Data for Integration Testing
Authors: Mary Jean Harrold, Mary Lou Soffa
Venue: IEEE Software (1991)

The extension of dataflow testing to interprocedural testing is described. This was done by developing both an analysis technique that computes the required interprocedural definition-use information, for both direct and indirect dependencies and a testing technique that uses this information in selecting and executing the subpaths across procedure boundaries. A testing tool that implements this technique is presented. For the interprocedural dataflow analysis, the technique summarizes the individual procedures' definition and use information at call sites and then propagates this information throughout the interacting procedures. By efficiently computing the interprocedural data dependencies before testing, the approach lets the testing tool use existing path-selection techniques based on dataflow for interprocedural testing. To track the execution path, the technique recognizes the calls to and returns from procedures and handles the association of various names with a definition as the execution path is being inspected. The technique handles recursive procedures and supports separate compilation of procedures.
A Parallel Computational Model for Integrated Speech and Natural Language Understanding
Authors: Sang-Hwa Chung, D. I. Moldovan, R. F. DeMara
Venue: IEEE Transactions on Computers (1993)

Presents a parallel approach for integrating speech and natural language understanding. The method emphasizes a hierarchically-structured knowledge base and memory-based parsing techniques. Processing is carried out by passing multiple markers in parallel through the knowledge base. Speech specific problems such as insertion, deletion, substitution, and word boundary detection have been analyzed and their parallel solutions are provided. Results on the SNAP-1 multiprocessor show an 80% sentence recognition rate for the Air Traffic Control (ATC) domain. Furthermore, speed-up of up to 15-fold is obtained from the parallel platform which provides response times of a few seconds per sentence for the ATC domain.
Simulation and optimization of the power distribution network in VLSI circuits
Authors: G. Bai, S. Bobba, I. N. Hajj
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we present simulation techniques to estimate the worst-case voltage variation using a RC model for the power distribution network. Pattern independent maximum envelope currents are used as a periodic input for performing the frequency-domain steady-state simulation of the linear RC circuit to evaluate the worst-case instantaneous voltage drop for the RC power distribution networks. The proposed technique unlike existing techniques, is guaranteed to give the maximum voltage drop at nodes in the RC power distribution network. We present experimental results to compare the frequency-domain and time-domain simulation techniques for estimating the maximum instantaneous voltage drop. We also present frequency domain sensitivity analysis based decoupling capacitance placement for reducing the voltage variation in the power distribution network. Experimental results on circuits extracted from layout are presented to validate the simulation and optimization techniques.
Reified Temporal Logics: An Overview
Authors: J. Ma, B. Knight
Venue: Artificial Intelligence Review (2001)

There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument&semi; modal temporal logics which are extensions of the propositional or predicate calculus with modal temporal operators&semi; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview on the temporal reified approach by looking closely at some representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches.
Construction of a Morlet Wavelet Power Spectrum
Authors: Hsuen-Chyun Shyu, Yuh-Sien Sun
Venue: Multidimensional Systems and Signal Processing (2002)

The Morlet wavelets transform (MWT) is an efficient means of detecting and analyzing transient signals. However, ordinary iterative processes that calculate the MWT are time-consuming. In addition, when the MWT is applied to construct a wavelet power spectrum on a linear frequency axis, the peak response appears at a value lower than the actual signal frequency. In this work, formulae that produce a fast MWT and Morlet power spectrum (MPS) scheme without iterative processes are derived. Also, we discuss in detail why the frequency slant phenomenon occurs. To avert this phenomenon, the transform kernel of the MWT is modified to facilitate the construction of an equal-amplitude Morlet wavelet transform. The modified Morlet power spectrum produces the peak responses roughly proportional to the squared input amplitudes at the accurate signal component frequencies.
A Staged Model for the Software Life Cycle
Authors: Václav T. Rajlich, Keith H. Bennett
Venue: Computer (2000)

Software engineers have traditionally considered any work after initial delivery as simply software maintenance. Some researchers have divided this work into various tasks, including making changes to functionality (perfective), changing the environment (adaptive), correcting errors (corrective), and making improvements to avoid future problems (preventive). However, many have considered maintenance basically uniform over time. Because software development has changed considerably since its early days, the authors believe this approach no longer suffices. They describe a new view of the software life cycle in which maintenance is actually a series of distinct stages, each with different activities, tools, and business consequences. While the industry still considers postdelivery work as simply software maintenance, the authors claim that the process actually falls into stages. They think both business and engineering can benefit from understanding these stages and their transitions.
Accelerating ray shooting through aggressive 5D visibility preprocessing
Authors: Adrian Sharpe, Matthew Hampton, Shaun Nirenstein, James Gain, Edwin Blake
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

We present a new approach to accelerating general ray shooting. Our technique uses a five-dimensional ray space partition and is based on the classic ray-classification algorithm. Where the original algorithm evaluates intersection candidates at run-time, our solution evaluates them as a preprocess.The offline nature of our solution allows for an adaptive subdivision of ray space. The advantage being, that it allows for the placement of a user set upper bound on the number of primitives intersected.The candidate sets produced account for occlusion, thereby reducing memory requirements and accelerating the ray shooting process. A novel algorithm which exploits graphics hardware is used to evaluate the candidate sets. It is the treatment of occlusion that allows for the practical precomputation of the ray space partition. This algorithm is called aggressive since it is optimal (no invisible primitives are included), but may result in false exclusion of visible primitives. Error is minimised through the adaptive sampling.
Sum-box technique for fast linear filtering
Authors: Jun Shen, Wei Shen, Serge Castan, Tianxu Zhang
Venue: Signal Processing (2002)

Linear filters are widely used in signal processing and in image processing, and the fast realization of large kernel filters has been an important research subject. Traditional fast algorithms try to decompose the initial kernel into the convolution of smaller kernels, and a lot of multiplications are still needed to realize all the convolutions with the small kernels. Box technique can realize the Gaussian filters with little multiplications, but it cannot realize linear filters other than the Gaussians. In the present paper, by use of the analysis on the scaled Spline functions, we propose the sum-box filter technique to approximately realize a given large kernel linear filter (even non Gaussian type) to a factor by the sum of the translated outputs of sum-box filters, requiring no multiplications. This original sum-box technique presented opens thus a new orientation for linear filter fast realization: realizing to a factor the convolution with a large filter kernel by additions only. From the viewpoint of computational complexity, this method is highly efficient in image and signal processing, in particular, for large filter kernels. Experimental results are reported.
Is Software Quality Visible in the Code?
Authors: Søren Lauesen, Houman Younessi
Venue: IEEE Software (1998)

Finding and fixing software code defects is crucial to product quality. It also, however, often proves difficult and time-consuming, especially late in the development cycle. While some believe that code analysis provides a simple way to detect quality defects, Lauesen and Younessi argue otherwise. To prove their point, they analyzed datafromerror reports, and their results show that code analysis detects only a small percentage of meaningful defects.
Structured Reactive Controllers
Authors: Michael Beetz
Venue: Autonomous Agents and Multi-Agent Systems (2001)

Service robots, such as autonomous office couriers or robot tourguides, must be both reliable and efficient. This requires them to flexibly interleave their tasks, exploit opportunities, quickly plan their course of action, and, if necessary, revise their intended activities. In this paper, we show how structured reactive controllers (SRCs) satisfy these requirements. The novel feature of SRCs is that they employ and reason about plans that specify and synchronize concurrent percept-driven behavior. Powerful control abstractions enable SRCs to integrate physical action, perception, planning, and communication in a uniform framework and to apply fast but imperfect computational methods without sacrificing reliability and flexibility. Concurrent plans are represented in a transparent and modular form so that automatic planning processes can reason about the plans and revise them. We present experiments in which SRCs are used to control two autonomous mobile robots. In one of them an SRC controlled the course of action of a museum tourguide robot that has operated for thirteen days, more than ninetyfour hours, completed 620 tours, and presented 2668 exhibits.
SimpleScalar: An Infrastructure for Computer System Modeling
Authors: Todd Austin, Eric Larson, Dan Ernst
Venue: Computer (2002)

Designers can execute programs on software models to validate a proposed hardware design's performance and correctness, while programmerscan use these models to develop and test software before the real hardwarebecomes available. Three critical requirements drive the implementationof a software model: performance, flexibility, and detail.Performance determines the amount of workload the model can exercise given the machine resources available for simulation. Flexibility indicates how well the model is structured to simplify modification, permitting design variants or even completely different designs to be modeled with ease. Detail defines the level of abstraction used to implement the model's components.The SimpleScalar tool set provides an infrastructure for simulation and architectural modeling. It can model a variety of platforms ranging from simple unpipelined processors to detailed dynamically scheduled microarchitectures with multiple-level memory hierarchies. SimpleScalar simulators reproduce computing device operations by executing all program instructions using an interpreter.The tool set's instruction inter-complex modern machines and effectively manage the large software projects needed to model such machines. Asim addresses these needs by providing a modular and reusable framework for creating many models. The framework's modularity helps break down the performance-modeling problem into individual pieces that can be modeled separately, while its reusability allows using a software component repeatedly in different contexts.
ISHYS: Designing an Intelligent Software Hypertext System
Authors: Pankaj K. Garg, Walt Scacchi
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors describe the design of ISHYS, an intelligent software hypertext system, and discuss novel applications that such a system can support. In designing ISHYS, they sought to support the software life cycle from a 'web of computing' framework, which necessarily requires the consideration of sociotechnical factors influencing and influenced by the software life cycle. ISHYS supports functionalities that include influencing work interactions on the basis of social interactions and determining tools and their options on the basis of project status information. Implementation of required enhancements to DIF (documents integration facility), the authors' current software hypertext system, has been completed using Prolog, C, and X Windows.
Book Reviews
Venue: IEEE Software (1990)

No abstract available The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Third Millennium's Test Dilemma
Authors: Bill Bottoms
Venue: IEEE Design Test (1998)

The president and CEO of Credence Systems, Bill Bottoms, addressed the VLSI Test Symposium held last April in Monterey, California. His keynote covered some of the challenges test engineers must face in the future. Specifically, Bottoms focused on what's driving the increase in test cost and what the industry can do about it.
P-MIP: paging in mobile IP
Authors: Xiaowei Zhang, Javier Gomez Castellanos, Andrew T. Campbell
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

As the number of Mobile IP users grows, so will the signaling overhead associated with Internet mobility management in the core IP network. This presents a significant challenge to Mobile IP as the number of mobile devices scale-up. In cellular networks, registration and paging techniques are used to minimize the signaling overhead and optimize the mobility management performance. Currently, Mobile IP supports registration but not paging. In this paper, we argue that Mobile IP should be extended to support paging to improve the scalability of the protocol to handle large populations of mobile devices. To address this, we introduce P-MIP, a set of simple paging extensions for Mobile IP, and discuss the construction of paging areas, movement detection, registration, paging and data handling. We present analysis and simulation results for Mobile IP with and without paging extensions, and show that P-MIP can scale well supporting large numbers of mobile devices with reduced signaling under a wide variety of system conditions. The ns-2P-MIP source code used to evaluate the protocol in this paper is available on the web (comet.columbia.edu/pmip).
On isomorphisms of finite Cayley graphs: a survey
Authors: Cai Heng Li
Venue: Discrete Mathematics (2002)

The isomorphism problem for Cayley graphs has been extensively investigated over the past 30 years. Recently, substantial progress has been made on the study of this problem, many long-standing open problems have been solved, and many new research problems have arisen. The results obtained, and methods developed in this area have also effectively been used to solve other problems regarding finite vertex-transitive graphs. The methods used in this area range from deep group theory, including the finite simple group classification, through to combinatorial techniques. This article is devoted to surveying results, open problems and methods in this area.