ppxscal/embedding_network huggingface dataset:
Polynomial Identification in the Limit of Substitutable Context-free Languages
Authors: Alexander Clark, Rémi Eyraud
Venue: The Journal of Machine Learning Research (2007)

This paper formalises the idea of substitutability introduced by Zellig Harris in the 1950s and makes it the basis for a learning algorithm from positive data only for a subclass of context-free languages. We show that there is a polynomial characteristic set, and thus prove polynomial identification in the limit of this class. We discuss the relationship of this class of languages to other common classes discussed in grammatical inference. It transpires that it is not necessary to identify constituents in order to learn a context-free language—it is sufficient to identify the syntactic congruence, and the operations of the syntactic monoid can be converted into a context-free grammar. We also discuss modifications to the algorithm that produces a reduction system rather than a context-free grammar, that will be much more compact. We discuss the relationship to Angluin's notion of reversibility for regular languages. We also demonstrate that an implementation of this algorithm is capable of learning a classic example of structure dependent syntax in English: this constitutes a refutation of an argument that has been used in support of nativist theories of language.
A structural equation modeling of the Internet acceptance in Korea
Authors: Byung Gon Kim, Soon Chang Park, Kyoung Jun Lee
Venue: Electronic Commerce Research and Applications (2007)

The objective of this study is to develop and test an integrated conceptual model of the Internet acceptance. Based on the two dominant theoretical paradigms - the theory of reasoned action (TRA) and the technology acceptance model (TAM) - we propose a model of the Internet acceptance to investigate the relationship between external variables such as individual differences, task characteristics and management support, and individual acceptance of the Internet. The model is tested using data gathered from 374 end users of the Internet in Korean firms and data analysis is conducted using a structural equation modeling with LISREL. Significant relationships are found between experience and usefulness, between experience and ease of use, and between ease of use and usefulness. Organizational support is found to influence usefulness, ease of use and subjective norm. We also observe that actual usage is not influenced by subjective norm, but significantly influenced by experience, usefulness and ease of use. This result implies that individual acceptance of the Internet is significantly related to external factors such as experience, task characteristics and organizational characteristics rather than beliefs.
On Combinational Networks with Restricted Fan-Out
Authors: K. L. Kodandapani
Venue: IEEE Transactions on Computers (1978)

Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free networks and functions.
Immune-Inspired Collaborative Filtering Technology for Rating-Based Recommendation System
Authors: YUE Xun, LI Quan-zhong
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A novel technology inspired by the adaptive and self-organizing immune nature is applied to the task of rating-based recommendation technology. Unlike present vector-space model, user's multiple interest model is introduced to be the representation of antigen and antibody. The artificial immune networks model, which is a type of competitive learning algorithm is capable of extracting relevant features contained in antigens, useful predictions and recommendations are made from the memory antibody cells which represent an "internal image" of the antigens. It provides better recommendation quality owing to solving to data sparse problem. Experimental results indicate the effectiveness and wide applicability. The advantages are expected to be its ease of adaptation to the dynamic environment.
On the Development of Improved Artificial Neural Network Model and Its Application on Hydrological Forecasting
Authors: Dedong Liu, Zhongbo Yu, Zhenchun Hao, Changjun Zhu, Qin Ju
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

As conventional multilayer backward-propagation network does not perform well on parameter estimation and convergence, several improved backward-propagation algorithms, such as VLBP, MOBP, CGBP and LMBP, were developed. In order to investigate simulation performance of each algorithm to construct the BP network model suitable for hydrological forecasting, five backward-propagation (BP) neural networks which are based on different algorithms are trained and compared among them. The results of experiments show that the Levenberg- Marquardt backpropagation (LMBP) neural network with a Levenberg-Marquardt based algorithm with enhanced optimization performance has better system identification capacity and is suitable for network in which performance index is evaluated with mean-square error. Therefore, LMBP neural network are chosen for construction of hydrological forecasting model. The flood forecast results compare well with observed data. According to criterion, the model can be used as a favorable method and can be applied in other nonlinear system identifications.
Formalized Dynamic Modeling of Web-Based Collaborative Negotiation Systems
Authors: Hong Jiang, Jun-zhong Gu, Qing-song Yu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The necessity of formalized modeling for Web-based collaborative negotiation systems is analyzed by referring to the negotiation activity process. Through the expansion of the classical Colored Petri Net with the connotation of negotiation activities and the classification of the elements concerning the negotiation activities according to the individualities, a formalized dynamic modeling method for Web-based collaborative negotiation system based on our BN_CPN is put forward. It can serve as the theoretical guide for designing and developing Web-based collaborative negotiation systems.
Special Feature the Impact Of Semiconductor Technology on Computer Systems
Authors: D. P. Bhandarkar
Venue: Computer (1979)

Semiconductor logic and solid-state memory the same basic technologies that gave us the calculator revolution promise to provide the tools for automation in the factory and office.
Program Behavior and the Page-Fault-Frequency Replacement Algorithm
Authors: W. W. Chu
Venue: Computer (1976)

Virtual memory is one of the major concepts that has evolved in computer architecture over the last decade. It has had a great impact on the design of new computer systems since it was first introduced by the designers of the Atlas computer in 1962. A virtual memory is usually divided into blocks of contiguous locations to allow an efficient mapping of the logical addresses into the physical address space. In this paper, we are concerned with paging systems, that is, systems for which the blocks of contiguous locations are of equal size. The memory system consists of two levels: main memory and auxiliary memory. The occurrence of a reference to a page that is currently not in main memory is called a page fault. A page fault results in the interruption of the program and the transfer of the referenced page from auxiliary to main memory.
Some comments on evolutionary algorithm theory
Authors: Ralf Salomon
Venue: Evolutionary Computation (1996)

The development of a sound theory that predicts and verifies existing evolutionary algorithms (EA) is one of the most important research issues in the field today. In mathematical proofs, the assumption of spherical symmetry is probably one of the most widely used simplifications. This paper discusses the extent to which spherical symmetry is appropriate for certain EAs. It turns out that spherical symmetry leads to simplifications in (self-adaptive) EAs but seems inappropriate for certain genetic algorithm variants, since small mutation rates bias a search algorithm toward the coordinate axes. This paper also argues that current test suites are weak in that they do not provide problems with significant epistasis that describes the interaction between different parameters. Consequently, when using an empirical test for pushing existing theory beyond its limits, benchmark functions should include more epistatic interaction or at least should use coordinate rotations.
Content-Based Music Retrieval Using Beat Information
Authors: Mohammad Khairul Islam, Hyung-Jin Lee, Anjan Kumar Paul, Joong-Hwan Baek
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

There are several important representative features in music. Among them beat is highly distinguishable one. Based on the pattern of beats' appearance in the music, we propose a music identification method that can be used for background music retrieval from video. In this paper, a music signal is primarily segmented into a number of small frames in the time domain. The features representing energy contents of each frame is determined by computing beats. Also, the time stamps' difference of two neighboring beats in frames is used as another feature. Extracted features from both the training and query music are classified using similarity matching algorithm. The retrieval accuracy of 95% of our method is a pretty good result. It can provide services like music or video indexing, summarization etc.
A Qualitative Modeling Shell for Process Diagnosis
Authors: T. F. Thompson
Venue: IEEE Software (1986)

Removing the knowledge base from a medical diagnosis system, but retaining the rule base, led to a reusable expert shell. This article evaluates Caster, an application to sandcasting.
On the Performance of TETRA Short Data Service-Transport Layer
Authors: Dimitrios I. Axiotis, Dimitrios G. Xenikos
Venue: Wireless Personal Communications: An International Journal (2007)

This paper presents the results of an extensive measurement survey on the performance of Short Data Service Transport Layer (SDS-TL) of Terrestrial Trunked Radio (TETRA) cellular networks. We developed a novel software measurement platform that runs over the TETRA Peripheral Equipment Interface (PEI), generates SDS-TL traffic, performs measurements, and presents statistics of QoS metrics. The measurement platform was utilized in two measurement campaigns: in the first one, two terminals were co-located in the same TETRA cell, and in the second campaign the terminals were positioned in different cells. Measurements were taken for SDS-TL sizes varying from 10 to 190 bytes (excluding the TL header) with an increment of 5 bytes. For each SDS-TL size, 1,500 messages were exchanged through the measurement platform between the TETRA mobile terminals. We repeated all measurements for three intertransmission intervals, namely 2, 1.5, and 1 s, corresponding to measurement durations-for each set of 1,500 SDS-TL- of ¿ 3,000, 2,250 and 1,500 s, respectively. Hence, 166,500 SDS-TL messages were exchanged between two terminals for each measurement campaign. Results obtained include the end-to-end transmission delay (mean and standard deviation) and the percentage of lost SDS-TL versus the message size for the three intertransmission intervals. The effects of inadequate radio capacity as well as gaps in the radiocoverage can be easily identified through the measurement platform, and we analyze such representative cases.
An Approach to Organizing Microinstructions which Minimizes the Width of Control Store Words
Authors: T. Jayasri
Venue: IEEE Transactions on Computers (1976)

This paper suggests a new method for minimizing the width or bit dimension of control store words in microprogrammed digital computers. It is shown that any given problem can be formulated within the framework of linear programming and that there exists a lower limit CLB to the number of bits. The optimal grouping of subcommands which gives this minimal width is also readily obtainable.
A cost effectiveness indicator for software development
Authors: Hakan Erdogmus
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Product quality, development productivity, and staffing needs are main cost drivers in software development. The paper proposes a cost-effectiveness indicator that combines these drivers using an economic criterion.
Applying Genetic Algorithms to Efficiently Locate Mobile Terminals in Personal Communication Networks
Authors: Yi-hua Zhu, Witold Pedrycz
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Location management (LM) is an essential feature in a personal communication service (PCS) network composed of a group of base stations. LM enables the PCS network to find the current cell, the radio coverage of a base station, in which a mobile terminal (MT) resides when an incoming call to the MT arrives. LM involves two operations: location update and paging. This study aims to develop algorithms that reduce paging cost so that total LM cost is reduced. As an optimization technique we consider the use of genetic algorithms using which we develops a sequential paging scheme. Furthermore, numeric studies are presented so that we can compare the proposed paging scheme with some well-known sequential paging schemes such as reverse paging, semi-reverse paging, and uniform paging. The experimental results demonstrate the effectiveness of the proposed paging scheme (minimal paging cost) over the existing ones.
Distributed Interpretation: A Model and Experiment
Authors: V. R. Lesser
Venue: IEEE Transactions on Computers (1980)

The range of application areas to which distributed processing has been applied effectively is limited. In order to extend this range, new models for organizing distributed systems must be developed.
Concept and construction of a dance robot system
Authors: Kuniya Shinozaki, Akitsugu Iwatani, Ryohei Nakatsu
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Dance is one form of entertainment where physical movement is the key factor. The main reason why robots are experiencing a kind of "boom" is that they have a physical body. We propose a robot dance system that combines these two elements. First, various factors concerning entertainment and dance are studied. Then we propose a robot dance system in which a humanoid robot achieves various dance performances by concatenating different short dance motions. Also we describe the details of the system by focusing on its software functions and show evaluation results of robot dance performances.
Improving Fuzzy C-Means with Shadow Set
Authors: Fusheng Yu, Fangmin Wu, Qiuyan Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Fuzzy C-Means (FCM) is an important algorithm in clustering. There has been much effort to improve FCM algorithm in efficiency. In this paper, we introduce the shadowed sets to FCM algorithm to enhance the efficiency and to improve the clustering results by properly eliminate some outliers during the process of clustering. The new fuzzy clustering algorithm, named shadow set-based FCM(S-FCM), presents better performance with respect to huge data sets especially to the data sets that do not exhibit definite number of clusters. Some experiments are carried to show the performance of the new algorithm.
Not quite the average: An empirical study of Web use
Authors: Harald Weinreich, Hartmut Obendorf, Eelco Herder, Matthias Mayer
Venue: ACM Transactions on the Web (TWEB) (2008)

In the past decade, the World Wide Web has been subject to dramatic changes. Web sites have evolved from static information resources to dynamic and interactive applications that are used for a broad scope of activities on a daily basis. To examine the consequences of these changes on user behavior, we conducted a long-term client-side Web usage study with twenty-five participants. This report presents results of this study and compares the user behavior with previous long-term browser usage studies, which range in age from seven to thirteen years. Based on the empirical data and the interview results, various implications for the interface design of browsers and Web sites are discussed. A major finding is the decreasing prominence of backtracking in Web navigation. This can largely be attributed to the increasing importance of dynamic, service-oriented Web sites. Users do not navigate on these sites searching for information, but rather interact with an online application to complete certain tasks. Furthermore, the usage of multiple windows and tabs has partly replaced back button usage, posing new challenges for user orientation and backtracking. We found that Web browsing is a rapid activity even for pages with substantial content, which calls for page designs that allow for cursory reading. Click maps provide additional information on how users interact with the Web on page level. Finally, substantial differences were observed between users, and characteristic usage patterns for different types of Web sites emphasize the need for more adaptive and customizable Web browsers.
Wavelet Denoising by Quantum Threshold Algorithm
Authors: Peng Wang, Jian-Ping Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Quantum threshold algorithm is proposed to reduce the noise of signal. Quantum superposition principle is used to construct noise model in wavelet domain. We consider that signal is quasi quantum system. Every wavelet coefficient belongs to a superposition state. We don't know whether it belongs signal or noise until we measure it. Unlike hard threshold algorithm quantum threshold algorithm hasn't a certain threshold. The probability that a wavelet coefficient belongs to signal or noise is decided by a distribution function. Finally, several experiments are made to compare the proposed method with conventional hard threshold algorithm. The pseudo-Gibbs phenomena can be reduced by this algorithm
Digital and Hybrid Computational Aspects of the Discrete Representation Theorem of Nonlinear Estimation
Authors: E. C. Tacker
Venue: IEEE Transactions on Computers (1973)

A nonlinear filtering problem is investigated, and the discrete representation theorem is used to synthesize the optimal filter. An optimal filtering algorithm is described, and hybrid techniques are employed to effect several methods of implementing the algorithm on a hybrid computer. These implementations are then compared (via Monte Carlo analysis) on the bases of speed and accuracy. It is concluded that hybrid computation techniques can be used to advantage when studying proposed nonlinear optimal estimation formulations.
AOP Based Trustable SLA Compliance Monitoring for Web Services
Authors: Congwu Chen, Lei Li, Jun Wei
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

With the integration of Web Services as a business solution in many enterprise applications, the Quality of Service (QoS) presented by Web Services is becoming the main concern of both service providers and clients. QoS requirements are recorded as part of the bi-lateral service-level agreement (SLA). In an open and service-oriented market, it is crucial to establish trustable SLA compliance monitoring and thus to assure clients the QoS claimed by providers are credible. In this paper, we propose a novel trustable mechanism to monitor and evaluate SLA compliance based on the Aspect Oriented Programming (AOP) paradigm. Authoritative monitoring aspects are supplied by a trustable SLA manager and by weaving the aspects into susceptible service runtime, service providers are ensured to monitor and report their service status obligatorily and accurately. Our mechanism is trustable, scalable and easy to deploy. We have engaged this mechanism into SOAPExpress and results show that it is effective.
An Approach to the Workload Characterization Problem
Authors: A. K. Agrawala
Venue: Computer (1976)

A major problem in the evaluation of the performance of a multiprogrammed computer system is the development of an accurate description of its normal workload. This paper formulates the workload characterization problem for a computing environment and presents three types of simplified models for the system workload. The probabilistic models of the workload presented here can be validated with respect to the real workload and are easy to use in a performance evaluation study. The results of a study of the workloads on the Univac 1108 computer at the Computer Science Center of the University of Maryland are also presented.
Graphics In Numerical Control-the User's Challenge
Authors: J. H. Mabry
Venue: IEEE Computer Graphics and Applications (1982)

Off-the-shelf graphics equipment and software must be adapted by users to their own application requirements. 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
Optimization of systems with multiple performance measures via simulation: Survey and recommendations
Authors: Scott L. Rosen, Catherine M. Harmonosky, Mark T. Traband
Venue: Computers and Industrial Engineering (2008)

Computer simulation is a powerful evaluative tool for the design and configuration of stochastic systems. Methodologies are needed that assist simulation end users in locating high quality design alternatives to the real system through the use of their simulation models. This paper focuses specifically on the simulation optimization problem that involves multiple performance measures. It surveys available methodologies for this problem and discusses notable strengths and weaknesses of each. Suggestions are made for future research that alleviates the common weakness of the reviewed literature.
Staging telephony service creation: a language approach
Authors: Fabien Latry, Julien Mercadal, Charles Consel
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

The open-endedness of telephony platforms is creating expectations among users, ranging from end-users to administrators, to create services dedicated to their activities. Not only is the population of developers heterogeneous, but the technologies underlying modern telephony range over a variety of areas such as multimedia, databases, web services, and distributed systems. This situation drastically widens the expertise required for service creation. This paper proposes an approach to coping with the heterogeneity of both the service developers and the technologies underlying modern telephony. Our approach is based on programming languages. It consists of providing a language that is specific to each developer community with respect to its expertise (e.g., programming skills) and the target application area (e.g., administration). Such languages, called Domain-Specific Languages (DSLs), are organized in layers, accounting for abstraction levels. Our layered approach to telephony service creation is illustrated by two high-level DSLs for end-user service creation, requiring no programming skills, and an expressive DSL enabling the development of expert-level telephony services. We show that layering DSLs greatly facilitates their implementation and verification of telephony-specific properties by leveraging on high-level tools.