ppxscal/embedding_network huggingface dataset:
Combining KPCA with LSSVM for the Mooney-Viscosity Forecasting
Authors: Mei Liu, Daoping Huang, Zonghai Sun, Zhengshi Chen
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Least Squares Support Vector Machine (LSSVM) has been used in soft sensor modeling in recent years. In developing a successful model based on LSSVM, the first important step is feature extraction. Principal Components Analysis (PCA) is a usual method for linear feature extraction and kernel PCA (KPCA) is a nonlinear PCA developed by using the kernel method. KPCA can efficiently extract the nonlinear relationship between original inputs. This paper proposes to combine KPCA with LSSVM to forecast the Mooney-Viscosity of Styrene Butadiene Rubber (SBR). KPCA is firstly applied for feature extraction. Then LSSVM is applied to proceed regression modeling. The experiment results show that KPCA-LSSVM features high learning speed, good approximation and generalization ability compared with SVM and PCA-SVM. The root mean square errors of the Mooney-viscosity in the KPCA-LSSVM, PCA-LSSVM and LSSVM are 0.0145, 0.0377 and 0.1775 respectively. LSSVM with KPCA for feature extraction has best performance. It may be used to efficiently guide production.
Optimal Exchange Rate Policy Under Unknown Pass-through and Learning With Applications to Korea
Authors: David Hudgins, C. W. Chan
Venue: Computational Economics (2008)

The purpose of this analysis is to explore optimal monetary and exchange rate policy in continuous time when there is uncertainty in the exchange rate pass-through mechanism. Selecting official reserves as an operating target, optimal feedback control rules are derived using MATLAB Simulink under a stochastic linear-quadratic Gaussian specification with a Kalman observer approach to learning the differing pass-through expectations. The model is estimated using discrete time Korean data, which is transformed into the continuous time model where simulations are applied to the Korean economy.
Infinite Runs in Weighted Timed Automata with Energy Constraints
Authors: Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Jiří Srba
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource (e.g. energy). We ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (e.g. remains between 0 and some given upper-bound). We also consider a game version of the above, where certain transitions may be uncontrollable.
Hangeul Learning System
Authors: Jae Won Jung, Jong Weon Lee
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This system is not only for a foreigner but also for everyone in Korea who doesn't know Hangeul (Korean language). It is difficult to study Hangeul themselves without any helper. This paper presents the AR based system that helps people to learn basic Hangeul letters and pronunciations in their home without any helper by applying the characteristics of consonant and vowel. We also suggest the Word Studying Methods using the proposed system. At this time, it is developed based on the pattern matching function of ARToolKit, we plan to improve the system by applying the character recognition function.
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
Authors: Lev Reyzin, Nikhil Srivastava
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, shortest path), but we focus mainly on edge counting queries. We give an algorithm for learning graph partitions using O(n logn) edge counting queries. We introduce a problem that has not been considered: verifying graphs with edge counting queries, and give a randomized algorithm with error ¿ for graph verification using O(log(1/¿)) edge counting queries. We examine the current state of the art and add some original results for edge detection and shortest path queries to give a more complete picture of the relative power of these queries to learn various graph classes. Finally, we relate our work to Freivalds' `fingerprinting technique' --- a probabilistic method for verifying that two matrices are equal by multiplying them by random vectors.
Tangent Circular Arc Smooth SVM (TCA-SSVM) Research
Authors: Yan-Feng Fan, De-Xian Zhang, Hua-Can He
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Spatial hypersurface plays a very important role in the classification problem. In SVM, classification hypersurface is emphasized because of the direct induction of the support vectors, so the hypersurface reflecting the relation between categorical attribute and condition attributes acquired by SVM promotes the classification effect. In traditional SVM solution algorithms, objective function is a strictly convex unconstrained optimization problem, but is not differentiable due to x+, which precludes the most used optimization algorithms. This paper presents a new TCA-Smooth technology which used a segment of circular arc tangent to the given plus function x+ to approximate the original un-differentiable model, thus the traditional SVM model is converted into a differentiable model. The proposed approach is experimentally evaluated in three datasets that are benchmarks for data mining applications and in a real-world dataset, leading to interesting results.
Recursion Schemata for NCk
Authors: Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

We give a recursion-theoretic characterization of the complexity classes NC k for k ¿ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computations (mutual in place recursion). This is, to our knowledge, the first exact characterization of NC k by function algebra over infinite domains in implicit complexity.
A Novel Intrusion-Tolerant Approach for Internet Access
Authors: Yan Wen, Jinjing Zhao, Huaimin Wang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Isolation execution is an effective mechanism that has been applied to protect the computers against the unknown attacks from the Internet. However, previous isolation solutions cannot achieve both the OS isolation and the reusage of existing software environment. In this paper, we present a new isolated execution approach called Aquarius for accessing the Internet safely. Besides fulfilling the OS isolation based on a hosted virtual machine (VM), Aquarius provides other two key features. One is that it can reuse the preinstalled software of the host OS. Another is that Aquarius faithfully reproduces the behavior of the Internet-accessing applications via providing transparent Internet accesses, as if they were directly connected to the Internet. Functional evaluation results illustrate the effectiveness of our approach, and performance evaluation results show that compute-intensive benchmarks run essentially at native speed on Aquarius VM, reaching 95.82-99.59% while network transmitting achieves 87.94% of the native network speed.
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
Authors: Guilhem Castagnos
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes, among others, the Paillier cryptosystem, and then, another scheme, built from a deterministic trapdoor function. Both schemes are proved semantically secure against chosen plaintext attacks in the standard security model and modify versions can be proved secure against adaptive chosen ciphertext attacks.By implementing these constructions with quotients of Z, elliptic curves and quadratic fields quotients we get some cryptosystems yet described in the past few years and provide variants that achieve higher levels of security than the original schemes. In particular, using quadratic fields quotients, we show that it is possible to build a new scheme secure against adaptive chosen ciphertext attacks in the standard security model.
Neighbourhood Discriminant Locally Linear Embedding in Face Recognition
Authors: Pang Ying Han, Andrew Teoh Beng Jin, Wong Eng Kiong
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Face images are often very high-dimensional and complex. However, the actual underlying structure can be characterized by a small number of features. Hence, locally linear embedding (LLE) is proposed as a nonlinear dimension reduction technique to deal this problem. LLE learns the intrinsic manifold embedded in the high dimensional ambient space by minimizing the global reconstruction error of the neighbourhood in the data set. LLE is popular in analyzing face images with different poses, illuminations or facial expressions for one subject class. It is developed based on the assumption that data that is distributed on a single manifold is having the same class label; hence the process of neighborhood selection is non class-specific. However, this is inappropriate to face recognition as face recognition learns in multiple manifolds where each representing data on one specific class. Here, we modify the original LLE by embedding prior class information in the process of neighborhood selection. Experimental results demonstrate that our technique consistently outperforms the original LLE in ORL, PIE and FRGC databases.
XML Filtering Using Dynamic Hierarchical Clustering of User Profiles
Authors: Panagiotis Antonellis, Christos Makris
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Information filtering systems constitute a critical component in modern information seeking applications. As the number of users grows and the information available becomes even bigger it is crucial to employ scalable and efficient representation and filtering techniques. In this paper we propose an innovative XML filtering system that utilizes clustering of user profiles in order to reduce the filtering space and achieves sub-linear filtering time. The proposed system employs a unique sequence representation for user profiles and XML documents based on the depth-first traversal of the XML tree and an appropriate distance metric in order to compare and cluster the user profiles and filter the incoming XML documents. Experimental results depict that the proposed system outperforms the previous approaches in XML filtering and achieves sub-linear filtering time.
Data-Driven Dialogue for Interactive Question Answering
Authors: Roberto Basili, Diego Cao, Cristina Giannone, Paolo Marocco
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper, a light framework for dialogue based interactive question answering is presented. The resulting architecture is called REQUIRE (Robust Empirical QUestion answering for Intelligent Retrieval), and represents a flexible and adaptive platform for domain specific dialogue. REQUIRE characterizes as a domain-driven dialogue system, whose aim is to support the specific tasks evoked by interactive question answering scenarios. Among its benefits it should be mentioned its modularity and portability across different domains, its robustness through adaptive models of speech act recognition and planning and its adherence of knowledge representation standard. The framework will be exemplified through its application within a sexual health information service tailored to young people.
Redefining the DCT-based feature for scene text detection: Analysis and comparison of spatial frequency-based features
Authors: Hideaki Goto
Venue: International Journal on Document Analysis and Recognition (2008)

We analyze some spatial frequency-based features used for text region detection in natural scene images, and redefine the DCT-based feature. We employ Fisher&#x2019;s discriminant analysis to improve the DCT-based feature and to achieve higher accuracy. An unsupervised thresholding method for discriminating text and non-text regions is introduced and tested as well. Experimental results show that a wide high frequency band, covering some lower-middle frequency components, is generally more suitable for scene text detection despite the original definition of the DCT-based feature.
A Taxonomy of QoS-Aware, Adaptive Event-Dissemination Middleware
Authors: Shruti P. Mahambre, Madhu Kumar S.D., Umesh Bellur
Venue: IEEE Internet Computing (2007)

Event broker networks--scalable versions of the publish-subscribe paradigm--act as peer-to-peer overlays on broker nodes. Various frameworks support different overlay topologies and routing schemes for event dissemination, but attention is now turning to the nonfunctional attributes (such as quality of service) of such systems. Although many research efforts are starting to address the need for adaptation and QoS, no taxonomies or comprehensive surveys of adaptive middleware, which provide support for service guarantees, exist yet. To tackle this knowledge gap, the authors examine existing event-based middleware efforts, focusing on quality of service and adaptation.
A Study on Logistics Mode of Procurement in China Air-Conditioner Manufacturers Based on Third-Party Logistics
Authors: Changzheng Zheng, Zhixue Liu, Xiaojing Wang, Chunguang Quan
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Analyzing the air-conditioner manufacturers' size, production mode, procurement features, actual procurement logistics mode and third-party logistics provider's logistics operational capability in China, this paper puts forward and analyzes three logistics mode of procurement based on third-party logistics from the perspective of air conditioner manufacturers in China, including the simple integrated mode, the HUB mode and the logistics strategic alliance mode.
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
Authors: Petr Jančar
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

The paper tries to highlight some crucial ideas appearing in the decidability and undecidability proofs for the bisimilarity problem on models originating in language theory, like context-free grammars and pushdown automata. In particular, it focuses on the method of finite bases of bisimulations in the case of decidability and the method of "Defender's forcing" in the case of undecidability. An intent was to write an easy-to-read article in a slightly informal way, which should nevertheless convey the basic ideas with sufficient precision.
On Scalable Synchronization for Distributed Embedded Real-Time Systems
Authors: Sherif F. Fahmy, Binoy Ravindran, E. Douglas Jensen
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

We consider the problem of programming distributed embedded real-time systems with distributed dependencies. We show that the de facto standard of using locks and condition variables in conjunction with threads can have significant overhead and semantic difficulty and suggest alternative programming abstractions to alleviate these problems. We also discuss several alternatives for implementing these programming abstractions and discuss the algorithms and protocols needed.
A geometric programming model of the lot-scheduling problem with investments in setup reductions and process improvements
Authors: Jose M. Cruz, Mousthapha Diaby, Aaron L. Nsakanda
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

This paper discusses a general nonlinear optimization model for the problem of investing in reduced setup times and process improvements for a manufacturer of several products operating in a JIT environment. Demand for each product occurs at a constant rate. The problem is constrained by limitations on the process improvement and setup reduction budgets, and on the manufacturing and warehousing capacities. The objective is to determine optimal levels of setup time and process improvements along with the corresponding amounts of investments respectively, and the optimal production cycle time for each product. A convex geometric programming model of this problem is developed in order to solve it. In order to deal with numerical difficulties that may be encountered in practice, a dual reformulation of the model is discussed.
Algebraic curves and maximal arcs
Authors: A. Aguglia, L. Giuzzi, G. Korchmáros
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $\mathcal{K}$ of the Desarguesian plane PG(2,q) is obtained. The case where $\mathcal{K}$ is a maximal (k,n)-arc is considered in greater depth.
Visualisation Tool for Cooperative Relations and Its Verification with a Case Study
Authors: Takanori Ugai, Kouji Aoyama
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Many organisations have communication problems such as inter-organisational barriers. However, these kinds of problems are not easy to visualise, and it is even more difficult to derive, implement and assess appropriate measures to deal with them. We developed a tool to visualise the dynamic structure of cooperative relationships between employees in organisations based on questionnaires given to employees of those organisations. This tool is used for visualising barriers between teams and the effects of measures. In this paper we explain some features of this tool and verify its capabilities and effectiveness with a case study. The case study is some field research based on interviews that we conducted in which we applied measures to improve the employees' communication. We collected a set of data about relationships in an organisation with questionnaires before and after implementing the measures. And we compared the observed result produced by the visualisation tool with the result from the field research.
The calculation of excited-state polarizabilities of solvated molecules
Authors: Kenneth Ruud, Benedetta Mennucci, Roberto Cammi, Luca Frediani
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

We briefly review the different ab initio methods that have been introduced for the calculation of excited-state polarizabilities of molecules in solution. Emphasis is put on the conceptual differences between the methods, emphasizing the strengths and weaknesses of the different approaches. A general discussion of the use of dielectric continuum methods in the modeling of linear and non-linear electric properties of ground- and excited state polarizabilities is given. Particular attention is given to the notion of equilibrium and non-equilibrium solvation models. We discuss the results of the few theoretical calculations that have been presented in the literature at the time of this review, and also give a few new results.
Implementing interactive analysis of attack graphs using relational databases
Authors: Lingyu Wang, Chao Yao, Anoop Singhal, Sushil Jajodia
Venue: Journal of Computer Security (2008)

An attack graph models the causal relationships between vulnerabilities. Attack graphs have important applications in protecting critical resources in networks against sophisticated multi-step intrusions. Currently, analyses of attack graphs largely depend on proprietary implementations of specialized algorithms. However, developing and implementing algorithms causes a delay to the availability of new analyses. The delay is usually unacceptable due to rapidly-changing needs in defending against network intrusions. An administrator may want to revise an analysis as soon as its outcome is observed. Such an interactive analysis, similar to that in decision support systems, is desirable but difficult with current approaches based on proprietary implementations of algorithms. This paper addresses the above issue through a relational approach. Specifically, we devise a relational model for representing necessary inputs, such as network configurations and domain knowledge, and we generate attack graphs from these inputs as relational views. We show that typical analyses can be supported through different type of searches in an attack graph, and these searches can be realized as relational queries. Our approach eliminates the needs for implementing algorithms, because an analysis is now simply a relational query. The interactive analysis of attack graphs becomes possible, since relational queries can be dynamically constructed and revised at run time. As a side effect, experimental results show that the mature optimization techniques in relational databases can transparently improve the performance of the analysis.
Some aspects regarding the cooperative control problem for flying wing air vehicles
Authors: Boscoianu Mircea, Axente Cornel, Pahonie Radu
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

The cooperative control of multiple FW-MAVs is an interesting task because it offers new capabilities, not possible with individual MAVs, including maximizing the area coverage for search and rescue operations, cooperative tracking of a moving target, cooperative engagement. This permits coordinated military maneuvers but also an aerodynamic optimization of the energy of the MAVs via a drag reduction given in the case of a close formation flight. The vehicles for this application are backward swept flying semi flexible wing MAVs special adapted for an effective formation of autonomous small MAVs. This low cost solution is well adapted for platoons of highly instable aerial vehicles because it permits an enlarged flight envelope and a good behavior at higher angles of attack and gust conditions without stalling.
Collaborative pricing model for bundling information goods
Authors: Wei-Lun Chang, Soe-Tsyr Yuan
Venue: Journal of Information Science (2008)

The information economy engenders consideration of certain issues such as information goods cost/pricing, technology infrastructure, and information policy in the era of knowledge economy. Due to the unique cost structure and product characteristics of information goods, conventional pricing strategies are unfeasible, and a differential pricing strategy is crucial. Nevertheless, few models exist for pricing information goods in the e-service industry. This study proposes a novel collaborative pricing model in which customers are active participants in determining product prices and adopt prices and services that meet their changing needs. This study also shows that the collaborative pricing model generates an optimal bundle price at equilibrium with optimal profit and utility. Theoretical proofs and practical implications justify this pricing model, which is essential for future information goods pricing in the information economy.