ppxscal/embedding_network huggingface dataset:
Measuring Differentiability: Unmasking Pseudonymous Authors
Authors: Moshe Koppel, Jonathan Schler, Elisheva Bonchek-Dokow
Venue: The Journal of Machine Learning Research (2007)

In the authorship verification problem, we are given examples of the writing of a single author and are asked to determine if given long texts were or were not written by this author. We present a new learning-based method for adducing the "depth of difference" between two example sets and offer evidence that this method solves the authorship verification problem with very high accuracy. The underlying idea is to test the rate of degradation of the accuracy of learned models as the best features are iteratively dropped from the learning process.
Design and Validation of a Connection Network for Many-Processor Multiprocessor Systems
Authors: G. H. Barnes
Venue: Computer (1981)

Distributed control and circuit switching are the keys to fast access in the many-processor to many-memory-module connection network proposed for the Numerical Aerodynamic Simulator.
Publishing of Interoperable Services and Processes in UDDI
Authors: Marcus Spies, Harald Schoning, Keith Swenson
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

A solution approach to representing collaborative business pro- cesses conforming to the Wf-XML/ASAP standard proposal in a UDDI registry. Wf-XML/ASAP is introduced as a coordination protocol for business collaborations focusing on loosely coupled subprocesses which involve executable and human activities. The UDDI standard as part of the web services protocol stack is designed to hold service relevant information from overall busi- ness entities down to technical fingerprints of mostly simple web services. We present a solution approach that allows to use UDDI for registering and discovering services using Wf-XML/ASAP interfaces. We conclude that while such a representation is possible, some of UDDI's structures and relationships need to be extended in order to get an appropriate service registry for interoperable services collaborative infrastructures.
The VC-1 Video Coding Standard
Authors: Hari Kalva, Jae-Beom Lee
Venue: IEEE MultiMedia (2007)

Achieving high-quality online video services requires improved video coding capabilities. The video compression standard VC-1 was developed mainly for online video services and has been adopted by the DVD forum for high-definition DVDs. We can expect to see VC-1 applied to satellite TV, IP set-top boxes, and high-definition DVD recorders.
A Double Layer Bayesian Classifier
Authors: Jiangwen Sun, Chongjun Wang, Shifu Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Numerous approaches have been proposed to relax the conditional independence assumption of naive bayes, the accuracy performance was indeed improved relative to naive bayes when the assumption is violated. But most of the previous approaches treated the attribute relation in the same way for all class labels. In practice, this relation may be different for different class labels. This paper proposes a novel approach, by which the posterior probability of dif- ferent class label is evaluated using different attribute re- lation. Experiment results indicate that the new approach obtains comparative performance relative to other modern Bayesian classifiers on some datasets, and on some other datasets it outperforms the others.
The impact of personality type on purchasing decisions in virtual stores
Authors: Reza Barkhi, Linda Wallace
Venue: Information Technology and Management (2007)

Despite the proliferation of virtual stores, research into the consumer personality characteristics that influence consumer interactions with virtual stores has been lagging. In this paper we propose and test a model linking consumer personality type with a decision to purchase from a virtual store. The results indicate that a consumer's personality type has an effect on perceived ease of use and peer influence; and those two variables, together with perceived usefulness, have an effect on a consumer's eventual decision to purchase from a virtual store. The practical implications of the findings are that consumer perceptions and attitudes towards virtual stores can be altered by personalizing virtual stores in a manner which will increase their likelihood of making a purchase.
Multi-population Parallel Genetic Algorithm for Economic Statistical Information Mining Based on Gene Expression Programming
Authors: Qihong Liu, Tiande Li, Changjie Tang, Qiwei Liu, Chuan Li, Shaojie Qiao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Function Discovery is an important research direction in Data Mining and Economic Statistical Target Forecast. Gene Expression Programming (GEP) is a new tool to discovery the function in economic target analysis field. To overcome the deficiency such as pre-maturity and biggish stagnancy generation in GEP, this study (1) Introduces a dynamic mutation operator ( DM-GEP ) and flexibility controlling of population scale (FC-GEP) for more faster jumping local optimum trap and shortening average convergence generation in evolution, (2) Proposes a genome diversity-guided of grading evolution strategy for stakeout and melioration of GEP evolution process, (3) implements a multi-genome child-population parallel genetic strategy and a PEDGEP algorithm for increasing average maximal fitness and success ratio, and (4) demonstrates the effectiveness and efficiency of the new algorithm by extensive experiments, Comparising with transitional GEP, the average convergence generation is decrease to 35% at least, and average maximal fitness increases 8% leastways.
Composing mappings among data sources
Authors: Jayant Madhavan, Alon Y. Halevy
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Semantic mappings between data sources play a key role in several data sharing architectures. Mappings provide the relationships between data stored in different sources, and therefore enable answering queries that require data from other nodes in a data sharing network. Composing mappings is one of the core problems that lies at the heart of several optimization methods in data sharing networks, such as caching frequently traversed paths and redundancy analysis. This paper investigates the theoretical underpinnings of mapping composition. We study the problem for a rich mapping language, GLAV, that combines the advantages of the known mapping formalisms globalas-view and local-as-view. We first show that even when composing two simple GLAV mappings, the full composition may be an infinite set of GLAV formulas. Second, we show that if we restrict the set of queries to be in CQk (a common restriction in practice), then we can always encode the infinite set of GLAV formulas using a finite representation. Furthermore, we describe an algorithm that given a query and a finite encoding of an infinite set of GLAV formulas, finds all the certain answers to the query. Consequently, we show that for a commonly occuring class of queries it is possible to pre-compose mappings, thereby potentially offering significant savings in query processing.
Self-reorganization of symptom parameters in frequency domain for failure diagnosis by genetic algorithms
Authors: Peng Chen, Masami Nasu, Toshio Toyota
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

In the field of failure diagnosis of plant machinery, one of the most important and most difficult factors is the identification of Symptom Parameters (SP). Failures of machinery can be sensitively detected and the failure types can be distinguished by using the optimum SP. Currently, however, there is no acceptable method for extracting the optimum SP. In order to overcome this difficulty and ensure highly accurate failure diagnosis, in this paper a new method called "Self-reorganization of Symptom Parameters" has been proposed by using Genetic Algorithms (GA). The new method can also be applied to other pattern recognition problems. It has been proved that the optimum SP can be quickly discovered by applying the method to many practical machinery diagnoses.
Haptic-feedback support for cognitive mapping of unknown spaces by people who are blind
Authors: O. Lahav, D. Mioduser
Venue: International Journal of Human-Computer Studies (2008)

Mental mapping of spaces is essential for the development of efficient orientation and mobility skills. Most of the information required for this mental mapping is gathered through the visual channel. People who are blind lack this information, and in consequence, they are required to use compensatory sensorial channels and alternative exploration methods. In this study, people who are blind use a virtual environment (VE) that provides haptic and audio feedback to explore an unknown space. The cognitive mapping of the space based on the VE and the subject's ability to apply this map to accomplish tasks in the real space are examined. Results show clearly that a robust and comprehensive map is constructed, contributing to successful performance in real space tasks.
Towards a generic model of intelligent networks and services
Authors: Gábor Németh
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The next generation of intelligent networks will provide non-conventional information processing, retrieval and transfer services for the user in a transparent way. The structure and services of large networks are dynamically changing because of modifications and failures, with static or dynamic task allocation over inhomogeneous or homogeneous resource types, leading to n-dimensional demand driven network structure model. The processing nodes of the network may use any mix of the four basic information processing models: control driven, data driven, demand driven and information driven models. A knowledge based generic model is presented for such a system, having logical, temporal and topological structures together with operations on these structures. The necessary mathematical concepts are parameterised hierarchical relations, logic functions, hierarchies of variables with their hierarchical control operators, and neighbourhood/similarity structures. Introducing a model time as a partial ordered set of time instants, an evolutionary system can be considered, both its capabilities and its active structure. For the operating system the mobile agent paradigm is proposed. The main goal of the model is to provide a theoretically sound base for the development of particular design models for various problem classes.
Controlling the Software Life Cycle The Project Management Task
Authors: W. C. Cave
Venue: IEEE Transactions on Software Engineering (1978)

This paper describes project management methods used for controlling the life cycle of large-scale software systems deployed in multiple instaltations over a wide geographic area. A set of management milestones is offered along with requirements and techniques for establishing and maintaining control of the project. In particular, a quantitative measure of software quality is proposed based upon functional value, availability, and maintenance costs. Conclusions drawn are based on the study of several cases and are generally applicable to both commercial and military systems.
Flexible Querying of Multiple Data Sources through Fuzzy Summaries
Authors: Patrick Bose, Allel Hadjali, Helene Jaudoin, Olivier Pivert
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper deals with efficient fuzzy query processing in a distributed database context. The idea suggested is to forward the query only to the data sources that are likely to provide "good answers" to the query, which entails to define a way to assess each source by means of a "compact" representation of its content. A solution based on fuzzy summaries is outlined, and different approaches to fuzzy summaries are presented and compared. The query/summary matching aspect is tackled for each of these approaches and a general processing strategy is described.
A Formal Description-Based Approach to Extended Many-Valued Context Analysis
Authors: Yuxia Lei, Baoxiang Cao, Jiguo Yu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Formal Concept Analysis (FCA) is an effective formal tool for data analysis and knowledge mining. The paper firstly proposed a semi-automatic method, which is based on extended description, is used to translate the original documents into extended many-valued context. Then based on extended many-valued contexts and extended description, the paper presented an approach to concept lattice analysis in order to improve the utility and pertinence to the concept lattice. The method allows to avoid the generation of a large one-valued context and to do document knowledge discovery.
Achieving Distributed Termination without Freezing
Authors: N. Francez
Venue: IEEE Transactions on Software Engineering (1982)

An efficient algorithm for achieving distributed termination without introducing new communicaton channels and without delaying the basic computations ("freezing") is presented. The algorithm is related to the methodology of designing distributed programs where the programmer is relieved from the problem of distributed termination. An informal correctness proof and complexity analysis are included.
A Coercion-Resistant Internet Voting Protocol
Authors: Bo Meng
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Internet voting protocol is the core of the Internet voting systems. People are focusing on the implementation of coercion-resistant. A coercion-resistant protocol achieves not only receipt-free but also defense against randomization, forced-abstention, and simulation. In this paper, we present an Internet voting protocol that achieves coercion-resistant with few physical assumptions based on designated verifier Proof and proof of knowledge that two ciphertexts are encryption of the same plaintext. In the last we prove that the protocol is invariableness, receipt-free and coercion-resistant.
Building CBR systems with jcolibri
Authors: Belén Díaz-Agudo, Pedro A. González-Calero, Juan A. Recio-García, Antonio A. Sánchez-Ruiz-Granados
Venue: Science of Computer Programming (2007)

Case-based reasoning (CBR) is a paradigm for combining problem solving and learning that has become one of the most successful applied subfields of AI in recent years. Now that CBR has become a mature and established technology two necessities have become critical: the availability of tools to build CBR systems, and the accumulated practical experience of applying CBR techniques to real-world problems. In this paper we are presenting jcolibri, an object-oriented framework in Java for building CBR systems, that greatly benefits from the reuse of previously developed CBR systems.
A Resolution-Based Proof Procedure Using Deletion-Directed Search
Authors: D. Gelperin
Venue: IEEE Transactions on Computers (1976)

The operation of a deletion-directed search strategy for resolution-based proof procedures is discussed. The strategy attempts to determine the satisfiability of a set of input clauses while at the same time minimizing the cardinality of the set of retained clauses. Distribution, a new clause deletion rule which is fundamental to the operation of the search strategy, is also described.
Modeling and Performance Analysis of Self-Similar Traffic Based on FBM
Authors: Xianhai Tan, Yuanhui Huang, Weidong Jin
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Self-similarity or long-range dependence (LRD) is a ubiquitous property of real traffic. Classical Poisson or Markov-based queue techniques are unsuitable for LRD traffic which creates the need for new analytical tools. Among the existing self-similar traffic models the Fractional Brownian Motion (FBM) process has been regarded as an attractive alternative to traditional modeling approaches, while it has some limitations. In this paper, we make a thorough investigation of traffic modeling and performance evaluation based on FBM. On the basis of the buffer overflow probability given by Norros, we derive the formulae of average queue length, queue length variance, average delay and jitter. The variation of these parameters is investigated through simulation, and some useful results are obtained. Finally, theoretical fractional traffic traces and real measured traffics traces are used to driven the OPNET to verify the accuracy and its scope of application of FBM model, and point out its inadequacy.
A Performance Analysis of MANET Multicast Routing Algorithms with Multiple Sources
Authors: Sang-Chul Kim, KeeHyun Shin
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Since network resource of mobile ad hoc network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MANET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source-specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i:e: less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted.
Runtime Service Discovery and Reconfiguration Using OWL-S Based Semantic Web Service
Authors: Jinhan Kim, Jaejeong Lee, Byungjeong Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In recent business environment where collaboration between organizations is essential, business organization must fast adapt to changing user and market demands. SOC (Service-Oriented Computing) is believed to be a prominent paradigm for efficient businesses application development. Semantic web enables users to locate, select, employ, compose, and monitor Web-based services automatically. OWL-S, ontology of service, helps this location, selection, and composition of services. In this paper we propose a framework, to support dynamic reconfiguration of service-oriented applications. This framework supports semantic discovery, ranking, and dynamic reconfiguration of services using OWL-S based ontology. A prototype is provided to show the validity of this framework.
Lazy maintenance of materialized views
Authors: Jingren Zhou, Per-Ake Larson, Hicham G. Elmongui
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Materialized views can speed up query processing greatly but they have to be kept up to date to be useful. Today, database systems typically maintain views eagerly in the same transaction as the base table updates. This has the effect that updates pay for view maintenance while beneficiaries (queries) get a free ride! View maintenance overhead can be significant and it seems unfair to have updates bear the cost. We present a novel way to lazily maintain materialized views that relieves updates of this overhead. Maintenance of a view is postponed until the system has free cycles or the view is referenced by a query. View maintenance is fully or partly hidden from queries depending on the system load. Ideally, views are maintained entirely on system time at no cost to updates and queries. The efficiency of lazy maintenance is improved by combining updates from several transactions into a single maintenance operation, by condensing multiple updates of the same row into a single update, and by exploiting row versioning. Experiments using a prototype implementation in Microsoft SQL Server show much faster response times for updates and also significant reduction in maintenance cost when combining updates.
((lambda (discussions) (report on x3j13)) (first year report))
Authors: Robert F. Mathis
Venue: ACM SIGPLAN Lisp Pointers (1987)

This is the report I am submitting to the US Tecnical Advisory Group (TAG) to ISO/TC97/SC22 (the subcommitte on programming languages) and SPARC (X3's Standards Planning and Review Committee).
Modelling Dynamic Memory Management in Constraint-Based Testing
Authors: Florence Charreteur, Bernard Botella, Arnaud Gotlieb
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. When programs contain dynamic memory allocation and loops, constraint reasoning becomes challenging as new variables and new constraints are created during the test data generation process. In this paper, we address this problem by proposing a new constraint model of C programs based on operators that model dynamic memory management. These operators apply deduction rules on abstract states of the memory allowing so to enhance the constraint reasoning process that permits to generate test data for these programs. We illustrate our approach on structural testing of a complex program that contains dynamic memory allocation/deallocation, structures and loops. An implementation is in progress and first experimental results obtained on this program show the highly deductive potential of the approach.
Using edge direction information for measuring blocking artifacts of images
Authors: F. Pan, X. Lin, S. Rahardja, E. P. Ong, W. S. Lin
Venue: Multidimensional Systems and Signal Processing (2007)

Block-based transform coding is the most popular approach for image and video compression. The objective measurement of blocking artifacts plays an important role in the design, optimization, and assessment of image and video coding systems. This paper presents a new algorithm for measuring blocking artifacts in images and videos. Instead of using the traditional pixel discontinuity along the block boundary, we use the edge directional information of the images. The new algorithm does not need the exact location of the block boundary thus is invariant to the displacement, rotation and scaling of the images. Experiments on various still images and videos show that the new blockiness measure is very efficient in terms of computational complexity and memory usage, and can produce blocking artifacts measurement consistent with subjective rating.
A Reliable Data Management Method for Parallel File System
Authors: Yanmei Huo, Kuo Tang, Liang Hu, Kexin Yang, Jiubin Ju
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

One way of improving I/O performance is to carry out I/O operations in parallel, which is supported by parallel file systems. The data management techniques are very important to build a parallel file system with high performance and high reliability. A simple and efficient parallel file data management method was implemented. A fixed stripe size and redundant data placement technique was used. Experimental results showed that this method can improve the performance and the reliability of parallel file data.