ppxscal/embedding_network huggingface dataset:
Riemannian Manifold Learning
Authors: Tong Lin, Hongbin Zha
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold learning (RML), based on the assumption that the input high-dimensional data lie on an intrinsically low-dimensional Riemannian manifold. The main idea is to formulate the dimensionality reduction problem as a classical problem in Riemannian geometry, i.e., how to construct coordinate charts for a given Riemannian manifold? We implement the Riemannian normal coordinate chart, which has been the most widely used in Riemannian geometry, for a set of unorganized data points. First, two input parameters (the neighborhood size k and the intrinsic dimension d) are estimated based on an efficient simplicial reconstruction of the underlying manifold. Then, the normal coordinates are computed to map the input high-dimensional data into a low-dimensional space. Experiments on synthetic data as well as real world images demonstrate that our algorithm can learn intrinsic geometric structures of the data, preserve radial geodesic distances, and yield regular embeddings.
Adapted generalized lifting schemes for scalable lossless image coding
Authors: Hocine Bekkouche, Michel Barret, Jacques Oksman
Venue: Signal Processing (2008)

Still image coding occasionally uses linear predictive coding together with multi-resolution decompositions, as may be found in several papers. Those related approaches do not take into account all the information available at the decoder in the prediction stage. In this paper, we introduce an adapted generalized lifting scheme in which the predictor is built upon two filters, leading to taking advantage of all the available information. With this structure included in a multi-resolution decomposition framework, we study two kinds of adaptation based on least-squares estimation, according to different assumptions, which are either a global or a local second order stationarity of the image. The efficiency in lossless coding of these decompositions is shown on synthetic images and their performances are compared with those of well-known codecs (S+P, JPEG-LS, JPEG2000, CALIC) on actual images. Four images' families are distinguished: natural, MRI medical, satellite and textures associated with fingerprints. On natural and medical images, the performances of our codecs do not exceed those of classical codecs. Now for satellite images and textures, they present a slightly noticeable (about 0.05-0.08bpp) coding gain compared to the others that permit a progressive coding in resolution, but with a greater coding time.
See the world with themexplorer
Authors: Adrian Popescu, Sofiane Souidi, Pierre-Alain Moëllic
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We demonstrate ThemExplorer1:, a mash-up for geographic image retrieval. The application combines: Geonames, a geographic thesaurus; TagMaps, a tool for visualizing tags on a map; PIRIA - a visual search engine, and pictures collected from Flickr and Google images. The user can query ThemExplorer using both keywords and example images.
FAN: A Scalable Flabellate P2P Overlay Supporting Multi-Dimensional Attributes
Authors: Wei Song, Ruixuan Li, Zhengding Lu, Guangcan Yu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Peer-to-peer (P2P) technology provides an efficient way for resource distribution, and sharing. While most current P2P systems only support queries over a single attribute which limits the popularity of the P2P technology. Full-blown P2P applications require the efficient resource searching supporting multi-dimensional attributes. In this paper, we propose Flabellate overlAy Network (FAN), a scalable P2P overlay supporting multi-dimensional attributes. In FAN, the peers are mapped into a d-dimensional Cartesian space. The resource management and searching are based on the peer’s second moment to the origin of coordinates. The theoretical analyses and experimental results demonstrate that FAN has high routing efficiency and low network maintenance cost over the existing structured P2P systems by storing logarithmic routing messages in peers and achieving logarithmic-hop resource searching. And many improved routing algorithms supporting multi-attribute queries can be implemented over FAN and achieve better performance.
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Authors: Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree in the resulted directed graph. The problem is called MMO, and is a restricted variant of the well-known minimum makespan problem. As previous studies, it is shown that MMO is in P for trees, weak NP-hard for planar bipartite graphs, and strong NP-hard for general graphs. There are still gaps between those graph classes. The objective of this paper is to show tight thresholds of complexity: We show that MMO is (i) in P for cactuses, (ii) weakly NP-hard for outerplanar graphs, and also (iii) strongly NP-hard for P4-bipartite graphs. The latter two are minimal superclasses of the former. Also, we show the NP-hardness for the other related graph classes, diamond-free, house-free, series-parallel, bipartite and planar.
An application of multiobjective optimization in electronic circuit design
Authors: Jan Míchal, Josef Dobeš
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Optimization is undoubtedly playing an ever more important role in CAD of electronic circuits. As the complexity of practical designs grows, so does the number of objectives to be optimized simultaneously. Even though a large number of multiobjective optimization methods have been developed in other disciplines like Operations Research, they are still generally unknown to electrical engineers and creators of CAD tools. The present paper provides a brief introduction to multiobjective optimization as such, explains two of the most frequently used methods, and discusses their advantages as well as their drawbacks. Several application guidelines and recommendations based on the authors' experience are proposed. The use of both methods is demonstrated on a practical example of a video amplifier design followed by evaluation and discussion of the obtained results.
Mathematical Modeling of Dynamic Host Responses to HBV Infection
Authors: Changjiang Long, Huan Qi, Sheng-He Huang
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Nowak's model of the human immunodeficiency virus (HIV) infection has been extensively and successfully used to simulate the interaction between HIV and cytotoxic lymphocyte (CTL)-mediated immune response. However, such model is not available for hepatitis B virus (HBV). As the enhanced recruitment of virus-specific CTLs into the liver has been an important novel concept in the pathogenesis of hepatitis B, we developed a specific mathematical model analyzing the relationship between HBV and the CTL-mediated immune response, and the indicator of the liver cell damage-alanine aminotransferase (ALT). The stability condition of the complete recovery equilibrium point at which HBV will be eliminated from the body entirely is discussed. Different set of parameters is used in the simulation and the results show that the model can interpret the wide variety of clinical manifestations of HBV infection. The model suggests that a rapid and vigorous CTL response is required for resolution of HBV infection.
Matching class diagrams: with estimated costs towards the exact solution?
Authors: Sabrina Uhrig
Venue: Proceedings of the 2008 international workshop on Comparison and versioning of software models (2008)

It is widely known that the general matching problem on graphs is a non-polynomial optimization problem. Thus all differencing algorithms we know of use heuristics to identify corresponding elements (e.g.[2],[6]) apart from those that rely on unique identifiers (e.g.[5],[3]). We wonder if an exact algorithm can be designed which computes a minimal cost matching between the elements of the class diagrams and which, although it shows a non-polynomial worst case behaviour, delivers its solution much faster in most cases. In this position paper we describe our ongoing work, the idea of an algorithm which works with estimated transformation costs in order to reduce the computation costs. The algorithm has not been implemented yet; it has only been manually tested on a few examples.
Evaluation of Multi-Channel Flooding for Inter-Vehicle Communication
Authors: Eiji Takimoto, Yoshihisa Kondo, Satoko Itaya, Ryutaro Suzuki, Sadao Obana
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Flooding protocols are efficient for communications on in stable network such as inter-vehicle communications because there is no necessity of complex procedures to build routes for data forwarding. In this paper, we propose a multi-channel flooding protocol using multi-interface WLAN terminals for improving robustness of communications. In simulation test, we show that packet loss rate can be reduced with parallel-redundant packet transmission using multi-channel, and transmission delay can also be reduced compared to serial-redundant packet transmission using single-channel. In experimental test, we confirm that the multi-channel flooding is also effective in real environment.
Silver Bullet Talks with Ed Amoroso
Authors: Gary McGraw
Venue: IEEE Security and Privacy (2008)

Gary McGraw interviews Ed Amoroso, AT&T's chief information security officer. Their conversation ranged widely, from system design to privacy.
Agent Based Architecture for Secure Access from Multiple Hospitals
Authors: Sun K. Yoo, Jun Choe, Do Yoon Kim
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Internet-based health data exchange, which is particularly useful for the management of cooperative health care and life time heath care records, requires the use of a common format to allow access to heterogeneous reservoirs scattered at different hospitals, as well as protection from intrusion and piracy. However, the unified management of multiple reservoirs is difficult to achieve, due to the different policies operated by different hospitals and the heterogeneous format of their information reservoirs. In this paper, we propose a multi-agent based secure architecture which can be used to retrieve healthcare information in a common format through the internet from multiple heterogeneous reservoirs. The proposed system is organized in the form of a 4-tier architecture, consisting of the client application, access control central agent, local access control agent and hospital information system, involving distributed processing with multiple matching agents connected to heterogeneous reservoirs and one flexible master controller to unify the different formats and different hospital policies, thus providing a secure common format and simplifying the problem of reservoir maintenance, including the addition, removal and modification of reservoirs. The combination of XML and RABC provides an efficient means of reservoir management, allowing for access control, a common format for information exchange, device independent display for diverse display resolutions of terminal devices, user identification for authentication, digital signature for data integrity, and selective encryption for protecting confidential health information.
Transient analysis of two-dimensional rectangular fin with various surface heat effects
Authors: Kuang Yuan Kung
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Analytical solutions to the transient heat conduction for a two dimensional rectangular fin with general boundary conditions is obtained by the principle of separation variables. In the analysis, the partial differential equation is directly transformed into ordinary differential equation. The closed form transient temperature distribution and the heat transfer rate are generalized for a linear combination of the product of Fourier series and exponential function.
Mobile Service Bundles: The Example of Navigation Services
Authors: Harry Bouwman, Timber Haaker, Henny de Vos
Venue: Electronic Markets (2007)

Mobile service providers can use service bundling to offer attractive services to customers. Customers may find bundles convenient compared to single services and there may be a price discount involved. This paper examines what kind of service bundle may be attractive to users in the car navigation system market. We hypothesize that customers are more likely to acquire enhanced services than supplementary services and that bundle price has a positive effect on the intent to purchase. We used a conjoint analysis to assess which combination of services and price level is the most attractive to users. It turned out that enhanced services, i.e. services that reinforce the functionality of the core navigation service, are more relevant than supplementary services. However, the relative importance of price discounts is almost similar to the importance of bundle composition, implying that a customer may appreciate a careful composition of a bundle above a simple price discount.
New Brownian bridge construction in quasi-Monte Carlo methods for computational finance
Authors: Junyi Lin, Xiaoqun Wang
Venue: Journal of Complexity (2008)

Quasi-Monte Carlo (QMC) methods have been playing an important role for high-dimensional problems in computational finance. Several techniques, such as the Brownian bridge (BB) and the principal component analysis, are often used in QMC as possible ways to improve the performance of QMC. This paper proposes a new BB construction, which enjoys some interesting properties that appear useful in QMC methods. The basic idea is to choose the new step of a Brownian path in a certain criterion such that it maximizes the variance explained by the new variable while holding all previously chosen steps fixed. It turns out that using this new construction, the first few variables are more ''important'' (in the sense of explained variance) than those in the ordinary BB construction, while the cost of the generation is still linear in dimension. We present empirical studies of the proposed algorithm for pricing high-dimensional Asian options and American options, and demonstrate the usefulness of the new BB.
Precision-at-ten considered redundant
Authors: William Webber, Alistair Moffat, Justin Zobel, Tetsuya Sakai
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Information retrieval systems are compared using evaluation metrics, with researchers commonly reporting results for simple metrics such as precision-at-10 or reciprocal rank together with more complex ones such as average precision or discounted cumulative gain. In this paper, we demonstrate that complex metrics are as good as or better than simple metrics at predicting the performance of the simple metrics on other topics. Therefore, reporting of results from simple metrics alongside complex ones is redundant.
Two New Push-Pull Balanced Data Dissemination Algorithms for Any-Type Queries in Large-Scale Wireless Sensor Networks
Authors: Zi-Jin Tao, Zheng-Hu Gong, Zhen-Zheng OuYang, Jin-Yi Xu
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

How to get a better balance between the push and pull of the event data is the common goal of the various data dissemination algorithms in Wireless Sensor Networks (WSNs). And the characteristics of the Any-type Query in WSNs is different from the All-type query. At this basis, the load of the system hotspot should be further decreased and the number of the event data replicas should be reduced. In the paper, two well-known typical structured and unstructured data dissemination algorithms (DCS and CN) are analyzed and their advantages and disadvantages are figured out. At the same time, by combining the push-pull strategies of the two algorithms, two new data dissemination algorithms are proposed based on the sequential DCS and CN push-pull strategies for the ANY-type queries in the different application situation in WSNs. The two new algorithms are Sequential-Dcs-Cn1 (SDC1) and Sequential -Dcs-Cn2 (SDC2). They have resolved the problems of the high load of the hotspot and the large number of the event data replicas and the low energy efficiency of queries on the premise that ensuring the balance between the push and pull. The theoretical analyses and simulations show that the performance of SDC1 is much better than that of the existing algorithms, and that of SDC2 is close to DCS, but is more fit for the case of unevenly distributed events than SDC1. So they are much more appropriate for the WSNs which are large-scale and have large volume of data to be dealt with, and they are two energy-efficient data dissemination algorithms
Distinguishing two graph-encoded manifolds of Lins
Authors: John F. P. Hudson
Venue: Journal of Graph Theory (1999)

Lins has conjectured that the two 3-manifolds that he refers to as H 3dod and &Hmacr; 3dod are not homeomorphic. He suggests that their fundamental groups may be the same, but that they may be distinguishable by their quantum invariants. This article describes the proof that they, in fact, have different fundamental groups. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 298&ndash;302, 1999
(De)randomized construction of small sample spaces in /spl Nscr//spl Cscr/
Authors: D. R. Karger
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

D. Koller and N. Megiddo (1993) introduced the paradigm of constructing compact distributions that satisfy a given set of constraints, and showed how it can be used to efficiently derandomize certain types of algorithm. In this paper, we significantly extend their results in two ways. First, we show how their approach can be applied to deal with more general expectation constraints. More importantly, we provide the first parallel (/spl Nscr//spl Cscr/) algorithm for constructing a compact distribution that satisfies the constraints up to a small relative error. This algorithm deals with constraints over any event that can be verified by finite automata, including all independence constraints as well as constraints over events relating to the parity or sum of a certain set of variables. Our construction relies on a new and independently interesting parallel algorithm for converting a solution to a linear system into an almost basic approximate solution to the same system. We use these techniques in the first /spl Nscr//spl Cscr/ derandomization of an algorithm for constructing large independent sets in d-uniform hypergraphs for arbitrary d. We also show how the linear programming perspective suggests new proof techniques which might be useful in general probabilistic analysis.
The Strip Cipher-The Spanish Official Method
Authors: José Ramón Soler Fuensanta, Francisco Javier López-Brea Espiau
Venue: Cryptologia (2007)

In this article, we present a study of the manual method of ciphering called "strip cipher." This was the official method of ciphering by all Spanish Ministries in the late 19th century, and the most commonly used method in the Spanish Civil War (1936-1939).
Learning topology of a labeled data set with the supervised generative Gaussian graph
Authors: Pierre Gaillard, Michaël Aupetit, Gérard Govaert
Venue: Neurocomputing (2008)

Extracting the topology of a set of a labeled data is expected to provide important information in order to analyze the data or to design a better decision system. In this work, we propose to extend the generative Gaussian graph to supervised learning in order to extract the topology of labeled data sets. The graph obtained learns the intra-class and inter-class connectedness and also the manifold-overlapping of the different classes. We propose a way to vizualize these topological features. We apply it to analyze the well-known Iris database and the three-phase pipe flow database.
A New Approach Combined Fuzzy Clustering and Bayesian Networks for Modeling Gene Regulatory Networks
Authors: Fei Wang, De Pan, Jianhua Ding
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The appearance of microarray technologies makes itpossible to simultaneously monitor the expression levelsfor tens of thousands of genes. Bayesian Network (BN)is an important approach for predicting gene regulatorynetworks from expression data. However, two fundamentalproblems greatly reduce the effectiveness of current BNmethods. The first problem is much less samples than genes,it makes that to find a ”best” network is very difficult.The second is the excessive computational time, the searchspace of possible Bayesian network is very large becausegenes are numerous. In this paper, we introduce a newmethod to learn Bayesian networks which combines fuzzyclustering algorithm to reduce the search space. From theview of systems biology, modularity and hierarchy are keyfeatures of biological networks. This allows us to gainglobal network by assembling local components. A localcomponent is composed of genes with same function. Thosegenes may have same or very similar expression pattern.Besides, those inter-related genes may be bridge of differentfunctional modules. Consequently, in a process of learningof local networks, the gap between the number of samplesand genes is shortened, and the search space is reduced.Ourapproach is evaluated using artificial data and expressiondata measured during the yeast cell cycle. Results demonstratethat this approach can predict regulatory networkswith significantly improved accuracy and reduced computationaltime compared with existing BN approaches.
Wavelet support vector machine for induction machine fault diagnosis based on transient current signal
Authors: Achmad Widodo, Bo-Suk Yang
Venue: Expert Systems with Applications: An International Journal (2008)

This paper presents establishing intelligent system for faults detection and classification of induction motor using wavelet support vector machine (W-SVM). Support vector machines (SVM) is well known as intelligent classifier with strong generalization ability. Application of nonlinear SVM using kernel function is widely used for multi-class classification procedure. In this paper, building kernel function using wavelet will be introduced and applied for SVM multi-class classifier. Moreover, the feature vectors for training classification routine are obtained from transient current signal that preprocessed by discrete wavelet transform. In this work, principal component analysis (PCA) and kernel PCA are performed to reduce the dimension of features and to extract the useful features for classification process. Hence, a relatively new intelligent faults detection and classification method called W-SVM is established. This method is used to induction motor for faults classification based on transient current signal. The results show that the performance of classification has high accuracy based on experimental work.