ppxscal/embedding_network huggingface dataset:
Similarity Analysis of Video Sequences Using an Artificial Neural Network
Authors: Suchendra M. Bhandarkar, Feng Chen
Venue: Applied Intelligence (2005)

Comparison of video sequences is an important operation in many multimedia information systems. The similarity measure for comparison is typically based on some measure of correlation with the perceptual similarity (or difference) amongst the video sequences or with the similarity (or difference) in some measure of semantics associated with the video sequences. In content-based similarity analysis, the video data are expressed in terms of different features. Similarity matching is then performed by quantifying the feature relationships between the target video and query video shots, with either an individual feature or with a feature combination. In this study, two approaches are proposed for the similarity analysis of video shots. In the first approach, mosaic images are created from video shots, and the similarity analysis is done by determining the similarities amongst the mosaic images. In the second approach, key frames are extracted for each video shot and the similarity amongst video shots is determined by comparing the key frames of the video shots. The features extracted include image histograms, slopes, edges, and wavelets. Both individual features and feature combinations are used in similarity matching using an artificial neural network. The similarity rank of the query video shots is determined based on the values of the coefficients of determination and the mean absolute error. The study reported in this paper shows that the mosaic-based similarity analysis can be expected to yield a more reliable result, whereas the key frame-based similarity analysis could be potentially applied to a wider range of applications. The weighted non-linear feature combination is shown to yield better results than a single feature for video similarity analysis. The coefficient of determination is shown to be a better criterion than the mean absolute error in similarity matching analysis.
The prolog phenomenon
Authors: Drew McDermott
Venue: Issue 72 (July 1980) (1980)

In 1968, Carl Hewitt introduce PLANNER, a "procedural deductive system." [Hewitt 72] It featured some very innovative concepts for the theorem-proving community of that time: the procedural interpretation of deduction, pattern-directed procedure invocation, an indexed data base of assertions and programs, and nondeterminism (backtracking). A simple version was implemented by Sussman, Winograd and Charniak [Sussman 71] and used by Winograd in his exciting work on natural language. [Winograd 72] A very similar language, QA4, was implemented on the West Coast. [Rulifson 72] These languages, known by the ambitious term "AI languages," were widely perceived as providing built-in facilities that everyone would need for the next generation of AI systems, the way LISP had provided facilities for the previous one.
Proposal to eliminate denormalized numbers
Authors: Bob Fraley, Steve Walther
Venue: ACM SIGNUM Newsletter (1979)

While the denormalized numbers extend the effective range of a floating point format for a given number format, we feel that the benefits do not justify the expense. This expense can be seen not only in the implementation of floating point but in the use of the resulting system. We feel that they further increase the difficulty of understanding the standard and its implications. Specifically:a. The feature increases the complexity of implementing the standard.b. The cost of producing high-quality software will increase because of this feature.c. Unexpected errors may be introduced into results due to denormalized numbers.d. The added effective range is quite small, especially in Double Format.e. Denormalized numbers may be added at a later time if desired, losing little of the proposed facility.
Scalable wideband speech coding using G.729 as a component
Authors: Akitoshi Kataoka, Shinji Hayashi
Venue: Systems and Computers in Japan (2005)

This paper proposes a scalable band-split wideband speech coding system that uses G.729 as a component and can decode speech from even part of the 16 kbit&sol;s encoded data. The configuration of the proposed scalable encoding is as follows. The 7-kHz band speech signal is split into lower and upper bands, which are encoded separately. The lower band is scalably encoded at 12 kbit&sol;s, and the upper band is encoded by CELP composed only of the noise codebook (4 kbit&sol;s). In the lower band, the lower-level encoder (core layer) is included in the upper-level encoder (enhancement layer) as part of the functional element, to improve the performance of the whole lower-band encoder. To further improve quality while retaining scalability to the core coder, an additional pitch prediction scheme is proposed in which the excitation component of the enhancement layer is used in the pitch component. Performance evaluation by objective measures and a subjective evaluation experiment for the proposed schemes, showed that the quality is greatly improved compared with the conventional method. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 65&ndash;74, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10555
A multi-threaded PIPELINED Web server architecture for SMP/SoC machines
Authors: Gyu Sang Choi, Jin-Ha Kim, Deniz Ersoz, Chita R. Das
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Design of high performance Web servers has become a recent research thrust to meet the increasing demand of network-based services. In this paper, we propose a new Web server architecture, called multi-threaded PIPELINED Web server, suitable for Symmetric Multi-Processor (SMP) or System-on-Chip (SoC) architectures. The proposed PIPELINED model consists of multiple thread pools, where each thread pool consists of five basic threads and two helper threads. The main advantages of the proposed model are global information sharing by the threads, minimal synchronization overhead due to less number of threads, and non-blocking I/O operations, possible with the helper threads.We have conducted an in-depth performance analysis of the proposed server model along with four prior Web server models (Multi-Process (MP), Multi-Thread (MT), Single-Process Event-Driven (SPED) and Asynchronous Multi-Process Event-Driven (AMPED)) via simulation using six Web server workloads. The experiments are conducted to investigate the impact of various factors such as the memory size, disk speed and numbers of clients. The simulation results indicate that the proposed PIPELINED Web server architecture shows the best performance across all system and workload parameters compared to the MP, MT, SPED and AMPED models. Although the MT and AMPED models show competitive performance with less number of processors, the advantage of the PIPELINED model becomes obvious as the number of processors or clients in an SMP/SoC machine increases. The MP model shows the worst performance in most of the cases. The results indicate that the proposed server architecture can be used in future large-scale SMP/SoC machines to boost system performance.
Surgeons' Economic Profiles: Can We Get the "Right" Answers?
Authors: Eric L. Eisenstein, Charles F. Bethea, Lawrence H. Muhlbaier, Marie Davidian, Eric D. Peterson, Judith A. Stafford, Daniel B. Mark
Venue: Journal of Medical Systems (2005)

Hospitals and payers use economic profiling to evaluate physician and surgeon performance. However, there is significant variation in the data sources and analytic methods that are used. We used information from a hospital's cardiac surgery and cost accounting information systems to create surgeon economic profiles. Three scenarios were examined: (1) surgeon modeled as fixed effect with no patient-mix adjustment; (2) surgeon modeled as fixed effect with patient-mix adjustment; (3) and surgeon modeled as random effect with patient-mix adjustment. We included 574 patients undergoing coronary artery bypass surgery at Baptist Medical Center, Oklahoma City, OK between July 1, 1995 and April 30, 1996. We found that profiles reporting unadjusted average surgeon costs may incorrectly identify high- and low-cost outliers. Adjusting for patient-mix differences and treating surgeons as random effects was the preferred approach. These results demonstrate the need for hospitals to reexamine their economic profiling methods.
Security vs Performance: Tradeoffs using a Trust Framework
Authors: Aameek Singh, Sandeep Gopisetty, Linda Duyanovich, Kaladhar Voruganti, David Pease, Ling Liu
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

We present an architecture of a trust framework that can be used to intelligently tradeoff between security and performance in a SAN file system. The primary idea is to differentiate between various clients in the system based on their trustworthiness and provide them with differing levels of security and performance. Client trustworthiness reflects its expected behavior and is evaluated in an online fashion using a customizable trust model. We also describe the interface of the trust framework with an example block level security solution for an out-of-band virtualization based SAN file system (SAN FS). The proposed framework can be easily extended to provide differential treatment based on data sensitivity, using a configurable parameter of the trust model. This allows associating stringent security requirements for more sensitive data, while trading off security for better performance for less critical data, a situation regularly desired in an enterprise.
DA STANDARDS ACTIVITIES
Authors: Patrick M. Hefferan
Venue: ACM SIGDA Newsletter (1989)

Dr. Jim Armstrong from Virginia Polytechnic Institute (VPI) called to order the third meeting of the VHDL modeling subcommittee of the IEEE DATC on January 12 at MCC in Austin, Texas. This meeting was held jointly with the Electronic Industry Association (EIA). The meeting was started by recounting what had taken place at the previous two meetings. He detailed the approach taken by the group to develop a model standard. Four papers will be published in a special issue of Design amp; Test magazine devoted to VHDL. There was much discussion on the means of interchanging information within the group. Electronic mail would be the most convenient, but only half of the members are on a network. A VHDL bulletin board was also discussed, a list was passed around the room for e-mail addresses and to indicate interest in a bulletin board. Some of the attendees weren't sure what the final output of the committee would be. Ron Waxman's idea was that the outcome would be a set of recommended practices submitted to IEEE for balloting. There was also some talk about subsets, and what the committee's position should be on them. The general consensus was that subsets are not recommended, but due to the complexity of VHDL, are unavoidable.
The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem
Authors: Joseph G. Szmerekovsky
Venue: Management Science (2005)

Recent approaches to modeling the client's payment-scheduling problem allow the client to control both the timing of payments and the completion times of activities. In practice, the activity schedule is typically determined by the contractor rather than the client. This paper addresses this drawback by considering a model in which the client selects the payment activities and the contractor selects the activity schedule, each to maximize his own net present value (NPV). In addition, the contractor has the option to reject the project if it does not provide a minimum NPV. The new model is shown to be NP-hard in the strong sense and a branch-and-bound procedure is provided for its solution. Results are obtained for the new model that contradict those of the older models. The benefits to the client are no longer increasing with retention and no longer decreasing with the number of payments. Furthermore, it is no longer ideal for the client to focus payments at the beginning and end of the project. Empirical evidence based on a randomly generated data set suggests that the market for the contractor's services, the timing of benefits received by the client, and the project duration drive these new results.
Business Services Networks: delivering the promises of B2B
Authors: Jay M. Tenenbaum, Rohit Khare
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

The fundamental challenge of e-commerce is enabling companies to do business with one another across a network, despite different business processes and computer systems. Traditionally, these problems were overcome through custom point-to-point integration or Electronic Data Interchange (EDI) networks. These expensive, time-consuming approaches make economic sense only when companies do a lot of business together. The promise of the Internet, by contrast, is an open e-business platform where companies can do business spontaneously with anyone, anywhere, anytime. Business Services Networks fulfill that vision. This vision paper also presents CommerceNet's role in catalyzing industrial adoption.
Modeling the Effect of Rayleigh Damping on the Stability of Real-Time Finite Element Models
Authors: Shaun Paul Marlatt, Shahram Payandeh
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The relationship between Rayleigh damping and the critical integration step size of linear explicit finite element models using centered difference integration is explored. From experimental results, an analytical formula is derived that extends the Courant condition to include Rayleigh damping, allowing real-time computation of stable time-step sizes for viscously damped finite element models for haptic simulations.
Data Stream Query Processing
Authors: Nick Koudas, Divesh Srivastava
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This tutorial provides a comprehensive and cohesive overview of the key research results in the area of data stream query processing, both for SQL-like and XML query languages.
Predicting outcomes of web navigation
Authors: Jacek Gwizdka, Ian Spence
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Two exploratory studies examined the relationships among web navigation metrics, measures of lostness, and success on web navigation tasks. The web metrics were based on counts of visits to web pages, properties of the web usage graph, and similarity to an optimal path. Metrics based on similarity to an optimal path were good predictors of lostness and task success.
AcceSS: accessibility through simplification & summarization
Authors: Bambang Parmanto, Reza Ferrydiansyah, Andi Saptono, Lijing Song, I Wayan Sugiantara, Stephanie Hackett
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

The goal of this project is to make the Web more accessible by providing some of the features naturally available to sighted users to users with visual impairments. These features are direct access and gestalt understanding, which can emerge from simplification and summarization. Simplification is achieved by retaining sections of the web page that are considered important while removing the clutter. The purpose of summarization is to provide the users with a preview of the web page. Simplification and summarization are implemented as a "guide dog" that helps users navigate the entire web site.
An Efficient Feature Selection Using Multi-Criteria in Text Categorization
Authors: Son Doan, Susumu Horiguchi
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Text categorization is a problem of assigning a document into one or more predefined classes. One of the most interesting issues in text categorization is feature selection. This paper proposes a novel approach in feature selection based on multi-criteria ranking of features. Based on a threshold value for each criterion, a new procedure for feature selection is proposed and applied to a text categorization. Experiments dealing with the Reuters-21578 benchmark data and the naive Bayes algorithm show that the proposed approach outperforms performances in compare to conventional feature selection methods.
Provable dimension detection using principal component analysis
Authors: Siu-Wing Cheng, Yajun Wang, Zhuangzhi Wu
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We present simple algorithms for detecting the dimension k of a smooth manifold M ⊂ Rd from a set P of point samples, provided that P satisfies a standard sampling condition as in previous results. The best running time so far is O(d2O(k7 log k)) worst-case by Giesen and Wagner after the adaptive neighborhood graph is constructed in O(d|P|2) worst-case time. Given the adaptive neighborhood graph, for any l ≥ 1, our algorithm outputs the true dimension with probability at least 1-2-l in O(2O(k)kd(k + l log d)) expected time. Our experimental results validate the effectiveness of our approach in computing the dimension. A further advantage is that both the algorithm and its analysis can be generalized to the noisy case, in which outliers and a small perturbation of the samples are allowed.
A queueing model with time-varying QoS and call dropping for evaluating the performance of CDMA cellular systems: Research Articles
Authors: Bin Liu, Attahiru Sule Alfa
Venue: Wireless Communications Mobile Computing (2004)

In this paper, we present a queueing model to evaluate the performance of CDMA reverse link in a multiple cell environment. Since CDMA capacity is interference limited, both the communication quality of ongoing calls and the admission condition of new arriving calls for each cell depend on the time-varying signal-to-interference ratio (SIR). We use a quasi-birth-and-death process to capture the variation of traffic loads in cells. After obtaining the stationary distribution of the system, we study some important performance indices such as the outage probability of existing calls, the blocking probability of new calls, the average carried traffic in a cell and the dropping frequency of ongoing calls. Numerical results reveal the effects of system parameters on its performance. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Strong, Stable, and Reliable Fitness Pressure in XCS due to Tournament Selection
Authors: Martin V. Butz, Kumara Sastry, David E. Goldberg
Venue: Genetic Programming and Evolvable Machines (2005)

Recent analysis of the XCS classifier system have shown that successful genetic learning strongly depends on the amount of fitness pressure towards accurate classifiers. Since the traditionally used proportionate selection is dependent on fitness scaling and fitness distribution, the resulting evolutionary fitness pressure may be neither stable nor sufficiently strong. Thus, we apply tournament selection to XCS. In particular, we exhibit the weakness of proportionate selection and suggest tournament selection as a more reliable alternative. We show that tournament selection results in a learning classifier system that is more parameter independent, noise independent, and more efficient in exploiting fitness guidance in single-step problems as well as multistep problems. The evolving population is more focused on promising subregions of the problem space and thus finds the desired accurate, maximally general representation faster and more reliably.
A Div-Curl Lemma for Edge Elements
Authors: Snorre H. Christiansen
Venue: SIAM Journal on Numerical Analysis (2005)

A variant of Murat and Tartar's div-curl lemma is stated and proved for Nédélec's edge elements. Given two sequences of vector fields of this type, converging weakly in L2 as the mesh width tends to 0, we prove that their scalar product converges in the sense of distributions when one of the sequences consists of so-called discrete divergence-free fields whereas the other has relatively compact $\curl$ in H-1. The proof uses a uniform norm equivalence related to discrete compactness properties of vector finite element spaces and a super-approximation property of scalar finite element spaces.
Benchmarking CAD search techniques
Authors: Dmitriy Bespalov, Cheuk Yiu Ip, William C. Regli, Joshua Shaffer
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

While benchmark datasets have been proposed for testing computer vision and 3D shape retrieval algorithms, no such datasets have yet been put forward to assess the relevance of these techniques for engineering problems. This paper presents several distinctive benchmark datasets for evaluating techniques for automated classification and retrieval of CAD objects. These datasets include (1) a dataset of CAD primitives (such as those common in constructive solid geometry modeling); (2) two datasets consisting of classes generated by minor topological variation; (3) two datasets of industrial CAD models classified based on object function and manufacturing process, respectively; (4) and a dataset of LEGO&copy; models from the Mindstorms&copy; robotics kits. Each model in the datasets is available in three formats - ACIS SAT, ISO STEP, and as a VRML mesh (some models are available under several different fidelity settings). These are all available through the National Design Repository.Using these datasets, we present comprehensive empirical results for ni&nacute;e (9) different shape and solid model matching and retrieval techniques. These experiments show, as expected, that the quality of precision-recall performance can significantly vary on different datasets. These experiments reveal that for certain object classes and classifications, such as those based on manufacturing processes, all existing techniques perform poorly. This study reveals the strengths and weaknesses of existing research in these areas, introduces open challenge problems, and provides meaningful datasets and metrics against which the success of current and future work can be measured.
Multi-Modal Perceptualization of Volumetric Data and Its Application to Molecular Docking
Authors: Ross Maciejewski, Seungmoon Choi, David S. Ebert, Hong Z. Tan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, we present a multi-modal data perceptualization system used to analyze the benefits of augmenting a volume docking problem with other perceptual cues, particularly stereoscopic vision and haptic rendering. This work focuses on the problem of matching complex three-dimensional shapes in order to reproduce known configurations. Specifically, we focus on the docking of two proteins, actin and cofilin, responsible for cellular locomotion. Users were shown examples of cofilin combining with actin and asked to reproduce this match. Accuracy of the match and completion time were measured and analyzed in order to quantify the benefits of augmenting tools for such a task.
Packet Routing in Dynamically Changing Networks on Chip
Authors: Mateusz Majer, Christophe Bobda, Ali Ahmadinia, Jurgen Teich
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication among modules which are dynamically placed on a reconfigurable device at run-time. Using simulation, we compare the performance of an adaptive Qrouting algorithm to the well known XY-routing strategy. Both algorithms are adapted to support communication on the DyNoC which is equivalent to routing on meshes with obstacles. In our experiments, Q-routing proves its performance under varying network load while using only local information for its routing decisions.