ppxscal/embedding_network huggingface dataset:
Collaborative Filtering for Multi-class Data Using Belief Nets Algorithms
Authors: Xiaoyuan Su, Taghi M. Khoshgoftaar
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

As one of the most successful recommender systems, collaborative filtering (CF) algorithms can deal with high sparsity and high requirement of scalability amongst other challenges. Bayesian belief nets (BNs), one of the most frequently used classifiers, can be used for CF tasks. Previous works of applying BNs to CF tasks were mainly focused on binary-class data, and used simple or basic Bayesian classifiers [1][2]. In this work, we apply advanced BNs models to CF tasks instead of simple ones, and work on real-world multi-class CF data instead of synthetic binary-class data. Empirical results show that with their ability to deal with incomplete data, extended logistic regression on naïve Bayes and tree augmented naïve Bayes (NB-ELR and TAN-ELR) models [3] consistently perform better than the state-of-the-art Pearson correlation-based CF algorithm. In addition, the ELR-optimized BNs CF models are robust in terms of the ability to make predictions, while the robustness of the Pearson correlation-based CF algorithm degrades as the sparseness of the data increases.
Application of a network dynamics analysis tool to mobile ad hoc networks
Authors: V. R. Syrotiuk, K. Shaukat, Y. J. Kwon, M. Kraetzl, J. Arnold
Venue: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (2006)

We present an application of the Redback network dynamics analysis tool to mobile ad hoc networks. Our goal is to understand the network properties that arise from different mobility models and to quantify how these differences impact communications. We generate input for Redback as a graph series for varying node density and speed in the random waypoint, reference point group, freeway, and Manhattan mobility models by sampling network topology in the ns-2 network simulator. The graph series are analyzed using several distance and metric measures in the Redback tool and visualized as a time series, one of the Redback output displays. We find measurable differences among mobility models that may impact mobile communications and influence protocol design.
A robust accuracy improvement method for blind identification using higher order statistics
Authors: V. Zivojnovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The accuracy improvement of parameter estimates using higher order statistics (HOS) of the input process is treated. It is shown that the robust distribution minimizing the Fisher information under moment constraints is of the exponential type, which covers moment sequences of sub-Gaussian distributions only. To enable accuracy-improvement for the class of heavy-tailed, super-Gaussian distributions, the Gaussian scale-mixtures as modeling distributions are introduced. It is shown that the additional knowledge about moments results in improved parameter estimates and that the scale-mixture found by the moment method is the most robust one among the class of Gaussian scale-mixtures. The prediction error algorithm with the newly introduced moment based norm has been verified in simulation runs with both a priori known moments of the input process and moments estimated from the residual.
Exploiting agents in e-learning and skills management context
Authors: Alfredo Garro, Luigi Palopoli, Francesco Ricca
Venue: AI Communications (2006)

Nowadays, it is quite agreed that organizations gain limited advantages in adopting e-learning platforms that only provide educational contents. An advantageous e-learning platform should have instead the capability to help enrich, share and circulate organization knowledge, thus contributing to making the organization dynamic and flexible. In this paper MASEL, a Multi-Agent System for E-Learning and Skill Management is described. MASEL performs the following tasks: (i) supports Chief Learning Officers in defining roles, associated competencies and required knowledge level; (ii) manages the skill map of the organization; (iii) evaluates human resources competence gaps; (iv) supports employees in filling the competence gaps related to their roles; (v) creates personalized learning paths according to feedbacks that users provide to optimize the acquisition of required competencies; (vi) assists Chief Learning Officers in selecting the most appropriate employee for a given role; (vii) assists a Project Manager in building teamwork. A prototype tool implementing MASEL using JADE (Java Agent DEvelopment Framework) was developed. The reasoning capability of MASEL agents involved in the learning paths building process and in the team building process is implemented using DLV, a disjunctive logic programming system.
A low-phase-noise 900-MHz CMOS ring oscillator with quadrature output
Authors: Zhi-Qiang Lu, Jian-Guo Ma, Feng-Chang Lai
Venue: Analog Integrated Circuits and Signal Processing (2006)

A 900-MHz two-stage CMOS voltage controlled ring oscillator (VCRO) with quadrature output is presented. The circuit is designed in a 0.18-um CMOS technology and operated on a 1.8-V supply voltage. The VCRO have a tuning range of 730 MHz to 1.43 GHz and good tuning linearity. Between 0 V and 1.1 V of control voltage, the gain of VCRO is around ¿620 MHz/V. At 900 MHz, the phase noise of the VCRO is ¿106.1 dBc/Hz at 600-KHz frequency offset with power consumption of 65.5 mW.
Digital watermarking security considerations
Authors: Rade Petrovic, Babak Tehranchi, Joseph M. Winograd
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

In this paper, we review our past experience with security of copy control audio watermarks, particularly related to SDMI. We also classify and analyze attacks published in literature and propose a number of security enhancement techniques for copy control and other digital watermarking applications. One type of security measure is based on uncoordinated selection of hiding places between embedders and extractors, with statistical analysis of expected matches. This approach reduces the repeatability of attacks and opens up the possibility of system renewal.Other security measures are introduced, based on weak watermark detections, time diversity extraction, weight accumulation, soft decision decoding, and extraction expansion or focusing. Finally, we propose a number of methods to conceal watermark presence, location and properties using random embedding, extraction and reporting, and random host signal modification techniques design to counter differential analysis or scrambling attacks.
Workflow Analysis based on Estimate of Fuzzy and Statistical Data
Authors: Feng TIAN, Keyi XING, Renhou LI
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

In general, an execution duration or constraints of the workflow activity may be created manually (empirical temporal information) or can be derived through process mining techniques from execution logs (statistical information). Those will induce inevitably complexity of time representation and analysis in a workflow model. The focus of this work is to deal with the time analysis of workflow where fuzzy and statistical temporal information coexist. Combining formal language with the definition of workflow net, a fuzzy estimate workflow nets is introduced to analyze workflow model, which can solve the situation, where fuzzy and statistical data coexisted, to realize efficient workflow management and meet time critical business services.
Architecture Evaluation for Distributed Auto-ID Systems
Authors: Hong-Hai Do, Jurgen Anke, Gregor Hackenbroich
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Auto-ID technologies allow capturing the time and location of products in the supply chain for tracking and tracing. This paves the way for a variety of business applications, such as Anti-counterfeiting, Pedigree, and Genealogy, which analyze the trace history of products to detect patterns or anomalies in the supply chain. While these applications have gained considerable interest recently, further work is needed towards integration of event data from heterogeneous Auto-ID nodes in order to obtain the complete trace history for products of interest. As a first step, we perform an architectural study on interoperable Auto-ID systems and present the results in this paper. We first review established techniques for data integration and data sharing as well as relevant industrial efforts. We then clarify the requirements that need to be addressed by an Auto-ID network. Finally, we discuss four possible architecture alternatives for implementing interoperability in such a network and comparatively evaluate the approaches according to the identified requirements.
OntoSphere3D: A Multidimensional Visualization Tool for Ontologies
Authors: Alessio Bosca, Dario Bonino
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper we propose a novel approach for inspecting and editing ontologies using a 3-dimensional space, where information is represented on a 3D viewport enriched by several visual cues. This approach aims at tackling space allocation issues for ontology visual models by adopting a dynamic collapsing mechanism and different views, at different granularities, for granting a constant navigability of the rendered model. A Protégé plug-in, based on the presented principles and named OntoSphere3D, has been developed. Preliminary results, comparing it to other solutions as Jambalaya, OWLViz and TgViz on specific operations, show that the approach is feasible and can actually lead to a more effective modeling process with respect to currently available solutions.
Rationalizing a Home Terabyte Server
Authors: Mache Creeger
Venue: Queue (2006)

With 1 TB of RAID 5 storage, most of my friends believe I have really gone off the deep end with my home server. They may be right, but as in most things in life, I have gotten to this point through a rational set of individual upgrades all perfectly reasonable at the time. Rather than being overly indulgent to my inner geek, am I an early adopter of what will be the inevitable standard for home IT infrastructure? Here is my story; you be the judge.
Distributed fault detection of wireless sensor networks
Authors: Jinran Chen, Shubha Kher, Arun Somani
Venue: Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks (2006)

Wireless Sensor Networks (WSNs) have become a new information collection and monitoring solution for a variety of applications. Faults occurring to sensor nodes are common due to the sensor device itself and the harsh environment where the sensor nodes are deployed. In order to ensure the network quality of service it is necessary for the WSN to be able to detect the faults and take actions to avoid further degradation of the service. The goal of this paper is to locate the faulty sensors in the wireless sensor networks. We propose and evaluate a localized fault detection algorithm to identify the faulty sensors. The implementation complexity of the algorithm is low and the probability of correct diagnosis is very high even in the existence of large fault sets. Simulation results show the algorithm can clearly identify the faulty sensors with high accuracy.
On the complexity of approximating k-set packing
Authors: Elad Hazan, Shmuel Safra, Oded Schwartz
Venue: Computational Complexity (2006)

Given a k-uniform hypergraph, the MAXIMUM k-SET PACKING problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to within a factor of Ω(k/ln k) unless P = NP. This improves the previous hardness of approximation factor of k/2O(√lnk) by Trevisan. This result extends to the problem of k-Dimensional-Matching.
Enabling contribution awareness in an overlay broadcasting system
Authors: Yu-Wei Sung, Michael Bishop, Sanjay Rao
Venue: ACM SIGCOMM Computer Communication Review (2006)

We consider the design of bandwidth-demanding broadcasting applications using overlays in environments characterized by hosts with limited and asymmetric bandwidth, and significant heterogeneity in outgoing bandwidth. Such environments are critical to consider to extend the applicability of overlay multicast to mainstream Internet environments where insufficient bandwidth exists to support all hosts, but have not received adequate attention from the research community. We leverage the multi-tree framework and design heuristics to enable it to consider host contribution and operate in bandwidth-scarce environments. Our extensions seek to simultaneously achieve good utilization of system resources, performance to hosts commensurate to their contributions, and consistent performance. We have implemented the system and conducted an Internet evaluation on Planet-Lab using real traces from previous operational deployments of an overlay broadcasting system. Our results indicate for these traces, our heuristics can improve the performance of high contributors by 10-240% and facilitate equitable bandwidth distribution among hosts with similar contributions.
Invariant tests for spatial stationarity using covariance structure
Authors: S. Bose, A. O. Steinhardt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors exploit the structure of covariance matrices of stationary processes to obtain invariant tests for stationarity, especially spatial stationarity. With this objective, they characterize the maximal invariants for testing for Toeplitz and centrosymmetric structure. This approach seems new and leads to invariant CFAR tests. The distribution is obtained under the null hypothesis and under the alternate hypothesis for a uniform linear array with a single near field interferer and an arbitrary far field environment. Simulation results indicate excellent performance.
Simulating uncertainty in mass balance modeling for fresh water reservoirs; case study: Deer Creek Reservoir, Utah, USA
Authors: Ahmad M. Salah, Paul J. Fields, A. Woodruff Miller
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simple mass balance techniques can be used to build a zero-dimensional model for a fresh water reservoir to quantify the amount of water and certain pollutants flowing into and out of the system. Yet, great uncertainty is involved in the environmental and hydrological factors related to a reservoir and it is useful to build a model that incorporates uncertainty. A generic mass balance model was built for a hypothetical reservoir and applied to Deer Creek Reservoir in Utah. Simulation was used to model the stochastic nature of the inflows and outflows to estimate the distribution of water volume and pollutant concentrations. The historical observations and simulated values were shown to be in good agreement. The model can therefore be used to manage the performance of the reservoir. The modeling process is not site specific, thus it can be used to model any reservoir provided that there are enough data.
Dealing with geospatial information in the semantic web
Authors: Damian O'Dea, Sean Geoghegan, Chris Ekins
Venue: Proceedings of the 2005 Australasian Ontology Workshop - Volume 58 (2005)

Geospatial information plays a critical role to the military user. Geospatial Web Services promise to make such information more readily available. Searching for the right Geospatial information, however, is a difficult task. The Semantic Web promises to facilitate this process by improving the capability to search for information by better expressing the context and meaning of the search query. Meshing the two approaches to create a Geospatial Semantic Web is an idea that is gaining prominence in both areas of Geospatial Information Science and Semantic Web Services. The Defence Science and Technology Organisation is also working to develop a system to explore and develop the Geospatial Semantic Web as a concept. We report our initial thoughts about the feasibility of such a program.
A Fast Palm Print Verification System
Authors: Michael KO Goh, Tee Connie, Andrew BJ Teoh, David CL Ngo
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Palm print is a relatively new biometric technology. Palm print textures like principle lines, wrinkles and ridges contain discriminative information which can be extracted for verification purpose. In this paper, we aim to reexamine the competitive palm code scheme proposed by [6], and introduce some improvement over the proposed method. In order to reduce the computation complexity, we adopted wavelet transform to decompose the palm print image into lower resolution. We are able to show that wavelet transform when integrated with 2D Gabor filter is able to yield verification rate of 96.70%, with an improved verification speed of less than 1 second.
An Aspect-oriented Approach to Developing a Teleworking Grid
Authors: Mark Anderson, Laeeq Ahmed
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

The field of teleworking is one which can be closely linked to the development of virtual environments. The aim of these environments is to create widely distributed applications to support the communication and collaboration of workers in a Virtual Office or Virtual Community. To that extent, there appears to be much in common with the field of Grid Computing which itself aims to support distributed resources and users in Virtual Organisations through a service-oriented architecture. In this paper we explore the similarities between these fields and the potential offered by Grid Computing. We also examine some of the potential limitations in the way that Grid services are currently developed, and propose an alternative strategy making use of Aspect Oriented Programming (AOP) to enable the creation of fully dynamic services to support the needs of an agile user base.
The state of e-Government and e-Participation in European Regions
Authors: G. Arevalo, E. Fernandez, J. Messia de la Cerda
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The aims of this work is to to assess how well prepared are European administrations to take full advantage of e-government and e-participation services, and to assess how much are currently benefiting European administrations from egovernment and e-participation services. The methodology stems from that used by United Nation [6]. Specifically, we have built indices to measure egovernment readiness (based on a measure of telecom infrastructure, education and governmental web services) and e-participation services. Simple statistical analyses aid us in extracting relevant information. For data availability reasons, the study has been undertaken at a European level. Data has been obtained from several sources including the United Nations reports, and various databases from EUROSTAT [10].
Stationary subdivision schemes reproducing polynomials
Authors: Sung Woo Choi, Byung-Gook Lee, Yeon Ju Lee, Jungho Yoon
Venue: Computer Aided Geometric Design (2006)

A new class of subdivision schemes is presented. Each scheme in this class is a quasi-interpolatory scheme with a tension parameter, which reproduces polynomials up to a certain degree. We find that these schemes extend and unify not only the well-known Deslauriers-Dubuc interpolatory schemes but the quadratic and cubic B-spline schemes. This paper analyzes their convergence, smoothness and accuracy. It is proved that the proposed schemes provide at least the same or better smoothness and accuracy than the aforementioned schemes, when all the schemes are based on the same polynomial space. We also observe with some numerical examples that, by choosing an appropriate tension parameter, our new scheme can remove undesirable artifacts which usually appear in interpolatory schemes with irregularly distributed control points.
Maximizing transmission time (MTT): a distributed MAC scheme for enhancing wireless LAN performance
Authors: Xin Gang Wang, Geyong Min, John E. Mellor, Lin Guan
Venue: Mobile Networks and Applications (2005)

Distributed contention-based Medium Access Control (MAC) protocols are the fundamental components for IEEE 802.11 type Wireless LANs (WLAN). The deficiency of these types of MAC protocols mainly comes from the idle slots used to contend the channel and from the transmission collisions due to the same backoff slot value being generated. Assigning the same transmission opportunity to various length packets also degrades the system performance. This study takes account of the above issues and presents a new MAC scheme called Maximizing Transmission Time (MTT) to enhance the wireless LAN performance. This scheme allows each station to transmit a burst of packets after winning a transmission opportunity instead of just one packet. This idea can reduce the average number of waiting slots and collision probability in each transmission cycle. Moreover, in order to ensure fairness among stations, a maximum transmission period is assigned to each station for controlling the length of the bursty transmission. An analytical performance model is derived for computing the throughput of the MTT scheme. The extensive simulation experiments reveal that the proposed method can enhance the wireless LANs performance significantly with high throughput, low delay and high degree of fairness.
Automatic Web Service Composition Using ConGolog
Authors: Minh Phan, Fumio Hattori
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Semantic Web Service, nowadays, is emerging as a solution for interoperating distributed applications on the WWW. Web service composition is the task of combining existing web services to yield a new service in order to achieve a desired goal. In this paper, we propose a formal approach to translate OWL-S web service descriptions into primitive and complex actions of ConGolog, a high level logic programming language with sensing actions for web service composition. In addition, in order to support information gathering with search in an open world initial database, we propose an extended version of the middle-ground ConGolog interpreter which relies on a theorem-prover with prime implicates.
Context Provisioning for Future Service Environments
Authors: Dana Pavel, Dirk Trossen
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Adapting services and applications to context bears the promise for increased user experience. Hence, context aware computing has been recognized as crucial for future, in particular mobile, services. The main focus of our work is on context aware systems, where context sources are distributed and span various domains. While a lot of work has been done already, many solutions fall short when it comes to the actual deployment, either due to complexity reasons or lack of widespread acceptance of the used technologies. The solution we developed aims for a platform that is highly extensible, achieves interoperability across devices and networks but is also grounded in available standards, making its widespread deployment possible almost immediately. The solution is rooted in two major design principles as well as in the usage of the event framework for the Session Initiation Protocol (SIP) to ensure this aim. In order to ground our platform to a specific use case, we also developed a proof-of-concept prototype within a mobile environment.