ppxscal/embedding_network huggingface dataset:
The measure of interaction among players in games with fuzzy coalitions
Authors: Shujin Li, Qiang Zhang
Venue: Fuzzy Sets and Systems (2008)

In this paper, the derivative among participation levels of players in games with fuzzy coalitions, which measures the simultaneous interaction among players with certain participation levels, is defined. Some properties of the derivative of fuzzy game with k-monotonicity are studied. Furthermore, the interaction index among participation levels is established. Based on the assumption that fuzzy characteristic functions are continuous, the integral index of (absolute) interaction among levels is proposed and the integral index of (absolute) interaction among players is defined as well. At last, the Shapley total integral index of interaction among players is constructed, and a series of properties relative to the index are proved.
On Homogeneity and On Line=Off-Line Behavior in M/G/1 Queueing Systems
Authors: R. M. Bryant
Venue: IEEE Transactions on Software Engineering (1981)

Operational analysis replaces certain classical queueing theory assumptions with the conditions of "homogeneous service times" and "on-line= off-line behavior." In this paper we explore the relationship between the operational and classical concepts for the sample paths of an M/G/1 queueing system. The primary results are that the sample paths can have these operational properties with nonzero probability if and only if the service time is exponential. We also state dual results for interarrival times in G/M/l. Additionally, we show that open, feedforward networks of single server queues can have product form solutions valid across a range of system arrival rates if and only if all of the service times are exponential. Finally, we consider the relationship between the operational quantities S(n) and the mean service time in M/G/1. This relationship is shown to depend on the form of the service time distribution. It follows that using operational analysis to predict the performance of an M/G/1 queueing system will be most successful when the service time is exponential. Simulation evidence is presented which supports this claim.
A RTL Testability Analyzer Based on Logical Virtual Prototyping
Authors: Yu Huang, Nilanjan Mukherjee, Wu-Tung Cheng, Greg Aldrich
Venue: Proceedings of the 16th Asian Test Symposium (2007)

In this paper, we propose a novel RTL testability analyzer based on logical virtual prototyping. A very fast synthesis engine is utilized to create a gate level hierarchical netlist with generic gates, which we call a logical virtual prototype, in this paper. Subsequently, ATPG and testability analysis are performed on the logical virtual prototype to provide RTL designers with a wealth of information that would allow them: (1) Accurately estimate / predict test coverage. (2) Generate patterns that can be used for gate-level design.
Computer Reduction of Two-Level, Multiple-Output Switching Circuits
Authors: Yueh-Hsung Su, D. L. Dietmeyer
Venue: IEEE Transactions on Computers (1969)

An algorithm which reduces the number of gates and connections (diodes) in two-level, multiple-output combinational logic networks is presented and compared with conventional minimization procedures.
A concepts-first approach to object-oriented modelling
Authors: Ven Yu Sien, David Carrington
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Information technology students at universities have in general found difficulty in grasping object-oriented (OO) concepts. They have problems with abstract thinking, especially in the context of performing abstractions of real-world problems in object-oriented analysis and design (OOAD) courses. Most of these students prefer to focus on the implementation phase of a software development lifecycle and consider the preceding analysis and design phases unnecessary. We present an approach to introduce the concept map as the first domain model to be derived from functional requirements or textual use cases during the analysis phase. It can subsequently evolve into a class diagram containing information on classes, attributes, associations, generalization-specialization hierarchies, aggregation and methods. This paper contains results of a quantitative evaluation for gauging the effectiveness of concept mapping in helping students with their abstraction techniques.
A moving interface method for dynamic kinetic-fluid coupling
Authors: Pierre Degond, Giacomo Dimarco, Luc Mieussens
Venue: Journal of Computational Physics (2007)

This paper is a continuation of earlier work [P. Degond, S. Jin, L. Mieussens, A smooth transition between kinetic and hydrodynamic equations, Journal of Computational Physics 209 (2005) 665-694] in which we presented an automatic domain decomposition method for the solution of gas dynamics problems which require a localized resolution of the kinetic scale. The basic idea is to couple the macroscopic hydrodynamics model and the microscopic kinetic model through a buffer zone in which both equations are solved. Discontinuities or sharp gradients of the solution are responsible for locally strong departures to local equilibrium which require the resolution of the kinetic model. The buffer zone is drawn around the kinetic region by introducing a cut-off function, which takes values between zero and one and which is identically zero in the fluid zone and one in the kinetic zone. In the present paper, we specifically consider the possibility of moving the kinetic region or creating new kinetic regions, by evolving the cut-off function with respect to time. We present algorithms which perform this task by taking into account indicators which characterize the non-equilibrium state of the gas. The method is shown to be highly flexible as it relies on the time evolution of the buffer cut-off function rather than on the geometric definition of a moving interface which requires remeshing, by contrast to many previous methods. Numerical examples are presented which validate the method and demonstrate its performances.
Proximity-based document representation for named entity retrieval
Authors: Desislava Petkova, W. Bruce Croft
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

One aspect in which retrieving named entities is different from retrieving documents is that the items to be retrieved - persons, locations, organizations - are only indirectly described by documents throughout the collection. Much work has been dedicated to finding references to named entities, in particular to the problems of named entity extraction and disambiguation. However, just as important for retrieval performance is how these snippets of text are combined to build named entity representations. We focus on the TREC expert search task where the goal is to identify people who are knowledgeable on a specific topic. Existing language modeling techniques for expert finding assume that terms and person entities are conditionally independent given a document. We present theoretical and experimental evidence that this simplifying assumption ignores information on how named entities relate to document content. To address this issue, we propose a new document representation which emphasizes text in proximity to entities and thus incorporates sequential information implicit in text. Our experiments demonstrate that the proposed model significantly improves retrieval performance. The main contribution of this work is an effective formal method for explicitly modeling the dependency between the named entities and terms which appear in a document.
CrowdViewer: from simple script to large-scale virtual crowds
Authors: Tianlu Mao, Bo Shu, Wenbin Xu, Shihong Xia, Zhaoqi Wang
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Visualization of large-scale virtual crowds is ubiquitous in many applications of computer graphics. For reasons of efficiency in modeling, animating and rendering, it is difficult to populate scenes with a large number of individually animated virtual characters in real-time applications. In this paper, we present an effective and readily usable solution to this problem. It accepts simple script which includes motion state and position information of each individual at each time step. Supported by material database and motion database, various human models are generated from model templates, and then driven by an agile on-line animation approach. A developed point-based rendering approach is presented to accelerate rendering. We test our system with script including 30,000 people evacuating from a sports arena. The results demonstrate that our approach provides a very effective way to visualize large-scale crowds with high visual realism in real-time.
WCDMA uplink capacity and interference statistics of highways cigar-shaped microcells
Authors: Bazil Taha-Ahmed, Miguel Calvo-Ramon
Venue: Wireless Personal Communications: An International Journal (2007)

The capacity and the interference statistics (mean value and variance) of the sectors of the cigar-shaped Wideband Code Division Multiple Access microcells are studied. The two-slope propagation model is used in the analysis. A model of five microcells is used to calculate the uplink capacity and interference statistics assuming highways cigar-shaped microcells. The capacity and the interference statistics of the microcell are studied for different sector range, propagation exponent, antenna side lobe levels and different standard deviation of the power control error. It is noticed that the quasi-maximum uplink sector capacity can be got when the sector range R is between 600 and 1,200 m and the sidelobe level of the directive antenna used in each sector is on the order of ¿15 dB.
Exploring software partitions for fast security processing on a multiprocessor mobile SoC
Authors: Divya Arora, Anand Raghunathan, Srivaths Ravi, Murugan Sankaradass, Niraj K. Jha, Srimat T. Chakradhar
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The functionality of mobile devices, such as cell phones and personal digital assistants (PDAs), has evolved to include various applications where security is a critical concern (secure web transactions, mobile commerce, download and playback of protected audio/video content, connection to corporate private networks, etc.). Security mechanisms (e.g., secure communication protocols) involve cryptographic algorithms, and are often quite computationally intensive, challenging the constrained processing and battery resources of mobile devices. Extensive design effort and aggressive hardware and software optimizations are required to address this challenge. Previous work has addressed the design of hardware architectures (custom accelerators, domain-specific processors, etc.) to accelerate security processing, and many emerging systems-on-chip (SoCs) feature some form of hardware support for security. In this paper, we address the complementary problem of mapping a complex security software library to an SoC platform with security hard-ware enhancements. We present a systematic methodology for exploring the software architecture for security processing for a commercial heterogeneous multiprocessor SoC for mobile devices. The SoC contains multiple host processors executing applications and a dedicated programmable security processing engine. We developed an exploration methodology to map the code and data of security software libraries onto the platform, with the objective of maximizing the overall application-visible performance. The salient features of the methodology include: 1) the use of real performance measurements from a prototyping board, which contains the target platform, to drive the exploration; 2) a new data structure access profiling framework that allows us to accurately model the communication overheads involved in offloading a given set of functions to the security processor; and 3) an exact branch-and-bound-based design space exploration algorithm that determines the best mapping of security library functions and data structures to the host and security processors. We used the proposed framework to map a commercial security llbrary to the target mobile application SoC. The resulting optimized software architecture outperformed several manually designed software architectures, resulting in up to 12.5× speed-up for individual cryptographic operations (encryption, hashing) and 2.2-6.2× speed-up for applications such as a digital rights management (DRM) agent and secure sockets layer (SSL) client. We also demonstrate the applicability of our framework to software architecture exploration in other multiprocessor scenarios.
Learnability of Gaussians with Flexible Variances
Authors: Yiming Ying, Ding-Xuan Zhou
Venue: The Journal of Machine Learning Research (2007)

Gaussian kernels with flexible variances provide a rich family of Mercer kernels for learning algorithms. We show that the union of the unit balls of reproducing kernel Hilbert spaces generated by Gaussian kernels with flexible variances is a uniform Glivenko-Cantelli (uGC) class. This result confirms a conjecture concerning learnability of Gaussian kernels and verifies the uniform convergence of many learning algorithms involving Gaussians with changing variances. Rademacher averages and empirical covering numbers are used to estimate sample errors of multi-kernel regularization schemes associated with general loss functions. It is then shown that the regularization error associated with the least square loss and the Gaussian kernels can be greatly improved when flexible variances are allowed. Finally, for regularization schemes generated by Gaussian kernels with flexible variances we present explicit learning rates for regression with least square loss and classification with hinge loss.
Multilevel Quantum Error Correction Codes in Transform Domain
Authors: Ying Guo, Dazu Huang, Guihua Zeng, Moon Ho Lee
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Quantum error correction codes (QECC) have become cornerstone of quantum information and computation. In this correspondence, we investigate a class of QECC in transform domain. To design the QECC denoted by [[N, k, d]] with larger N, generators of stabilizer of the constructed codes are composed via selecting randomly N - k rows from an yielded matrices with recursive relations of matrices transform. Subsequently, a new kind of stabilizer quantum codes may be generated expediently. In the proposed approach, the parameter N may be arbitrary larger, and the QECC with larger N may be easily constructed due to the employment of the recursive relations of matrices transform. Especially, some new codes, which are impossible to be obtained via the previous approaches, are constructed. The resulting codes are more efficient with better perimeters than the previous quantum codes.
Water Quality Assessment Model Based on Index Subset Weights and Its Application
Authors: Huicheng Zhou, Fangjie Cong, Guohua Liang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A fuzzy pattern recognition model is applied to the water-quality assessment on the basis of the fact that there exist no clear and absolute boundaries between different grades of water-quality. The model is constructed based on the relative membership degrees in fuzzy sets and it has some superior characteristics compared with the assessment methods applied at present. Furthermore, there are two criteria on how to decide the weights of different objectives, one is the effect of single index on environment pollution, and the other is the mutual-function and the relationship between different indexes. So based on the idea of hierarchical analysis, all indexes are classified into several subsets to take consideration of the interrelation of the indexes of water environment pollution and then the index subset weights are determined qualitatively and quantitatively. A case study is given to show how to use the fuzzy pattern recognition model based on the index subset weights. Key words: relative membership degree; fuzzy pattern recognition; water-quality assessment; hierarchical analysis; index subset weights
Translator Writing Systems: Where Do they Now Stand?
Authors: A. V. Aho
Venue: Computer (1980)

Automatic compiler generation? Not yet. But new languages development tools are reducing the effort required to construct good compilers.
Visual Intelligence: The First Decade of Computer Art (1965-1975)
Authors: Frank Dietrich
Venue: IEEE Computer Graphics and Applications (1985)

Current technology provides today's computer artists with the means to almost unlimited creativity, but pioneers in the field had to overcome some formidable obstacles.
Tutorial Series 4 Perspectives on Personal Computing
Authors: J. Raskin
Venue: Computer (1981)

Products of a technology-fueled revolution to put computing in the hands of many people, personal computers are quickly becoming tools as essential as the telephone.
Some Parametric Techniques in the Analog Solution of Ordinary Differential Equations
Authors: T. A. Newton
Venue: IEEE Transactions on Computers (1975)

The direct analog simulation of an ordinary differential equation over an interval for the independent variable is not possible whenever on that interval there is division by a variable which tends to zero, or there is a dependent variable such as a derivative which is represented by an integrator output and which becomes large without bound. Also, the raising of time dependent variables to fractional powers can require considerable analog equipment and introduce further error into a simulation.
Improving change prediction with fine-grained source code mining
Authors: Huzefa Kagdi
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The thesis proposes a software-change prediction approach that is based on mining fine-grained evolutionary couplings from source code repositories. Here, fine-grain refers to identifying couplings between source code entities such as methods, control structures, or even comments. This differs from current source code mining techniques that typically only identify couplings between files or fairly high-level entities. Furthermore, the model combines the mined evolutionary couplings with the estimated changes identified by traditional impact analysis techniques (e.g., static analysis of call and program-dependency graphs). The research hypothesis is that software-change prediction using the proposed synergistic approach results in an overall improved expressiveness (i.e., granularity and context given to a developer) and effectiveness (i.e., accuracy of the prediction)
DynaNP - A Coarse-grain Dataflow Network Processor Architecture with Dynamic Configurable Processing Path
Authors: Tao Li, Xiao-ming Zhang, Zhi-gang Sun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Aimed at the limitation of ILP exploitation and the fixed topology of control-flow NP, a new scheme of coarse-grain dataflow NP architecture-DynaNP is proposed. DynaNP can not only improve the programmability of NP by adopting control-flow structure in each Processing Element (PE), but also effectively exploit the task-level parallelism by introducing data-flow model into the processing of multiple PEs. A mechanism of dynamic configurable processing path is also provided in DynaNP. An SDTPPS algorithm based on dynamic configurable processing path is proposed in DynaNP. The simulation results show that by using this algorithm the load of each PE can be balanced efficiently and the overall throughput of DynaNP will be improved.
Implementation and Research on EHW-based Digital Chip Using Handel-C Language
Authors: Qian-sheng Fang, Yi Yang, Wan-li Chen, Li-jun Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

When conventional Electronic Design Automation (EDA) technology is used to design digital chip, there are many stubborn difficulties such as being unable to automatically repair if hardware malfunctions, being lack of adaptation etc. However, Evolvable Hardware (EHW) can adapt to different environment and enhance its performance since it is capable of self-organization, self- adaptation and self-repair. Handel-C Language, having its origin in ISO/ANSI-C programming language, as well as lots of reusable routine C programs, can execute on Field Programmable Gate Array (FPGA), so, in a very real sense, hardware implementation is performed completely by means of software. The present paper selects six-multiplexor as the target circuit, and the digital chip with evolutionary function is successfully implemented. Also, an approach to design digital chip with the ability to automatically repair is presented, and some key problems in the process of hardware implementation are solved. The simulated experiment verifies that the presented approach has great evolutionary efficiency and the designed chip has to some degree the ability of self-repair.
An Oncology Clinical Information System
Authors: B. I. Blum
Venue: Computer (1979)

Because of its reliance on protocols, oncology is an active area for developing patient management systems. This system prepares a daily treatment plan for each cancer patient.
Genetic Algorithm based Adaptive Neural Network Ensemble and Its Application in Predicting Carbon Flux
Authors: Yueju Xue, Shuguang Liu, Yueming Hu, Jingfeng Yang, Qiang Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

To improve the accuracy in prediction, Genetic Algorithm based Adaptive Neural Network Ensemble (GA-ANNE) is presented. Intersections are allowed between different training sets based on the fuzzy clustering analysis, which ensures the diversity as well as the accuracy of individual Neural Networks (NNs). Moreover, to improve the accuracy of the adaptive weights of individual NNs, GA is used to optimize the cluster centers. Empirical results in predicting carbon flux of Duke Forest reveal that GA-ANNE can predict the carbon flux more accurately than Radial Basis Function Neural Network (RBFNN), Bagging NN ensemble, and ANNE.
Image Retrieval Based on Color and Texture
Authors: Chengyu Wu, Xiaoying Tai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Color and texture are important image features. In this paper a clustering algorithm based on mean shift is used to extract the dominant color in CIE L*a*b* color space. Earth Mover's Distance is used to calculate the color dissimilarity. A new method based on texture features is proposed, which calculates the gray-level variation between neighboring pixels at the directions of horizontal, vertical, 45 degree and 135 degree. The technique of relevance feedback is used to enhance the effectiveness. Finally, a prototype system is developed to compare the retrieval precision, the rank and the execution time by two experiments. The results show that the proposed approach is effective.
MIKE: A Network Operating System for the Distributed Double-Loop Computer Network
Authors: Duen-Ping Tsay
Venue: IEEE Transactions on Software Engineering (1983)

This paper presents the framework and model of a network operating system (NOS) called MIKE for use in distributed systems in general and for use in the Distributed Double-Loop Computer Network (DDLCN) in particular. MIKE, which stands for Multicomputer Integrator KErnel, provides system-transparent operation for users and maintains cooperative autonomy among local hosts.