ppxscal/embedding_network huggingface dataset:
The 2-adic valuation of a sequence arising from a rational integral
Authors: Tewodros Amdeberhan, Dante Manna, Victor H. Moll
Venue: Journal of Combinatorial Theory Series A (2008)

We analyze properties of the 2-adic valuation of an integer sequence that originates from an explicit evaluation of a quartic integral. We also give a combinatorial interpretation of the valuations of this sequence.
A Business Plans Training Tool Based on the Semantic Web Principles
Authors: Aristomenis M. Macris, Dimitrios A. Georgakellos
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

This paper presents the development of a training tool that enhances and empowers trainees' ability in developing business projects by preparing high-quality business plans. An ontology-based knowledge network was developed for the semantic representation of the business plans preparation procedure. The model can combine existing multimedia material with ontology constructs in order to build user-training scenarios and satisfy specific training needs. Hence, users are enabled to actively participate in the business plan preparing process, since, they are now equipped with an appropriate tool for acquiring a clear and in-depth understanding of this process, because the training scenarios designed show not only the meaning and the importance of the various business functional plans, but also how they affect each other within a business development project. Knowledge reusability is also achieved, since knowledge constructs instilled into a knowledge network can be used into new scenarios in order to meet new training needs.
Contiguous relations and their computations for F12 hypergeometric series
Authors: Adel K. Ibrahim, Medhat A. Rakha
Venue: Computers Mathematics with Applications (2008)

The hypergeometric function F12[a"1,a"2;a"3;z] plays an important role in mathematical analysis and its application. Gauss defined two hypergeometric functions to be contiguous if they have the same power-series variable, if two of the parameters are pairwise equal, and if the third pair differs by +/-1. He showed that a hypergeometric function and any two other contiguous to it are linearly related. In this paper, we present an interesting formula as a linear relation of three shifted Gauss polynomials in the three parameters a"1,a"2 and a"3. More precisely, we obtained a recurrence relation including F12[a"1+@a"1,a"2;a"3;z],F12[a"1,a"2+@a"2;a"3;z]andF12[a"1,a"2;a"3+@a"3;z] for any arbitrary integers @a"1,@a"2 and @a"3.
A compact wide band filter based on the left handed material theory
Authors: C. Huang, D. Chen, W. J. Wei, X. M. Jing, X. Chen, J. Q. Liu, J. Zhu, Z. Y. Wei, H. Q. Li
Venue: Microelectronic Engineering (2008)

A novel micro CRLH (composite right/left-handed) wide band filter based on Left handed material (LHM) theory was designed and fabricated. As a promising design, the length of the main part is only 1/20 compared to the working wavelength. It can be used to eliminate the noise in RF interconnect and other area. The phase shift in LHM is negative. This characteristic can decrease the phase delay. And also, the absolute value of phase constant will increase when frequency decrease at the left handed band (LH-band), which contribute to minimize the design. The other advantage of the LHM is that the phase constant will changed to the opposite direction, when the wavelength changed with the working frequency. This provides a negative feedback to the electric length, so the left handed region has a wider band width. Measurements results show that relative bandwidth (3dB) of 8 cells is 71.42%. The relative bandwidth (3dB) of 4 cells is 58.46%.
Heuristic algorithm for a cutting stock problem in the steel bridge construction
Authors: Yaodong Cui, Yiping Lu
Venue: Computers and Operations Research (2009)

A rectangular two-dimensional cutting stock problem in the steel bridge construction is discussed. It is the problem of cutting a set of rectangular items from plates with arbitrary sizes that lie in the supplier specified ranges, such that the necessary plate area is minimized. Several types of cutting patterns are used to compose the cutting plan. All of them are easy to generate and cut except the last one. The algorithm uses both recursive and dynamic programming techniques to generate patterns of the last type. The computational results of 22 practical instances indicate that the algorithm can produce solutions close to optimal, and the computation time is reasonable for practical use.
Gateway placement for throughput optimization in wireless mesh networks
Authors: Fan Li, Yu Wang, Xiang-Yang Li, Ashraf Nusairat, Yanwei Wu
Venue: Mobile Networks and Applications (2008)

In this paper, we address the problem of gateway placement for throughput optimization in multi-hop wireless mesh networks. Assume that each mesh node in the mesh network has a traffic demand. Given the number of gateways to be deployed (denoted by k) and the interference model in the network, we study where to place exactly k gateways in the mesh network such that the total throughput is maximized while it also ensures a certain fairness among all mesh nodes. We propose a novel grid-based gateway deployment method using a cross-layer throughput optimization, and prove that the achieved throughput by our method is a constant times of the optimal. Simulation results demonstrate that our method can effectively exploit the available resources and perform much better than random and fixed deployment methods. In addition, the proposed method can also be extended to work with multi-channel and multi-radio mesh networks under different interference models.
Correlating Time-Related Data Sources with Co-clustering
Authors: Vassiliki Koutsonikola, Sophia Petridou, Athena Vakali, Hakim Hacid, Boualem Benatallah
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

A huge amount of data is circulated and collected every day on a regular time basis. Given a pair of such datasets, it might be possible to reveal hidden dependencies between them since the presence of the one dataset elements may influence the elements of the other dataset and vice versa. Furthermore, the impact of these relations may last during a period instead of the time point of their co-occurrence. Mining such relations under those assumptions is a challenging problem. In this paper, we study two time-related datasets whose elements are bilaterally affected over time. We employ a co-clustering approach to identify groups of similar elements on the basis of two distinct criteria: the direction and duration of their impact. The proposed approach is evaluated using time-related news and stock's market real datasets.
The Exclusion of Malicious Routing Peers in Structured P2P Systems
Authors: Bong-Soo Roh, O-Hoon Kwon, Sung Je Hong, Jong Kim
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

We propose a scheme which excludes malicious routing peers from the normal routing process of structured P2P systems such as Chord. This scheme prevents continuous routing overheads from malicious peers. Simulation results show that the proposed scheme reduces the average routing length compared with the routing algorithm only using the alternate lookup path.
A Generic Layout-Tool for Summaries of Meetings in a Constraint-Based Approach
Authors: Sandro Castronovo, Jochen Frey, Peter Poller
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

We present SuVi - Summary Visualizer -, a generic layout-tool which displays a multimodal summary of a meeting in either a story-board style or newspaper-style. The system relies on constraint solving techniques in such a way that the two layouts have been extensively modeled in a series of constraints representing the underlying design knowledge. While the story-board aims to give the reader an overview of the chronological sequence of the meeting, the newspaper-layout focuses on presenting the topics of a meeting depending on their relevance. We also show two methods for connecting the whole AMI meeting corpus as a large input resource for the story-board part of SuVi and present a first end-to-end implementation of our system.
Addressing New Concerns in Model-Driven Web Engineering Approaches
Authors: Nathalie Moreno, Santiago Meliá, Nora Koch, Antonio Vallecillo
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

In the last few years, almost all model-driven Web Engineering approaches have evolved in response to the new challenges of Web systems design, which are due to new requirements and implementation technologies in the Web domain. The evolution implies the extension and adaptation of current approaches, in terms of new models, transformations and processes in order to incorporate new concerns or aspects. Such changes in a methodology are a risky and error-prone process. In this paper, we analyze different alternatives to address the evolution and in particular, the addition of a new concern in a Model-Driven Web Engineering approach: (a) extending the original method with an additional modeling concern, (b) merging the original proposal with another approach covering the specific concern and, (c) finally, we propose a an interoperable and architectural-centric approach that aims to reduce the impact of adding a new concern. We discuss the main advantages and drawbacks of each alternative.
Assessment of Classification Models with Small Amounts of Data
Authors: Boštjan Brumen, Matjaž B. Jurič, Tatjana Welzer, Ivan Rozman, Hannu Jaakkola, Apostolos Papadopoulos
Venue: Informatica (2007)

One of the tasks of data mining is classification, which provides a mapping from attributes (observations) to pre-specified classes. Classification models are built by using underlying data. In principle, the models built with more data yield better results. However, the relationship between the available data and the performance is not well understood, except that the accuracy of a classification model has diminishing improvements as a function of data size. In this paper, we present an approach for an early assessment of the extracted knowledge (classification models) in the terms of performance (accuracy), based on the amount of data used. The assessment is based on the observation of the performance on smaller sample sizes. The solution is formally defined and used in an experiment. In experiments we show the correctness and utility of the approach.
A framework for performance evaluation of user modeling servers for Web applications
Authors: Vladimir Zadorozhny, Michael Yudelson, Peter Brusilovsky
Venue: Web Intelligence and Agent Systems (2008)

Adaptive Web systems utilize user models (or group models) to represent essential information about an individual user (or a group) so that these systems can adapt their behavior to the goals, tasks, interests, and other features of individual users or groups of users. Meanwhile, proper performance assessment has become a critical issue for the efficient deployment of adaptive Web systems that implement complex user model inferences. This paper presents one of the first efforts to develop a framework for evaluating the performance of user modeling servers (UMS). We conduct a performance-driven analysis of the UMS conceptual model, extracting a comprehensive set of parameters in order to build a practical UMS Performance Evaluation Framework (UMS/PEF). We also apply the proposed UMS/PEF framework for comparing performances between different UMS. Experimental results have demonstrated high utility of the proposed UMS/PEF framework. This work was partially supported by NSF CRCD/EI Award 0426021 and NSF CAREER Award 0447083.
Enhanced Three-Round Smart Card-Based Key Exchange Protocol
Authors: Eun-Jun Yoon, Kee-Young Yoo
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In 2007, Kwon et al. proposed a three-round protocol, SKE, for smart card-based key exchange in the three-party setting which provides both key independence and forward secrecy. This paper demonstrates the vulnerability of the SKE protocol and then presents an improvement to repair the security flaws of the SKE protocol.
Region-Based Encoding Method Using Multi-dimensional Gaussians for Networks of Spiking Neurons
Authors: Lakshmi Narayana Panuku, C. Chandra Sekhar
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In this paper, we address the issues in representation of continuous valued variables by firing times of neurons in the spiking neural network used for clustering multi-variate data. The existing range-based encoding method encodes each dimension separately. This method does not make use of the correlation among the different variables, and the knowledge of the distribution of data. We propose a region-based encoding method that places multi-dimensional Gaussian receptive fields in the data-inhabited regions, and captures the correlation among the variables. Effectiveness of the proposed encoding method in clustering the complex 2-dimensional and 3-dimensional data sets is demonstrated.
Multivariates Polynomials for Hashing
Authors: Jintai Ding, Bo-Yin Yang
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security properties and potential feasibility, where the compression functions are randomly chosen high-degree polynomials, and show that under some plausible assumptions, high-degree polynomials as compression functions has good properties. Next, we propose to improve on the efficiency of the system by using some specially designed polynomials generated by a small number of random parameters, where the security of the system would then relies on stronger assumptions, and we give empirical evidence for the validity of using such polynomials.
Efficient artificial hippocampus algorithm for biometric authentication system
Authors: Ming-Shou An, Jang-Hui Kim, Dae-Seong Kang
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

In this paper, we studied the face verification system using artificial Hippocampus algorithm which can remodel the hippocampus neuron as a principle of a man's brain in engineering, then it can learn the feature vector of the face images very fast and construct the optimized feature each image. The system is composed of two parts mainly. One is feature extraction using PCA and LDA mixture algorithm and the other is artificial hippocampus algorithm and recognition simulation experiment confirm the each recognition rate, which is low-level quality image. The results of experiments, we can compare a feature extraction and learning method proposed in this paper of any other methods, and we can confirm that the proposed method is superior to the existing method.
The Complexity of Boolean Formula Minimization
Authors: David Buchfuhrer, Christopher Umans
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

The Minimum Equivalent Expression problem is a natural optimization problem in the second level of the Polynomial-Time Hierarchy. It has long been conjectured to be $\Sigma_2^P$-complete and indeed appears as an open problem in Garey and Johnson [GJ79]. The depth-2 variant was only shown to be $\Sigma_2^P$-complete in 1998 [Uma98], and even resolving the complexity of the depth-3 version has been mentioned as a challenging open problem. We prove that the depth-k version is $\Sigma_2^P$-complete under Turing reductions for all k ¿ 3. We also settle the complexity of the original, unbounded depth Minimum Equivalent Expression problem, by showing that it too is $\Sigma_2^P$-complete under Turing reductions.
Sufficient Criteria for Consistent Behavior Modeling with Refined Activity Diagrams
Authors: Stefan Jurack, Leen Lambers, Katharina Mehner, Gabriele Taentzer
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

In use case-driven approaches to requirements modeling, UML activity diagrams are a wide-spread means for refining the functional view of use cases. Early consistency validation of activity diagrams is therefore desirable but difficult due to the semi-formal nature of activity diagrams. In this paper, we specify well-structured activity diagrams and define activities more precisely by pre- and post- conditions. They can be modeled by interrelated pairs of object diagrams based on a domain class diagram. This activity refinement is based on the theory of graph transformation and paves the ground for a consistency analysis of the required system behavior. A formal semantics for activity diagrams refined by pre- and post-conditions allows us to establish sufficient criteria for consistency. The semi-automatic checking of these criteria is supported by a tool for graph transformation.
Operon Prediction in Bacterial Genomes
Authors: Matheus B. Barros, Simone L. Martins, Alexandre Plastino
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

Operons are sets of adjacent genes that encode proteins with related metabolic functions. Operon prediction may be useful for understanding the systems of regulation and for genome annotation. In this work, we present an extension of the PROCSIMO tool to allow the operon prediction in bacterial genomes based on the similarity evaluation between pairs of genes. Computational experiments were made to validate this new functionality. With the use of this tool, we expect to enlarge the number of known operons in bacterial organisms.
Complex Queries for Moving Object Databases in DHT-Based Systems
Authors: Cecilia Hernández, M. Andrea Rodríguez, Mauricio Marin
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed indexing method, using the Distributed Hash Table (DHT) paradigm, devised to efficiently support complex spatio temporal queries. We assume a setting in which there is a large number of database servers that keep track of events associated with a highly dynamic system of moving objects deployed in a spatial area. We present a technique for properly keeping the index up to date and efficiently processing range and top-k queries for moving object databases. We evaluated our system using event-driven simulators with demanding spatio temporal workloads and the results show good performance in terms of response time and network traffic.
Discovering Pathways of Service Oriented Biological Processes
Authors: George Zheng, Athman Bouguettaya
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Service oriented modeling and deployment of biological processes allow these processes to be published, discovered and, most importantly, invoked on the Web. This in-place invocation capability provides the basis for simulation based validation and predictive analysis of discovered pathways linking published services. We present a Web service mining framework that enables the discovery and validation of such pathways. In our experiment, we model the semantic interfaces of biological processes as WSML Web services and deploy them through the execution environment WSMX. We show how pathways involving these processes are discovered and simulated using our service mining approach.
Fuzzy neural network sliding mode control for long delay time systems based on fuzzy prediction
Authors: Feipeng Da
Venue: Neural Computing and Applications (2008)

Delay time, which may degrade the control performance, is frequently encountered in various control processes. The fuzzy neural network sliding mode controller (FNNSMC), which incorporates the fuzzy neural network (FNN) with the sliding mode controller (SMC), is developed to control the long delay system with unknown model based on fuzzy prediction algorithm in the paper. According to the characteristics of the long delay systems, we simulate the manual operating process and predict the delayed error and its derivative based on the information of the input and output variables of the process, and then feedback these prediction values to the FNN and train the FNN with the regulation function by the idea of sliding mode control until the better control results are obtained. The FNNSMC has more robustness due to the abilities of the learning and reasoning and can eliminate the drawbacks of the general SMC, namely the chattering in the control signal and the needing knowledge of the bounds of the disturbances and uncertainties. Simulation examples demonstrate the advantages of the proposed control scheme.
Digital Image Colorization Based on Probabilistic Distance Transform
Authors: Przemyslaw Lagodzinski, Bogdan Smolka
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Colorization denotes a process of adding color to gray-scale images, movies and TV programs. This process replaces the intensity value of an image pixel with a vector in a three dimensional color space composed of hue, saturation and luminance, and since this mapping - between intensity and color, has no inherently 'correct solution', human interaction and external information usually plays a large role. In this paper we present a novel colorization method that takes advantage of the modified morphological distance transform to automatically propagate the color scribbled by a user on the gray-scale image. The introduced modification of the distance transform is based on the Gibbs distribution which governs the behavior of a virtual particle performing a random walk on the image domain. Such a modification allows for the application of the distance transform to the gray-scale images and yields high quality colorization results.
Topology perserving mappings using cross entropy adaptation
Authors: Ying Wu, Colin Fyfe
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In this paper, we review the technique of Cross Entropy and apply it in a novel manner to the creation of topology preserving mappings. We create an underlying latent space which is mapped into data space by mapping the latent points through a number of basis functions and then linearly combining the output of these basis functions to create centres or prototypes in data space. In this paper, we use the cross entropy method for adapting the parameters of this linear combination matrix. We further show that the method can be extended to deep architectures, architectures with multiple layers of adaptive units which can be used to try to create more interesting features than can be found with one adaptive layer.