ppxscal/embedding_network huggingface dataset:
Closed G-networks with Resets: product form solution
Authors: Jean-Michel Foumeau
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We consider a closed queueing network of generalized queues with customers and signals. Each queue has an infinite capacity and one server. The service time is exponential. After its service completion a customer moves to another queue and may become a signal. When the signal enters a non empty queue it vanishes while it resets the queue when it enters an empty queue. We prove that the steady state distribution for such a closed network of queues has a product form solution. To the best of our knowledge it is the first closed network of generalized queues with product form solution. We also consider a more complex system where the reset acts upon a set of queues rather than a single one. We also prove that the steady-state distribution exists and has a product form.
Computer Science Education in the 1980's
Authors: R. M. Aiken
Venue: Computer (1980)

During the 1980's computer professionals will confront complex issues relating to microsystems and personal computing, computers and society, certification and accreditation, the job market, and cooperation among professional societies.
Example-driven design of efficient record matching queries
Authors: Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti, Raghav Kaushik
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applications. Implementations of record matching rely on exact as well as approximate string matching (e.g., edit distances) and use of external reference data sources. Record matching can be viewed as a query composed of a small set of primitive operators. However, formulating such record matching queries is difficult and depends on the specific application scenario. Specifically, the number of options both in terms of string matching operations as well as the choice of external sources can be daunting. In this paper, we exploit the availability of positive and negative examples to search through this space and suggest an initial record matching query. Such queries can be subsequently modified by the programmer as needed. We ensure that the record matching queries our approach produces are (1) efficient: these queries can be run on large datasets by leveraging operations that are well-supported by RDBMSs, and (2) explainable: the queries are easy to understand so that they may be modified by the programmer with relative ease. We demonstrate the effectiveness of our approach on several real-world datasets.
Computational foundations of image interpolation algorithms
Authors: Tinku Acharya, Ping-Sing Tsai
Venue: Ubiquity (2007)

Image interpolation is an important image processing operation applied in diverse areas ranging from computer graphics, rendering, editing, medical image reconstruction, to online image viewing. Image interpolation techniques are referred in literature by many terminologies, such as image resizing, image resampling, digital zooming, image magnification or enhancement, etc. Basically, an image interpolation algorithm is used to convert an image from one resolution (dimension) to another resolution without loosing the visual content in the picture. Image interpolation algorithms can be grouped in two categories, non-adaptive and adaptive. The computational logic of an adaptive image interpolation technique is mostly dependent upon the intrinsic image features and contents of the input image whereas computational logic of a non-adaptive image interpolation technique is fixed irrespective of the input image features. In this paper, we review the progress of both non-adaptive and adaptive image interpolation techniques. We also proposed a new algorithm for image interpolation in discrete wavelet transform domain and shown its efficacy. We describe the underlying computational foundations of all these algorithms and their implementation techniques. We present some experimental results to show the impact of these algorithms in terms of image quality metrics and computational requirements for implementation.
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
Authors: Thomas Roelleke, Hengzhi Wu, Jun Wang, Hany Azzam
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2008)

This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports the ranking of any object, it allows for the reasoning across structured and unstructured data, and it gives the software (knowledge) engineer control over ranking and thus supports customisation. The contributions of this paper include the specification of probabilistic SQL (PSQL) and probabilistic relational algebra (PRA), a new relational operator for probability estimation (the relational Bayes), the probabilistic relational modelling of retrieval models, a comparison of modelling retrieval with traditional SQL versus modelling retrieval with PSQL, and a comparison of the performance of probability estimation with traditional SQL versus PSQL. The main findings are that the PSQL/PRA paradigm allows for the description of advanced retrieval models, is suitable for solving large-scale retrieval tasks, and outperforms traditional SQL in terms of abstraction and performance regarding probability estimation.
Control of discrete-event systems with modular or distributed structure
Authors: Jan Komenda, Jan H. van Schuppen
Venue: Theoretical Computer Science (2007)

Most of the large scale state transition (also called discrete-event) systems are formed as parallel compositions of many small subsystems (modules). Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems. For both modular and distributed discrete-event systems sufficient and necessary conditions are derived for modular control synthesis to equal global control synthesis, while enforcing a safety specification in an optimal way (the language of the controlled system is required to be the supremal one achievable by an admissible controller and included in a safety specification language). The two cases of local (decomposable) and global (indecomposable) specifications are considered. The modular control synthesis has a much lower computational complexity than the corresponding global control synthesis for the respective sublanguages. The complexity is compared using explicit formulas.
Domain-theoretical models of parametric polymorphism
Authors: L. Birkedal, R. E. Møgelberg, R. L. Petersen
Venue: Theoretical Computer Science (2007)

We present a domain-theoretical model of parametric polymorphism based on admissible per's over a domain-theoretical model of the untyped lambda calculus. The model is shown to be a model of Abadi & Plotkin's logic for parametricity, by the construction of an LAPL-structure as defined by the authors in [L. Birkedal, R.E. Mogelberg, R.L. Petersen, Parametric domain-theoretical models of polymorphic intuitionistic/linear lambda calculus, in: M. Escardo, A. Jung, M. Mislove (Eds.), Proceedings of Mathematical Foundations of Programming Semantics 2005, vol. 155, 2005, pp. 191-217; L. Birkedal, R.E. Mogelberg, R.L. Petersen, Category theoretical models of linear Abadi & Plotkin logic, 2006 (submitted for publication)]. This construction gives formal proof of solutions to a large class of recursive domain equations, which we explicate. As an example of a computation in the model, we explicitly describe the natural numbers object obtained using parametricity. The theory of admissible per's can be considered a domain theory for (impredicative) polymorphism. By studying various categories of admissible and chain complete per's and their relations, we discover a picture very similar to that of domain theory.
Database challenges in the integration of biomedical data sets
Authors: Rakesh Nagarajan, Mushtaq Ahmed, Aditya Phatak
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The clinical and basic science research domains present exciting and difficult data integration issues. Solving these problems is crucial as current research efforts in the field of biomedicine heavily depend upon integrated storage, querying, analysis, and visualization of clinicopathology information, genomic annotation, and large scale functional genomic research data sets. Such large scale experimental analyses are essential to decipher the pathophysiological processes occurring in most human diseases so that they may be effectively treated. In this paper, we discuss the challenges of integration of multiple biomedical data sets not only at the university level but also at the national level and present the data warehousing based solution we have employed at Washington University School of Medicine. We also describe the tools we have developed to store, query, analyze, and visualize these data sets together.
Confirmation rule induction and its applications to coronary heart disease diagnosis and risk group discovery
Authors: Dragan Gamberger, Nada Lavrač, Goran Krstačić
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

The confirmation rule set concept, presented in this paper, provides a framework for reliable decision making. This framework enables flexible formation of a confirmation rule set, by incorporating rules induced by machine learning algorithms as well as human encoded expert rules. The only conditions for including a rule into the confirmation rule set are its high predictive accuracy and relative independence from other rules in the rule set. This paper introduces the concept of confirmation rule sets, together with an algorithm for selecting relatively independent rules from a set of acceptable confirmation rules. It presents also two approaches to confirmation rule induction: first, an exhaustive confirmation rule construction algorithm that was used to discover diagnostic rules in the coronary heart disease diagnosis problem, and second, a heuristic confirmation rule construction algorithm that was used for subgroup discovery in the coronary heart disease risk group detection problem.
Automatic Detection of Design Pattern for Reverse Engineering
Authors: Hakjin Lee, Hyunsang Youn, Eunseok Lee
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In maintenance, the lack of documentation leads to high costs of reverse engineering. Generally, design-pattern is a reusable solution to a commonly occurring problem in software design. If design-patterns could be captured and reused in reverse engineering, the reverse engineering would be very helpful those who develops and maintains software. So there have been many attempts to detect design-patterns during reverse engineering. However, the approaches suffer from serious drawbacks to its practical implementation; false positive, false negative rate, the number of detected patterns. In this paper, we propose a new taxonomy of GoF design patterns that can guide the reverse-engineering process. This approach not only combines static analysis with dynamic analysis but also adds what we call the implementation-specific analysis. We apply a number of existing and new applications, including PURE toolkit, JINI based home application system, project management tool, MP3 player, and we demonstrate that the reverse engineering process is more accurate.
The Application of SOM Network to Clustering Enterprises Based on Questionnaires
Authors: Yan Yu, Pelian He, Yinghua Zhang, Yushan Bai, Zhengju Song, Tingting Yin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The self-organizing map (SOM) is an excellent tool for data mining. In order to know the understanding of businesses of establishing the environment-friendly enterprise, we carried out a questionnaire to 49 manufacturing enterprises in a city and clustered the results using SOM network. We found that there are four different classes among the enterprises. In doing this work we developed a new procedure of uniting one-dimensional SOM with two-dimensional SOM for visualizing and exploring properties of the training results. The procedure can reduce subjective factors and give satisfactory cluster results. This study was a trial applying the SOM method to cluster based on the questionnaire results directly.
Fuzzy Hierarchy Control Strategy of the Double Inverted Pendulum Based on Granular Computing
Authors: Xiaoli Hao, Keming Xie, Xinying Xu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The double inverted pendulum is a kind of multi- variable, nonlinear and fast system. When it is controlled by fuzzy controller, "rule explosion" is easily caused by many inputs. To solve the problem, the paper provides fuzzy hierarchy control strategy based on granular computing. According to granular theory, the error space is divided into different granular elements to constitute coarser granularity and finer granularity. Then we adopt fuzzy control on the layer of former to realize robust, while PID control on latter to realize delicate adjustment. The simulations testify that the strategy is effective, which not only solve the problem of rule explosion, but also achieve ideal performance of stable state and transient state.
On the Time Necessary to Compute Switching Functions
Authors: P. M. Spira
Venue: IEEE Transactions on Computers (1971)

In this note we establish a new upper bound on the time to compute classes of switching functions. As did Shannon and Lupanov in their study of the number of elements necessary to compute switching functions, we base our method on a Shannon expansion about a certain number of variables of the function being computed.
Topology of real algebraic space curves
Authors: Mhammed El Kahoui
Venue: Journal of Symbolic Computation (2008)

In this paper we give a new projection-based algorithm for computing the topology of a real algebraic space curve given implicitly by a set of equations. Under some genericity conditions, which may be reached through a linear change of coordinates, we show that a plane projection of the given curve, together with a special polynomial in the ideal of the curve contains all the information needed to compute its topological shape. Our method is also designed in such a way to exploit important particular cases such as complete intersection curves or curves contained in nonsingular surfaces.
HoSeqI
Authors: Anne-Muriel Arigon, Guy Perrière, Manolo Gouy
Venue: Bioinformatics (2006)

Summary: We present a web service allowing to automatically assign sequences to homologous gene families from a set of databases. After identification of the most similar gene family to the query sequence, this sequence is added to the whole alignment and the phylogenetic tree of the family is rebuilt. Thus, the phylogenetic position of the query sequence in its gene family can be easily identified. Availability: Contact: arigon@biomserv.univ-lyon1.fr Supplementary Information: Supplementary Data are available at Bioinformatics online.
An efficient multipath structure for concurrent data transport in wireless mesh networks
Authors: Xuhui Hu, Myung J. Lee
Venue: Computer Communications (2007)

Multipath routing is employed extensively in wireless mesh networks for fault tolerance, throughput enhancement, and load balancing purposes. Most existing multipath routing methods tend to establish link-disjoint or node-disjoint paths with minimal path costs. As paths created by these methods are typically close to each other, they may cause serious inter-path interference when serving for concurrent data transmissions. In this paper, we first introduce an AODV-based decoupled multipath routing protocol named AODV-DM. AODV-DM builds an insulating region around each established path to prevent new paths from being formed in the neighborhood of the established path. Multiple paths formed by this means are ''isolated'' from each other; thereby they are very suitable to serve for concurrent data transmissions. We also investigate the transport-layer route-coupling problem, and conclude that a path-aware SCTP scheme is a very good match to our AODV-DM protocol. The path-aware SCTP scheme enables the transport layer to make the most of the capacity provided by decoupled multipath. We simulate the AODV-DM protocol and integrate it with the path-aware SCTP protocol. The simulation results demonstrate that AODV-DM, combined with the path-aware SCTP, significantly boosts end-to-end throughput of multihop data transmissions. This decoupled multipath structure is especially beneficial to concurrent transmissions of time-constraint data in wireless mesh networks.
Robustness of star graph network under link failure
Authors: Shahram Latifi, Ebrahim Saberinia, Xialong Wu
Venue: Information Sciences: an International Journal (2008)

The star graph is an attractive underlying topology for distributed systems. Robustness of the star graph under link failure model is addressed. Specifically, the minimum number of faulty links, f(n,k), that make every (n-k)-dimensional substar S"n"-"k faulty in an n-dimensional star network S"n, is studied. It is shown that f(n,1)=n+2. Furthermore, an upper bound is given for f(n,2) with complexity of O(n^3) which is an improvement over the straightforward upper bound of O(n^4) derived in this paper.
Reciprocal attentive communication in remote meeting with a humanoid robot
Authors: Tomoyuki Morita, Kenji Mase, Yasushi Hirano, Shoji Kajita
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

In this paper, we investigate the reciprocal attention modality in remotecommunication. A remote meeting system with a humanoid robot avatar is proposedto overcome the invisible wall for a video conferencing system. Ourexperimental result shows that a tangible robot avatar provides more effectivereciprocal attention against video communication. The subjects in the experimentare asked to determine whether a remote participant with the avatar is activelylistening or not to the local presenter's talk. In this system, the head motionof a remote participant is transferred and expressed by the head motion of ahumanoid robot. While the presenter has difficulty in determining the extentof a remote participant's attention with a video conferencing system, she/he hasbetter sensing of remote attentive states with the robot. Based on theevaluation result, we propose a vision system for the remote user thatintegrates omni-directional camera and robot-eye camera images to provide a wideview with a delay compensation feature.
A Fast Path Recovery Scheme for Publish/Subscribe in Mobile Ad Hoc Networks
Authors: Sang-chul Moon, Yangwoo Ko, Dongman Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper analyzes previous work on publish/subscribe in mobile ad-hoc networks with respect to collaboration methods among distributed event brokers. Our experiments suggest that approaches based on event delivery trees are suitable for a scenario where people are served by various personalized services in public spaces. However, these approaches based on independent periodic beaconing may fail to reflect the current network topology while building event delivery paths during path maintenance. For this reason they do not correctly recover a broken path caused by node mobility, which results in lower event delivery ratios. This paper proposes a scheme for building and maintaining event delivery paths based on initiating advertisements from the root node. This guarantees correct recovery of event delivery paths within each beacon period. Our experiments show that, our proposed scheme gives a better event delivery ratio with lower overhead.
A Formula for Ternary Network Cost
Authors: S. Satake
Venue: IEEE Transactions on Computers (1974)

By means of Monte Carlo method, an average cost function of ternary two variable switching function is obtained.
Rank and select revisited and extended
Authors: Veli Mäkinen, Gonzalo Navarro
Venue: Theoretical Computer Science (2007)

The deep connection between the Burrows-Wheeler transform (BWT) and the so-called rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text indexing. Rank of a symbol at a given position equals the number of times the symbol appears in the corresponding prefix of the sequence. Select is the inverse, retrieving the positions of the symbol occurrences. It has been shown that improvements to rank/select algorithms, in combination with the BWT, turn into improved compressed text indexes. This paper is devoted to alternative implementations and extensions of rank and select data structures. First, we show that one can use gap encoding techniques to obtain constant time rank and select queries in essentially the same space as what is achieved by the best current direct solution (and sometimes less). Second, we extend symbol rank and select to substring rank and select, giving several space/time trade-offs for the problem. An application of these queries is in position-restricted substring searching, where one can specify the range in the text where the search is restricted to, and only occurrences residing in that range are to be reported. In addition, arbitrary occurrences are reported in text position order. Several byproducts of our results display connections with searchable partial sums, Chazelle's two-dimensional data structures, and Grossi et al.'s wavelet trees.
Oscillation of forced neutral differential equations with positive and negative coefficients
Authors: Özkan Öcalan
Venue: Computers Mathematics with Applications (2007)

Some sufficient conditions are obtained for the oscillation of forced neutral differential equations with positive and negative coefficients [x(t)-R(t)x(t-r)]^'+P(t)x(t-@t)-Q(t)x(t-@s)=f(t),t>=t"0 where R(t),P(t),Q(t)@?C([t"0,~),R^+),r>0,@t>=0,@s>=0.
Marketing with metadata: how metadata can increase exposure and visibility of online content
Authors: M. Moffat
Venue: The New Review of Information Networking (2006)

The concept of metadata is briefly introduced and the benefits of exposing metadata for publishers and content providers are discussed. Various approaches for standardised exposure of metadata are described including; harvesting via OAT-PMH, distributed searching via Z39.50 & SRU/SRW, and exposure of content for syndication via RSS. Case studies are used throughout to provide illustrative examples of these methods in action and a range of typical concerns relating to metadata sharing issues are addressed.