ppxscal/embedding_network huggingface dataset:
A software approach to channel-state dependent scheduling for wireless LANs
Authors: Hiroto Aida, Yoshito Tobe, Masato Saito, Hideyuki Tokuda
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

This paper proposes a new practical packet scheduling scheme for wireless LANs called SoCPS and also explores extensively the effectiveness of wireless packet scheduling under a variety of conditions over an actual wireless LAN. One well-known aspect in packet scheduling at the base station is consideration of channel state dependency. In conventional studies, the channel state is expressed in microscopic two states in the Markovian sense. To eliminate a large overhead associated with acquiring such a fine-grain channel state and to establish a software-based enhancement, we introduce the notion of Strength of Connection (SoC) which can be expressed as the long-term strength of the connectivity between the base station and an end host. We examine schemes for identifying the channel state and examine the applicability to packet scheduling. We also design a packet scheduling scheme based on SoC called SoCPS. Finally, we investigate the performance under various conditions of traffic and wireless channel states. We have designed and implemented SoCPS on FreeBSD computers. Our evaluation results obtained with up to eight wireless-LAN nodes have determined the applicability of SoCPS and limitation in wireless packet scheduling for wireless LANs. In particular, while FIFO is sufficient in many cases where TCP traffic is dominant, scheduling with SoC consideration is effective for real-time UDP traffic.
SEI Capability Maturity Model's Impact on Contractors
Authors: Hossein Saiedian, Richard Kuzara
Venue: Computer (1995)

With strong DoD sponsorship, more companies will probably base their software process improvement efforts on SEI¿s Capability Maturity Model, but the opposition is loud and clear.
Planning and Executing Time-Bound Projects
Authors: Eduardo Miranda
Venue: Computer (2002)

A time-bound project is constrained by hard deadlines, in which the delivery's timing is as important as the delivery itself. Because most time-bound projects start with more requirements than developers can handle within the imposed time constraints, requirements often must be slashed halfway through the project, resulting in missed deadlines, customer frustration, and wasted effort. A better approach defines requirement priorities before the project's start. But failing to prioritize requirements is not the only reason that projects miss deadlines.Traditional planning methods' inability to deal with uncertain estimates and their failure to recognize that development work does not progress linearly are also to blame. Statistically Planned Incremental Deliveries offer an approach that addresses these problems by combining ideas from critical chain planning, incremental development, and rate monitoring into a practical method for planning and executing time-bound projects.
Scaling Up Visual Programming Languages
Authors: Margaret M. Burnett, Marla J. Baker, Carisa Bohus, Paul Carlson, Sherry Yang, Pieter van Zee
Venue: Computer (1995)

Visual programming languages (VPLs) appear to have great promise towards lessening the distinction between programming and problem solving, by making programming more direct, more immediate, and simpler. However, making VPLs suitable for solving large, realistic programming problems often seems to require reintroducing the very complexities that VPLs seek to avoid. This is called the scaling-up problem. This paper discusses the opportunities and obstacles VPLs encounter when attempting to solve the scaling-up problem. An understanding of this problem, its components, and the interrelationships among these components is necessary to ensure that efforts to solve the problem are productive and that these efforts do not compromise the qualities that make VPLs attractive.
Programming Industrial Strength Windows, 1st edition
Authors: Petter Hesselberg
Venue:  (2000)

:Windows applications designed for large audiences, whether for commercial production or for large corporate user groups, need to have "industrial strength" reliability. This book shows how to design production-quality applications that move seamlessly between all Windows versions, including Windows 2000. The author takes the reader through the development of an original application step by step in order to demonstrate all aspects of application design, platform compatibility, usability issues, and the myriad details of error handling and recovery, testing, installation and registry issues, and internationalization. The comprehensive scope of the author's presentation, including details of drag and drop and shell integration, makes this book unique. The demonstration application, TextEdit, is implemented using C++ and the native Win32 API, to run on Win95/98, WinNT 4.0/5.0, and Win 2000. 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
Accurate CMOS bridge fault modeling with neural network-based VHDL saboteurs
Authors: Don Shaw, Dhamin Al-Khalili, Côme Rozon
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This paper presents a new bridge fault model that is based on a multiple layer feedforward neural network and implemented within the framework of a VHDL saboteur cell. Empirical evidence and experimental results show that it satisfies a prescribed set of bridge fault model criteria better than existing approaches. The new model computes exact bridged node voltages and propagation delay times with due attention to surrounding circuit elements. This is significant since, with the exception of full analog simulation, no other technique attempts to model the delay effects of bridge defects. Yet, compared to these analog simulations, the new approach is orders of magnitude faster and achieves reasonable accuracy; computing bridged node voltages with an average error near 0.006 volts and propagation delay times with an average error near 14 ps.
Case study: visualization of particle track data
Authors: Xiaoming Wei, Arie E. Kaufman, Timothy J. Hallman
Venue: Proceedings of the conference on Visualization '01 (2001)

The Relativistic Heavy Ion Collider (RHIC) experiment at the Brookhaven National Lab is designed to study how the universe came into being. It is believed that after the Big Bang, the universe expanded and cooled, consisting of a soup of quarks, gluons, electrons and neutrinos. As the temperature lowered, electrons combined with protons and formed neutral atoms. Later, clouds of atoms contracted into stars. In this paper, we describe how techniques of volume rendering and information visualization are used to visualize the large particle track data set generated from this high energy physics experiment. The system, called TrackVis, is based on our earlier work of VolVis - Volume Visualization software. Example images of real particle collision data are shown, which are helpful to physicists in investigating the behavior of strongly interacting matter at high energy density.
A Survey on Content-Based Retrieval for Multimedia Databases
Authors: Atsuo Yoshitaka, Tadao Ichikawa
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Conventional database systems are designed for managing textual and numerical data, and retrieving such data is often based on simple comparisons of text/numerical values. However, this simple method of retrieval is no longer adequate for the multimedia data, since the digitized representation of images, video, or data itself does not convey the reality of these media items. In addition, composite data consisting of heterogeneous types of data also associates with the semantic content acquired by a user's recognition. Therefore, content-based retrieval for multimedia data is realized taking such intrinsic features of multimedia data into account. Implementation of the content-based retrieval facility is not based on a single fundamental, but is closely related to an underlying data model, a priori knowledge of the area of interest, and the scheme for representing queries. This paper surveys recent studies on content-based retrieval for multimedia databases from the point of view of three fundamental issues. Throughout the discussion, we assume databases that manage only nontextual/numerical data, such as image or video, are also in the category of multimedia databases.
Mathematica 2.2 for Engineers
Authors: Henry Shapiro
Venue:  (1999)

:This new Toolkit module teaches a five-step method for solving problems with Mathematica, and explains how to create notebooks, type formulas, define functions, and specify equations. The module also shows how to define and manipulate lists, and introduces all necessary commands for graphing, plotting and analyzing experimental data, and solving algebraic equations.
An Algorithm for Data-Driven Bandwidth Selection
Authors: Dorin Comaniciu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

The analysis of a feature space that exhibits multiscale patterns often requires kernel estimation techniques with locally adaptive bandwidths, such as the variable-bandwidth mean shift. Proper selection of the kernel bandwidth is, however, a critical step for superior space analysis and partitioning. This paper presents a mean shift-based approach for local bandwidth selection in the multimodal, multivariate case. Our method is based on a fundamental property of normal distributions regarding the bias of the normalized density gradient. We demonstrate that, within the large sample approximation, the local covariance is estimated by the matrix that maximizes the magnitude of the normalized mean shift vector. Using this property, we develop a reliable algorithm which takes into account the stability of local bandwidth estimates across scales. The validity of our theoretical results is proven in various space partitioning experiments involving the variable-bandwidth mean shift.
A Visual Process Connector for Unix
Authors: Mitali Bhattacharyya, David Cohrs, Barton Miller
Venue: IEEE Software (1988)

Upconn, a tool that lets Unix programmers visually describe the connections between the processes in a distributed program and then execute the distributed program, is described. Upconn consists of several modules and can be extended by adding to a library of tools rather than by adding many special features to Upconn itself. Upconn has three main uses. First, it lets researchers study distributed processing in common Unix environments, reducing the dependence on specialized environments. Second, it can be used for rapid prototyping of distributed applications. Third, Upconn is a learning tool that can help students focus on writing distributed programs without dealing with the complexities of the communication links.
A Unified Task-Based Dependability Model for Hypercube Computers
Authors: C. R. Das, J. Kim
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A unified analytical model for computing the task-based dependability (TDB) of hypercube architectures is presented. A hypercube is deemed operational as long as a task can be executed on the system. The technique can compute both reliability and availability for two types of task requirements¿I-connected model and subcube model. The I-connected TBD assumes that a connected group of at least I working nodes is required for task execution. The subcube TBD needs at least an m-cube in an n-cube, m greater than or equals n, for task execution. The dependability is computed by multiplying the probability that x nodes (math) are working in an n-cube at time t by the conditional probability that the hypercube can satisfy any one of the two task requirements from x working nodes. Recursive models are proposed for the two types of task requirements to find the connection probability. The subcube requirement is extended to find multiple subcubes for analyzing multitask dependability. The analytical results are validated through extensive simulation.
Repeated Computation of Global Functions in a Distributed Environment
Authors: V. K. Garg, J. Ghosh
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

In a distributed system, many algorithms need repeated computation of a global function.These algorithms generally use a static hierarchy for gathering the necessary data fromall processes. As a result, they are unfair to processes at higher levels of the hierarchy,which have to perform more work than processes at lower levels do. In this paper, wepresent a new revolving hierarchical scheme in which the position of a process in thehierarchy changes with time. This reorganization of the hierarchy is achieved concurrently with its use. It results in algorithms that are not only fair to all processes but also less expensive in terms of messages. The reduction in the number of messages is achieved by reusing messages for more than one computation of the global function. The technique is illustrated for a distributed branch-and-bound problem and for asynchronous computation of fixed points.
Model Scenarios for Direction-Selective Adaptive Antennas in Cellular Mobile Communication Systems &ndash; Scanning the Literature
Authors: U. Martin, J. Fuhl, I. Gaspard, M. Haardt, A. Kuchar, C. Math, A. F. Molisch, R. Thomä
Venue: Wireless Personal Communications: An International Journal (1999)

Intelligent antennas offer the possibility of greatly increasing the capacity of cellular mobile radio systems. We give a comprehensive overview of the literature concerning model scenarios for applications of direction-selective intelligent antennas. Measurement campaigns and simplified models are described that have been derived from these measurements or from physical considerations. Furthermore, directional fading simulators are reviewed which are essential for testing of smart antenna systems.
Coloring Eulerian triangulations of the projective plane
Authors: Bojan Mohar
Venue: Discrete Mathematics (2002)

A simple characterization of the 3-, 4-, and 5-colorable Eulerian triangulations of the projective plane is given.
The Use of Integrated Organization and Information Systems Models in Building and Delivering Business Application Systems
Authors: M. Chen, J. F. Nunamaker,  Jr., E. S. Weber
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The use of integrated organization and information systems models in building and delivering business application systems is proposed. The concept of integrated organization and information systems modeling is discussed and illustrated by means of an extended critical success factors model. A flexible metasystem, MetaPlex, designed and implemented to support high-level organization and information systems modeling, is described in detail. The use of integrated models with executive information systems to support the delivery of information is discussed. Directions for future research are also suggested.
User Interfaces for Volumetric Displays
Authors: Ravin Balakrishnan, George W. Fitzmaurice, Gordon Kurtenbach
Venue: Computer (2001)

Although still in the prototype stage, three-dimensional volumetric displays present unique interface challenges. Current display technologies limit our ability to view and interact with 3D computer graphics because we typically view 3D data on a 2D system that cannot display the depth dimension. Volumetric displays hold the promise of enhancing 3D graphics realism by providing all the depth cues humans require. Incorporating everyday gestures to delineate subportions of the working volume, the authors use physical mockups to consider potentially viable displays and associated input mechanisms. Researchers can use high-fidelity mockups and props to glimpse the future with minimal prototyping effort, before the display and input technologies mature. The authors' mockups elucidate a range of design challenges and volumetric-display opportunities, revealing a rich set of alternative user-interface design options. However, more evaluation must be conducted before it's possible to harness the full potential of interacting with volumetric displays.
Simultaneous Localization and Map-Building Using Active Vision
Authors: Andrew J. Davison, David W. Murray
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

An active approach to sensing can provide the focused measurement capability over a wide field of view which allows correctly formulated Simultaneous Localization and Map-Building (SLAM) to be implemented with vision, permitting repeatable long-term localization using only naturally occurring, automatically-detected features. In this paper, we present the first example of a general system for autonomous localization using active vision, enabled here by a high-performance stereo head, addressing such issues as uncertainty-based measurement selection, automatic map-maintenance, and goal-directed steering. We present varied real-time experiments in a complex environment.
Automatic and portable performance modeling for parallel I/O: a machine-learning approach
Authors: Shengke Yu, Marianne Winslett, Jonghyun Lee, Xiaosong Ma
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

A performance model for a parallel I/O system is essential for detailed performance analyses, automatic performance optimization of I/O request handling, and potential performance bottleneck identification. Yet how to build a portable performance model for parallel I/O system is an open problem. In this paper, we present a machine-learning approach to automatic performance modeling for parallel I/O systems. Our approach is based on the use of a platform-independent performance metamodel, which is a radial basis function neural network. Given training data, the metamodel generates a performance model automatically and efficiently for a parallel I/O system on a given platform. Experiments suggest that our goal of having the generated model provide accurate performance predictions is attainable, for the parallel I/O library that served as our experimental testbed on an IBM SP. This suggests that it is possible to model parallel I/O system performance automatically and portably, and perhaps to model a broader class of storage systems as well.
Modeling of hydrate formation conditions in mixtures of methane, water and acetone
Authors: J. Javanmardi, M. Moshfeghian, C. J. Peters
Venue: Iranian Journal of Science and Technology (2002)

The new model for structure II hydrates in the ternary mixtures methane+water +1,4-dioxane, has been applied to the system methane+water+acetone. Similarly to 1,4- dioxane, acetone also has promoting effects up to a concentration of about 6-mole %. Beyond this concentration, this effect decreases and, gradually, acetone starts to change nature from a gas hydrate-promoting agent into a gas hydrate inhibitor. Based on minimization of the difference between experimental and calculated equilibrium temperatures, the Kihara parameters of acetone have been obtained. The results are in good agreement with the experimental data. The ability and accuracy of this new model are also compared with an existing model.
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
Authors: Jong Soo Park, Ming-Syan Chen, Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. Mining association rules means that, given a database of sales transactions, to discover all associations among items such that the presence of some items in a transaction will imply the presence of other items in the same transaction. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items that appear in a sufficient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of itemsets first, and then, identifying¿within this candidate set¿those itemsets that meet the large itemset requirement. Generally, this is done iteratively for each large k-itemset in increasing order of k, where a large k-itemset is a large itemset with k items. To determine large itemsets from a huge number of candidate sets in early iterations is usually the dominating factor for the overall data-mining performance. To address this issue, we develop an effective algorithm for the candidate set generation. It is a hash-based algorithm and is especially effective for the generation of candidate set for large 2-itemsets. Explicitly, the number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods¿thus resolving the performance bottleneck. Note that the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly. The advantage of the proposed algorithm also provides us the opportunity of reducing the amount of disk I/O required. Extensive simulation study is conducted to evaluate performance of the proposed algorithm.
More Efficient Topological Sort Using Reconfigurable Optical Buses
Authors: Jie Li, Yi Pan, Hong Shen
Venue: The Journal of Supercomputing (2003)

Topological sort of an acyclic graph has many applications such as job scheduling and network analysis. Due to its importance, it has been tackled on many models. Dekel et al. &lsqb;3&rsqb;, proposed an algorithm for solving the problem in O(log2 N) time on the hypercube or shuffle-exchange networks with O(N3) processors. Chaudhuri &lsqb;2&rsqb;, gave an O(log N) algorithm using O(N3) processors on a CRCW PRAM model. On the LARPBS (Linear Arrays with a Reconfigurable Pipelined Bus System) model, Li et al. &lsqb;5&rsqb; showed that the problem for a weighted directed graph with N vertices can be solved in O(log N) time by using N3 processors. In this paper, a more efficient topological sort algorithm is proposed on the same LARPBS model. We show that the problem can be solved in O(log N) time by using N3/log N processors. We show that the algorithm has better time and processor complexities than the best algorithm on the hypercube, and has the same time complexity but better processor complexity than the best algorithm on the CRCW PRAM model.
Dynamic Functional Testing for VLSI Circuits
Authors: Peter M. Maurer
Venue: IEEE Design Test (1990)

The author discusses the two main problems of dynamic testing (i.e. testing while the simulator is running), namely the design of a high-level vector-generation language and the design of the interface between the vector generator and the simulator. He offers guidelines for designing a high-level vector-generation language as well as several examples written in FHDL, a driver language developed at the University of South Florida. The author also describes a solution to interface design that is based on a special interface data structure that supports several styles of vector generators and interactive circuit debugging.
Hardware/Software Cost Analysis of Interrupt Processing Strategies
Authors: Mansur H. Samadzadeh, Loai E. Garalnabi
Venue: IEEE Micro (2001)

A new study compares the architectural design and implementation costs of five strategies that let pipelined processors support precise interrupts. Hardware dominates the cost of all strategies except checkpoint repair, which, depending on the implementation, can incur either high software or hardware costs.