ppxscal/embedding_network huggingface dataset:
Vector least-squares solutions for coupled singular matrix equations
Authors: Adem Kılıçman, Zeyad Abdel Aziz Al Zhour
Venue: Journal of Computational and Applied Mathematics (2007)

The weighted least-squares solutions of coupled singular matrix equations are too difficult to obtain by applying matrices decomposition. In this paper, a family of algorithms are applied to solve these problems based on the Kronecker structures. Subsequently, we construct a computationally efficient solutions of coupled restricted singular matrix equations. Furthermore, the need to compute the weighted Drazin and weighted Moore-Penrose inverses; and the use of Tian's work and Lev-Ari's results are due to appearance in the solutions of these problems. The several special cases of these problems are also considered which includes the well-known coupled Sylvester matrix equations. Finally, we recover the iterative methods to the weighted case in order to obtain the minimum D-norm G-vector least-squares solutions for the coupled Sylvester matrix equations and the results lead to the least-squares solutions and invertible solutions, as a special case.
Dealing with Missing Values in a Probabilistic Decision Tree during Classification
Authors: Lamis Hawarah, Ana Simonet, Michel Simonet
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

This paper deals with the problem of missing values in decision trees during classification. Our approach is derived from the ordered attribute trees method, proposed by Lobo and Numao in 2000, which builds a decision tree for each attribute and uses these trees to fill the missing attribute values. Our method takes into account the dependence between attributes by using Mutual Information. The result of the classification process is a probability distribution instead of a single class. In this paper, we present tests performed on several databases using our approach and Quinlan's method. We also measure the quality of our classification results. Finally, we discuss some perspectives.
Embedded optical flow motion compensation and finite state hierarchical vector quantization
Authors: K. Mukherjee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We propose a video coding and delivery scheme which is geared towards low bit-rate and real-time performance requirements. We use a finite state wavelet-based hierarchical lookup vector quantization (FSWHVQ) scheme, which embeds the optical flow calculations in table-lookups. This video coding scheme is both fast (table-lookups) and accurate (dense motion field), and avoids the blocking artifacts and poor prediction which plagues block coding schemes at low bit rates. For restricted image compression/transmission scenarios like teleconferencing, for which a good training set may be available, the FSWHVQ scheme may be viewed as storing an internal representation in its lookup tables, a valid and complete model of the problem domain.
Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET)
Authors: Sandhya Khurana, Neelima Gupta, Nagender Aneja
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Lack of infrastructure, central controlling authority and the properties of wireless links make Mobile Ad hoc Networks (MANETs) vulnerable to attacks. Several protocols have been proposed to make the routing protocols handle attacks in MANETs. These protocols detect the misbehaving nodes and re-route the data packets around them, mostly along the shortest such path. However, no single protocol handles all the attacks. A variant of the problem for routing around misbehaving nodes in ad hoc networks can be stated as: Given a set of nodes under the danger of attack, one wishes to determine the path which is farthest from the endangered nodes. The problem does not address the problem of handling attack directly but tries to minimize the impact of attack. The problem also finds its applications in sensor networks. In this paper, we present a simple and efficient algorithm to solve the problem. The algorithm converges in O(d^{2}) time where d is the diameter of the network.
Asynchronous notifications among distributed objects
Authors: Yeturu Aahlad, Bruce E. Martin, Mod Marathe, Chung Le
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

Distributed object systems typically support synchronous requests from one distributed object to another. Often, a more decoupled style of communication among distributed objects is appropriate. We describe an object service called event channel that decouples distributed object communication. We describe SunSoft's implementation of the event channel and illustrate its use in a stock trading application.
A new flexible architecture for variable length DCT targeting shape-adaptive transform
Authors: T. Le
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Shape-assisted block-based texture coding methodologies such as the shape-adaptive DCT raise the need for an architecture which can perform efficiently the transform of variable length N. This paper presents a 1D DCT architecture satisfying the given requirement in terms of scalability and modularity for 2/spl les/N/spl les/8. The architecture employs a canonical-signed-digit serial multiplication to reduce hardware resources and requires only one multiplier to perform the final scaling. A proposed algorithm searching for an optimal assignment of cosine factors leads to a resource saving of about 12% for the multiplication blocks if carry-ripple-adders are assumed to be used. Different area and speed requirements are possible since only feed-forward paths are involved and easily pipelined. The architecture represents a trade-off between time-recursive, fully modular but operation non-efficient structure and multiplication efficient but irregular and fixed-length implementation.
Hybrid Verification of Protocol Bridges
Authors: Praveen Tiwari, Raj S. Mitra
Venue: IEEE Design Test (2007)

It is becoming increasingly more evident that simulation cannot provide full verification for today's complex designs. Formal verification is emerging as an alternative technique to simulation that promises to guarantee complete verification. However, because of its inability to handle all classes and sizes of designs, this technology is also incomplete. The solution is to combine the two complementary techniques, using their respective strengths. The authors of this article have developed such a technique for hybrid verification. They illustrate its application through two case studies in protocol bridge verification. In both designs, the hybrid technique was able to discover bugs that simulation and formal verification had failed to find individually.
An Integrative view of the concept of Digital Ecosystem
Authors: Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In the literature we fid two broad definitions of the concept of Digital Ecosystem, hence leading to confusion and ambiguity with regards to its semantic interpretation. In this paper we make use of ontology, which is a well-known tool for knowledge sharing, in order to present an integrative view of the concept of Digital Ecosystem. We implement the ontology by using Protégé-owl.
A Comparison of Personal Name Matching: Techniques and Practical Issues
Authors: Peter Christen
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Finding and matching personal names is at the core of an increasing number of applications: from text and Web mining, search engines, to information extraction, dedupli- cation and data linkage systems. Variations and errors in names make exact string matching problematic, and ap- proximate matching techniques have to be applied. When compared to general text, however, personal names have different characteristics that need to be considered. In this paper we discuss the characteristics of personal names and present potential sources of variations and errors. We then overview a comprehensive number of commonly used, as well as some recently developed name matching techniques. Experimental comparisons using four large name data sets indicate that there is no clear best matching technique.
Specification of Realizable Service Conversations Using Collaboration Diagrams
Authors: Tevfik Bultan, Xiang Fu
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Specification, modeling and analysis of interactions among peers that communicate via messages are becoming increasingly important due to the emergence of service oriented computing. Collaboration diagrams provide a convenient visual model for specifying such interactions. An interaction among a set of peers can be characterized as a conversation, the global sequence of messages exchanged among the peers, listed in the order they are sent. A collaboration diagram can be used to specify the set of allowable conversations among the peers participating to a composite web service. Specification of interactions from such a global perspective leads to the realizability problem: Is it possible to construct a set of peers that generate exactly the specified conversations? In this paper we investigate the realizability of conversations specified by collaboration diagrams. We formalize the realizability problem by modeling peers as concurrently executing finite state machines and we give sufficient realizability conditions for a class of collaboration diagrams.
Deciding XPath containment with MSO
Authors: Pierre Genevès, Nabil Layaïda
Venue: Data Knowledge Engineering (2007)

XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath fragment covers most of the language features used in practice. Specifically, we show how XPath queries can be translated into equivalent formulas in monadic second-order logic. Using this translation, we construct an optimized logical formulation of the containment problem, which is decided using tree automata. When the containment relation does not hold between two XPath expressions, a counter-example XML tree is generated. We provide practical experiments that illustrate the efficiency of the decision procedure for realistic scenarios.
Admission Control for Non-preprovisioned Service Flow in Wireless Metropolitan Area Networks
Authors: Liping Wang, Fuqiang Liu, Yusheng Ji, Nararat Ruangchaijatupon
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Improving the admission control process in wireless metropolitan area networks (WMAN) based on the IEEE 802.16e standard can improve the QoS. Because IEEE 802.16e supports five classes of service as well as mobility, an admission control policy for non-preprovisioned service flow is proposed. This policy is compatible with the QoS parameters for each service class defined in the standard. As improvements, the guard channel scheme is used to give handover connections higher priority and a novel proportional bandwidth-borrowing scheme is added to prioritize the different service classes. The simulation results show the proposed admission control policy maximizes the bandwidth utilization and the use of the two schemes provides a reasonable priority order of new originated connections and handover connections of different service classes. The connection-blocking and connection-dropping probabilities were reduced to the extent that they can be ignored.
Bandwidth Constrained Routing Algorithm for MPLS Traffic Engineering
Authors: Afef Kotti, Rached Hamza, Kamel Bouleimen
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Much of the researches in network resource management have been devoted to providing bandwidth guarantees and preventing network congestion. However, most of them rely on load balancing to avoid network bottlenecks, tailoring on the other hand longer and costly paths. They ignore that longer paths can badly affect on both quality of routing, and usage efficiency of their network infrastructure. This paper presents a new Bandwidth Constrained Routing Algorithm (BCRA) for MPLS traffic engineering. The approach is an improvement of the well-known bandwidth constrained routing algorithms since it compromises between network load balancing, reducing path length, and minimizing path cost. Our proposed TE (Traffic Engineering) algorithm has been integrated in a toolbox for traffic engineering methods to evaluate its performance against some existing ones. Simulation results show that it outperforms the most recent algorithms under a wide range of workload, topology and system parameters. Simulations also show that our proposed algorithm gives good results in reducing rejected requests.
From Abstract Painting to Information Visualization
Authors: Kang Zhang
Venue: IEEE Computer Graphics and Applications (2007)

This article studies some of the theories used in abstract painting and their existing and potential applications to information visualization. The authors relate the three dimensions of painting--form, color, and texture--various visual cognition principles, and finally aesthetic compositions used in abstract painting for effective information visualization.
Rotational and translational motion estimation and selective reconstruction in digital image sequences
Authors: Mingqi Kong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper addresses the problem of motion estimation and selective reconstruction of objects undergoing rotational motion composed with translational motion. The goal is to derive the motion parameters belonging to the multiple moving objects, i.e. the angular velocities and the translational velocities and identify their locations at each time instance by selective reconstruction. These parameters and locations can be used for various purpose such as trajectory tracking, focus/shift attention of robot, etc. The innovative algorithm we have developed is based on angular velocity and translational velocity tuned 2D+T filters. One of the important facts about the algorithm is that it is effective for both spinning motion and orbiting motion, and thus unifies the treatment of the two kinds of rotational motion. Also by tuning of the filters, we can derive the translational motion parameters and the rotational motion parameters separately, which has the advantage of making motion estimation faster and more robust compared to estimating all of them simultaneously. The algorithm is simulated using synthesized image sequences corrupted by noise and is shown to be accurate and robust against noise and occlusion.
Using content-addressable networks for load balancing in desktop grids
Authors: Jik-Soo Kim, Peter Keleher, Michael Marsh, Bobby Bhattacharjee, Alan Sussman
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Desktop grids have evolved to combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently matching incoming jobs to available system resources and achieving good load balance in a fully decentralized and heterogeneous computing environment is a challenging problem. In this paper, we extend our prior work with a new decentralized algorithm for maintaining approximate global load information, and a job pushing mechanism that uses the global information to push jobs towards underutilized portions of the system. The resulting system more effectively balances load and improves overall system throughput. Through a comparative analysis of experimental results across different system configurations and job profiles, performed via simulation, we show that our system can reliably execute Grid applications on a distributed set of resources both with low cost and with good load balance.
Outliers Detection in Multivariate Time Series by Independent Component Analysis
Authors: Roberto Baragona, Francesco Battaglia
Venue: Neural Computation (2007)

In multivariate time series, outlying data may be often observed that do not fit the common pattern. Occurrences of outliers are unpredictable events that may severely distort the analysis of the multivariate time series. For instance, model building, seasonality assessment, and forecasting may be seriously affected by undetected outliers. The structure dependence of the multivariate time series gives rise to the well-known smearing and masking phenomena that prevent using most outliers' identification techniques. It may be noticed, however, that a convenient way for representing multiple outliers consists of superimposing a deterministic disturbance to a gaussian multivariate time series. Then outliers may be modeled as nongaussian time series components. Independent component analysis is a recently developed tool that is likely to be able to extract possible outlier patterns. In practice, independent component analysis may be used to analyze multivariate observable time series and separate regular and outlying unobservable components. In the factor models framework too, it is shown that independent component analysis is a useful tool for detection of outliers in multivariate time series. Some algorithms that perform independent component analysis are compared. It has been found that all algorithms are effective in detecting various types of outliers, such as patches, level shifts, and isolated outliers, even at the beginning or the end of the stretch of observations. Also, there is no appreciable difference in the ability of different algorithms to display the outlying observations pattern.
Modularity and Temporal Reasoning: A Logic Programming Approach
Authors: Vitor Nogueira, Salvador Abreu
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Albeit temporal reasoning and modularity are very prolific fields of research in Logic Programming (LP), we find few examples of their integration. In this paper we propose the addition of temporal annotations to a modular extension of LP. Moreover, we also provide a sketch for a compiler, allowing this way for the development of applications based on such language.
Worst-case optimal redistribution of VCG payments
Authors: Mingyu Guo, Vincent Conitzer
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

For allocation problems with one or more items, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, strategy-proof, individually rational, and does not incur a deficit. However, the VCG mechanism is not (strongly) budget balanced: generally, the agents' payments will sum to more than 0. If there is an auctioneer who is selling the items, this may be desirable, because the surplus payment corresponds to revenue for the auctioneer. However, if the items do not have an owner and the agents are merely interested in allocating the items efficiently among themselves, any surplus payment is undesirable, because it will have to flow out of the system of agents. In 2006, Cavallo [3] proposed a mechanism that redistributes some of the VCG payment back to the agents, while maintaining efficiency, strategy-proofness, individual rationality, and the non-deficit property. In this paper, we extend this result in a restricted setting. We study allocation settings where there are multiple indistinguishable units of a single good, and agents have unit demand. (For this specific setting, Cavallo's mechanism coincides with a mechanism proposed by Bailey in 1997 [2].) Here we propose a family of mechanisms that redistribute some of the VCG payment back to the agents. All mechanisms in the family are efficient, strategy-proof, individually rational, and never incur a deficit. The family includes the Bailey-Cavallo mechanism as a special case. We then provide an optimization model for finding the optimal mechanism--that is, the mechanism that maximizes redistribution in the worst case--inside the family, and show how to cast this model as a linear program. We give both numerical and analytical solutions of this linear program, and the (unique) resulting mechanism shows significant improvement over the Bailey-Cavallo mechanism (in the worst case). Finally, we prove that the obtained mechanism is optimal among all anonymous deterministic mechanisms that satisfy the above properties.
Methods of Evaluation and Extraction of Membership Functions--Review with a New Approach
Authors: Dwijesh Dutta Majumder, Rupak Bhattacharyya, Supratim Mukherjee
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In Fuzzy mathematics, evaluation of membership function is still a problem, as the methods for this purpose do not hold well in all aspects. The purpose of this work is to assemble and to draw an overview of them. In addition, this work consists of a new approach, which may lead to a new way. The approach is from numerical point of view with the help of statistics. There are two methods, namely (i) Modified Newton's divided difference Method and (ii) Modified Lagrange's interpolation Method.
Negative weights make adversaries stronger
Authors: Peter Hoyer, Troy Lee, Robert Spalek
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has application to classical complexity in formula size lower bounds, and is versatile with equivalent formulations interms of weight schemes, eigen values, and Kolmogorov complexity. All these formulations rely on the principlethat if an algorithm successfully computes a function then, in particular, itis able to distinguish between inputs which map to different values. We present a stronger version of the adversary method which goes beyond this principle to make explicit use of the stronger condition that the algorithm actually computes the function. This new method, which we call ADV+-, has all the advantages ofthe old: it is a lower bound on bounded-error quantum query complexity, its square is a lower bound on formula size, and it behaves well with respect tofunction composition. Moreover ADV+- is always at least as large as the adversary method ADV, and we show an example of a monotone function forwhich ADV+-(f)=Omega(ADV(f)1.098). We also give examples showing that ADV+- does not face limitations of ADV like the certificate complexity barrier and the property testing barrier.
A Novel Integrated Approach Using Dynamic Thresholding and Edge Detection (IDTED) for Automatic Detection of Exudates in Digital Fundus Retinal Images
Authors: Anantha Vidya Sagar, S. Balasubramaniam, V. Chandrasekaran
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The Automatic Screening of patients for early detection and prevention of Diabetic Retinopathy (DR) has been the prime focus in recent times due to the large ratio of patients to medical ophthalmologists. Exudate detection is one of the main steps of DR. A reliable method for detection of exudates is presented in this paper. Optic disc (OD) is localized by the Principle Component Analysis (PCA). Active contour based approach is used for accurate segmentation of boundary of OD. In our IDTED method, pre-processing techniques such as histogram specification and local contrast enhancement are integrated with dynamic thresholding (DT) and edge detection for exudate detection. The IDTED algorithm, when tested on 25 digital fundus retinal images and compared with the performance of a human grader, has shown a mean sensitivity of 99% and a mean predictivity of 93%.