ppxscal/embedding_network huggingface dataset:
Experimental Application-Driven Architecture Analysis of an SIMD/MIMD Parallel Processing System
Authors: E. C. Bronson, T. L. Casavant, L. H. Jamieson
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

An experimental analysis of the architecture of an SIMD/MIMD parallel processing system is presented. Detailed implementations of parallel fast Fourier transform (FFT) programs were used to examine the performance of the prototype of the PASM (PartitionableSIMD/MIMD) parallel processing system. Detailed execution-time measurements using specialized timing hardware were made for the complete FFT and for components of SIMD, MIMD, and barrier-synchronized MIMD implementations. The component measurements isolated the effects of floating-point arithmetic operations, interconnection network transfer operations, and program control overhead. The measurements allow an accurate extrapolation of the execution time, speedup, and efficiency of the MIMD, SIMD, and barrier-synchronized MIMD programs to a full 1024-processor PASM system. This constitutes one of the first results of this kind, in which controlled experiments on fixed hardware were used to make comparisons of these fundamental modes of computing. Overall, the experimental results demonstrate the value of mixed-mode SIMD/MIMD computing and its suitability for computational intensive algorithms such as the FET.
SIMSAFADIM: three-dimensional simulation of stratigraphic architecture and facies distribution modeling of carbonate sediments
Authors: Klaus Bitzer, Ramon Salas
Venue: Computers Geosciences (2002)

We present a three-dimensional simulation model for production, transport and deposition of carbonate sediment. Carbonate production is calculated from population dynamics of carbonate producing organisms. The population dynamics are simulated using a predator-prey model, which includes various effects such as competition with other species, internal competition, effects of mud and suspended carbonate sediments on carbonate producing organisms and depth dependent growth functions. Fluid flow is simulated as a steady-state potential flow using a finite-element model. Transport of suspended sediment is calculated including diffusive, dispersive and advective components. Deposition of suspended carbonate matter is calculated as a function of flow velocity, water depth and settling velocity of suspended carbonate matter. Its flexibility in representing ecologic processes and boundary conditions for flow and sediment transport permits the computer model to be applied to a wide range of possible situations in carbonate systems. A sample experiment is presented to demonstrate the capabilities of the model.
Practical Multimedia Electronic Mail on X.400
Authors: Sylvain Carrier, Nicolas D. Georganas
Venue: IEEE MultiMedia (1995)

The proliferation of small and large computer networks and workstations has been the supporting platform for the extensive use and growth of electronic mail. As users became accustomed to the usefulness of electronic mail, they also encountered its limitations with regards to multimedia content and interoperability. An approach that provides a multimedia capability to X.400 that has a built-in interoperability with the Internet/MIME standard is proposed. This approach ensures that existing X.400 and Internet electronic mail facilities can be used to transport and exchange multimedia information by using published interoperability documents. The implementation of the prototype by the MCRLab at the University of Ottawa based on this approach is presented. Brief compatibility comparisons with military messaging standards and other multimedia mail projects are also provided.Contact Carrier at the National Defence Headquarters, Directorate of Information Systems Engineering and Maintenance 6-2, Jackson Building, Ottawa, Ontario, Canada K1A 0K2, e-mail scarrier@mvax.dcem.dnd.ca.
A case study in selective visualization of unsteady 3D flow
Authors: Dirk Bauer, Ronald Peikert, Mie Sato, Mirjam Sick
Venue: Proceedings of the conference on Visualization '02 (2002)

In this case study, we explore techniques for the purpose of visualizing isolated flow structures in time-dependent data. Our primary industrial application is the visualization of the vortex rope, a rotating helical structure which builds up in the draft tube of a water turbine. The vortex rope can be characterized by high values of normalized helicity, which is a scalar field derived from the given CFD velocity data. In two related applications, the goal is to visualize the cavitation regions near the runner blades of a Kaplan turbine and a water pump, respectively. Again, the flow structure of interest can be defined by a scalar field, namely by low pressure values. We propose a particle seeding scheme based on quasi-random numbers, which minimizes visual artifacts such as clusters or patterns. By constraining the visualization to a region of interest, occlusion problems are reduced and storage efficiency is gained.
SHAPES: A Novel Approach for Learning Search Heuristics in Under-Constrained Optimization Problems
Authors: Khanh P. V. Doan, Kit Po Wong
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Although much research in machine learning has been carried out on acquiring knowledge for problem-solving in many problem domains, little effort has been focused on learning search-control knowledge for solving optimization problems. This paper reports on the development of SHAPES, a system that learns heuristic search guidance for solving optimization problems in intractable, under-constrained domains based on the Explanation-Based Learning (EBL) framework. The system embodies two new and novel approaches to machine learning. First, it makes use of explanations of varying levels of approximation as a mean for verifying heuristic-based decisions, allowing heuristic estimates to be revised and corrected during problem-solving. The provision of such a revision mechanism is particularly important when working in intractable and under-constrained domains, where heuristics tend to be highly over-generalized, and hence at times will give rise to incorrect results. Second, it employs a new linear and quadratic programming-based weight-assignment algorithm formulated to direct search toward optimal solutions under best-first search. The algorithm offers a direct method for assigning rule strengths and, in so doing, avoids the need to address the credit-assignment problem faced by other iterative weight-adjustment methods.
Noise Generation and Coupling Mechanisms in Deep-Submicron ICs
Authors: Xavier Aragonès, Jose Luis González, Francesc Moll, Antonio Rubio
Venue: IEEE Design Test (2002)

On-chip noise generation and coupling is an important issue in deep-submicron technologies. Advanced IC technology faces new challenges to ensure function and performance integrity. Selecting adequate test techniques depends on the circuit, its implementation, and the possible physical failures and parasitic coupling models. This new demand for test technology practices precipitated the investigation of dI/dt and dV/dt noise generation and propagation mechanisms.
Fast Parzen Density Estimation Using Clustering-Based Branch and Bound
Authors: B. Jeon, D. A. Landgrebe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This correspondence proposes a fast Parzen density estimation algorithm that would be especially useful in nonparametric discriminant analysis problems. By preclustering the data and applying a simple branch and bound procedure to the clusters, significant numbers of data samples that would contribute little to the density estimate can be excluded without detriment to actual evaluation via the kernel functions. This technique is especially helpful in the multivariant case, and does not require a uniform sampling grid. The proposed algorithm may also be used in conjunction with the data reduction technique of Fukunaga and Hayes (1989) to further reduce the computational load. Experimental results are presented to verify the effectiveness of this algorithm.
Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems
Authors: Chanjung Park, Seog Park, Sang H. Son
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and is represented as a priority to be used by schedulers. Recently, security has become another important issue in many real-time applications. In many systems, sensitive information is shared by multiple users with different levels of security clearance. As more advanced database systems are being used in applications that need to support timeliness while managing sensitive information, there is an urgent need to develop protocols for concurrency control in transaction management that satisfy both timing and security requirements. In this paper, we propose a new multiversion concurrency control protocol that ensures that both security and real-time requirements are met. The proposed protocol is primarily based on locking. However, in order to satisfy timing constraints and security requirements, a new method, called the freezing method, is proposed. In order to show that our protocol provides a higher degree of concurrency than existing multiversion protocols, we define a new serializability for multiversion concurrency control, called FR-serializability, which is more general than traditional serializability. We present several examples to illustrate the behavior of our protocol, along with performance comparisons with other protocols. The simulation results show significant performance improvement of the new protocol.
Real-Time Supervisory Control of a Processor for Non-Preemptive Execution of Periodic Tasks
Authors: Peter C. Y. Chen, W. M. Wonham
Venue: Real-Time Systems (2002)

In this article, a method for scheduling a processor for non-preemptive execution of periodic tasks is presented. This method is based on the formal framework of supervisory control of timed discrete-event systems. It is shown that, with this method, the problem of determining schedulability and the problem of finding a scheduling algorithm are dual since a solution to the former necessarily implies a solution to the latter and vice versa. Furthermore, the solution to the latter thus obtained is complete in the sense that it contains all &ldquo;safe&rdquo; sequences of task execution with the guarantee that no deadline is missed. Examples are described to illustrate this method. Implication of the results and computational complexity associated with this method are discussed.
Markov Random Field Models for Unsupervised Segmentation of Textured Color Images
Authors: Dileep Kumar Panjwani, Glenn Healey
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We present an unsupervised segmentation algorithm which uses Markov random field models for color textures. These models characterize a texture in terms of spatial interaction within each color plane and interaction between different color planes. The models are used by a segmentation algorithm based on agglomerative hierarchical clustering. At the heart of agglomerative clustering is a stepwise optimal merging process that at each iteration maximizes a global performance functional based on the conditional pseudolikelihood of the image. A test for stopping the clustering is applied based on rapid changes in the pseudolikelihood. We provide experimental results that illustrate the advantages of using color texture models and that demonstrate the performance of the segmentation algorithm on color images of natural scenes. Most of the processing during segmentation is local making the algorithm amenable to high performance parallel implementation.
Affinity scheduling of unbalanced workloads
Authors: Srikant Subramaniam, Derek L. Eager
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Scheduling in a shared memory multiprocessor is often complicated by the fact that a unit of work may be processed more efficiently on one processor than on any other, due to factors such as the presence of required data in a local cache. The unit of work is said to have an "affinity" for the given processor, in such a case. The scheduling issue that has to be considered is the tradeoff between the goals of respecting processor affinities (so as to obtain improved efficiencies in execution) and of dynamically assigning each unit of work to whichever processor happens to be, at the time, least loaded (so as to obtain better load balance and decreased processor idle times).A specific context in which the above scheduling issue arises is that of shared memory multiprocessors with large, per-processor caches or cached main memories. The shared-memory programming paradigm of such machines permits the dynamic scheduling of work. The data required by a unit of work may, however, often reside mostly in the cache of one particular processor, to which that unit of work thus has affinity.In this paper, two new "affinity scheduling" algorithms are proposed for a context in which the units of work have widely varying execution times. An experimental study of these algorithms finds them to perform well in this context.
How to Invest in E-commerce Stocks
Authors: Bill Burnham
Venue:  (1998)

:The opportunities are incredible. The risks are high. Investment in the electronic commerce industry isn't for everybody, but for those willing to put their money in this fast-paced growth sector, the rewards can be immense. In How to Invest in E-Commerce Stocks, research analyst Bill Burnham, who pioneered the study of the electronic commerce industry from an investor's perspective, offers the information and guidance you need to maximize your investment return and avoid costly mistakes. With more than 100 charts, graphs, and side-bars, and a clear, concise style, Burnham opens to you a full perspective on the breadth and depth of the industry. You'll become familiar with the five major sectors of the e-commerce industry: Security, Electronic Payments, Financial Services Software, Business Commerce Software, and Commerce Content. You'll understand the structure of each and what sub-sectors it contains ... examine an index of the forty-eight leading firms in the industry ... and learn the eight essential aspects to consider when evaluating each sector's investment possibilities. Most importantly, Burnham delineates the four commandments for investing in the e-commerce community that can help prevent catastrophic financial loss. Outlining the long-term evolution of the industry, he guides investors in establishing an "early warning system" to rapidly assess the impact of short-term events and trends on a particular company's long-term growth and earnings potential.
The Impending Changes in Software Education
Authors: Thomas B. Hilburn, Watts S. Humphrey
Venue: IEEE Software (2002)

Because of the growing impact of software and its historically poor performance in meeting society's needs, the practice of software engineering is in need of substantial changes. One challenge concerns preparing software professionals for their careers; the field must drastically change its approach to software engineering education if it hopes to consistently provide safe, secure, and reliable systems. This special issue sheds light on some of the issues both academic and industry-based educators must resolve to better address society's need for qualified and capable software professionals.
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles
Authors: Christos Faloutsos, H. v. Jagadish, Yannis Manolopoulos
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

We give a closed-form expression for the average number of n-dimensional quadtree nodes ("pieces" or "blocks") required by an n-dimensional hyperrectangle aligned with the axes. Our formula includes as special cases the formulae of previous efforts for two-dimensional spaces [8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hypersurface of the hyperrectangle and not on its hypervolume. The practical use of the derived formula is that it allows the estimation of the space requirements of the n-dimensional quadtree decomposition. Quadtrees are used extensively in two-dimensional spaces (geographic information systems and spatial databases in general), as well in higher dimensionality spaces (as oct-trees for three-dimensional spaces, e.g., in graphics, robotics, and three-dimensional medical images [2]). Our formula permits the estimation of the space requirements for data hyperrectangles when stored in an index structure like a (n-dimensional) quadtree, as well as the estimation of the search time for query hyperrectangles, for the so-called linear quadtrees [17]. A theoretical contribution of the paper is the observation that the number of blocks is a piece-wise linear function of the sides of the hyperrectangle.
Fusing Neural Networks Through Space Partitioning and Fuzzy Integration
Authors: Antonas Verikas, Arunas Lipnickas
Venue: Neural Processing Letters (2002)

To improve recognition results, decisions of multiple neural networks can be aggregated into a committee decision. Aggregation weights assigned to neural networks or groups of networks can be the same in the entire data space or can be different (data dependent) in various regions of the space. In this paper, we propose a method for obtaining data dependent aggregation weights. The proposed approach is tested in two aggregation schemes, namely aggregation through neural network selection, and aggregation by the Choquet integral with respect to the &lambda;-fuzzy measure. The effectiveness of the approach is demonstrated on two artificial and three real data sets.
Doing Business in the Wired World
Authors: Ajit Kambil
Venue: Computer (1997)

Since 1993, use of the Internet and the World Wide Web has exploded, creating a global "infostructure" to support commerce. Today in New York, costs to publish on this infostructure are as low as $3,000 for server hardware and software, and $650 per month for a shared T1 connection. Individual dial-up access costs around $15 per month and continues to fall. This and the Internet's usefulness will capture an estimated 377 million users by 2000. The 1997 Nielsen-CommerceNet survey of Internet demographics estimated 50 million people over the age of 16 in the US and Canada had Internet access. About 37 million had access to the Web. Both the Nielsen and Hermes project surveys found Internet users are well educated and affluent-ideal targets for marketing. An estimated 5.6 million users have already purchased products over the Internet, and this method was especially attractive to those who valued convenience more than price. Thus the Internet is rapidly becoming the largest interactive multimedia infrastructure for marketing and is supplanting some traditional media. Although in its infancy, e-commerce promises to dramatically alter the structure and processes of commerce. Managers will have to invent new business models that reemphasize scale, differentiation, and brands to effectively compete on a noisy infostructure with low transaction costs. They will also have to spend substantial time redesigning transaction processes and participating in industry groups to develop new e-commerce conventions. Effectively implementing these strategies and simultaneously reconciling new and existing business models will be key to a firm's success.
Drawing database schemas
Authors: Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
Venue: Software&mdash;Practice Experience (2002)

A wide number of practical applications would benefit from automatically generated graphical representations of database schemas, in which tables are represented by boxes, and table attributes correspond to distinct stripes inside each table. Links, connecting attributes of two different tables, represent referential constraints or join relationships, and may attach arbitrarily to the left- or to the right-hand side of the stripes representing the attributes. To our knowledge no drawing technique is available to automatically produce diagrams in such a strongly constrained drawing convention. In this paper we provide a polynomial time algorithm for solving this problem, and test its efficiency and effectiveness against a large test suite. Also, we describe an implementation of a system that uses such an algorithm and we study the main methodological problems we faced in developing such a technology.
GATES: An Airline Gate Assignment and Tracking Expert System
Authors: Robert P. Brazile, Kathleen M. Swigger
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

A description is given of GATES, an expert system that assigns gates to arriving and departing flights at New York's John F. Kennedy International Airport (JFK). GATES uses flight information and knowledge about current constraints to produce possible gate assignment schedules. GATES is a constraint-satisfaction expert system. To make its decisions, it uses two types of production rule: permissive rules and conflict rules. Permissive rules determine when it's appropriate to consider a particular gate for a particular flight, and permit the system to search the next level of rules to obtain an assignment. Conflict rules determine when particular flights cannot be assigned to particular gates. System operators can modify schedules by retracting rules, adjusting tolerances, and deleting information. The system was developed for a PC, thereby providing an efficient and flexible user environment. The approach is extensible to various engineering and industrial problems where limited resources and weakly defined constraints exist and in which scheduling must occur.
Partial simulation-driven ATPG for detection and diagnosis of faults in analog circuits
Authors: Sudip Chakrabarti, Abhijit Chatterjee
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we propose a novel fault-oriented test generation methodology for detection and isolation of faults in analog circuits. Given the description of the circuit-under-test, the proposed test generator computes the optimal transient test stimuli in order to detect and isolate a given set of faults. It also computes the optimal set of test nodes to probe at, and the time instants to make measurements. The test generation program accommodates the effects introduced by component tolerances and measurement inaccuracy, and can be tailored to fit the signal generation capabilities of a hardware tester. Experimental results show that the proposed technique can be applied to generate transient tests for both linear and non-linear analog circuits of moderate complexity in reasonably less CPU time. This will significantly impact the test development costs for an analog circuit and will decrease the time-to-market of a product. Finally, the short duration and the easy-to-apply feature of the test stimuli will lead to significant reduction in production test costs.
Associative Processors and Memories: A Survey
Authors: K. E. Grosspietsch
Venue: IEEE Micro (1992)

The functional structure of a classical content-addressable memory (CAM) and its realization at the transistor level are described. Some unorthodox CAM approaches are briefly examined. Associative processor systems are discussed, and application-specific CAM architectures to support artificial intelligence features are surveyed. Limitations of associative processing and ways to circumvent them are addressed. The use of parallel cellular logic is considered.