ppxscal/embedding_network huggingface dataset:
Parameterized cross-validation for nonlinear regression models
Authors: Imhoi Koo, Namgil Lee, Rhee Man Kil
Venue: Neurocomputing (2008)

This paper presents a new method of cross-validation (CV) for nonlinear regression problems. In the conventional CV methods, a validation set, that is, a part of training data is used to check the performance of learning. As a result, the trained regression models cannot utilize the whole training data and obtain the less performance than the expected for the given training data. In this context, we consider to construct the performance prediction model using the validation set to determine the optimal structure for the whole training data. We analyze risk bounds using the VC dimension theory and suggest a parameterized form of risk estimates for the performance prediction model. As a result, we can estimate the optimal structure for the whole training data using the suggested CV method referred to as the parameterize CV (p-CV) method. Through the simulation for function approximation, we have shown the effectiveness of our approach.
Theoretical and applicative contributions to flexibility of technology at turning on CNC machine tools
Authors: Badea Lepadatescu, Adela-Eliza Dumitrascu, Constantin Buzatu, Simona Duicu, Ioan Enescu
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

Flexibility of technology on machining on CNC machine tools is made by various factors: manufacturing strategies, using of combined tools, changing of cutting parameters, etc. Accuracy of the workpiece depends on geometry of the active part of cutting tool, stiffness coefficients of the machine tool and part holding device and many other factors. In the paper are presented only the theoretical and applicative contributions to part accuracy by the nose radius of the insert used to machining. Leading by this idea were shown the calculations of the corrections which have to be done directly on the CNC turning machine panel in the case when is using the insert with other nose radius that was initial in the machining program. If that these corrections are not sufficient for making a part with the required accuracy in the paper are given the modifications of the machine program according with the nose radius that is used. Also are given the tables with all these corrections and modifications when is using a rhombic and square insert, which are often used at turning operations.
Fast communication: Quantifying filter bank decorrelating performance via matrix diagonality
Authors: Mauricio Martínez-García
Venue: Signal Processing (2009)

An important number of signal processing applications require decomposing a discrete-time signal into decorrelated frequency channels. Several algorithms have been used for this purpose. One of the most popular is the DFT, which is known to be far from optimal due to the presence of overlap between adjacent channels. Filter banks are an interesting alternative as they can be designed for reduced frequency overlap, which results in an approximately tridiagonal autocorrelation matrix. In order to compare the decorrelating ability of different transforms, we propose simple but useful measures via autocorrelation matrix diagonality. We develop analytical expressions and numerical examples to show that our measures are equivalent for well decorrelated signals, and related to the well known Itakura-Saito distortion measure.
Computable Categoricity of Graphs with Finite Components
Authors: Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to strongly locally finite graphs; these are the graphs all of whose components are finite. We present a necessary and sufficient condition for certain classes of strongly locally finite graphs to be computably categorical. We prove that if there exists an infinite $\Delta_2^0$-set of components that can be properly embedded into infinitely many components of the graph then the graph is not computably categorical. We outline the construction of a strongly locally finite computably categorical graph with an infinite chain of properly embedded components.
Analysis of nonlinear coupled thermo-magnetic problem by means of equivalent thermal network approach
Authors: Francesco Della Torre, Sonia Leva, Adriano Paolo Morando
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

A first-order approximation model for the magneto-thermal problem is presented with reference to a particular heating application. The model is based on an equivalent thermal network. The linkage between thermal field and magnetic field and between thermal and electromagnetic parameters are take into account considering the skin-effect and the dependence of the impressed heat on frequency and on temperature. The model is also integrated by means of a numerical approach in order to solve both the problem. Some results related to a specific example are shown.
Feasible Application of Shape-Based Classification
Authors: A. Caro, P. G. Rodríguez, T. Antequera, R. Palacios
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper reports the results obtained by analysing some of the most well-known features used in Computer Vision to describe and classify shapes in an appealing real application. We aim to demonstrate the applicability of shape descriptors to classify muscles on Magnetic Resonance Imaging (MRI). The mechanized classification of ham muscles could help the industries to automate the ripening process for Iberian ham. The excellent classification percentages obtained in our experiments suggest the real viability of the feature vector developed in this paper to recognize and classify muscles.
Note: A note on the signed edge domination number in graphs
Authors: Xueliang Fu, Yuansheng Yang, Baoqi Jiang
Venue: Discrete Applied Mathematics (2008)

Let G=(V(G),E(G)) be a graph. A function f:E(G)->{+1,-1} is called the signed edge domination function (SEDF) of G if @?"e"^"'"@?"N"["e"]f(e^')>=1 for every e@?E(G). The signed edge domination number of G is defined as @c"s^'(G)=min{@?"e"@?"E"("G")f(e)|f is a SEDF of G}. Xu [Baogen Xu, Two classes of edge domination in graphs, Discrete Applied Mathematics 154 (2006) 1541-1546] researched on the edge domination in graphs and proved that @c"s^'(G)@?@?116n-1@? for any graph G of order n(n>=4). In the article, he conjectured that: For any 2-connected graph G of order n(n>=2), @c"s^'(G)>=1. In this note, we present some counterexamples to the above conjecture and prove that there exists a family of k-connected graphs G"m","k with @c"s^'(G"m","k)=-k(m-1)(km+k+1)2(k>=2,m>=1).
The Acquisition of Linguistic Competence for Communicating Propositional Logic Sentences
Authors: Josefina Sierra, Josefina Santibáñez
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

We describe some experiments which show how a language expressive enough to allow the communication of meanings of the same complexity as propositional logic formulas can emerge in a population of autonomous agents which have no prior linguistic knowledge. We take an approach based on general purpose cognitive capacities, such as invention, adoption and induction, and on self-organisation principles applied to a particular type of linguistic interaction known as a language game.These experiments extend previous work by considering a larger population and a much larger search space of grammar rules. In particular the agents are allowed to order the expressions associated with the constituents of a logical formula in arbitrary order in the sentence. Previous work assumed that the expressions associated with the connectives should be always placed in the first position of the sentence. Another difference is that communication is considered successful in a language game if the meaning interpreted by the hearer is logically equivalent to the meaning the speaker had in mind. In previous experiments the meanings of speaker and hearer were required to be syntactically equal. This allows us to observe how a less strict grammar in terms of word order emerges through the self-organisation process, which minimizes the learning effort of the agents by imposing only those order relations among the components of a sentence that are necessary for language understanding.
A Buffered-Mode MPI Implementation for the Cell BETM Processor
Authors: Arun Kumar, Ganapathy Senthilkumar, Murali Krishna, Naresh Jayam, Pallav K. Baruah, Raghunath Sharma, Ashok Srinivasan, Shakti Kapoor
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The Cell Broadband EngineTM is a heterogeneous multi-core architecture developed by IBM, Sony and Toshiba. It has eight computation intensive cores (SPEs) with a small local memory, and a single PowerPC core. The SPEs have a total peak single precision performance of 204.8 Gflops/s, and 14.64 Gflops/s in double precision. Therefore, the Cell has a good potential for high performance computing. But the unconventional architecture makes it difficult to program. We propose an implementation of the core features of MPI as a solution to this problem. This can enable a large class of existing applications to be ported to the Cell. Our MPI implementation attains bandwidth up to 6.01 GB/s, and latency as small as 0.41 μs. The significance of our work is in demonstrating the effectiveness of intra-Cell MPI, consequently enabling the porting of MPI applications to the Cell with minimal effort.
Detecting Unsuccessful Automated Negotiation Threads When Opponents Employ Hybrid Strategies
Authors: Ioannis Papaioannou, Ioanna Roussaki, Miltiades Anagnostou
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In artificial intelligence systems, building agents that negotiate on behalf of their owners aiming to maximise their utility is a quite challenging research field. In this paper, such agents are enhanced with techniques based on neural networks (NNs) to predict their opponents' hybrid negotiation behaviour, thus achieving more profitable results. The NNs are used to early detect the cases where agreements are not achievable, supporting the decision of the agents to withdraw or not from the negotiation threads. The designed NN-assisted negotiation strategies have been evaluated via extensive experiments and are proven to be very useful.
Model-Checking Software Using Precise Abstractions
Authors: Marsha Chechik, Arie Gurfinkel
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

Formal verification techniques are not yet widely used in the software industry, perhaps because software tends to be more complex than hardware, and the penalty for bugs is often lower (software can be patched after the release). Instead, a large amount of time and money is being spent on software testing, which misses many subtle errors, especially in concurrent programs. Increased use of concurrency, e.g., due to the popularity of web services, and the surge of complex viruses which exploit security vulnerabilities of software, make the problem of creating a verifying compiler for production-quality code essential and urgent.
Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack
Authors: Hung-Min Sun, Mu-En Wu, Yao-Hsin Chen
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since Integer-Factorization is difficult, p and q are simply estimated as ${\sqrt{N}}$. In the Wiener attack, $2\sqrt{N}$ is adopted to be the estimation of p + q in order to raise the security boundary of private-exponent d. This work proposes a novel approach, called EPF, to determine the appropriate prime-factors of N. The estimated values are called "EPFs of N ", and are denoted as p E and q E . Thus p E and q E can be adopted to estimate p + q more accurately than by simply adopting $2\sqrt{N}$. In addition, we show that the Verheul and Tilborg's extension of the Wiener attack can be considered to be brute-guessing for the MSBs of p + q. Comparing with their work, EPF can extend the Wiener attack to reduce the cost of exhaustive-searching for 2r + 8 bits down to 2r ¿ 10 bits, where r depends on N and the private key d. The security boundary of private-exponent d can be raised 9 bits again over Verheul and Tilborg's result.
Computer user security: a model facilitating measurement
Authors: Margarita Rovira
Venue:  (2008)

Computer user security considers the actions of computer users in supporting or thwarting computer security. This research considered computer users that were employees or other workers that acted like fulltime employees of organizations. Most security failures had some link to users; despite the best technical products and plans, one could not overcome user risks. It was therefore important to know the status of computer user security, changes in this area over time, and comparative levels between areas. There appeared to be no objective method to measure the computer security abilities of a group of users in an organization. Little agreement was evident on what constituted user security with over one hundred different descriptive words used in formal literature. A further problem was that important terms like awareness had numerous and even opposing definitions. This research aimed to create a strong theoretical model based on an extensive review of the literature. Next, it evaluated the viability of the model using quantitative methods including surveys and partial least squares (PLS) statistical analysis. The research emulated and extended UTAUT by Venkatesh, Morris, Davis, and Davis who published the model as "User Acceptance of Information Technology: Toward a Unified View" in MISQ, 2003. Finally, this research extended findings to practical measurement. The outcome found support for the new model, but indicated that security technology usage had external influences that limited the relevance of UTAUT. The measurement system identified specific facets and locations that were either strong or weak. Included in the sample data were two apparent anomalies that later proved to have been accurate detection and measurement by the new system. This exploratory research created a basis that promoted the ability for organizations to objectively comply with legal reporting requirements, identify weaknesses in the most serious security areas, isolated specific locations needing improvement, and allowed for efficient budget allocations. The judgment of remediation efficacy was a further anticipated benefit.
Integrating Topic Estimation and Dialogue History for Domain Selection in Multi-domain Spoken Dialogue Systems
Authors: Satoshi Ikeda, Kazunori Komatani, Tetsuya Ogata, Hiroshi G. Okuno
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

We present a method of robust domain selection against out-of-grammar (OOG) utterances in multi-domain spoken dialogue systems. These utterances cause language-understanding errors because of a limited set of grammar and vocabulary of the systems, and deteriorate the domain selection. This is critical for multi-domain spoken dialogue systems to determine a system's response. We first define a topic as a domain from which the user wants to retrieve information, and estimate it as the user's intention. This topic estimation is enabled by using a large amount of sentences collected from the Web and Latent Semantic Mapping (LSM). The results are reliable even for OOG utterances. We then integrated both the topic estimation results and the dialogue history to construct a robust domain classifier against OOG utterances. The idea of integration is based on the fact that the reliability of the dialogue history is often impeded by language-understanding errors caused by OOG utterances, from which using topic estimation obtains useful information. Experimental results using 2191 utterances showed that our integrated method reduced domain selection errors by 14.3%.
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
Authors: Daniele Gorla
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already been somehow presented in the literature) that an encoding should satisfy to be considered a good means for language comparison. We argue that the combination of such criteria is a valid proposal by noting that: (i) the best known encodings appeared in the literature satisfy them; (ii) this notion is not trivial, because there exist encodings that do not satisfy all the criteria we have proposed; (iii) the best known separation results can be formulated in terms of our criteria; and (iv) some widely believed (but never formally proved) separation results can be proved by using the criteria we propose. Moreover, the way in which we prove known separation results is easier and more uniform than the way in which such results were originally proved.
A Hybrid Method for the Protein Structure Prediction Problem
Authors: Márcio Dorn, Ardala Breda, Osmar Norberto De Souza
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

This article provides the initial results of our effort to develop a hybrid prediction method, combining the principles of de novo and homology modeling, to help solve the protein three-dimensional (3-D) structure prediction problem. A target protein amino acid sequence is fragmented into many short contiguous fragments. Clustered short templates fragments, obtained from experimental protein structures in the Protein Data Bank (PDB), using the NCBI BLASTp program, were used for building an initial conformation, which was further refined by molecular dynamics simulations. We tested our method with the artificially designed alpha helical hairpin (PDB ID: 1ZDD) starting with its amino acids sequence only. The structure obtained with the proposed method is topologically a helical hairpin, with a C( RMSD of ~ 5.0 Å with respect to the experimental PDB structure for all 34 amino acids residues, and only ~ 2.0 Å when considering amino acids 1 to 22. We discuss further improvements to the method.
Project "Animat Brain": Designing the Animat Control System on the Basis of the Functional Systems Theory
Authors: Vladimir G. Red'Ko, Konstantin V. Anokhin, Mikhail S. Burtsev, Alexander I. Manolov, Oleg P. Mosalov, Valentin A. Nepomnyashchikh, Danil V. Prokhorov
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

The paper proposes the framework for an animat control system (the Animat Brain) that is based on the Petr K. Anokhin's theory of functional systems. We propose the animat control system that consists of a set of functional systems (FSs) and enables predictive and purposeful behavior. Each FS consists of two neural networks: the actor and the predictor. The actors are intended to form chains of actions and the predictors are intended to make prognoses of future events. There are primary and secondary repertoires of behavior: the primary repertoire is formed by evolution; the secondary repertoire is formed by means of learning. This paper describes both principles of the Animat Brain operation and the particular model of predictive behavior in a cellular landmark environment.
A Simple, Pipelined Algorithm for Large, Irregular All-gather Problems
Authors: Jesper Larsson Träff, Andreas Ripke, Christian Siebert, Pavan Balaji, Rajeev Thakur, William Gropp
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

We present and evaluate a new, simple, pipelined algorithm for large, irregular all-gather problems, useful for the implementation of the MPI_Allgatherv collective operation of MPI. The algorithm can be viewed as an adaptation of a linear ring algorithm for regular all-gather problems for single-ported, clustered multiprocessors to the irregular problem. Compared to the standard ring algorithm, whose performance is dominated by the largest data size broadcast by a process (times the number of processes), the performance of the new algorithm depends only on the total amount of data over all processes. The new algorithm has been implemented within different MPI libraries. Benchmark results on NEC SX-8, Linux clusters with InfiniBand and Gigabit Ethernet, Blue Gene/P, and SiCortex systems show huge performance gains in accordance with the expected behavior.
Clinical Performance of Digital Breast Tomosynthesis Versus Full-Field Digital Mammography: Preliminary Results
Authors: Gisella Gennaro, Enrica Baldan, Elisabetta Bezzon, Manuela Grassa, Luigi Pescarini, Cosimo Maggio
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Preliminary results of a clinical study designed to compare clinical performance of digital breast tomosynthesis (DBT) versus standard full-field digital mammography (FFDM) in a diagnostic population are presented and discussed. Paired tomosynthesis and mammography examinations were analyzed by three experienced radiologists. One hundred single-breast cases were analyzed. Findings were rated in terms of lesion conspicuity, classified using the ACR BIRADS scale and compared with the truth. Statistically significant differences were found in lesion conspicuity for all radiologists, showing tomosynthesis superior to mammography. Finding classifications (BIRADS) were evaluated by ROC analysis. The results obtained from tomosynthesis images were consistently superior to FFDM for all readers. The difference was statistically significant for one radiologist. The results demonstrated DBT superiority for conspicuity of findings and showed potential for superior clinical performance.