ppxscal/embedding_network huggingface dataset:
Building Behavior Scoring Model Using Genetic Algorithm and Support Vector Machines
Authors: Defu Zhang, Qingshan Chen, Lijun Wei
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In the increasingly competitive credit industry, one of the most interesting and challenging problems is how to manage existing customers. Behavior scoring models have been widely used by financial institutions to forecast customer's future credit performance. In this paper, a hybrid GA+SVM model, which uses genetic algorithm (GA) to search the promising subsets of features and multi-class support vector machines (SVM) to make behavior scoring prediction, is presented. A real life credit data set in a major Chinese commercial bank is selected as the experimental data to compare the classification accuracy rate with other traditional behavior scoring models. The experimental results show that GA+SVM can obtain better performance than other models.
Electric Load Forecasting Using Adaptive Multiresolution-Based Bilinear Recurrent Neural Network
Authors: Dong-Chul Park, Dong-Min Woo, Seung-Soo Han
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A short-term electric load forecasting method using an Adaptive Multiresolution-based BiLinear Recurrent NeuralNetwork (AMBLRNN) is proposed in this paper. The AMBLRNN is based on the BLRNN that has been proven to have robust abilities in modeling and predicting time series. The learning process is further improved by using a multiresolution-based learning algorithm which employs the wavelet transform for multiresolution analysis of signal. Experiments are conducted on load data from the North-American Electric Utility (NAEU). Results show that the AMBLRNN out performs other conventional models 10%-25% in terms of MAPE (Mean Absolute Percentage Error) on forecasting accuracies.
Biometric Authentication for Border Control Applications
Authors: Taekyoung Kwon, Hyeonjoon Moon
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

For homeland and national security, the deployment of multi-modal biometrics is desirable with e-passports, but is hindered by privacy infringement and high cost implementation. We propose an authentication methodology which combines multi-modal biometrics and cryptographic mechanisms for border control applications. Specifically, we accommodate face and fingerprint without a mandatory requirement of (tamper-resistant) smart-card-level devices. We could imprint a (publicly readable) bar codes on the passport with regard to easier world-wide deployment. Additionally, we present a solution based on certification and key management method to control the validity of passports within the current PKI technology paradigm.
A Finite Element Model for Epidermal Wound Healing
Authors: F. J. Vermolen, J. A. Adam
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

A finite element model for epidermal wound healing is proposed. The model takes into account the sequential steps of angiogenesis (neo-vascularization) and wound contraction (the actual healing of a wound). An innovation in the present study is the combination of both partially overlapping processes, yielding novel insights into the process of wound healing. The models consist of nonlinearly coupled diffusion-reaction equations, in which transport of oxygen, growth factors and epidermal cells and mitosis are taken into account.
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
Authors: Willi Geiselmann, Rainer Steinwandt
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, none of the published proposals for coping with the sieving step is satisfying. Even for the best known designs, the technological obstacles faced for the parameters expected for a 1024-bit RSA modulus are significant.Below we present a new hardware design for implementing the sieving step. The suggested chips are of moderate size and the inter-chip communication does not seem unrealistic. According to our preliminary analysis of the 1024-bit case, we expect the new design to be about 2 to 3.5 times slower than TWIRL (a wafer-scale design). Due to the more moderate technological requirements, however, from a practical cryptanalytic point of view the new design seems to be no less attractive than TWIRL.
Dynamic Workflow Management for P2P Environments Using Agents
Authors: Wallace A. Pinheiro, Adriana S. Vivacqua, Ricardo Barros, Amanda S. Mattos, Nathalia M. Cianni, Pedro C. Monteiro,  Jr., Rafael N. Martino, Vinícius Marques, Geraldo Xexéo, Jano M. Souza
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Traditional workflow systems don't handle dynamic scenarios well, as they are centralized and pre-defined at the start of the project. In this paper, we present a P2P framework to support dynamic workflows, which uses contracts to deal with unexpected changes in the flow of activities. DynaFlow is an agent based framework, where agents take action when exceptions occur. DynaFlow could provide adequate support for E-Science experiments mapped into workflows instances, with tasks operating in distributed environments and diverse types of computational resources and data.
A Tabletop Interface Using Controllable Transparency Glass for Collaborative Card-Based Creative Activity
Authors: Motoki Miura, Susumu Kunifuji
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Conventional tabletop systems have focused on communication with virtual data, using phicons or physical objects as handles. This approach is versatile, given the full use of a horizontal display. However, we consider that an another approach can be formulated that can support normal specific tasks on a table. We have developed a card-handling activity environment enhanced by a tabletop interface. We use a glass tabletop with controllable transparency to improve surface scanning and the display of supplemental data. We describe the architecture of the tabletop system and its design criteria. Due to its simple configuration, this tabletop system can handle a large number of paper cards, as used in the KJ method. Therefore, our system can be used to enhance card-based tasks by showing additional data, and it provides the ability to review transactions by recording the tasks.
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
Authors: Steven D. Galbraith, Michael Scott
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

We present efficiently computable homomorphisms of the groups G 2 and G T for pairings G 1 ×G 2 ¿G T . This allows exponentiation in G 2 and G T to be accelerated using the Gallant-Lambert-Vanstone method.
Releasing and Scheduling of Lots in a Wafer Fab
Authors: Subhash C. Sarin, Vinod D. Shenai, Lixin Wang
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

In this paper, we address the problem of both releasing and scheduling of lots in a wafer fab. In the lot release problem, we determine the number of lots of different products to be released in each period of a planning horizon in order to minimize total tardiness. The problem of the scheduling of lots at various workstations is modeled as a mathematical program for the objective of minimizing the cycle times of the lots and is solved by the Lagrangian relaxation method. Computational results are presented that exhibit that our methodology constantly generates better solutions compared to those obtained by commonly-used dispatching rules.
Perturbating RSA Public Keys: An Improved Attack
Authors: Alexandre Berzati, Cécile Canovas, Louis Goubin
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Since its first introduction by Bellcore researchers [BDL97], fault injections have been considered as a powerful and practical way to attack cryptosystems, especially when they are implemented on embedded devices. Among published attacks, Brier et al. followed the work initiated by Seifert to raise the problem of protecting RSA public elements.We describe here a new fault attack on RSA public elements. Under a very natural fault model, we show that our attack is more efficient than previously published ones. Moreover, the general strategy described here can be applied using multiple transient fault models, increasing the practicability of the attack.Both the theoretical analysis of the success probability, and the experimental results --- obtained with the GMP Library on a PC ---, provide evidence that this is a real threat for all RSA implementations, and confirm the need for protection of the public key.
Runtime infrastructure for simulating vehicle-2-x communication scenarios
Authors: Tobias Queck, Bjöern Schüenemann, Ilja Radusch
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

Simulations are essential to evaluate Vehicle-2-X Communication applications and to efficiently prepare their deployment. Accordingly, to enable realistic simulations of Vehicle-2-X Communication applications, different kinds of simulators have to be coupled dynamically. Running coupled simulators synchronously and exchanging simulation data among them is a challenging task. Currently, simulator couplings lack flexibility because they are designed merely for specific simulators. In this work, the runtime infrastructure VSimRTI is presented allowing a flexible combination of time-discrete simulators for Vehicle-2-X simulations. Based on the requirements of a concrete scenario, arbitrary simulators can be plugged onto the VSimRTI and are executed together.
Linear Quantifier Elimination
Authors: Tobias Nipkow
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All procedures are defined and verified in the theorem prover Isabelle/HOL, are executable and can be applied to HOL formulae themselves (by reflection).
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
Authors: Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

In this paper, we study the problem of perfectly reliable message transmission (PRMT) and perfectly secure message transmission (PSMT) between a sender S and a receiver R in an undirected synchronous network, tolerating a mixed adversary, where the adversary can be either static or mobile. The connectivity requirement, phase complexity and communication complexity are three important parameters of any interactive PRMT/PSMT protocol and are well studied in the literature in the presence of a static/mobile Byzantine adversary. However, in the presence of a mixed adversary, we encounter several surprising consequences. In this paper, we prove that even though the connectivity requirement for PRMT is same against both static and mobile mixed adversary, the lower bound on communication complexity for PRMT tolerating a mobile mixed adversary is more than its static mixed counterpart. This is interesting because against a "Byzantine adversary", the connectivity requirement and the lower bound on the communication complexity of PRMT protocols are same for both static and mobile case. Thus our result shows that for PRMT, a mobile mixed adversary is more powerful than its static counterpart. As our second contribution, we design a four phase communication optimal PSMT protocol tolerating a "static mixed adversary". Comparing this with the existing three phase communication optimal PSMT protocol against a "static Byzantine adversary", we find that additional one phase is enough to design communication optimal protocol against a static mixed adversary. Finally, we show that the connectivity requirement and lower bound on communication complexity of any PSMT protocol is same against both static and mobile mixed adversary, thus proving that mobility of the adversary has no effect on PSMT. To show that our bound is tight, we also present a worst case nine phase communication optimal PSMT protocol tolerating a mobile mixed adversary which is first of it's kind. This also shows that the mobility of the adversary does not hinder to design constant phase communication optimal PSMT protocol. In our protocols, we have used new techniques which can be effectively used against both static and mobile mixed adversary and are of independent interest.
A New Multi-Criteria Quadratic-Programming Linear Classification Model for VIP E-Mail Analysis
Authors: Peng Zhang, Juliang Zhang, Yong Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In the recent years, classification models based on mathematical programming have been widely used in business intelligence. In this paper, a new Multi-Criteria Quadratic-Programming Linear Classification (MQLC) model is proposed and tested with VIP E-Mail dataset. This experimental study uses a variance of K-fold Cross-Validation to demonstrate the accuracy and stability of the model. Finally, we compare our model with the decision tree by using commercial software C5.0. The result indicates that the proposed MQLC model performs better than decision tree on small samples.
Generalization of Concave and Convex Decomposition in Kikuchi Free Energy
Authors: Yu Nishiyama, Sumio Watanabe
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Computing marginal probabilities from a high-dimensional distribution is generally an intractable task which arises in various probabilistic information processing. The minimum of Kikuchi free energy is known to yield more accurate marginals than that of Bethe free energy. Concave convex procedure (CCCP) proposed by Yuille is known to be an algorithm which guarantees to monotonically decrease both free energies.In this paper, we generalize CCCP algorithm for Kikuchi free energy and present a new CCCP (NCCCP) algorithm which includes a high-dimensional free vector. The free vector enables NCCCP to be more stable and to reduce enormous computational cost underlying CCCP. Moreover it seems that there exists an optimal series of free vectors that can minimize the huge computational cost. This means that there exists an optimal concave and convex decomposition schedule in Kikuchi free energy.
Study on Tool Wear Monitoring Based on Multi-source Information Fusion
Authors: Lanshen Guo, Haiwei Zhang, Yanxia Qi, Zhi Wei
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The paper developed a system of tool wear monitoring in advanced manufacture systems. In conventional wear-monitoring method, it cannot exhibit unique behavior found in regular modern machining systems. Because a single monitoring signal, such as the signal of force, temperature, ultrasound or AE, cannot exactly describe the state of tool work for monitoring in advanced manufacture. This paper, therefore, mainly researched on real-time cutter state monitoring using neural network, neural network integration and multi-sensor information integrating technology. Picture pattern-recognition and feature extracting were adopted and combined with other information of the cutter dynamically. The characteristic information was gathered using an appropriate model of cutter wear or damage. Neural network were used to imitate the complicated nonlinear mapping relationship and to fuse multi-kind sensors that collect wearing and damage information and make decision and judgment rapidly.
Elongation method and supermolecule approach for the calculation of nonlinear susceptibilities. Application to the 3-Methyl-4-Nitropyridine 1-Oxide and 2-Methyl-4-Nitroaniline crystals
Authors: Feng Long Gu, Maxime Guillaume, Edith Botek, Benoît Champagne, Frédéric Castet, Laurent Ducasse, Yuriko Aoki
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The linear and nonlinear optical properties of the 3-methyl-4-nitropyridine-1-oxyde (POM) and 2-methyl-4-nitroaniline (MNA) crystals are evaluated using the elongation method and the supermolecule approach. The elongation calculations adopt the finite field Hartree-Fock numerical scheme to get the static polarizability, first and second hyperpolarizabilities of large one-dimensional clusters, allowing a very accurate extrapolation of the crystal packing ratios to the infinite one-dimensional arrays. The supermolecule approach employs the analytical time-dependent Hartree-Fock scheme for evaluating the static and dynamic polarizability and first hyperpolarizabilities of smaller clusters. Most of the calculations are performed using the semiempirical AM1 Hamiltonian. Preliminary results are also carried out at the ab initio level using a minimal basis set. These polarizability and hyperpolarizability results are then used to estimate the effective (hyper)polarizabilities of the unit cell in the whole crystals and subsequently their linear and nonlinear susceptibilities. The inclusion of electron correlation effects is also discussed.
Scalable adaptive mantle convection simulation on petascale supercomputers
Authors: Carsten Burstedde, Omar Ghattas, Michael Gurnis, Georg Stadler, Eh Tan, Tiankai Tu, Lucas C. Wilcox, Shijie Zhong
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Mantle convection is the principal control on the thermal and geological evolution of the Earth. Mantle convection modeling involves solution of the mass, momentum, and energy equations for a viscous, creeping, incompressible non-Newtonian fluid at high Rayleigh and Peclet numbers. Our goal is to conduct global mantle convection simulations that can resolve faulted plate boundaries, down to 1 km scales. However, uniform resolution at these scales would result in meshes with a trillion elements, which would elude even sustained petaflops supercomputers. Thus parallel adaptive mesh refinement and coarsening (AMR) is essential. We present RHEA, a new generation mantle convection code designed to scale to hundreds of thousands of cores. RHEA is built on ALPS, a parallel octree-based adaptive mesh finite element library that provides new distributed data structures and parallel algorithms for dynamic coarsening, refinement, rebalancing, and repartitioning of the mesh. ALPS currently supports low order continuous Lagrange elements, and arbitrary order discontinuous Galerkin spectral elements, on octree meshes. A forest-of-octrees implementation permits nearly arbitrary geometries to be accommodated. Using TACC's 579 teraflops Ranger supercomputer, we demonstrate excellent weak and strong scalability of parallel AMR on up to 62,464 cores for problems with up to 12.4 billion elements. With RHEA'S adaptive capabilities, we have been able to reduce the number of elements by over three orders of magnitude, thus enabling us to simulate large-scale mantle convection with finest local resolution of 1.5 km.
Improper choosability of graphs of nonnegative characteristic
Authors: Yongzhu Chen, Weiyi Zhu, Weifan Wang
Venue: Computers Mathematics with Applications (2008)

A graph G is called (k,d)^*-choosable if, for every list assignment L with |L(v)|=k for all v@?V(G), there is an L-coloring of G such that every vertex has at most d neighbors having the same color as itself. Let G be a graph embeddable in a surface of nonnegative characteristic. In this paper, we prove: (1) If G contains no k-cycle with a chord for all k=4,5,6, then G is (3,1)^*-choosable; (2) If G contains neither 5-cycle with a chord nor 6-cycle with a chord, then G is (4,1)^*-choosable.
Interfaces for Data Transfer Between Solid Modeling Systems
Authors: P. Wilson, I. Faux, M. Ostrowski, K. Pasquill
Venue: IEEE Computer Graphics and Applications (1985)

Data-exchange methods between geometric modeling systems have yet to be standardized. This early attempt, while not ideal, appears to provide a good foundation for future efforts.
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
Authors: J. -M. Champarnaud, J. -Ph. Dubernard, H. Jeanne
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

Our aim is to present an efficient algorithm that checks whether a binary and prolongeable regular language is geometrical or not, based on specific properties of its minimal deterministic automaton. Geometrical languages have been introduced in the framework of off-line temporal validation of real-time softwares. Actually, validation can be achieved through both a model based on regular languages and a model based on discrete geometry. Geometrical languages are intended to develop a link between these two models. The regular case is of practical interest regarding to implementation features, which motivates the design of an efficient geometricity test addressing the family of regular languages.
MetaLex XML and the Legal Knowledge Interchange Format
Authors: Alexander Boer, Radboud Winkels, Fabio Vitali
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

Electronic government invariably involves XML and electronic law: legislation is as essential to public administration as the ball is to a ball game. This paper gives an overview of two XML standard proposals dealing with two complementary aspects of electronic legislation --- the documents themselves as a carrier, and an institutional reality they represent --- in a coherent way: MetaLex XML and the Legal Knowledge Interchange format (LKIF). MetaLex XML is well on its way to becoming formal and de facto standard for legislation in XML. LKIF is yet to be submitted as a proposed standard. LKIF includes some interesting innovations from an AI Law perspective.
Emergent Rhythms through Multi-agency in Max/MSP
Authors: Arne Eigenfeldt
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

This paper presents a multi-agents architecture created in Max/MSP that generates polyphonic rhythmic patterns which continuously evolve and develop in a musically intelligent manner. Agent-based software offers a new method for real-time composition that allows for complex interactions between individual voices while requiring very little user interaction or supervision. The system described, Kinetic Engine is an environment in which networked computers, using individual software agents, emulate drummers improvising within a percussion ensemble. Player agents assume roles and personalities within the ensemble, and communicate with one another to create complex rhythmic interactions. The software has been premiered in a recent work, Drum Circle, which is briefly described.