ppxscal/embedding_network huggingface dataset:
Impacts of influx of computer science graduates from developing countries to Europe and North America
Authors: W. A. Khan
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This paper addresses the history of the computer, from it inception as mechanical machine followed by progress due to transistors, integrated circuits, VLSI, various stages of microprocessor development, use of low level instruction set and high level languages, connectivity using various communication media, access to information on the World Wide Web and the concepts and implementation of e-technology. It draws a parallel between the industrial revolution and the IT revolution and then focuses on the influx of computer science graduates from developing countries to Europe and North America. The paper analyses the need and supply chain between the two points and identifies the pro and cons of the education imparted to these graduates. It concludes with recommendations to pacify the impact that both the donor and receiving countries share.
A switched parametric and transform audio coder
Authors: S. N. Levine
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In this paper, we present a system of sines+transients+noise modeling techniques that dynamically switches between parametric representations and transform coding based representations. The sines and noise are represented by parametric models using multiresolution sinusoidal modeling and Bark-band noise modeling, respectively. The transients are modeled by short regions of transform coding. In addition, new methods are presented for selection and quantization of sinusoidal trajectories based on trajectory length and signal-to-masking thresholds. This system is useful for both low bitrate audio coding (20-40 kbps) and compressed-domain processing, such as time-scale modification.
Host laboratory functions for the DoD 2400 bps vocoder selection process
Authors: P. D. Gatewood
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In order for a test method to yield meaningful results the equipment and procedures used to collect and format data for that test must be accurate and consistent. A laboratory evaluating narrowband digital voice coders must be prepared to generate data for a variety of test methods across numerous voice systems without introducing extraneous variability. This paper describes the functions of the host laboratory for the Department of Defense (DoD) 2400 bps vocoder selection process. The generation of calibrated, representative audio input material and the collection of processed speech is discussed. The inclusion of calibration and reference speech systems, a channel simulator, and a common testbed interface is presented. The implementation of a communicability test method is described. Strict attention to detail in preparation and procedure allow these methods to be the basis for any voice communication system evaluation and selection process.
Interactive evolution for industrial design
Authors: Boris Georg Bezirtzis, Matthew Lewis, Cara Christeson
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Interactive evolutionary design (IED) has the potential to change development processes in industrial design from generating individual solutions to designing parametric models that are employed to create a vast space of possible solutions. This paper describes the current stage of a continuing interdisciplinary project between computer science and industrial design to make IED accessible for designers. The long term goal is to integrate the software into participatory design research methods, since interactive evolutionary design interfaces can be used without extensive training and skills. Everybody can use it to intuitively identify, communicate and explore appealing solutions within a large solution space. A case study is conducted to illustrate initial experiences by applying interactive evolutionary design software to the design process of a small, electric vehicle. The findings of the case study are immediately applied to further develop the software as a new design tool. The main contribution of this article is an explanation of basic techniques for designers/artists to design and shape a solution space.
Estimation System of People's Freindship and Hierarchical Relationship from Sentence Types
Authors: NISHIHARA Yoko, SUNAYAMA Wataru, YACHIDA Masahiko
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Many people cooperate for creating something new. It is important for the team's perfomance to build a trusting relationship. It is necessary for building the trusting relationship to know the present state of the team. People are able to understand other people's friendship and hierarchical relationship from their talk. We propose an estimation system of people's friendship and hierarchical relationship. People's uttered sentence types are used to estimate the two relationships. The types are identified from meanings of auxiliary verbs and particles that are included in a sentence. We experimented confirmed that this system is efficient to estimate the two relationships.
Optimal Objective Functional Selection for Image Reconstruction in Diffuse Optical Tomography
Authors: Amol V. Patil, Soumyo Mukherji, Uday B. Desai
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Diffused Optical Tomography (DOT) is a powerful noninvasive functional imaging technique. Inter-parameter crosstalk and near source detector artifacts are major source of inaccuracies in DOT images. In this work we investigate the effect of various objective functional definitions and measurement types on performance of image reconstruction algorithm. Special attention is paid to measurement data types appropriate for handling experimental limitations and inaccuracies. We propose a method of selecting optimal objective functional by visualizing objective functionals in two parameter space using single inclusion DOT problem. Using our method we synthesize a new objective functional for our sample DOT problem. The proposed objective functionals provide minimum inter-parameter crosstalk with negligible near source detector artifacts. Limited memory quasi-Newtonian algorithm is used for image reconstruction. Synthetic data is used to demonstrate effect of various objective functionals on image reconstruction and the superiority of the proposed objective functional.
Implicit&mdash;Explicit Schemes for BGK Kinetic Equations
Authors: Sandra Pieraccini, Gabriella Puppo
Venue: Journal of Scientific Computing (2007)

In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be constructed with this technique. The methods proposed are based on an explicit---implicit time discretization. In particular the convective terms are treated explicitly, while the source terms are implicit. In this fashion even problems with infinite stiffness can be integrated with relatively large time steps. The conservation properties of the schemes are investigated. Numerical results are shown for schemes of order 1, 2 and 5 in space, and up to third-order accurate in time.
Hierarchical motion estimation based on visual patterns for video coding
Authors: Shengm Zhong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Block matching algorithms (BMAs) are often employed for motion estimation (ME) in video coding. Most conventional fast BMAs treat the ME problem as an optimization problem and suffer heavily from the problem of being trapped at local minima. The full search algorithm (FS), on the other hand, is very time-consuming. Few of them makes use of the information inherent in the images explicitly. We propose a new ME algorithm which can reduce the search range while guaranteeing global optimality in most cases, making use of the edge features. Microblock visual patterns are designed to extract edge information to guide block matching: searching is only carried out at places where the real match most likely happens. The motion field subsampling technique is further employed to get a hierarchical algorithm, which can further double the speed. The proposed algorithms obtain speeds about ten times faster than that of FS with comparable prediction quality.
CASSANDRA Framework: A Service Oriented Distributed Multimedia Content Analysis Engine
Authors: Fons de Lange, Jan Nesvadba, Johan Lukkien
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Connected Consumer Electronics (CE) devices face an exponential growth in storage, processing capabilities and connectivity bandwidth. This increased complexity calls for new software architectures that naturally admit self-organization, resource management for efficient workload distribution, and a transparent cooperation of connected CE-terminals. The interconnected nature makes advanced applications feasible such as the smart distribution of complex multimedia content analysis algorithms, resulting in automatic semantic content-awareness creation. In this paper we describe a modular, self-aware, self-organizing, real-time and distributed multimedia content analysis system. Based on a Service Oriented Architecture it is, furthermore, capable of efficiently and dynamically using the available resources in a grid-like manner.
Term Collections in λ and ρ-calculi
Authors: Germain Faure
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The @r-calculus generalises term rewriting and the @l-calculus by defining abstractions on arbitrary patterns and by using a pattern-matching algorithm which is a parameter of the calculus. In particular, equational theories that do not have unique principal solutions may be used. In the latter case, all the principal solutions of a matching problem are stored in a ''structure'' that can also be seen as a collection of terms. Motivated by the fact that there are various approaches to the definition of structures in the @r-calculus, we study in this paper a version of the @l-calculus with term collections. The contributions of this work include a new syntax and operational semantics for a @l-calculus with term collections, which is related to the @l-calculi with strict parallel functions studied by Boudol and Dezani et al. and a proof of the confluence of the @b-reduction relation defined for the calculus (which is a suitable extension of the standard rule of @b-reduction in the @l-calculus).
Partially observable Markov decision processes with imprecise parameters
Authors: Hideaki Itoh, Kiyohiko Nakamura
Venue: Artificial Intelligence (2007)

This study extends the framework of partially observable Markov decision processes (POMDPs) to allow their parameters, i.e., the probability values in the state transition functions and the observation functions, to be imprecisely specified. It is shown that this extension can reduce the computational costs associated with the solution of these problems. First, the new framework, POMDPs with imprecise parameters (POMDPIPs), is formulated. We consider (1) the interval case, in which each parameter is imprecisely specified by an interval that indicates possible values of the parameter, and (2) the point-set case, in which each probability distribution is imprecisely specified by a set of possible distributions. Second, a new optimality criterion for POMDPIPs is introduced. As in POMDPs, the criterion is to regard a policy, i.e., an action-selection rule, as optimal if it maximizes the expected total reward. The expected total reward, however, cannot be calculated precisely in POMDPIPs, because of the parameter imprecision. Instead, we estimate the total reward by adopting arbitrary second-order beliefs, i.e., beliefs in the imprecisely specified state transition functions and observation functions. Although there are many possible choices for these second-order beliefs, we regard a policy as optimal as long as there is at least one of such choices with which the policy maximizes the total reward. Thus there can be multiple optimal policies for a POMDPIP. We regard these policies as equally optimal, and aim at obtaining one of them. By appropriately choosing which second-order beliefs to use in estimating the total reward, computational costs incurred in obtaining such an optimal policy can be reduced significantly. We provide an exact solution algorithm for POMDPIPs that does this efficiently. Third, the performance of such an optimal policy, as well as the computational complexity of the algorithm, are analyzed theoretically. Last, empirical studies show that our algorithm quickly obtains satisfactory policies to many POMDPIPs.
Distance Measures for Well-Distributed Sets
Authors: Alex Iosevich, Michael Rudnev
Venue: Discrete Computational Geometry (2007)

In this paper we investigate the Erdos/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been classically used to study this problem. We conjecture that a majorant for the spherical means suffices to prove the distance conjecture(s) in this setting. For a class of non-Euclidean distances, we show that this generally cannot be achieved, at least in dimension two, by considering integer point distributions on convex curves and surfaces. In higher dimensions, we link this problem to the question about the existence of smooth well-curved hypersurfaces that support many integer points.
Web Based Visual Exploration of Patent Information
Authors: Mark Giereth, Steffen Koch, Martin Rotard, Thomas Ertl
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Patents are an invaluable source of scientific and technological information. Due to the strongly increasing number of patent applications and the broadening of the objectives of patent analysis, there is a great demand for ubiquitous access to patent information and for flexible visualizations meeting the requirements of different groups of users. In this paper we propose new visualization techniques for patent information and approaches for interactively exploring this information in web based environments. We show how these visualizations can be integrated into existing web portals by using a new paradigm that we call Semantic Lens.
SWAP: a scheduler with automatic process dependency detection
Authors: Haoqiang Zheng, Jason Nieh
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

We have developed SWAP, a system that automatically detects process dependencies and accounts for such dependencies in scheduling. SWAP uses system call history to determine possible resource dependencies among processes in an automatic and fully transparent fashion. Because some dependencies cannot be precisely determined, SWAP associates confidence levels with dependency information that are dynamically adjusted using feedback from process blocking behavior. SWAP can schedule processes using this imprecise dependency information in a manner that is compatible with existing scheduling mechanisms and ensures that actual scheduling behavior corresponds to the desired scheduling policy in the presence of process dependencies. We have implemented SWAP in Linux and measured its effectiveness on microbenchmarks and real applications. Our results show that SWAP has low overhead, effectively solves the priority inversion problem and can provide substantial improvements in system performance in scheduling processes with dependencies.
Smartocracy: Social Networks for Collective Decision Making
Authors: Marko A. Rodriguez, Daniel J. Steinbock, Jennifer H. Watkins, Carlos Gershenson, Johan Bollen, Victor Grey, Brad deGraf
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Smartocracy is a social software system for collective decision making. The system is composed of a social network that links individuals to those they trust to make good decisions and a decision network that links individuals to their voted-on solutions. Such networks allow a variety of algorithms to convert the link choices made by individual participants into specific decision outcomes. Simply interpreting the linkages differently (e.g. ignoring trust links, or using them to weight an individual's vote) provides a variety of outcomes fit for different decision making scenarios. This paper will discuss the Smartocracy network data structures, the suite of collective decision making algorithms currently supported, and the results of two collective decisions regarding the design of the system.
RE: reliable email
Authors: Scott Garriss, Michael Kaminsky, Michael J. Freedman, Brad Karp, David Mazières, Haifeng Yu
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

The explosive growth in unwanted email has prompted the development of techniques for the rejection of email, intended to shield recipients from the onerous task of identifying the legitimate email in their inboxes amid a sea of spam. Unfortunately, widely used content-based filtering systems have converted the spam problem into a false positive one: email has become unreliable. Email acceptance techniques complement rejection ones; they can help prevent false positives by filing email into a user's inbox before it is considered for rejection. Whitelisting, whereby recipients accept email from some set of authorized senders, is one such acceptance technique. We present Reliable Email (RE:), a new whitelisting system that incurs zero false positives among socially connected users. Unlike previous whitelisting systems, which require that whitelists be populated manually, RE: exploits friend-of-friend relationships among email correspondents to populate whitelists automatically. To do so, RE: permits an email's recipient to discover whether other email users have whitelisted the email's sender, while preserving the privacy of users' email contacts with cryptographic private matching techniques. Using real email traces from two sites, we demonstrate that RE: renders a significant fraction of received email reliable. Our evaluation also shows that RE: can prevent up to 88% of the false positives incurred by a widely deployed email rejection system, at modest computational cost.
Boosting Debugging Support for Complex Systems on Chip
Authors: Albrecht Mayer, Harry Siebert, Klaus D. McDonald-Maier
Venue: Computer (2007)

Advanced on-chip debugging support can help overcome the challenges of developing real-time embedded systems driven by complex SoCs, making development support a decisive selection factor. One novel approach supports the on-time development of high-quality complex systems, without greatly increasing the required design and production resources.
File-based network collaboration system
Authors: Toshinari Takahashi, Atsushi Shimbo, Masao Murota
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

Computer-Supported Cooperative Work (CSCW) requires coordinated access to shared information over computer networks; such networks have tended to use wires, but wireless networks are now becoming common. There are a large number of tools aimed at helping users to work cooperatively but these tend to be application specific, leading to proliferation and requiring a large amount of development effort. A more general purpose mechanism would keep the number of tools manageable, and would obviate the need to develop a completely new tool for each problem area. Data security is also a very important requirement in distributed systems. A solution to the problems of cooperative working must take this security requirement into account. This paper describes a mechanism aimed at both problems: a general purpose tool for cooperative working that is more secure than existing proposals. Our approach is novel in that we do not require explicit locking, which can lead to a number of problems, particularly in distributed systems, as we shall explain. Client routines act upon user requests to insert or delete blocks in a file, and request a file-server to modify a shared file according to those requests. The fileserver receives excrypted requests asynchronously and merges these requests into the current version of the document without decrypting the requests. Indeed, an interesting feature of our proposal is that the server could not decrypt the content of these requests even if it wanted to. We call this mechanism "privacy enhanced merging". Our current implementation includes a concurrent editing application that we call "Network BBS"; the server is able to make use of a conventional file-system. This is an experimental tool of our proposed "Collaborative File System".
A New IBR Approach Based on View Synthesis for Virtual Environment Rendering
Authors: Zhi-ping Hu, Yuan-jun He, Zong-ying Ou
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

A general IBR (Image Based Rendering) approach schema for synthesis image of new viewpoint is presented in this paper. Giving a series of images of an environment on closely spaced two circles viewpoints the proposed algorithm can generate perspective intermediate images of the environment in any viewpoint between two circles. In this case the same environment is displayed from the view of a virtual camera controlled by the user. The synthesis processing consists of three steps: First, the ring-like region between outer and inner circles can be divided as a set of fan-like sub-regions. Find the fan-like region to encircle the specified viewpoint; then an IBR processing between two images taken by moving camera along optical axis is implemented to generate two intermediate image; finally, an IBR processing between two images taken by moving camera around the scene is implemented to generate the destination image corresponding the specified viewpoint. Some experiment result images are also shown in this paper.