ppxscal/embedding_network huggingface dataset:
Sync Classes: A Framework for Optimal Scheduling of Requests in Multimedia Storage Servers
Authors: Leana Golubchik, V. s. Subrahmanian, Sherry Marcus, Joachim Biskup
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

There have been many proposals on how media-on-demand servers can effectively allow clients to share resources. In this paper, given a set of clients, we show how these clients may be partitioned into ¿sync-classes¿¿sets of clients who can be serviced through allocation of a single set of resources. As a set of clients may be partitioned into sync-classes in many different ways, we show that a very large class of cost functions may be used to determine which partition to choose. We provide algorithms to compute such optimal splits. Our framework is very generic in the following ways: 1) The system may plug-in any cost function whatsoever, as long as it satisfies four common-sense axioms that evaluate costs, and 2) the system may evaluate the future anticipated requests of a user using any user model (e.g., a Markovian model) that has a specified I/O interface. Thus, a wide variety of predictive methods (of what the user will do) and a wide variety of costing methods may be used within our framework.
Fitting Superellipses
Authors: Paul L. Rosin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

In the literature, methods for fitting superellipses to data tend to be computationally expensive due to the nonlinear nature of the problem. This paper describes and tests several fitting techniques which provide different trade-offs between efficiency and accuracy. In addition, we describe various alternative error of fit (EOF) measures that can be applied by most superellipse fitting methods.
Handling Execution Overruns in Hard Real-Time Control Systems
Authors: Marco Caccamo, Giorgio Buttazzo, Lui Sha
Venue: IEEE Transactions on Computers (2002)

In many real-time control applications, the task periods are typically fixed and worst-case execution times are used in schedulability analysis. With the advancement of robotics, flexible visual sensing using cameras has become a popular alternative to the use of embedded sensors. Unfortunately, the execution time of visual tracking varies greatly. In such environments, control tasks have a normally short computation time, but also an occasional long computation time; therefore, the use of worst-case execution time is inefficient for control performance optimization. Nevertheless, to maintain the control stability, we still need to guarantee the schedulability of the task set, even if the worst case arises. In this paper, we propose an integrated approach to control performance optimization and task scheduling for control applications where the execution time of each task can vary greatly. We present an innovative approach to overrun management that allows us to fully utilize the processor for optimizing the control performance and yet guaranteeing the schedulability of all tasks under worst-case conditions.
Exploring the Role of Diagnosis in Software Engineering
Authors: Les Hatton
Venue: IEEE Software (2001)

Software engineers, encouraged to believe that their capability to remove defects matches their ambition to do so, rarely contemplate the possibility of software failure during design. Changing this attitude-and improving diagnostics- could reverse software's tendency toward repetitive failure.
2-connected and 2-edge-connected Steinhaus graphs
Authors: Dongju Kim, Daekeun Lim
Venue: Discrete Mathematics (2002)

The numbers of 2-connected and 2-edge-connected Steinhaus graphs with n vertices are determined for n ≥ 6. The possible generating strings of 2-connected and 2-edge-connected Steinhaus graphs are classified.
Selling Believable Technology
Authors: Christophe Debou, Norbert Fuchs, Heinz Saria
Venue: IEEE Software (1993)

A general framework that enables software developers to more effectively and objectively package and advertise their products is presented. Key to the framework is the formation and testing of verifiable hypotheses. The framework is used to measure the pros and cons of introducing two technologies to developers. The first involved introducing complexity metrics to the maintainers of a telecommunications system. The second involved introducing Lotos, a formal description language, to industrial developers. In both applications, tools and techniques from ESPRIT and RACE projects were used.
SEI's Software Product Line Tenets
Authors: Linda M. Northrop
Venue: IEEE Software (2002)

Software product lines are rapidly emerging as a viable and important software development paradigm. The Software Engineering Institute defines basic concepts and the activities and practices that ensure success. The author shares how-to's, success stories, and lessons learned while defining and applying this approach.
The Timewheel Group Communication System
Authors: Shivakant Mishra, Christof Fetzer, Flaviu Cristian
Venue: IEEE Transactions on Computers (2002)

This paper describes a group communication system, called the timewheel group communication system, that has been designed for a timed asynchronous distributed system model. All protocols in the timewheel frop communication system have been designed to be fail-aware in the sense that a process can detect, at any point in time, whether any of its properties is violated. Although these protocols have been designed to operate in an asynchronous distributed computing environment, they provide timeliness properties. The timewheel group communication system provides nine group communication semantics that a user can dynamically choose from while broadcasting an update. This system provides high throughput, fast delivery and stability times, uses a small number of messages per update broadcast, and evenly distributes the processing load among group members.
Medical Information and the Internet: Do You Know What You Are Getting?
Authors: Fitzgerald Craan, Denise M. Oleske
Venue: Journal of Medical Systems (2002)

Due to the Internet technology, hundreds of Web sites are accessible for medical information, and the retrieval of such information is quite rapid. Once you as a consumer obtain all of this information, how do you determine whether the information you are looking at is valid and current and even relevant to your needs? This article presents various criteria necessary to evaluate the information on a medical Web site; no standards currently are in place to mandate the validity of information published on the Internet.
Recognizing Mathematical Expressions Using Tree Transformation
Authors: Richard Zanibbi, Dorothea Blostein, James R. Cordy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expression in three successive passes. The Layout Pass constructs a Baseline Structure Tree (BST) describing the two-dimensional arrangement of input symbols. Reading order and operator dominance are used to allow efficient recognition of symbol layout even when symbols deviate greatly from their ideal positions. Next, the Lexical Pass produces a Lexed BST from the initial BST by grouping tokens comprised of multiple input symbols; these include decimal numbers, function names, and symbols comprised of nonoverlapping primitives such as ¿=¿. The Lexical Pass also labels vertical structures such as fractions and accents. The Lexed BST is translated into $\LaTeX$. Additional processing, necessary for producing output for symbolic algebra systems, is carried out in the Expression Analysis Pass. The Lexed BST is translated into an Operator Tree, which describes the order and scope of operations in the input expression. The tree manipulations used in each pass are represented compactly using tree transformations. The compiler-like architecture of the system allows robust handling of unexpected input, increases the scalability of the system, and provides the groundwork for handling dialects of mathematical notation.
Conditional Connectivity Measures for Large Multiprocessor Systems
Authors: S. Latifi, M. Hegde, M. Naraghi-Pour
Venue: IEEE Transactions on Computers (1994)

Introduces a new measure of conditional connectivity for large regular graphs by requiring each vertex to have at least g good neighbors in the graph. Based on this requirement, the vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized.
Databases with Alternative Information
Authors: W. Homenda
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Alternative information is studied. Two different pieces of information, I1 AND/OR I2 and EITHER I1 OR I2 are examples of alternative information. Applicable models of data do not distinguish information of this kind, but such distinction, however, is important in many circumstances. An attempt to distinguish and process alternative information is made.
Simulating a Function of Visual Peripheral Processes with an Analog VLSI Network
Authors: Hua Li, Ching-Ho Chen
Venue: IEEE Micro (1991)

A two-dimensional analog VLSI network for implementing a function of motion perception during the peripheral process is described. The network contains many nodes, or processing elements (PEs), which operate concurrently in asynchronous fashion. Each PE performs an image-difference operation as well as thresholding to extract motion information on a pixel-by-pixel basis. Analog voltage, which interacts extremely quickly, implements all computations. An energy equilibrium state of the network provides stabilized analog voltage across the network. SPICE simulations and experiments using real images verify the results of the theoretical analysis.
Nonregular Abnormal Extremals of 2-Distribution: Existence, Second Variation, and Rigidity
Authors: I. Zelenko
Venue: Journal of Dynamical and Control Systems (1999)

We study existence and rigidity (W^1_\infty-isolatedness) of nonregular abnormal extremals of completely nonholonomic 2-distribution (nonregularity means that such extremals do not satisfy the strong generalized Legendre&ndash;Clebsch condition). Introducing the notion of diagonal form of the second variation, we generalize some results of A. Agrachev and A. Sarychev about rigidity of regular abnormal extremals to the nonregular case. In order to reduce the second variation to the diagonal form, we construct a special curve of Lagrangian subspaces, a Jacobi curve. We show that certain geometric properties of this curve (like simplicity) imply the rigidity of the corresponding abnormal extremal.
Health Care Web Sites: Are They Reliable?
Authors: Edward J. Clark
Venue: Journal of Medical Systems (2002)

Locating reliable health care information on the World Wide Web is difficult and confusing. Thus, Internet users must choose the appropriate resources to guide their health care decisions. This paper will describe the &ldquo;typical&rdquo; Internet user. Then, it will compare the three most &ldquo;comprehensive&rdquo; web site guidelines. Finally, it will summarize what criteria are necessary to create and maintain reliable health care web sites.
Investigation on hexane-insoluble materials in lecithin
Authors: M. I. Nasir
Venue: Iranian Journal of Science and Technology (2002)

In lecithin production unit Of Jahan Vegetable Oil Co. (JVOC), Karaj, Iran, studies are made for the lecithin produced by hexane extracted soybean oil, with the standard specification (except for hexane-insoluble (HI) materials), which, is above 0.3% in crude lecithin. HI materials in lecithin are detrimental to clarity as it can cause haziness in fluid lecithin and usability in specific application. Analyses of crude oil before and after filtration indicated that filter plates do not effect lyre move of the impurities of residual fines, seed fragments and metal particles. Crude oil has more HI materials during degumming than before degumming. Analyses of oil and lecithin during processing steps showed increase in HI and toluene-insoluble (TI) materials where ever water was added. Degumming water contained about 360-1330 ppm salt (T.S), which contributed to the HI mateials. About 30-38% of HI are salt and the rest are water-soluble most probably sugar, Salt free water and efficient filtration of oil, as tested in laboratory degumming process, decreased the HI matters in lecithin to below 0.3%.
PaleoNet: paleontology, publication and community in the digital age
Authors: Norman MacLeod
Venue: Computers Geosciences (2002)

PaleoNet is an electronic communications system that realizes the concept of a global 'paleontological community'. It was begun in a conscious attempt to overcome the disciplinary, geographical, and occupational barriers that subdivide that community into sectors and impede information flow. Operationally PaleoNet consists of a listserver and associated web sites in the US and UK. Over the past 8 years of operation PaleoNet has more than met expectations set for it to become one of the most unconventional and innovative aspects of the contemporary paleontological scene. In particular, PaleoNet challenges conventional notions of formal scientific publication as the primary means paleontologists use to communicate with colleagues.
A Rule-Based Software Test Data Generator
Authors: W. H. Deason, D. B. Brown, K. -H. Chang, J. H. Cross II
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Rule-based software test data generation is proposed as an alternative to either path/predicate analysis or random data generation. A prototype rule-based test data generator for Ada programs is constructed and compared to a random test data generator. Four Ada procedures are used in the comparison. Approximately 2000 rule-based test cases and 100000 randomly generated test cases are automatically generated and executed. The success of the two methods is compared using standard coverage metrics. Simple statistical tests showing that even the primitive rule-based test data generation prototype is significantly better than random data generation are performed. This result demonstrates that rule-based test data generation is feasible and shows great promise in assisting test engineers, especially when the rule base is developed further.
Least Committed Splines in 3D Modelling of Free Form Objects from Intensity Images
Authors: Kuntal Sengupta, Prabir Burman, Sumit Gupta
Venue: Journal of Mathematical Imaging and Vision (2002)

Generating 3D models of objects from video sequences is an important problem in many multimedia applications ranging from teleconferencing to virtual reality. In this paper, we present a method of estimating the 3D face model from a monocular image sequence, using a few standard results from the affine camera geometry literature in computer vision, and spline fitting techniques using a modified non parametric regression technique. We use the bicubic spline functions to model the depth map, given a set of observation depth maps computed from frame pairs in a video sequence. The minimal number of splines are chosen on the basis of the Schwartz's Criterion. We extend the spline fitting algorithm to hierarchical splines. Note that the camera calibration parameters and the prior knowledge of the object shape is not required by the algorithm. The system has been successfully demonstrated to extract 3D face structure of humans as well as other objects, starting from their image sequences.
Practical fast computation of Zernike moments
Authors: Al-Rawi Mohammed, Yang Jie
Venue: Journal of Computer Science and Technology (2002)

The fast computation of Zernike moments from normalized geometric moments has been developed in this paper. The computation is multiplication free and only additions are needed to generate Zernike moments. Geometric moments are generated using Hatamian's filter up to high orders by a very simple and straightforward computation scheme. Other kinds of moments (e.g., Legendre, pseudo Zernike) can be computed using the same algorithm after giving the proper transformations that state their relations to geometric moments. Proper normalizations of geometric moments are necessary so that the method can be used in the efficient computation of Zernike moments. To ensure fair comparisons, recursive algorithms are used to generate Zernike polynomials and other coefficients. The computational complexity model and test programs show that the speed-up factor of the proposed algorithm is superior with respect to other fast and/or direct computations. It perhaps is the first time that Zernike moments can be computed in real time rates, which encourages the use of Zernike moment features in different image retrieval systems that support huge databases such as the XM experimental model stated for the MPEG-7 experimental core. It is concluded that choosing direct computation would be impractical.
Genetic Algorithm and Graph Partitioning
Authors: Thang Nguyen Bui, Byung Ro Moon
Venue: IEEE Transactions on Computers (1996)

Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The algorithms include a fast local improvement heuristic. One of the novel features of these algorithms is the schema preprocessing phase that improves GAs' space searching capability, which in turn improves the performance of GAs. Experimental tests on graph problems with published solutions showed that the new genetic algorithms performed comparable to or better than the multistart Kernighan-Lin algorithm and the simulated annealing algorithm. Analyses of some special classes of graphs are also provided showing the usefulness of schema preprocessing and supporting the experimental results.
Situation Assessment for Process Control
Authors: Francois Jakob, Pierre Suslenschi
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

Extase, a situation assessment system that finds the causes of alarm signals relating to the heating furnace of a distillation column, is presented. The system is centered around two design principles. First, heterogeneous knowledge is represented by causally describing process functions. Second, a hypothesis network that supports local search control, stores time-dependent dynamic information, and forms a basis for the explanation facility is progressively built. The motivations and requirements for this research are examined, the process environment that served as an example is described, and system implementation is discussed. Extase has been installed and tested in a refinery and has completed its first development cycle. The authors describe and discuss system implementation principles in detail. Finally, they present the results of field testing and assess the system's limits and strengths.
A note on triangle-free and bipartite graphs
Authors: Hans Jurgen Promela, Thomas Schickinger, Angelika Steger
Venue: Discrete Mathematics (2002)

Using a clever inductive counting argument Erdös, Kleitman and Rothschild showed that almost all triangle-free graphs are bipartite, i.e., the cardinality of the two graph classes is asymptotically equal. In this paper, we investigate the structure of the few triangle-free graphs which are not bipartite. Using similar techniques as Erdös, Kleitman and Rothschild we prove that with high probability these graphs can be made bipartite by removing a single vertex. In this sense these graphs are almost bipartite.
Mica: A Wireless Platform for Deeply Embedded Networks
Authors: Jason L. Hill, David E. Culler
Venue: IEEE Micro (2002)

Low-power integration of sensing, communication, and computation requires a new approach to wireless design. Flexible interfaces and primitive accelerators enable aggressive system-level optimizations.
Segmented Information Dispersal (SID) Data Layouts for Digital Video Servers
Authors: Ariel Cohen, Walter A. Burkhard
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We present a novel data organization for disk arrays¿Segmented Information Dispersal (SID). SID provides protection against disk failures while ensuring that the reconstruction of the missing data requires only relatively small contiguous accesses to the available disks. SID has a number of properties that make it an attractive solution for fault-tolerant video servers. Under fault-free conditions, SID performs as well as RAID 5 and organizations based on balanced incomplete block designs (BIBD). Under failure, SID performs much better than RAID 5 since it significantly reduces the size of the disk accesses performed by the reconstruction process. SID also performs much better than BIBD by ensuring the contiguity of the reconstruction accesses. Contiguity is a very significant factor for video retrieval workloads, as we demonstrate in this paper. We present SID data organizations with a concise representation which enables the reconstruction process to efficiently locate the needed video and check data.
Demonstration of the complex event recognition architecture for multimodal event parsing
Authors: Will Fitzgerald, R. James Firby, Michael Hannemann
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

An important criterion for many intelligent user interfaces is that the interface be multimodal, that is, allow the user to interact with the system using a variety of different input channels. In addition to user interface interactions per se, the system may need to process input from multiple channels to make decisions in response to interface interactions or for other related purposes.The multimodal event parsing system described in our paper has been implemented in a working system called CERA, the Complex Event Recognition Architecture. CERA, developed under contract with NASA, has been used to identify complex events across multiple sensor channels in an advanced life support system demonstration project.We will demonstrate:The CERA event recognition language,The CERA event recognition engine at work,A custom development environment for writing and debugging CERA event recognizers, Visualization tools for complex event display,Integrating CERA with various toolkits and projects.The CERA event recognition engine is written in Common Lisp [1] and has a custom development environment with visualization tools based within the Eclipse extensible IDE [2]. This combination provides an easy to use development environment that can be used remotely, while maintaining the interactive flexibility of Lisp.As well as being a stand-alone event recognition system, CERA has also been tightly integrated with the RAP execution system [3] and the I/NET Conversational Interface system for dialogue management [4]. This combination allows the creation of human/computer interfaces for dynamic systems that make use of natural language, multi-channel controls and sensors, and other available physical context.Our demonstration will consist of a number of different components designed to illustrate the various aspects of CERA and our approach to building multimodal interfaces. The first demonstration will show CERA processing and combining events from multiple input streams, including examples from the NASA advanced life support system domain. The emphasis of this demonstration will be to show how event recognizers are built and how they work in practice.Our second demonstration will illustrate the CERA IDE and visualization tools. These tools allow the programming of a remote CERA system and the monitoring and debugging of its operation. Techniques for monitoring recognition progress and examining partial recognition state will be examined.Finally, we will demonstrate a more complex interface that combines natural language input with various non-linguistic input streams. An automotive telematics application will form the basis of this demonstration. The audience will be encouraged to participate in this demonstration.