ppxscal/embedding_network huggingface dataset:
SIGART special issue on machine learning
Venue: Issue 76 (April 1981) (1981)

Current research on Machine Learning encompasses a diverse set of approaches, and of opinions regarding where the important issues lie. The significant increase of interest and research activity in Machine Learning over the past few years has led us to organize this special issue of SIGART, whose purpose is to provide a snapshot of current research in this field. This issue contains a set of summaries of ongoing research, solicited from the community at large, and received from thirty-five research groups from around the world. A substantial bibliography on Machine Learning is also included. 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 Efficient Secure Key Issuing Protocol in ID-Based Cryptosystems
Authors: Raju Gangishetti, M. Choudary Gorantla, Manik Lal Das, Ashutosh Saxena, Ved P. Gulati
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.
Do people trust their eyes more than ears?: media bias in detecting cues of expertise
Authors: Jens Riegelsberger, M. Angela Sasse, John D. McCarthy
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Enabling users to identify trustworthy actors is a key design concern in online systems and expertise is a core dimension of trustworthiness. In this paper, we investigate (1) users' ability to identify expertise in advice and (2) effects of media bias in different representations. In a laboratory study, we presented 160 participants with two advisors -- one represented by text-only; the other represented by one of four alternate formats: video, audio, avatar, or photo+text. Unknown to the participants, one was an expert (i.e. trained) and the other was a non-expert (i.e. untrained). We observed participants' advice seeking behavior under financial risk as an indicator of their trust in the advisor. For all rich media representations, participants were able to identify the expert, but we also found a tendency for seeking video and audio advice, irrespective of expertise. Avatar advice, in contrast, was rarely sought, but -- like the other rich media representations -- was seen as more enjoyable and friendly than text-only advice. In a future step we plan to analyze our data for effects on advice uptake.
Hypermedia Systems Development Practices: A Survey
Authors: Michael Lang, Brian Fitzgerald
Venue: IEEE Software (2005)

Do shoddy project management, inadequate requirements analysis and planning, and ad hoc "quick and dirty" techniques really characterize hypermedia development? How are such projects guided and controlled? This survey shows that talk of a "crisis" is largely unfounded.
DA Standards Activities
Authors: Patrick M. Hefferan
Venue: ACM SIGDA Newsletter (1991)

TOKYO, JAPAN, November 12, 1990 --- Japan Electronic Industry Development Association (JEIDA) announces the schedule for the first phase UDL/I software development and delivery. The main development plan, which includes the design and program development of the compiler, simulator, waveform user interface and others, has been awarded to Fintronic USA, Inc., of San Mateo, CA. This selection has been made by the UDL/I Software Development Committee (USDC) among four companies that submitted proposals: three from the USA and one from India. Recently, the detailed agreements among JEIDA, Fintronic USA and Advanced Software Technology and Mechatronics Research Institute (ASTEM), Kyoto, JAPAN, have been completed. The UDL/I Intermediate Format will be released at the end of March 1991, the beta program will be released by the end of December 1991, and the final programs will be distributed by the end of March 1992.
Neuro-fuzzy structures and their comparative analyzes
Authors: Robert Nowicki, Agata Pokropińska
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

In the paper various neuro-fuzzy architectures will be tested and compared. These architectures are based on the weighted version of triangular norms in rule aggregation and Cartesian product parts. The main goal of the paper is to investigate if the new architectures lead to improvement of results of classification and approximation. The structures will be tested on the typical benchmarks (Wine Recognition, Wisconsin Breast Cancer Data, Nonlinear Dynamic Plant and Modeling of a Static Nonlinear Function).
Enhancing grid capabilities: IBP over IPv6
Authors: Alessandro Bassi, Micah Beck, Julien Laganier, Gabriella Paolini
Venue: Future Generation Computer Systems (2005)

Grid computing is considered as the ultimate solution for the scientific computing community. The main accent was first put on the computational side, as the other factors, such as network and storage, were considered as given. Logistical Networking started to fill the gap in the research of storage aspects of grid, and is now widely accepted and known as a mechanism to manage distributed storage resources, in an Internet-style way. In this paper we would like to show the advantages that the adoption of IPv6 can provide to the Internet Backplane Protocol(IBP), that can be considered the foundation stone of Logistical Networking, and therefore to grid systems. On top of it, IBP allows mixed IPv4/IPv6 environments to coexist, providing a very elegant way of moving data between grids based on different networking protocols.
A new approach to computer science in the liberal arts
Authors: Brendan Burns
Venue: Journal of Computing Sciences in Colleges (2005)

In the following we make the case for a new course for introducing computer science in the liberal arts classroom. The course is related to breadth-first computer science, but is aimed at developing a broad course suitable for non-majors to gain a comprehensive overview of computer science beyond its algorithmic and mathematic fundamentals. One of the aims of the liberal arts philosophy is to provide students with broad exposure to subject which may not be their primary focus. Neither traditional non-majors courses or introductory programming classes fit this goal. In contrast we propose a course structure which aims to survey computer science in one or two semesters while providing students with significant training and experience in programming.
Robust and Efficient Foreground Analysis for Real-Time Video Surveillance
Authors: Ying-Li Tian, Max Lu, Arun Hampapur
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a new method to robustly and efficiently analyze foreground when we detect background for a fixed camera view by using mixture of Gaussians models and multiple cues. The background is modeled by three Gaussian mixtures as in the work of Stauffer and Grimson [11]. Then the intensity and texture information are integrated to remove shadows and to enable the algorithm working for quick lighting changes. For foreground analysis, the same Gaussian mixture model is employed to detect the static foreground regions without using any tracking or motion information. Then the whole static regions are pushed back to the background model to avoid a common problem in background subtraction ¿ fragmentation (one object becomes multiple parts). The method was tested on our real time video surveillance system. It is robust and run about 130 fps for color images and 150 fps for grayscale images at size 160x120 on a 2GB Pentium IV machine with MMX optimization.
Cluster-Head Election Using Fuzzy Logic for Wireless Sensor Networks
Authors: Indranil Gupta, Denis Riordan, Srinivas Sampalli
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Wireless Sensor Networks (WSNs) present a new generation of real-time embedded systems with limited computation, energy and memory resources that are being used in a wide variety of applications where traditional networking infrastructure is practically infeasible. Appropriate cluster-head node election can drastically reduce the energy consumption and enhance the lifetime of the network. In this paper, a fuzzy logic approach to cluster-head election is proposed based on three descriptors - energy, concentration and centrality. Simulation shows that depending upon network configuration, a substantial increase in network lifetime can be accomplished as compared to probabilistically selecting the nodes as cluster-heads using only local information.
Neural network analysis using the Java mathematical and statistics library (JMSL&trade;)
Authors: Edward R. Jones
Venue: Journal of Computing Sciences in Colleges (2005)

Statistical methods are taught in many different college level courses in Computer Science, Psychology, Social Science, Business and Mathematics. Forecasting is a popular topic in these courses using linear and non-linear regression analysis, time series analysis, logistic regression and other statistical methods. Neural networks can replace all of these techniques. An added advantage is that forecasts from neural networks are easier to construct and as accurate as or more accurate than more traditional methods.A neural network consists of interconnected computational nodes, referred to as perceptrons, that map input attributes to one or more outputs. This makes neural networks ideal for forecasting, classify unknown data, and solve pattern recognition problems.
A Fast Implementation of Multiplicative Inversion Over GF(2^m )
Authors: Francisco Rodriguez-Henriquez, Nazar A. Saqib, Nareli Cruz-Cortes
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, an efficient architecture for multiplicative inversion in GF(2^m ) using addition chains is presented. The approach followed was based on the Itoh-Tsujii algorithm targeting a fast implementation on reconfigurable hardware devices. We give the design details of the proposed architecture whose main building blocks are a field multi-squarer block, a field polynomial multiplier and a BRAM two-ports memory. Our design is able to compute multiplicative inversion in GF(2^{193} ) in about 1.33µS using only 27 clock cycles.
Review of "Object-Oriented Programming with Visual Basic.NET by Michael McMillan"; Cambridge University Press: Cambridge, &copy;2004, 0-521-53983-8
Authors: Haoyang Che
Venue: ACM SIGSOFT Software Engineering Notes (2005)

I've already been a VB user for almost seven years. However, I must confess that I've rarely touched it since the last multimedia medical project. We used VB 6 in our development team, for that VB.NET didn't gain ground at that time. The first time I heard of VB.NET was in mid-2002. Then all of a sudden when I got up in the next morning, Microsoft .NET technology seemed to have become popular overnight. Buzzwords and slogans were everywhere: on the Internet, on the weighty books of published abstracts, on T-shirts, on sweatshirts, and even on souvenir pens. Is VB.NET still VB? Everyone may bear the question in his mind when he first glimpses at it. Object-Oriented Programming with Visual Basic.NET by Michael McMillan will give you a reasonable answer.
Scheduling Based on the Impact over Process Communication of Parallel Applications
Authors: Renato Porfirio Ishii, Rodrigo Fernandes de Mello, Luciano Jose Senger, Marcos Jose Santana, Regina Helena Carlucci Santana
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

This paper presents a new model for the evaluation of the impacts on processing operations resulting from the communication among processes. The model quantifies the traffic volume imposed on the communication network by means of the latency parameters and the overhead. Such parameters represent the load that each process imposes over the network and the delay on the CPU, as a consequence of the network operations. The delay is represented on the model by means of metric measurements slowdown. The equations that quantify the costs involved in the processing operation and message exchange are defined. In the same way, equations to determine the maximum network bandwidth are used on the decision-making scheduling. The proposed model uses a constant that delimitates the communication network maximum allowed usage, this constant de- fines two possible scheduling techniques: group scheduling or through communication network. Such techniques are incorporated to the DPWP policy, generating an extension of this policy. Results confirm the performance enhancement of parallel applications.
Channel-estimate-based frequency-domain equalization (CE-FDE) for broadband single-carrier transmission: Research Articles
Authors: Qing Zhang, Tho Le-Ngoc
Venue: Wireless Communications Mobile Computing (2004)

A channel-estimate-based frequency-domain equalization (CE-FDE) scheme for wireless broadband single-carrier communications over time-varying frequency-selective fading channels is proposed. Adaptive updating of the FDE coefficients are based on the timely estimate of channel impulse response (CIR) to avoid error propagation that is a major source of performance degradation in adaptive equalizers using least mean square (LMS) or recursive least square (RLS) algorithms. Various time-domain and frequency-domain techniques for initial channel estimation and adaptive updating are discussed and evaluated in terms of performance and complexity. Performance of uncoded and coded systems using the proposed CE-FDE with diversity combining in different time-varying, multi-path fading channels is evaluated. Analytical and simulation results show the good performance of the proposed scheme suitable for broadband wireless communications. For channels with high-Doppler frequency, diversity combining substantially improves the system performance. For channels with sparse multi-path propagation, a tap-selection strategy used with the CE-FDE systems can significantly reduce the complexity without sacrificing the performance. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Articulated Structure from Motion by Factorization
Authors: P. Tresadern, I. Reid
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Multibody affine Structure From Motion (SFM) methods commonly assume independent motion between objects such that the ýmeasurement matrixý has rank 4k. When multiple views are available, each object is then independently calibrated to a metric co-ordinate frame. However, articulated motion results in a further decrease in rank ¿ a fact that we exploit to detect articulated objects and determine their degrees of freedom using simple linear methods. Furthermore, these objects cannot be recovered and calibrated independently since this violates articulation constraints. We show that articulation constraints can be imposed during factorization and self-calibration to recover consistent 3D structure and motion, from which link lengths and joint angles can be computed. The stability of the method is evaluated using synthetic data for comparison with ground truth and results are also presented for real image sequences.
Data Agnostic Resource Scheduling in the Grid
Authors: Geoffrey G. Hayward, L. Ian Lumb
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Data grid architectures must confront the antipodal problems of data locality and global data coherence. Here, we examine a new approach to meeting these conflicting needs that leverages a storage wide area network, a clustered file system, a distributed block system, and a distributed resource scheduler. We examine multi-site concurrent I/O performance on an emulated three-site data grid with inter-site separations ranging from 1000km-5000km. We examine workloads that require all sites to interact with a single, globally coherent data image. In particular, all three sites perform concurrent write operations to shared files within a single file system.
News
Authors: Greg Goth
Venue: IEEE Internet Computing (2004)

The long economic stagnation in the Internet's core might be soon coming to a close. The optic fiber laid in the bubble's heady days might soon be in demand not by commercial enterprises that need applications like video on demand, but by networks centered on educational centers that ship huge amounts of data to each other, and to their prospective public and private sector partners.
An Empirical Analysis of Forecast Sharing in the Semiconductor Equipment Supply Chain
Authors: Christian Terwiesch, Z. Justin Ren, Teck H. Ho, Morris A. Cohen
Venue: Management Science (2005)

We study the demand forecast-sharing process between a buyer of customized production equipment and a set of equipment suppliers. Based on a large data collection we undertook in the semiconductor equipment supply chain, we empirically investigate the relationship between the buyer's forecasting behavior and the supplier's delivery performance. The buyer's forecasting behavior is characterized by the frequency and magnitude of forecast revisions it requests (forecast volatility) as well as by the fraction of orders that were forecasted but never actually purchased (forecast inflation). The supplier's delivery performance is measured by its ability to meet delivery dates requested by the customers. Based on a duration analysis, we are able to show that suppliers penalize buyers for unreliable forecasts by providing lower service levels. Vice versa, we also show that buyers penalize suppliers that have a history of poor service by providing them with overly inflated forecasts.
Increasing the Impedance Range of a Haptic Display by Adding Electrical Damping
Authors: Joshua S. Mehling, J. Edward Colgate, Michael A. Peshkin
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This work examines electrical damping as a means for improving haptic display performance. Specifically, electrical damping, like its mechanical counterpart, can significantly reduce the occurrences of limit cycle oscillations at high impedance boundaries in virtual environments. Furthermore, electrical damping has a number of advantages including its simplicity of design and the ease at which it can be made frequency dependent so that it does not adversely affect a deviceýs low impedance range. This work examines the theoretical behavior and practical application of frequency dependent electrical damping as it applies to haptic displays. Data is presented illustrating a significant increase in the range of virtual wall behaviors that a one degree-of-freedom device is capable of displaying when electrical damping is added.
Meta Change Queue: Tracking Changes to People, Places, and Things
Authors: Jon Finke
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Managing information flow between different parts of the enterprise information infrastructure can be a daunting task. We have grown too large to send the complete lists around anymore, instead we need to send just the changes of interest to the systems that want them. In addition, we wanted to eliminate "sneaker net" and have the systems communicate directly without human intervention. Some of our applications required real time updates, and for all cases, we needed to respect the "business rules" of the destination systems when entering information. This paper describes a general method for propagating changes of information while respecting the needs of the target systems.
Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
Authors: Qin Ni
Venue: SIAM Journal on Optimization (2005)

The problem of minimizing a conic function subject to an ellipsoidal constraint is discussed in this paper. The feasible set of this problem is divided into three different cases. Necessary and sufficient optimality conditions are obtained for different cases where there is a characterization of optimality for the basic case. These conditions provide a sound basis for the further development of efficient methods for trust-region subproblems of a conic model.
Optimal statistical operators for 3-dimensional rotational data: geometric interpretations and application to prosthesis kinematics
Authors: Oyvind Stavdahl, Anne Karin Bondhus, Kristin Y. Pettersen, Kjell E. Malvig
Venue: Robotica (2005)

Rotational data in the form of measured three-dimensional rotations or orientations arise naturally in many fields of science, including biomechanics, orthopaedics and robotics. The cyclic topology of rotation spaces calls for special care and considerations when performing statistical analysis of rotational data. Relevant theory has been developed during the last three decades, and has become a standard tool in some areas. In relation to the study of human kinematics and motion however, these concepts have hardly been put to use. This paper gives an introduction to the intricacies of three-dimensional rotations, and provides a thorough geometric interpretation of several approaches to averaging rotational data. A set of novel, simple operators is presented. Simulations and a prosthetics-related real-world example involving wrist kinematics illuminate important aspects of the results. Finally generalizations and related subjects for further research are suggested.
On the relationship between minimum norm and linear prediction for spatial spectrum estimation
Authors: Sverre Holm
Venue: Signal Processing (2005)

When teaching high-resolution spatial spectrum estimation, there is a simple progression from the minimum variance method to the MUSIC method, while the linear prediction and minimum norm methods seem to be more or less independent methods based on their own unique criteria of optimality. In this paper, the minimum norm method is derived from the linear prediction method in exactly the same way as the MUSIC method is derived from the minimum variance method. The derivation consists of replacing the correlation with its noise subspace component and setting all noise eigenvalues to unity. This makes it simpler to understand the methods and their properties. This relationship also brings out the meaning of setting the first element to unity in the minimum norm method--it corresponds to the predicted element in linear prediction.