ppxscal/embedding_network huggingface dataset:
Data complexity assessment in undersampled classification of high-dimensional biomedical data
Authors: R. Baumgartner, R. L. Somorjai
Venue: Pattern Recognition Letters (2006)

Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a design of data complexity measures was proposed in order to assess the competence of a classifier in a particular context. Our work was motivated by the analysis of ill-posed regression problems by Elden and the interpretation of linear discriminant analysis as a mean square error classifier. Using Singular Value Decomposition analysis, we define a discriminatory power spectrum and show that it provides useful means of data complexity assessment for undersampled classification problems. In five real-life biomedical data sets of increasing difficulty we demonstrate how the data complexity of a classification problem can be related to the performance of regularized linear classifiers. We show that the concentration of the discriminatory power manifested in the discriminatory power spectrum is a deciding factor for the success of the regularized linear classifiers in undersampled classification problems. As a practical outcome of our work, the proposed data complexity assessment may facilitate the choice of a classifier for a given undersampled problem.
Voronoi Diagram Based Automated Skeleton Extraction from Colour Scanned Maps
Authors: Ojaswa Sharma, Darka Mioc, Francois Anton
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

This paper presents a methodology to automate some parts of the manual digitization process. This includes replacing the manual digitization process by computer assisted skeletonization using scanned paper maps. In colour scanned paper maps various features on the map can be distinguished based on their colour. This research work utilizes the Delaunay triangulation and the Voronoi diagram in order to extract the skeletons that are guaranteed to be topologically correct. The features thus extracted as object centrelines can be stored as vector maps in a Geographic Information System after labelling and editing. Map updates are important in any Geographic Information System. Therefore, this research work can also be used for updates from sources that are either paper copy maps or digital raster images. A prototype application that is developed as part of the research has been presented.
A spatial-domain error concealment method with edge recovery and selective directional interpolation
Authors: Wei-Ying Kung, Chang-Su Kim, C. C. J. Kuo
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A low complexity spatial-domain error concealment method is proposed to reconstruct still images and intra-coded (I) frames in video when they are transmitted through unreliable channels in this work. The proposed concealment algorithm works with the following steps. First, missing edges in a lost macroblock (MB) are detected and recovered using gradient data. Then, the lost MB is implicitly divided into several segments along the recovered edges. Finally, each pixel in a segment is directionally interpolated from boundary pixels adjacent to the segment. Experimental results show that the proposed algorithm can recover high as well as low frequency information in lost MBs and provide better visual quality in comparison with the conventional spatial domain interpolation.
Delay-Bounded Range Queries in DHT-based Peer-to-Peer Systems
Authors: Dongsheng Li, Xicheng Lu, Baosheng Wang, Jinshu Su, Jiannong Cao, Keith C. C. Chan, Hong-va Leong
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Many general range query schemes for DHT-based peer-to-peer (P2P) systems have been proposed, which do not need to modify the underlying DHTs. However, most existing works have the query delay depending on both the scale of the system and the size of the query space or the specific query, and thus cannot guarantee to return the query results in a bounded delay. In this paper, we propose Armada, an efficient general range query scheme to support single-attribute and multipleattribute range queries. Armada is the first delaybounded range query scheme over constant-degree DHTs, and can return the results for any range query within 2logN hops in a P2P system with N peers. Results of analysis and simulations show that the average delay of Armada is less than logN, and the average message cost of single-attribute range queries is about logN+2n..2 (n is the number of peers that intersect with the query). These results are very close to the lower bounds on delay and message cost of range queries over constant-degree DHTs.
On compensating the Mel-frequency cepstral coefficients for noisy speech recognition
Authors: Eric H. C. Choi
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

This paper describes a novel noise-robust automatic speech recognition (ASR) front-end that employs a combination of Mel-filterbank output compensation and cumulative distribution mapping of cepstral coefficients with truncated Gaussian distribution. Recognition experiments on the Aurora II connected digits database reveal that the proposed front-end achieves an average digit recognition accuracy of 84.92% for a model set trained from clean speech data. Compared with the ETSI standard Mel-cepstral front-end, the proposed front-end is found to obtain a relative error rate reduction of around 61%. Moreover, the proposed front-end can provide comparable recognition accuracy with the ETSI advanced front-end, at less than half the computation load.
Predicting partner's behaviour in agent negotiation
Authors: Jakub Brzostowski, Ryszard Kowalczyk
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We propose an improved approach for modeling behaviours of negotiation partners and predictive decision-making based on this modelling. Our prediction is based only on the history of the offers during the current negotiation. The mechanism estimates an influence of different factors contributing to partner's behaviour during negotiation and uses this information to construct a prediction about agent's future behaviour. The optimal sequence of offers is determined according to the prediction. The approach is tested in simple scenarios and the results comparing our approach to random strategy selection are illustrated.
Conway's Angel in three dimensions
Authors: Martin Kutz
Venue: Theoretical Computer Science (2005)

The Angel-Devil game is an infinite game played on an infinite chess board: In each move the Angel, a generalized chess king, jumps from his current square to some location at distance at most k, while his opponent, the Devil, blocks squares trying to strand the Angel. The Angel wins if he manages to fly on forever. It is a long-standing open question whether some Angel of sufficiently large power k can escape.We show that in the three-dimensional analog of the game the 13-Angel can win. Our proof is constructive and provides an explicit infinite escape strategy.
The Discussion on the Network Plan Technique That Is Used to Arrange Duration of Project
Authors: Li Xia, Wu Wen-ping, Li Sui-cheng, Sheng Yi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

On the basis of several problems exposed during the applications of the management method-Network Plan Technique on how to scheme and execute plans in modern project management, this paper advances the probability of meeting the project deadline a concept of 'expected delay', and works out the mathematical formula in order to increase the probability of completing the planned duration of project and every node.
Reducibility and reduction of discrete-time nonlinear control systems: comparison of two approaches
Authors: U. Kotta, E. Pawluszewicz, S. Nomm
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The problem of system reduction is studied for discrete-time nonlinear single-input single-output systems described by high-order input-output (i/o) difference equations, that is, given the i/o equation, can one find a minimal representation which is equivalent to the original system with the order being as small as possible. Comparison of two notions of reducibility is provided. The reducibility properties addressed are both generalizations of the well-known notion of transfer equivalence to the case of nonlinear control systems. Two roles of transfer equivalence are covered by these extensions. The first is that of identity of the outputs for any fixed control sequence under zero initial conditions. The second role is that of pole/zero cancellation that may occur in the transfer function of equivalent systems. The relationship between two reducibility criteria related to two equivalence notions is examined and the reducibility criterion which extends pole/zero cancellation property is shown to be stronger. Finally, the computational aspects of system reduction are discussed.
Cell-Site Diversity Against Co-Channel Interference in LMDS Networks
Authors: A. D. Panagopoulos, K. P. Liolis, P. G. Cottis
Venue: Wireless Personal Communications: An International Journal (2006)

LMDS networks are fixed radio systems providing advanced telecommunication services to a variety of users. Millimeter wave frequencies above 20 GHz have been allocated to LMDS systems by ITU-R and CEPT. The design of LMDS systems must take into account how interference affects performance considering the dominant propagation impairments in these frequencies. In the present paper, cell-site diversity, an effective fade mitigation countermeasure for LMDS systems, is considered for the reduction of intersystem interference on downstream LMDS channels. The intersystem cochannel interference may originate from adjacent LMDS networks or from point-to-point links operating at the same frequencies. A physical propagation model for the calculation of carrier-to-interference ratio diversity gain for the downstream channel is presented. Numerical results focus on the impact of frequency of operation, the subscriber's service availability and the climatic conditions on the interference analysis of LMDS networks either using or not cell site diversity.
Conformance deterioration in QoS networks: phenomenon, analysis and elimination
Authors: Frank Y. Li, Norvald Stol, Bjarne E. Helvik
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

To verify conformance consistency of a previously regulated flow in QoS networks, two token buckets with identical token rate (r) and bucket size (b) are employed at the ingress and the egress nodes as the traffic shaper and policer respectively. In the presence of variable packet length, it has been found that an originally conformant packet may become non-conformant even transmitted at a constant speed. This non-intuitive phenomenon is referred to as conformance dete-roration. After illustrating how conformance deterioration happens, the paper analyzes the probability of conformance deterioration for the single-hop case, both in general and for a special case. The analytical results are enriched by discussions and examples. To further understand the phenomenon, a set of simulations is carried out based on a generic multi-hop network model, for both individual and aggregated traffic flows. Finally, measures to eliminate conformance deterioration are also studied and compared in the paper.
A Multi-Channel Algorithm for Edge Detection Under Varying Lighting
Authors: Wei Xu, Michael Jenkin, Yves Lesperance
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In vision-based autonomous spacecraft docking multiple views of scene structure captured with the same camera and scene geometry is available under different lighting conditions. These "multiple-exposure" images must be processed to localize visual features to compute the pose of the target object. This paper describes a robust multi-channel edge detection algorithm that localizes the structure of the target object from the local gradient distribution computed over these multiple-exposure images. This approach reduces the effect of the illumination variation including the effect of shadow edges over the use of a single image. Experiments demonstrate that this approach has a lower false detection rate than the average response of the Canny edge detector applied to the individual images separately.
A new approach for combining content-based and collaborative filters
Authors: Byeong Man Kim, Qing Li, Chang Seok Park, Si Gwan Kim, Ju Yeon Kim
Venue: Journal of Intelligent Information Systems (2006)

With the development of e-commerce and the proliferation of easily accessible information, recommender systems have become a popular technique to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. A variety of techniques have been proposed for performing recommendations, including content-based and collaborative techniques. Content-based filtering selects information based on semantic content, whereas collaborative filtering combines the opinions of other users to make a prediction for a target user. In this paper, we describe a new filtering approach that combines the content-based filter and collaborative filter to capitalize on their respective strengths, and thereby achieves a good performance. We present a series of recommendations on the selection of the appropriate factors and also look into different techniques for calculating user-user similarities based on the integrated information extracted from user profiles and user ratings. Finally, we experimentally evaluate our approach and compare it with classic filters, the result of which demonstrate the effectiveness of our approach.
Geometric Hashing with Local Affine Frames
Authors: Ondrej Chum, Jiri Matas
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We propose a novel representation of local image structure and a matching scheme that are insensitive to a wide range of appearance changes. The representation is a collection of local affine frames that are constructed on outer boundaries of maximally stable extremal regions (MSERS) in an affine-covariant way. Each local affine frame is described by a relative location of other local affine frames in its neighborhood. The image is thus represented by quantities that depend only on the location of the boundaries of MSERs. Inter-image correspondences between local affine frames are formed in constant time by geometric hashing. Direct detection of local afine frames removes the requirement of a point-based hashing to establish reference frames in a combinatorial way, which has in the case of affine transform complexily that is cubic in the number of points. Local affine frames, which are also the quantities represented in the hash table, occupy a 6 0 space and hence data collisions are less likely compared with 2 0 point hashing. Experimentally, the robustness of the method and its insensitiviq to photometric changes is demonstrated on images from different spectral bands of satellite sensor; on images of a transparent object and on images of an object taken during day and night.
Analysis of the Coexistence of Monopoly and Competition in Online Services Providers Market
Authors: Mingli Liu, Zhiwei Wang, Jingyuan Cheng, Hong Zhang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

The coexistence of monopoly and competition is a remarkable property of the market structure for online service providers (OSPs) in e-business economy. In this paper, the process, characters, and regularity of OSPs market structure's changes and evolution are analyzed, based on its own supply-demand curve and mechanism of the positive feedback effect. It mainly elaborates the reasons of the coexistence of monopoly and competition. At the same time, its influence on the competitive strategy of enterprises are given and discussed.
A Practical Estimation Method for Complex RE
Authors: Bhavani Palyagar, Frank Moisiadis
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Software projects typically require effort estimation from the Software Development Life Cycle (SDLC) staff at the commencement of the software development activities. Inaccuracies in effort estimation of software projects early on in the SDLC continues to be a perennial problem. Typically, improved estimates for software projects are provided under circumstances where Requirements Engineering (RE) is completed. RE provides a key reference in the form of requirements for the estimation process. However, RE by itself may consume significant effort demanding the RE phase to be estimated as the first step in the SDLC. It is difficult to establish RE estimates, as RE usually has no tangible reference on which estimates can be based. This paper provides a practical estimation method for large and complex RE processes. We demonstrate using a case study snapshot in a large software organization that the method provides improved effort estimates for the RE process.
User Preferences for Access to Textual Information
Authors: Thibault Roy, Stephane Ferrari
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

Accessing textual information is still a complex task when the user has to browse through large collections of texts or long documents. Improving satisfaction requires taking into account the user's preferences. A model is proposed below as well as related tools helping user to build his own semantic lexicons and operating them for tasks such as searching information in a specific domain. The process can be realised through graphical user interfaces, step by step, in an incremental approach. In order to show the flexibility of the model, we present two experiments with different tasks and contexts: accessing information and studying a linguistic figure.
Model checking for multivalued logic of knowledge and time
Authors: Beata Konikowska, Wojciech Penczek
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a multivalued &mu;K-calculus, an expressive logic to specify knowledge and time in multi-agent systems. We show that the general method of translation [22] from multivalued to two-valued De Morgan algebras can be extended to mv &mu;K-calculus model checking. This way can we reduce the model checking problem for mv &mu;K-calculus to several instances of the model checking problem for two-valued &mu;K-calculus. As a result, properties involving mv &mu;K-calculus or its subsets, like mv CTLK or mv CTL*K, can be verified using any of the available model checking algorithms. Three simple examples are shown to exemplify possible applications of multivalued logics of knowledge and time.
A semantics-based approach to malware detection
Authors: Mila Dalla Preda, Mihai Christodorescu, Somesh Jha, Saumya Debray
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

Malware detection is a crucial aspect of software security. Current malware detectors work by checking for "signatures," which attempt to capture (syntactic) characteristics of the machine-level byte sequence of the malware. This reliance on a syntactic approach makes such detectors vulnerable to code obfuscations, increasingly used by malware writers, that alter syntactic properties of the malware byte sequence without significantly affecting their execution behavior.This paper takes the position that the key to malware identification lies in their semantics. It proposes a semantics-based framework for reasoning about malware detectors and proving properties such as soundness and completeness of these detectors. Our approach uses a trace semantics to characterize the behaviors of malware as well as the program being checked for infection, and uses abstract interpretation to "hide" irrelevant aspects of these behaviors. As a concrete application of our approach, we show that the semantics-aware malware detector proposed by Christodorescu et al. is complete with respect to a number of common obfuscations used by malware writers.
In VINI veritas: realistic and controlled network experimentation
Authors: Andy Bavier, Nick Feamster, Mark Huang, Larry Peterson, Jennifer Rexford
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

This paper describes VINI, a virtual network infrastructure that allows network researchers to evaluate their protocols and services in a realistic environment that also provides a high degree of control over network conditions. VINI allows researchers to deploy and evaluate their ideas with real routing software, traffic loads, and network events. To provide researchers flexibility in designing their experiments, VINI supports simultaneous experiments with arbitrary network topologies on a shared physical infrastructure. This paper tackles the following important design question: What set of concepts and techniques facilitate flexible, realistic, and controlled experimentation (e.g., multiple topologies and the ability to tweak routing algorithms) on a fixed physical infrastructure? We first present VINI's high-level design and the challenges of virtualizing a single network. We then present PL-VINI, an implementation of VINI on PlanetLab, running the "Internet In a Slice". Our evaluation of PL-VINI shows that it provides a realistic and controlled environment for evaluating new protocols and services.
Business-to-business e-procurement corporate initiative: a descriptive empirical study
Authors: Rebecca Angeles
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

An exploratory and empirical study was undertaken to discover the initial e-procurement experiences of firms. Applying the survey method and taking a participant sample from the membership of the Institute for Supply Management and Council for Supply Management Professionals (formerly Council of Logistics Management), this study presents hard data on the perceived and expected benefits from e-procurement, the types of goods and services purchased, the electronic solutions and environments used for purchasing, actual cost savings gained, business practices that encourage successful procurement, and obstacles to systems implementation.
Extended static checking for haskell
Authors: Dana N. Xu
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and to systems that are guarded by runtime checks. Extended static checking can reduce these costs by helping to detect bugs at compile-time, where possible. Extended static checking has been applied to objectoriented languages, like Java and C#, but it has not been applied to a lazy functional language, like Haskell. In this paper, we describe an extended static checking tool for Haskell, named ESC/Haskell, that is based on symbolic computation and assisted by a few novel strategies. One novelty is our use of Haskell as the specification language itself for pre/post conditions. Any Haskell function (including recursive and higher order functions) can be used in our specification which allows sophisticated properties to be expressed. To perform automatic verification, we rely on a novel technique based on symbolic computation that is augmented by counter-example guided unrolling. This technique can automate our verification process and be efficiently implemented.