ppxscal/embedding_network huggingface dataset:
A 3-D Graphics Display System With Depth Buffer and Pipeline Processor
Authors: Akira Fujimoto, Christopher Perrott, Kansei Iwata
Venue: IEEE Computer Graphics and Applications (1984)

Capable of displaying 10,000 polygons per second, this interactive terminal produces smooth, color-shaded surfaces quickly for applications in science, engineering, training simulation, and animation.
Adaptation hiding modularity
Authors: Yuanyuan Song
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Although self-adaptivity is emerging as an important system property, designers still lack principled and systematic methods for developing, reasoning about, and synthesizing specifications, architectures, and implementations for such systems. I exploit recent work on design structure and design-time adaptive capacity to devise a method for specifying, modularizing and synthesizing mechanisms for runtime self-adaptation. Results of an early evaluation of my method on a widely studied model problem suggest that it contributes to our knowledge of self-adaptive systems and has the potential to improve their design
A Hybrid Parallel Algorithm for Complex Decision Problem Optimization
Authors: Yan Luo, Changrui Yu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, there is an attempt to develop a parallel version of the simulated annealing (SA) algorithm. Firstly, this paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of the algorithm. Secondly, the paper introduces the SA algorithm and incorporates the ideas of SA into two of the arithmetic operators of NP algorithm to form the combined NP/SA algorithm. Moreover, the paper presents the explicit optimization procedure of the hybrid parallel algorithm NP/SA. The NP/SA algorithm adopts the global optimization ability of NP algorithm and the local search ability of SA algorithm so that it improves the optimization efficiency and the convergence rate. This paper also illustrates the parallel NP/SA algorithm through an optimization example.
ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks
Authors: Shiping Chen, Baile Shi, Shigang Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Application-level multicast is a promising alternative to IP multicast due to its independence to the IP routing infrastructure and its flexibility in constructing the delivery trees. The existing overlay multicast systems either support a single data source or have high maintenance overhead when multiple sources are allowed. They are inefficient for applications that require any-source multicast with varied host capacities and dynamic membership. This paper proposes ACOM, an any-source overlay multicast system, consisting of three distributed multicast algorithms on top of a non-DHT overlay network with simple structures (random overlay with a non-DHT ring) that are easy to manage as nodes join and depart. The nodes have different capacities, and they can support different numbers of direct children during a multicast session. No explicit multicast trees are maintained on top of the overlay. The distributed execution of the algorithms naturally defines an implicit, roughly-balanced, capacity-constrained multicast tree for each source node. We prove that the system can deliver a multicast message from any source to all nodes in expected O(logc n) hops, which is asymptotically optimal, where c is the average node capacity and n is the number of members in a multicast group.
Active Service in Migrating Workflow System
Authors: Rui Wang, Guangzhou Zeng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper describes the architecture of active service model of migrating workflow system. Virtualization technologies are available for all the resources needed to construct virtual services specific group. The architecture is designed to support organizations coevolutionary for providing workflow service. In particular, these technologies enable the creation of dynamic pools of virtual resources that can be aggregated on-demand for workflow specific goal.
Software Engineering and Structured Programming
Authors: M. V. Wilkes
Venue: IEEE Transactions on Software Engineering (1976)

This paper discusses the requirements of programmers working in varying environments in relation to software engineering, structured programming, and program verification.
Data-intensive image based relighting
Authors: Biswarup Choudhury, Sharat Chandran
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Image based Relighting(IBRL) has attracted a lot of interest in the computer graphics research, gaming, and virtual cinematography communities for its ability to relight objects or scenes, from novel illuminations captured in natural or synthetic environments. However, the advantages of an image-based framework conflicts with a drastic increase in the storage caused by the huge number of reference images pre-captured under various illumination conditions. To perform fast relighting, while maintaining the visual fidelity, one needs to preprocess this huge data into an appropriate model. In this paper, we propose a novel and efficient two-stage relighting algorithm which creates a compact representation of the huge IBRL dataset and facilitates fast relighting. In the first stage, using Singular Value Decomposition, a set of eigen image bases and relighting coefficients are computed. In the second stage, and in contrast to prior methods, the correlation among the relighting coefficients is harnessed using Spherical Harmonics. The proposed method thus has lower memory and computational requirements. We demonstrate our results qualitatively and quantitatively with new generated image data.
Learning to join everything
Authors: Fernando Pereira
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Text, speech, images, video, DNA sequences provide information about entities that people can recognize when looking at a particular instance. But those entities and their attributes and relationships are not directly accessible to queries that join across types of sources. Information extraction methods based on supervised machine learning recognize mentions of entities and relationships of predefined types in different kinds of sources, which can then be used to answer some useful types of queries. However, supervised learning relies on hand-annotated training sets that are difficult to create and limit what types of entities and relationships can be joined for new applications. These limitations have prompted research into unsupervised extraction methods that rely on correlations among sources rather than hand-annotated training sets. While these methods are not yet as accurate as those based on supervised learning, they have the potential for a new query-by-example approach to information integration in which seed sets of query answers are expanded into ranked lists of potential answers by learning occurrence patterns from the seed answers. I will give examples of both types of methods from our research on biomedical information extraction, leading to some ideas on a possible convergence of search and databases through machine learning.
A Method for the Access to the Contents in a Set of Knowledge Using a Fuzzy Logic Based Intelligent Agent
Authors: Jorge Ropero, Ariel Gomez, Carlos Leon, Alejandro Carrasco
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper proposes a method for the classification of the contents in a set of knowledge in order to answer to user consultations using natural language. The system is based on a fuzzy logic engine, which takes advantage of its flexibility for managing sets of accumulated knowledge. These sets can be built in hierarchic levels by a tree structure. A method of consultation based on a fuzzy logic application provided with an interface that one may interact with in natural language is also proposed.The eventual aim of this system is the implementation of an intelligent agent to manage the information contained in an internet portal.
Finite Precision Rational Arithmetic: Slash Number Systems
Authors: D. W. Matula
Venue: IEEE Transactions on Computers (1985)

Fraction number systems characterized by fixed-slash and floating-slash formats are specified. The structure of arithmetic over such systems is prescribed by the rounding obtained from "best rational approximation." Multitiered precision hierarchies of both the fixed-slash and floating-slash type are described and analyzed with regards to their support of both exact rational and approximate real computation.
A Cooperative System of Metaheuristics
Authors: J. M. Cadenas, M. C. Garrido, E. Munoz
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Hybrid systems give more flexible mechanisms for solving complex problems that can be very difficult to solve using less tolerant approaches. Therefore, a hybrid system will be the most suitable tool in order to cope with the algorithm-instance problem, which says that it is possible that an algorithm and its parameters that obtain good results for an instance of a problem, do not get the same results for another instance of the same problem. All this leads us to use different algorithms to solve combinatorial optimization problems within a single coordinated schema, that is a hybrid cooperative system of metaheuristics. In order to build this system we have proposed a methodology for the construction of a hybrid system, based on Data Mining and Soft Computing. In order to test the usefulness of this methodology two hybrid systems based on a fuzzy model have been constructed to solve the knapsack problem. The first system coordinates two metaheuristics, a Genetic Algorithm and a Tabu Search. The second one adds a third metaheuristic, Simmulated Annealing, in order to check the robustness of the system and its capacity of obtaining higher quality solutions when a metaheuristic is added. Results obtained by this systems and a comparison with the ones obtained with individual metaheuristics are shown.
Social&ndash;biological information technology: An integrated conceptual framework
Authors: Diane Nahl
Venue: Journal of the American Society for Information Science and Technology (2007)

A model is proposed that is motivated by the growing theoretical importance of the affective domain in information science (IS) and human&ndash;computer interaction (HCI), and the increased need for integrated models that provide an explicit account of how human mental and physiological systems dynamically interact in task performance with information systems. The ecological constructionism framework defines a social and biological information technology that is created through the dynamic intersection of technological affordances in symbiotic interaction with affective, cognitive, and sensorimotor information procedures that users creatively construct to satisfice the social practices inherent in information settings. Samples of spontaneous user discourse were mapped, demonstrating the model's suitability for charting the flow of mental procedures that users perform in interaction with information systems. The framework is shown to be compatible with the research focus in the literature on information behavior in IS and user affect in HCI. It also addresses current challenges to create more versatile architectures integrating technology, biology, and community into organic or synergic systems. The model specifies the components and dynamics of a human&ndash;computer symbiotic information environment. &copy; 2007 Wiley Periodicals, Inc.
Research on Risk Control Model of Cooperatively Technical Innovation based on Wavelet and Nerve Network
Authors: Yang Changhui
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Innovation is the impetus and source of enterprise development, and the cooperatively technical innovation is become a main innovation method. It is necessary to take measure to prevent and indemnify the loss that the risk may bring. Because of the existence of the complex non-linear function mechanism between the risk factors, so the non-linear method can be used to research the keeping way and controlling mechanism of cooperatively technical innovation. At first, this paper analyzed the seeking method of enterprise cooperatively technical innovation risk, and the steps of seeking risks are presented. And then the concept of controlling risk regulation gradient is put forward, and the method of calculating risk regulation gradient is expatiated in detail. The nerve network is suitable for recognizing and simulating nonlinear system, and the wavelet transformation or the decomposition displays the good time frequency localization characteristic and the multi-criteria function, therefore the wavelet nerve network based on the wavelet decomposition and the nerve network has the good fault-tolerant ability and the non-linearity approaching performance. And based on this, a complete controlling risk model of cooperatively technical innovation is brought forward, and the algorithm of risk control model is discussed.
An Adaptive Multi-node Downloading Partitioning Algorithm of Distributed Virtual Environment Based on Grid Computing
Authors: Yuying Wang, Hongmei Li, Jinyuan Jia
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

When users are connected to a Large Scale distributed virtual environment system on internet, downloading speed is a key point to support a life-like world and real time interactions for a large number of avatars in a consistent fashion. We proposed an adaptive multi-node downloading partitioning algorithm to balance the bottleneck problem on multi-node downloading architecture we designed. It facilitates a flexible and scalable downloading large scale DVE. Our method has five major steps: (1) to build up a database by partitioning the ground of a DVE into two-dimensional square regions covered with three-dimensional objects uniformly; (2) to determine statically a region where an avatar's area of interest located according to its spatial coherence; (3) to group the grid nodes located on same region in DVE; (4) to build a downloading servers group within each region and adapt it dynamically; (5) to balance the downloading workload dynamically. A specific multi-node downloading component is devised for supporting remote multi-thread downloading DVE based Globus platform. The downloading speed is proportional to the number of grid nodes participated in the downloading task in each region. Initial experimental results show the feasibility and effectiveness of our approach
Identifying semantic equivalence for multi-document summarisation
Authors: Eamonn Newman, Joe Carthy, John Dunnion, Nicola Stokes
Venue: Artificial Intelligence Review (2006)

We describe Semantic Equivalence and Textual Entailment Recognition, and outline a system which uses a number of lexical, syntactic and semantic features to classify pairs of sentences as "semantically equivalent". We describe an experiment to show how syntactic and semantic features improve the performance of an earlier system, which used only lexical features. We also outline some areas for future work.
On the efficient and fast response for sensor deployment in sparse wireless sensor networks
Authors: Ben-Jye Chang, Jia-Bin Peng
Venue: Computer Communications (2007)

Wireless sensor networks have recently become new techniques and popular research issues. A wireless sensor network consists of a large number of sensor nodes that have the capabilities of sensing, computing and wireless transmission. Wireless sensor networks (namely WSNs) assist people in working under dangerous environments, provide long-term target observations and track on moving objects. Consequently, WSNs decrease risk and increase efficiency. Although WSNs have been studied extensively, several problems should be addressed, such as sensor-deployment policy, data aggregation/fusion issue, and data transmission issue. An efficient sensor-deployment approach could decrease cost, minimize transmission delay and reduce time complexity. Most studies have proposed the probability-based sensor-deployment policies to monitor an overall area. However, not the entire network is interested to be sensed/monitored. Monitoring of an entire area brings several disadvantages: (1) high cost of placing large number of sensors, (2) long delay of data transmission, (3) slow response and (4) unnecessary data aggregation. Furthermore, previous works were lack of considering the difference between the sensing and the transmission radii, and then yield inaccurate analysis. This work thus proposes an efficient sensor placement approach (namely ESP) for a sparse interested area with considering of obstructers that block the data transmission and sensing signal. Additionally, the issue of different radii of sensing and transmission is analyzed in detail. Numerical results demonstrate that the proposed ESP approach requires the least number of sensor nodes under various network sizes and different number of obstacles. Simulation results indicate that the number of sensor nodes decreases when the sensing or transmission radius increases. The running time of ESP, O(K^2), is also analyzed, which is better than that of the probability-based approaches, O(N^2), where K is the number of interested grids and N is the number of grids.
Computer Graphics: The Need for Graphics Design Part One
Authors: W. Myers
Venue: Computer (1981)

Graphics design and computer graphics should be inseparable partners, not virtual strangers. This is the first of two articles examining the relationship between the two fields. 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
An Interactive System for Reading Unformatted Printed Text
Authors: R. N. Ascher, G. M. Koppelman, M. J. Miller, G. Nagy, G. L. Shelton
Venue: IEEE Transactions on Computers (1971)

A system intended to provide input of printed text to computers is applied to published patents, annotated law reports, and technical journals.
Animating the Human Muscle Structure
Authors: Xiaosong Yang, Jian Chang, Jian J. Zhang
Venue: Computing in Science and Engineering (2007)

Graphical simulations of human muscle motion and deformation are of great interest to medical education. In this article, the authors present a technique for simulating muscle deformations by combining physically and geometrically based computations to reduce computation cost and produce fast, accurate simulations.
Extensions to P2MP RSVP-TE for VPN-specific state provisioning with fair resource sharing
Authors: Haesun Byun, Meejeong Lee
Venue: Computer Communications (2007)

Among the resource provisioning algorithms for the hose-based Virtual Private Network (VPN) Quality of Service (QoS), VPN-specific state provisioning allows the service provider to obtain highest resource multiplexing gains. In this paper, we show that the existing resource reservation protocols proposed for the Internet are not appropriate for the VPN-specific state provisioning. Furthermore, since the VPN-specific state provisioning makes the reserved resources to be randomly shared by the sites belonging to the same VPN, a site generating heavy traffic may unfairly dominate the resources reserved for the VPN. We propose extensions to an existing resource reservation protocol proposed for the Internet, i.e., P2MP RSVP-TE (Point-to-Multipoint Resource Reservation Protocol-Traffic Engineering), for the resource reservation of VPN-specific state provisioning. The proposed extensions also enable the fair usage of reserved resources among the users of a VPN that is provisioned by the VPN-specific state. Through simulation experiments, the effects of deploying a fair usage mechanism into the resource reservation of VPN-specific state provisioning is presented.
Merging radiometric grids using histogram matching
Authors: D. R. Cowan, G. R. J. Cooper
Venue: Computers Geosciences (2008)

Large-scale compilations of airborne geophysical data are an important part of regional-scale mineral exploration and in most cases, the compilation involves merging datasets of varying quality, acquired over a long period of time. Merging radiometric datasets involves the additional complication that many older surveys were flown with uncalibrated spectrometer systems. Conventional grid merging is based on calculation of base-level shift and scaling factors for each grid with the grid edges feathered. However, even after these corrections, soil moisture differences between surveys acquired over a long period of time and at different seasons when soil moisture content varied introduce scaling errors into the estimated radioelement concentrations. An alternative method based on histogram matching is suggested as an improvement on existing methods. Source code in Matlab format is available from the server at www.iamg.org.
2007 Special Issue: A computational neuroscience approach to consciousness
Authors: Edmund T. Rolls
Venue: Neural Networks (2007)

Simultaneous recordings from populations of neurons in the inferior temporal visual cortex show that most of the information about which stimulus was shown is available in the number of spikes (or firing rate) of each neuron, and not from stimulus-dependent synchrony, so that it is unlikely that stimulus-dependent synchrony (or indeed oscillations) is an essential aspect of visual object perception. Neurophysiological investigations of backward masking show that the threshold for conscious visual perception may be set to be higher than the level at which small but significant information is present in neuronal firing and which allows humans to guess which stimulus was shown without conscious awareness. The adaptive value of this may be that the systems in the brain that implement the type of information processing involved in conscious thoughts are not interrupted by small signals that could be noise in sensory pathways. I then consider what computational processes are closely related to conscious processing, and describe a higher order syntactic thought (HOST) computational theory of consciousness. It is argued that the adaptive value of higher order thoughts is to solve the credit assignment problem that arises if a multistep syntactic plan needs to be corrected. It is then suggested that it feels like something to be an organism that can think about its own linguistic, and semantically-based thoughts. It is suggested that qualia, raw sensory and emotional feels, arise secondarily to having evolved such a higher order thought system, and that sensory and emotional processing feels like something because it would be unparsimonious for it to enter the planning, higher order thought, system and not feel like something.