ppxscal/embedding_network huggingface dataset:
O(n) mass matrix inversion for serial manipulators and polypeptide chains using Lie derivatives
Authors: Kiju Lee, Yunfeng Wang, Gregory S. Chirikjian
Venue: Robotica (2007)

Over the past several decades, a number of O(n) methods for forward and inverse dynamics computations have been developed in the multibody dynamics and robotics literature. A method was developed by Fixman in 1974 for O(n) computation of the mass-matrix determinant for a serial polymer chain consisting of point masses. In other of our recent papers, we extended this method in order to compute the inverse of the mass matrix for serial chains consisting of point masses. In the present paper, we extend these ideas further and address the case of serial chains composed of rigid-bodies. This requires the use of relatively deep mathematics associated with the rotation group, SO(3), and the special Euclidean group, SE(3), and specifically, it requires that one differentiates real-valued functions of Lie-group-valued argument.
An Architecture for Software Systems with Time Constraints
Authors: Jianmin Jiang, Hongping Shu, Li Xu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A software system's architecture provides a model of the system that suppresses implementation detail, allowing the architect to concentrate on the analysis and decisions that are most crucial to structuring the system to satisfy its requirements, specially including time constraints. In his paper, we propose a timed model for an architecture for software systems with time constraints and investigate structural and behavioral relations among timed components and the composite of them in this model. These work will be likely used for consistency testing and verification of component-based analysis and development for real-time systems.
Automatic feature selection in the markov random field model for information retrieval
Authors: Donald A. Metzler
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Previous applications of the Markov random field model for information retrieval have used manually chosen features. However, it is often difficult or impossible to know, a priori, the best set of features to use for a given task or data set. Therefore, there is a need to develop automatic feature selection techniques. In this paper we describe a greedy procedure for automatically selecting features to use within the Markov random field model for information retrieval. We also propose a novel, robust method for describing classes of textual information retrieval features. Experimental results, evaluated on standard TREC test collections, show that our feature selection algorithm produces models that are either significantly more effective than, or equally effective as, models with manually selected features, such as those used in the past.
The influence of feature-rich computerized glosses on reading comprehension and vocabulary acquisition
Authors: Elyes Ben Salem, Ronald Aust
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

To investigate the influence of media-rich computerized glosses on reading comprehension and vocabulary acquisition, we assigned second language Spanish learners to five conditions: 1) no gloss, 2) gloss with text (English translation), 3) text and audio (spoken in Spanish and English), 4) text, audio and picture, 5) text, audio, picture and writing. Participants read a 608 word Spanish story with 25 glossed words, and completed comprehension and vocabulary tests. Gloss users had significantly higher reading comprehension and vocabulary acquisition scores than non-gloss users. The quantity of gloss accesses was positively correlated to comprehension and vocabulary scores, especially when learners use glosses that include text, audio and picture. Results also found that reading time was positively correlated to comprehension. The more frequently second language learners consult computerized glosses the better they comprehend and acquire new words. Glosses with text, audio and carefully selected pictures are particularly beneficial in advancing the ability to produce new words.
Multicast based Middleware for Parallel Stream Processing
Authors: Aizaz Hakro, Marguerite C. Murphy
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents the design and evaluation of Ultimate Stream: middleware that allows real-time delivery of streaming video data to all computers in a local multicast group. No special hardware or software support other than standard TCP/IP Multicast over a local subnet is required. Frame level data shredding and reconstruction are used to provide consistency and synchronization without retransmission. A prototype scientific application (MouseCam) was implemented to evaluate our design in a practical context. The middleware layer is flexible enough to work with a number of different types of data, including sequential JPEG images, as used in this prototype. The MouseCam prototype demonstrates that our software can be effectively used as a backbone inside a private subnet to transfer large amounts of streaming data to multiple nodes in real-time for subsequent processing in parallel.
Assignment of Tasks in a Distributed Processor System with Limited Memory
Authors: G. S. Rao
Venue: IEEE Transactions on Computers (1979)

A recently published algorithm shows how to assign modules to a two-processor computer system with distributed execution so as to minimize the total of execution costs and interprocessor communication costs. In this paper we consider the same problem except that one processor has limited memory capacity. Although this problem is NP-complete, techniques based on the Gomory-Hu tree from network flow theory can be applied to instances of the problem to obtain a reduction in complexity. A new technique based on a graph called the inclusive cut graph is shown to be an even more powerful tool. These two techniques can solve some instances of the problem completely; still others are reduced sufficiently to be susceptible to enumerative techniques. In the worst case, the techniques yield no reduction in problem size.
The Computer-aided Programming System?A Friendly Programming Environment
Authors: Neng Yao
Venue: IEEE Micro (1985)

A conventional system puts the programmer through a time-consuming cycle of manual referencing, code correction, and program re-execution. This system provides a window-based on-line help facility to ease and speed the programming process. 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
XML Data Representation in Document Image Analysis
Authors: A. Belaid, Y. Rangoni, I. Falk
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents the XML-based formats ALTO, TEI, METS used for Digital Libraries and their interest for data representation in a Document Image Analysis and Recog- nition (DIAR) process. In the first part we briefly present these formats with focus on their adequacy for structural representation and modeling of DIAR data. The second part shows how these formats can be used in a reverse engineer- ing process. Their implementation as a data representation framework will be shown.
A Guide to Sources of Information about Computer Graphics
Authors: C. Machover
Venue: IEEE Computer Graphics and Applications (1981)

Computer graphics is now a mature discipline, supported by an extensive literature, a number of professional societies, and a full schedule of conferences, workshops, and short courses.
A Hybrid Method of Feature Selection for Chinese Text Sentiment Classification
Authors: Suge Wang, Yingjie Wei, Deyu Li, Wu Zhang, Wei Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Text sentiment classification can be extensively applied to information retrieval, text filtering, online tracking evaluation, the diagnoses of public opinions and chat systems. In this paper, a kinds of hybrid methods, based on category distinguishing ability of words and information gain, is adopted to feature selection. For examining the impact of varying the feature dimension to classification results, using corpus of car reviews, feature dimensions, 1000, 2000 and 3000 are adopted in our experiments. The experiments classification results indicate that the hybrid methods are best with feature dimension equal to 3000, and the result by using hybrid methods is superior to that by directly using information gain. In our experiments F value can achieve over 80%. Finally, some mistake examples are employed to indicate the limitations of methods in this paper.
Software component composition: a subdomain-based testing-theory foundation
Authors: Dick Hamlet
Venue: Software Testing, Verification Reliability (2007)

Composition of software elements into assemblies (systems) is a fundamental aspect of software development. It is an important strength of formal mathematical specification that the descriptions of elements can be precisely composed into the descriptions of assemblies. Testing, on the other hand, is usually thought to be &lsquo;non-compositional.&rsquo; Testing provides information about any executable software element, but testing descriptions have not been combined to describe assemblies of elements. The underlying reason for the compositional deficiency of testing is that tests are samples. When two elements are composed, the input samples (test points) for the first lead to an output sample, but it does not match the input test points of the second, following element. The current interest in software components and component-based software development (CBSD) provides an ideal context for investigating elements and assemblies. In CBSD, the elements (components) are analysed without knowledge of the system(s) to be later assembled. A fundamental testing theory of component composition must use measured component properties (test results) to predict system properties. This paper proposes a testing-based theory of software component composition based on subdomains. It shows how to combine subdomain tests of components into testing predictions for arbitrarily complex assemblies formed by sequence, conditional, and iteration constructions. The basic construction of the theory applies to functional behaviour, but the theory can also predict the system's non-functional properties from component subdomain tests. Compared with the alternative of actually building and testing a system, theoretical predictions are computationally more efficient. The theory can also be described as an exercise in modelling. Components are replaced by abstractions derived from testing them, and these models are manipulated to model system behaviour. This article replaces a previously published version. DOI: 10.1002&#x002F;stvr.368. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Probabilistic graphical models and their role in databases
Authors: Amol Deshpande, Sunita Sarawagi
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Probabilistic graphical models provide a framework for compact representation and efficient reasoning about the joint probability distribution of several interdependent variables. This is a classical topic with roots in statistical physics. In recent years, spurred by several applications in unstructured data integration, sensor networks, image processing, bio-informatics, and code design, the topic has received renewed interest in the machine learning, data mining, and database communities. Techniques from graphical models have also been applied to many topics directly of interest to the database community including information extraction, sensor data analysis, imprecise data representation and querying, selectivity estimation for query optimization, and data privacy. As database research continues to expand beyond the confines of traditional enterprise domains, we expect both the need and applicability of probabilistic graphical models to increase dramatically over the next few years. With this tutorial, we are aiming to provide a foundational overview of probabilistic graphical models to the database community, accompanied by a brief overview of some of the recent research literature on the role of graphical models in databases.
A Definition-Driven Theorem Prover
Authors: G. W. Ernst
Venue: IEEE Transactions on Computers (1976)

This paper describes a theorem prover, running on a PDP-10-Tenex system, that can prove some theorems whose statements involve a relatively large number of definitions. Such theorems require special methods because 1) their statements contain a large number of clauses and 2) their proofs are quite long although straightforward.
10-Gigabit Ethernet Connectivity for Computer Servers
Authors: Serag GadelRab
Venue: IEEE Micro (2007)

Widespread deployment of 10-gigabit Ethernet connections to servers has been hampered by the high cost of network interfaces and the fast-network, slow-host phenomenon. Although the cost of 10GbE connectivity is decreasing, the mismatch between network bandwidth and host computational capacity still needs attention. This article describes the challenges posed by 10GbE termination in modern servers, presents evolving methods that can overcome the computational challenges, and highlights future research trends.
Reflections on the High-Level Language Symbol Computer System
Authors: D. R. Ditzel
Venue: Computer (1981)

A radical computer architecture implementing a programming language and a timeshared operating system directly in hardware, Symbol remains a valuable lesson in building complex systems.
Signal-to-Memory Mapping Analysis for Multimedia Signal Processing
Authors: Ilie I. Luican, Hongwei Zhu, Florin Balasa
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The storage requirements in data-dominant signal processing systems, whose behavior is described by array-based, loop-organized algorithmic specifications, have an important impact on the overall energy consumption, data access latency, and chip area. Finding the optimal storage of the usually large arrays from these behavioral specifications is an important step during memory allocation. This paper proposes more efficient algorithms for the intra-array storage mapping models of De Greef [5] and Tronçon [11], resulting in an implementation several time faster than the original ones.
Applying fast simulation to find the number of good permutations
Authors: N. Yu. Kuznetsov
Venue: Cybernetics and Systems Analysis (2007)

A permutation (s0, s1,¿, sN ¿ 1) of symbols 0, 1,¿, N ¿ 1, is called good if the set (t0, t1,¿, tN ¿ 1) formed according to the rule ti = i + si (mod N), i = 0, 1, ¿ N ¿ 1, is also a permutation. A fast simulation method is proposed. It allows the number of good permutations to be evaluated with high accuracy for large N (in particular, N > 100). Empirical upper and lower bounds for the number of good permutations are presented and verified against numerical data.
Share It, Reveal It, Reuse It, and Push Multimedia into a New Decade
Authors: Susanne Boll
Venue: IEEE MultiMedia (2007)

Imagine you work on semantic annotation of photos and aim to automatically annotate a photo with names, places, and events. But you aren't the only one in the field, and you would like to benchmark your own work against another group's data set, or you aim to reuse a third group's method. Today, there are almost no good standards and procedures in our community to share and reuse data, methods, models, or algorithms—this is something we should change!
A Job Management System for a Large Scale Grid System
Authors: Yong Woo Lee, Phil Doo Hong
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

SGJOMS is an easy-to-use frontend for job management for the Seoul-Grid System which covers whole area of Seoul, the capital city of. It has been developed to meet the needs of Seoul-Grid Project and offers possibilities for extension and customization that make it interesting for a wide range of user communities. SGMOS allows users to do several standard actions in Grid job management. One of them is submission of Grid jobs and their monitoring. This functionality supports Grid users and developers to create and manage Grid jobs independent of the middleware. Grid Resource brokering facility, Grid file management facility, Grid job accounting facility and Grid resource monitoring facility for job management are provided by SGJOMS. In this paper, the internals of SGJOMS is explained.
Research of multi-factors heuristics tasks scheduling model and its algorithms in grid environment
Authors: Xian-Wu Zeng, Cun-Chen Gao, Shu-Ping Bao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The tasks scheduling model is established based on multi-factors that include communication abilities between any two sites, process ability of the site and the reliability of site in complex and dynamic environment. The Target heuristic function is constructed combined minimum executing time and reliability of site. Simulation result demonstrates the factors concern with task scheduling model accord actual situations and its can be satisfied task scheduling demand in complex grid environment. It can be found optimization value of the local target heuristic function combined minimum executing time and reliability of site.
Distributed Fault-Tolerant Computer Systems
Authors: D. A. Rennels
Venue: Computer (1980)

Modular systems employing building-block VLSI circuits may provide fault tolerance to a variety of applications.
Oscillations of solutions of second order quasilinear differential equations with impulses
Authors: Chuhua Jin, Lokenath Debnath
Venue: Journal of Applied Mathematics and Computing (2007)

Some Kamenev-type oscillation criteria are obtained for a second order quasilinear damped differential equation with impulses. These criteria generalize and improve some well-known results for second order differential equations with /and without impulses. In addition, new oscillation criteria are also obtained to generalize and improve known results. Two examples of applications are given to illustrate the theory.
The Layered Fuzzy Clustering Method Based on Distance and Density
Authors: Xiaoping Qiu, Yang Xu, Xiaobing Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, a layered fuzzy clustering method based on distance and density (LFCDD) is summarized. The lower- most layer's algorithm deals with the original data points, the upper layer with the cluster centers of the nearest lower layer. In each layer it identifies the cluster number automat- ically. It calculates the density and density set of each data point based on distance matrix; then chooses one data point randomly and judges whether every element in the selected data point's density set is in the same cluster with itself, this process is repeated till all data points have been selected. In order to find the optimum value of the parameters, we adopt an objective function using entropy on the uppermost layer. Clustering analysis of LFCDD has been performed and the experimental results show that a high recognition rate can be achieved. 1
Service Robot System Based on Brain-computer Interface Technology
Authors: Li Zhao, Chuo Li, Shigang Cui
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper presents a brain-computer interface (BCI) system that can help the disabled to control external service robot. The system is based on Electroencephalogram (EEG) alpha (a) wave. Alpha wave-block was recognized, processed and transmitted to control single option, and design of state selector helps to realize multi-option control. BCI subjects were able to use the system reliably after merely short-time training prior to the experiments. If only the subjects carry out operation steps correctly, and the average accuracy rate of execution unit still can reach 91.2%. This system will be helpful to disabled person by being proved rationality of multi-option control and practical value triggered by Alpha wave, and approaches to improve the performance of the system are discussed.
Chinese Automatic Summarization Based on Thematic Sentence Discovery
Authors: Meng Wang, Chungui Li, Xiaorong Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, we propose a practical approach for extracting the most relevant sentences from the original document to form a summary. The idea of our approach is to obtain summary based on similarity of thematic sentences, which use terms as features rather than words, and employs Term Length Term Frequency (TLTF) to compute weight of terms to obtain features. Furthermore, it uses an improved k-means method to cluster sentences, and compute similarity of thematic sentences according to clustering results. Experimental results indicate a clear superiority of the proposed method over the traditional method under the proposed evaluation scheme.
The Oregon Report Personal Computing
Authors: P. Isaacson
Venue: Computer (1978)

In the home, in business, in science, in education, the personal computer is an increasingly available resource, prompting widespread attention to both its use and its impact.
A Quality Chain Modeling Methodology for Ternary Web Services Quality View
Authors: Youngkon Lee, Gwyduk Yeom
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

WSQM TC, an OASIS technical committee for web service quality model, published the Web Services Quality Model (WSQM) which models and explains the quality factor, quality action, and quality associates for Web services. WSQM focuses on the classification and definition of quality factors and activities of associates conceptually. As the coverage of Web services expands and implementation cases of them increase, the importance of the method which applies the quality model to real world practically grows up to make it easy communicating the information of quality of Web services. This research report presents the method describing the quality factors of Web services and SOA normally and quantitatively. For this, we adopt the standard XML schema as the framework for describing Web services quality. This report provides briefly the WSQM which is basis of WSQDL (Web Services Quality Description Language) and explains the considerations, the concept of quality chain, the overall structure of WSQDL, and items of WSQDL. The followings are the summary of the report.
Unsupervised information extraction from unstructured, ungrammatical data sources on the World Wide Web
Authors: Matthew Michelson, Craig A. Knoblock
Venue: International Journal on Document Analysis and Recognition (2007)

Information extraction from unstructured, ungrammatical data such as classified listings is difficult because traditional structural and grammatical extraction methods do not apply. Previous work has exploited reference sets to aid such extraction, but it did so using supervised machine learning. In this paper, we present an unsupervised approach that both selects the relevant reference set(s) automatically and then uses it for unsupervised extraction. We validate our approach with experimental results that show our unsupervised extraction is competitive with supervised machine learning approaches, including the previous supervised approach that exploits reference sets.