ppxscal/embedding_network huggingface dataset:
Optimized view-dependent rendering for large polygonal datasets
Authors: Jihad El-Sana, Eitan Bachmat
Venue: Proceedings of the conference on Visualization '02 (2002)

In this paper we are presenting a novel approach for rendering large datasets in a view-dependent manner. In a typical view-dependent rendering framework, an appropriate level of detail is selected and sent to the graphics hardware for rendering at each frame. In our approach, we have successfully managed to speed up the selection of the level of detail as well as the rendering of the selected levels. We have accelerated the selection of the appropriate level of detail by not scanning active nodes that do not contribute to the incremental update of the selected level of detail. Our idea is based on imposing a spatial subdivision over the view-dependence trees data-structure, which allows spatial tree cells to refine and merge in real-time rendering to comply with the changes in the active nodes list. The rendering of the selected level of detail is accelerated by using vertex arrays. To overcome the dynamic changes in the selected levels of detail we use multiple small vertex arrays whose sizes depend on the memory on the graphics hardware. These multiple vertex arrays are attached to the active cells of the spatial tree and represent the active nodes of these cells. These vertex arrays, which are sent to the graphics hardware at each frame, merge and split with respect to the changes in the cells of the spatial tree.
Semiautomatic Acquisition of Semantic Structures for Understanding Domain-Specific Natural Language Queries
Authors: H. H. Meng, K. C. Siu
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper describes a methodology for semiautomatic grammar induction from unannotated corpora of information-seeking queries in a restricted domain. The grammar contains both semantic and syntactic structures, which are conducive to (spoken) natural language understanding. Our work aims to ameliorate the reliance of grammar development on expert handcrafting or on the availability of annotated corpora. To strive for reasonable coverage on real data, as well as portability across domains and languages, we adopt a statistical approach. Agglomerative clustering using the symmetrized divergence criterion groups words ¿spatially.¿ These words have similar left and right contexts and tend to form semantic classes. Agglomerative clustering using mutual information groups words ¿temporally.¿ These words tend to co-occur sequentially to form phrases or multiword entities. Our approach is amenable to the optional injection of prior knowledge to catalyze grammar induction. The resultant grammar is interpretable by humans and is amenable to hand-editing for refinement. Hence, our approach is semiautomatic in nature. Experiments were conducted using the atis (Air Travel Information Service) corpus and the semiautomatically-induced grammar $G_{SA}$ is compared to an entirely handcrafted grammar $G_H$. $G_H$ took two months to develop and gave concept error rates of 7 percent and 11.3 percent, respectively, in language understanding of two test corpora. $G_{SA}$ took only three days to produce and gave concept errors of 14 percent and 12.2 percent on the corresponding test corpora. These results provide a desirable trade-off between language understanding performance and grammar development effort.
A Neural Network with Evolutionary Neurons
Authors: Alberto Alvarez
Venue: Neural Processing Letters (2002)

A neural network, combining evolution and learning is introduced. The novel feature of the proposed network is the evolutionary character of its neurons. The argument of the transfer function performed by the neurons in the network is neither a linear nor polynomial function of the inputs to the neuron, but an unknown general function P(&middot;). The adequate functional form P(&middot;) for each neuron, is achieved during the learning period by means of genetic programming. The proposed neural network is applied to the problem domain of time series prediction of the Mackey-Glass delay differential equation. Simulation results indicate that the new neural network is effective.
Optimal Resilient Distributed Algorithms for Ring Election
Authors: M. Y. Chan, F. Y. L. Chin
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The problem of electing a leader in a dynamic ring in which processors are permitted tofail and recover during election is discussed. It is shown that theta (n log n+k/sub r/)messages, counting only messages sent by functional processors, are necessary andsufficient for dynamic ring election, where k/sub r/ is the number of processor recoveriesexperienced.
Adapting RVR Simulation Techniques for Residual Connectedness Network Reliability Models
Authors: H. Cancela, M. E. Urquhart
Venue: IEEE Transactions on Computers (2002)

The RVR (recursive variance reduction) simulation technique has been used with success for the evaluation of the terminal reliability measure of networks where only links can fail. In this paper, we show how this technique can be adapted for computing the terminal residual connectedness reliability measure in the case of networks where nodes can fail. We prove that RVR simulation of residual connectedness reliability has a lower variance than standard Monte Carlo simulation, leading to better estimates. We study the worst case computational complexity of the RVR method, and we discuss the influence of the nodes failure probability in the algorithm performance, which makes it more efficient and specially suited for very reliable networks.
Integration of Pricing with Call Admission Control to Meet QoS Requirements in Cellular Networks
Authors: Jiongkuan Hou, Jie Yang, Symeon Papavassiliou
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Call Admission Control (CAC) plays a significant role in providing the desired Quality of Service (QoS) in cellular networks. Traditional CAC schemes that mainly focus on the tradeoff between new call blocking probability and handoff call blocking probability cannot solve the problem of congestion in wireless networks. In this paper, we investigate the role of pricing as an additional dimension of the call admission control process in order to efficiently and effectively control the use of wireless network resources. First, we prove that, for a given wireless network, there exists a new call arrival rate which can maximize the total utility of users while maintaining the required QoS. Based on this result and observation, we propose an integrated pricing and call admission control scheme where the price is adjusted dynamically based on the current network conditions in order to alleviate the problem of congestion. Our proposed integrated approach implicitly implements a distributed user-based prioritization mechanism by providing negative incentives according to the current network conditions and therefore shaping the aggregate traffic in the network. We compare the performance of our approach in terms of congestion prevention, achievable total user utility, and obtained revenue, with the corresponding results of conventional systems where pricing is not taken into consideration in the call admission control process. These performance results verify the considerable improvement that can be achieved by the integration of pricing in the call admission control process in cellular networks.
Fear of Coding, and How to Reduce It
Authors: Diomidis Spinellis
Venue: Computer (2001)

Drawing on airline practices, the author proposes coding in pairs, with a senior programmer guiding a junior counterpart.
Ring embedding in faulty honeycomb rectangular torus
Authors: Hsun-Jung Cho, Li-Yen Hsu
Venue: Information Processing Letters (2002)

Assume that m and n are positive even integers with n ≥ 4. The honeycomb rectangular torus HReT(m, n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m, n) is a 3-regular bipartite graph. We prove that any HReT(m, n) - e is hamiltonian for any edge e ∈ E(HReT(m, n)). Moreover, any HReT(m, n) - F is hamiltonian for any F = {a, b} with a ∈ A and b ∈ B where A and B are the bipartition of HReT(m, n), if n ≥ 6 or m = 2.
Baire's Category Theoretic Classification of Compact Expansive Dynamical Systems
Authors: Kazutaka Sakai
Venue: Open Systems Information Dynamics (2002)

A revised version of the estimation inequality of Akashi [2] is given, and this result is applied to Baire's category theoretic classification of &epsi;-expansive dynamical systems. Moreover, this classification method is applied to topological classification of shift dynamical systems on finite-dimensional compact domains.
Drawing Dynamic Trees
Authors: Sven Moen
Venue: IEEE Software (1990)

A tree-drawing algorithm that addresses the weaknesses of current approaches to constructing graphical user interfaces is presented. Present algorithms either do not let you draw tree nodes of varying shapes and sizes or they draw such trees in a way that does not produce trees as compact as they could be, which is especially important when diagramming a large system. Also, they cannot reuse layout information when the trees changes, so after every change the layout must be recomputed and the tree redrawn. The main difference between these traditional approaches and the author's approach is that his algorithm is more geometric. Unlike other algorithms, it uses an explicit representation of node and subtree contours, and it stores every contour as a polygon. It has three advantages over traditional algorithms. It allows one to draw trees with nodes of any polygonal shape compactly. The data structure supports insert and delete operations on subtrees. It is simple to implement, yet flexible.
A Fair Resource Allocation Protocol for Multimedia Wireless Networks
Authors: Anjlica Malla, Mona El-Kadi, Stephan Olariu, Petia Todorova
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with Quality-of-Service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes.
The Desktop Designer's Illustration Handbook
Authors: Marcelle Lapow Toor
Venue:  (1997)

:The Desktop Designer's Illustration Handbook is written by a graphic designer who really knows how to teach desktop illustration techniques. Marcelle Lapow Toor has taught graphic design and desktop publishing to university students and has conducted workshops at national conferences throughout the country. Her proven building block approach helps you make practical sense of the principles of illustration, design, and composition. She easily guides you through the process - from deciding what kind of illustration to use to manipulating images for maximum visual impact. With the aid of insider tips from participating pros, hundreds of illustrations, helpful hints, and time saving checklists, Ms. Toor clearly explains how to create eye-catching results. 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
DJ-boids: emergent collective behavior as multichannel radio station programming
Authors: Jesús Ibáñez, Antonio F. Gómez-Skarmeta, Josep Blat
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

In this paper we propose to apply emergent collective behavior ideas to automatically program Internet multichannel radio stations. The proposed model simulates n virtual Dj's (one per channel) playing songs at the same time. Every virtual Dj takes into account the songs played by the other ones, programming a sequence of songs whose order is also coherent. That is, every song played in a channel takes into account both, the song previously played in the same channel and the songs being played in the other channels at the same time
L-functions for images of graph coverings by some operations
Authors: Hirobumi Mizuno, Iwao Sato
Venue: Discrete Mathematics (2002)

We express the L-functions of the line graph and the middle graph of a regular covering of a regular graph G by using some characteristic polynomials. As a corollary, we express the zeta functions of the line graph and the middle graph of a regular covering of G by using the characteristic polynomial of that regular covering.
Towards an ontology of approximate reason
Authors: James F. Peters, Andrzej Skowron, Jaroslaw Stepaniuk, Sheela Ramanna
Venue: Fundamenta Informaticae (2002)

This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an agent. Agents are designed to classify information granules derived from sensors that respond to stimuli in the environment of an agent or received from other agents. Classification of information granules is carried out in the context of parameterized approximation spaces and a calculus of granules. Judgment in agents is a faculty of thinking about (classifying) the particular relative to decision rules derived from data. Judgment in agents is reflective, but not in the classical philosophical sense (e.g., the notion of judgment in Kant). In an agent, a reflective judgment itself is an assertion that a particular decision rule derived from data is applicable to an object (input). That is, a reflective judgment by an agent is an assertion that a particular vector of attribute (sensor) values matches to some degree the conditions for a particular rule. In effect, this form of judgment is an assertion that a vector of sensor values reflects a known property of data expressed by a decision rule. Since the reasoning underlying a reflective judgment is inductive and surjective (not based on a priori conditions or universals), this form of judgment is reflective, but not in the sense of Kant. Unlike Kant, a reflective judgment is surjective in the sense that it maps experimental attribute values onto the most closely matching descriptors (conditions) in the derived rule. Again, unlike Kant's notion of judgment, a reflective judgment is not the result of searching for a universal that pertains to a particular set of values of descriptors. Rather, a reflective judgment by an agent is a form of recognition that a particular vector of sensor values pertains to a particular rule in some degree. This recognition take the form of an assertion that a particular descriptor vector is associated with a particular decision rule. These considerations can be repeated to other forms of classifiers besides those defined by decision rules.
Surgical Planning for Liver Resection
Authors: Elliot K. Fishman, Brian S. Kuszyk, David G. Heath, Luomin Gao, Brian Cabral
Venue: Computer (1996)

Advances in 3D computerized visualization of the human body are transforming liver cancer treatment. The authors describe their technique for using volume rendering of computerized tomography (CT) imaging data to generate a 3D map of the liver. This map gives surgeons vital information about liver tumor location relative to key blood vessels and other important body structures. This is particularly important for minimally invasive surgery, which permits less complete visualization than a standard surgical incision. The authors' technique could also help doctors determine which cases are operable without having to perform exploratory surgery.The key, the authors explain, is recent computer science and image-processing developments that obtain more information from data sets than just the visual display of a tumor. Advances in computer graphics hardware technology allow creation of volume-rendered images at near real-time speeds, using commercially available computer systems. The authors explain the importance of segmentation and volume rendering technologies in this effort. In addition, they discuss research and future directions in such areas as interactive tools, image-guided surgery, and virtual reality.
Local search heuristics for two-stage flow shop problems with secondary criterion
Authors: Jatinder N. D. Gupta, Karsten Hennig, Frank Werner
Venue: Computers and Operations Research (2002)

This paper develops and compares different local search heuristics for the two-stage flow shop problem with makespan minimization as the primary criterion and the minimization of either the total flow time, total weighted flow time, or total weighted tardiness as the secondary criterion. We investigate several variants of simulated annealing, threshold accepting, tabu search, and multi-level search algorithms. The influence of the parameters of these heuristics and the starting solution are empirically analyzed. The proposed heuristic algorithms are empirically evaluated and found to be relatively more effective in finding better quality solutions than the existing algorithms.
Parallel algorithms for LQ optimal control of discrete-time periodic linear systems
Authors: Peter Benner, Ralph Byers, Rafael Mayo, Enrique S. Quintana-Ort&#x00ED;, Vicente Hern&#x00E1;ndez
Venue: Journal of Parallel and Distributed Computing (2002)

This paper analyzes the performance of two parallel algorithms for solving the linear-quadratic optimal control problem arising in discrete-time periodic linear systems. The algorithms perform a sequence of orthogonal reordering transformations on formal matrix products associated with the periodic linear system and then employ the so-called matrix disk function to solve the resulting discrete-time periodic algebraic Riccati equations needed to determine the optimal periodic feedback. We parallelize these solvers using two different approaches, based on a coarse-grain and a medium-grain distribution of the computational load. The experimental results report the high performance and scalability of the parallel algorithms on a Beowulf cluster.
Use of Contextual Information for Feature Ranking and Discretization
Authors: Se June Hong
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Deriving classification rules or decision trees from examples is an important problem. When there are too many features, discarding weak features before the derivation process is highly desirable. When there are numeric features, they need to be discretized for the rule generation. We present a new approach to these problems. Traditional techniques make use of feature merits based on either the information theoretic, or the statistical correlation between each feature and the class. We instead assign merits to features by finding each feature's "obligation" to the class discrimination in the context of other features. The merits are then used to rank the features, select a feature subset, and discretize the numeric variables. Experience with benchmark example sets demonstrates that the new approach is a powerful alternative to the traditional methods. This paper concludes by posing some new technical issues that arise from this approach.
MAC and Interworking Layers for an ATM Wireless System
Authors: Francesco Delli Priscoli
Venue: Wireless Personal Communications: An International Journal (1999)

High speed Asynchronous Transfer Mode (ATM) wireless networks are assuming a growing interest in the personal communication area [1&ndash;6]. This paper describes the design of a wireless ATM system, which is being implemented in the &rsquo;&rsquo;MEDIAN&lsquo;&lsquo; project belonging to the European Community (EC) Advance Communications Technologies and Services (ACTS) programme. The Medium Access Control (MAC) aims at providing a simple and efficient transport for ATM cells from a Base Station (BS), interfaced with the ATM Broadband Integrated Service Digital Network (B-ISDN), to ATM Portable Stations (PSs) and vice versa. A Time Division Duplex (TDD) scheme is adopted in which uplink and downlink frame durations can be varied frame-by-frame, in order to fit the present uplink/downlink traffic mix. Moreover, in the uplink, a contention-free based technique is considered in which the slots are assigned to the calls depending on the present load of the PS uplink buffers. The proposed interworking with the ATM network is based on the concept of intercepting the ATM Signalling and Management Cells at the BS, in order to deduce from the ATM Q.2931 messages information relevant to the registration, the call set-up and the MAC procedures.
MultiSpec: a tool for multispectral--hyperspectral image data analysis
Authors: Larry Biehl, David Landgrebe
Venue: Computers Geosciences (2002)

MultiSpec is a multispectral image data analysis software application. It is intended to provide a fast, easy-touse means for analysis of multispectral image data, such as that from the Landsat, SPOT, MODIS or IKONOS series of Earth observational satellites, hyperspectral data such as that from the Airborne Visible-Infrared Imaging Spectrometer (AVIRIS) and EO-1 Hyperion satellite system or the data that will be produced by the next generation of Earth observational sensors. The primary purpose for the system was to make new, otherwise complex analysis tools available to the general Earth science community. It has also found use in displaying and analyzing many other types of non-space related digital imagery, such as medical image data and in K-12 and university level educational activities.MultiSpec has been implemented for both the Apple Macintosh® and Microsoft Windows® operating systems (OS). The effort was first begun on the Macintosh OS in 1988. The GLOBE (http://www.globe.gov) program supported the development of a subset of MultiSpec for the Windows OS in 1995. Since then most (but not all) of the features in the Macintosh OS version have been ported to the Windows OS version.Although copyrighted, MultiSpec with its documentation is distributed without charge. The Macintosh and Windows versions and documentation on its use are available from the World Wide Web at URL: http://dynamo.ecn.purdue.edu/~biehl/MultiSpec/ MultiSpec si copyrighted (1991-2001) by Purdue Research Foundation, West Lafayette, Indiana 47907.
Using Symbolic Computation to Find Algebraic Invariants
Authors: D. Keren
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Implicit polynomials have proved themselves as having excellent representation power for complicated objects, and there is growing use of them in computer vision, graphics, and CAD. A must for every system that tries to recognize objects based on their representation by implicit polynomials are invariants, which are quantities assigned to polynomials that do not change under coordinate transformations. In the recognition system developed at the Laboratory for Engineering Man-Machine Studies in Brown University (LEMS), it became necessary to use invariants which are explicit and simple functions of the polynomial coefficients. A method to find such invariants is described and the new invariants presented. This work addresses only the problem of finding the invariants; their stability is studied in another paper.