ppxscal/embedding_network huggingface dataset:
The INTEL&reg; 8087 numeric data processor
Authors: John F. Palmer
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The INTEL&reg; 8087 is a high performance general purpose numeric data processor. It is used with the INTEL&reg; 8086, or the INTEL&reg; 8088, microprocessors to extend their instruction sets with over 100 instructions (not counting addressing mode). The 8087 has all of the 8086 addressing modes and through a coprocessing interface is able to execute numeric instructions concurrently with the 8086 (or 8088). The high performance overlapped execution is transparent to the user who sees the 8087 simply as an extension of the 8086 (8088). Furthermore, the 8087 is the only chip that must be added to an 8086-based system to provide numerics capability with a performance enhancement over software of more than 100. In addition to high performance, great care was taken to ensure that the 8087 could be used in any application involving numbers---including commercial calculations. This required an unprecedented level of accuracy and reliability to be built into the processor. The intent was to greatly simplify the production of high performance but reliable numeric software.
Improving network intrusion detection through soft computing and natural immunology
Authors: Seyed A. Shahrestani
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

While it is critical to have the mechanisms capable of preventing security violations, for most modern massively interconnected networks, complete prevention of security breaches is not practical. Intrusion detection can be regarded as an alternative, or as a compromise to this situation. This paper discusses the shortcomings of some of the more traditional approaches used in intrusion detection systems. An alternative view that may provide better security systems, based on adopting the design principles from the natural immune systems, is also presented. The advantages of approximate reasoning and soft computing to provide tolerance to imprecision are also considered.
A user-centric federated single sign-on system
Authors: Suriadi Suriadi, Ernest Foo, Audun Jøsang
Venue: Journal of Network and Computer Applications (2009)

Current identity management systems are not concerned with user privacy. Users must assume that identity providers and service providers will ensure their privacy, which is not always the case. This paper proposes an extension of the existing federated single sign-on (FSSO) systems that adopts the beneficial properties of the user-centric identity management (UCIM) model. This new identity management system allows the users to control and enforce their privacy requirements while still retaining the convenience of single sign-on over a federation of service providers. Colored Petri Nets are used to formally model the new identity management system to provide assurance that the privacy goals are achieved. To our knowledge, Colored Petri Nets have not been used to model privacy in identity management systems before.
Minimizing costs in round robin tournaments with place constraints
Authors: Sigrid Knust, Daniel Lücking
Venue: Computers and Operations Research (2009)

In this paper we consider a general sports league scheduling problem and propose solution algorithms for it. The objective is to find a feasible schedule for a round robin tournament with minimum number of breaks and minimum total costs where additionally place constraints are taken into account. We present a ''first-break, then-schedule'' approach which uses an enumerative procedure to generate home-away patterns and integer programming for finding corresponding schedules. Computational results are presented for leagues with up to 14 teams.
Time Distribution in Structural Workflow Nets
Authors: Piotr Chrząstowski-Wachtel, Paweł Findeisen, Grzegorz Wolny
Venue: Fundamenta Informaticae (2008)

Workflows with transition execution times having exponential distributions are considered. The aim is to determine the overall execution time without looking into the reachability space and its analysis using Markov processes. We concentrate on the so called structural workflows, which are represented with Petri nets constructed by means of specific refinement rules. With each refinement rule (sequence, choice, parallelization, loop) we associate formulas which allow to compute the overall execution time distribution. The class of exponential distributions is too narrow to keep the result within itself. We analyze the so called exponential polynomials, generalizing exponential distributions. They are closed under SUM and MAX functions. This closure property combined with the knowledge of refinements history enables us to find the requested formulas.
Development of a sliding control maximum power point tracker for photovoltaic
Authors: Ying-Shing Shiao, Jui-Liang Yang, Ding-Tsair Su
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This paper proposes a control strategy of a Maximum Power Point Tracking (MPPT) impendence adapter coupling a photovoltaic generator to a battery. The proposed strategy is based on the sliding mode control theory of continue systems permitting a direct control of power converter. The PV generator price is even relatively high, so the user is interested to the optimal coupling of PV generator to electromechanical loads. In fact, this system used optimal coupling in order to have maximum power during the whole operating period. This paper, consisting of a Boost type dc/dc converter, which micro-processor, PIC16F877A, is used to implement the sliding mode controller. Comparing with other techniques used in the past, the use of the proposed MPPT control improves the PV system performance. The results of simulation and experiment are present.
A Closed-Form Expression of the Positional Uncertainty for 3D Point Clouds
Authors: Kwang-Ho Bae, David Belton, Derek D. Lichti
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We present a novel closed-form expression of positional uncertainty measured by a near-monostatic and time-of-flight laser range finder with consideration of its measurement uncertainties. An explicit form of the angular variance of the estimated surface normal vector is also derived. This expression is useful for the precise estimation of the surface normal vector and the outlier detection for finding correspondence in order to register multiple three-dimensional point clouds. Two practical algorithms using these expressions are presented: a method for finding optimal local neighbourhood size which minimizes the variance of the estimated normal vector and a resampling method of point clouds.
Support for virtual organisation creation &ndash; partners' profiles and competency management
Authors: Jiri Hodik, Jiri Vokrinek, Petr Becvar
Venue: International Journal of Agent-Oriented Software Engineering (2009)

The only possibility for Small and Medium Enterprises (SMEs) to succeed in marketing competition with big corporations is cooperation and sharing of knowledge and resources. A promising way to cooperate and keep their independence is the formation of semipermanent collaborative networks, which facilitate Virtual Organisation (VO) creation and management. This work concentrates on the maintenance and facilitation of partners' profiles and competency management in such networks. The aim of our effort is to support potential partner identification during the VO creation and adaptation processes, as well as the facilitation of advertisement of oneself to be identified as a potential partner. The contributions of the work are the definition of competency and profile-related terms, the description of competency structures and an architecture of a competency and profiles management system, as well as a prototype verifying the presented theoretical work in a real business environment.
Fast Robber in Planar Graphs
Authors: Nicolas Nisse, Karol Suchan
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

In the cops and robber game, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the cops and the second one with one robber. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists in minimizing the number of cops used to capture the robber in a graph. This minimum number is called the cop-number of the graph. If the cops and the robber have the same velocity, $3+\frac{3}{2}g$ cops are sufficient to capture one robber in any graph with genus g (Schröder, 2001). In the particular case of a grid, 2 cops are sufficient.We investigate the game in which the robber is slightly faster than the cops. In this setting, we prove that the cop-number of planar graphs becomes unbounded. More precisely, we prove that $\Omega(\sqrt{\log n})$ cops are necessary to capture a fast robber in the n ×n square-grid. This proof consists in designing an elegant evasion-strategy for the robber. Then, it is interesting to ask whether a high value of the cop-number of a planar graph H is related to a large grid G somehow contained in H. We prove that it is not the case when the notion of containment is related to the classical transformations of edge removal, vertex removal, and edge contraction. For instance, we prove that there are graphs with cop-number at most 2 and that are subdivisions of arbitrary large grids. On the positive side, we prove that, if a planar graph H planar a large grid as an induced subgraph, then H has large cop-number. Note that, generally, the cop-number of a graph H is not closed by taking induced subgraphs G, even if H is planar and G is an distance-hereditary induced-subgraph.
A Web Based Pathfinder Service for Road Networks in India
Authors: Siddharth Jain, R. K. Ghosh
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

This paper is concerned with online personalized navigation services for road network systems in India. We study it as a path cost optimization problem on semi-structured graphs. Existing online services like Google Maps and Live Search Maps do not yet provide road navigation for India. Our strategy is based on the cognitive clustering process that humans use for finding a route between a source-destination pair over a real road network. A semi-automatic web based tool has been developed for collaborative community assisted creation of road maps by leveraging Google Maps services. Our experiments over real route maps indicate that the proposed algorithm performs very well with caching and provides more accurate navigational directions when compared with available web-based map services for Indian road network system.
The generic dimensions of the space of smooth splines of degree 7 on tetrahedral partitions
Authors: Xiquan Shi, Ben Kamau, Fengshan Liu, Baocai Yin
Venue: Journal of Approximation Theory (2009)

In this paper, we consider the spaces of once differentiable polynomial splines of degree 7 on tetrahedral partitions and give an expression for their generic dimensions.
On the transferability of private signatures
Authors: Javier Herranz
Venue: Information Sciences: an International Journal (2009)

In some situations, a user wants to sign a message in such a way that only a designated verifier is convinced of the validity of the signature, whereas other users cannot distinguish whether the signer has signed this message at all. In some cases, the signer may want to preserve this level of privacy forever, which means that the initial verifier should not be able to convince anyone else of the fact that the signer signed the message. In some other cases, the signer may want to give the initial verifier the possibility to transfer his conviction to someone else (maybe to everybody), when/if desired. In this paper we review this notion of private signatures, focusing on the level of transferability desired by the signer. We first consider the two extreme cases (non-transferability and complete transferability) which can be generically and efficiently solved by using very basic cryptographic primitives, as we show in this paper. Then we consider a case with partial transferability, for which we propose a generic solution based on the primitive of distributed ring signatures.
Ontology-based examinational students work retrieval
Authors: Dilyana Budakova, Lyudmil Dakovski
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Intelligent Virtual Agent (IVA) developments provide a new kind of interaction between the IVA and the human beings in front of the computer. Agents -- assistants that present lessons, ask questions about the lesson, and examine the students, are gladly received, with great interest from the students. Therefore we are working on modelling and investigating an IVA intended to help students in their preparation for a particular examination and to check their paper works after the examination. The agent's architecture includes a number of modules, such as: an emotional module; a motivational module; a module, comprising behavioural rules and meta-rules (principles); a module for acquisition and usage of knowledge; modules for visualization of the agent and animated pronunciation of texts. The agent's modules serve different steps: building an ontology of lectures; ontology-based recognition of the topic, on which a student has worked; natural language processing; semiautomatic creation and enrichment of the ontology of each lecture; ontology-based checking of the particular student's work (matching processing); loading up those slides from the lecture, which contain the information, omitted in the student's work; accumulation of statistical data related to the identified matches; change of the agent's condition; visualization of the agent and pronunciation of a text
Decomposition and composition of the properties of alternatives in multicriteria decision-making problems
Authors: A. N. Voronin
Venue: Cybernetics and Systems Analysis (2009)

It is shown that under the vector approach, the problem of making decisions by decomposing the properties of alternatives can be represented by a hierarchical system of criteria. At the lower hierarchy level, an alternative is evaluated for separate properties on the basis of a criterion vector and, at the upper level, a composition is used to evaluate the alternative as a whole. The problem is solved by the method of nested scalar convolutions of vector-valued criteria.
Algorithms for learning regular expressions from positive data
Authors: Henning Fernau
Venue: Information and Computation (2009)

We describe algorithms that directly infer very simple forms of 1-unambiguous regular expressions from positive data. Thus, we characterize the regular language classes that can be learned this way, both in terms of regular expressions and in terms of (not necessarily minimal) deterministic finite automata.
Online updating appearance generative mixture model for meanshift tracking
Authors: Jilin Tu, Hai Tao, Thomas Huang
Venue: Machine Vision and Applications (2009)

This paper proposes an appearance generative mixture model based on key frames for meanshift tracking. Meanshift tracking algorithm tracks an object by maximizing the similarity between the histogram in tracking window and a static histogram acquired at the beginning of tracking. The tracking therefore could fail if the appearance of the object varies substantially. In this paper, we assume the key appearances of the object can be acquired before tracking and the manifold of the object appearance can be approximated by piece-wise linear combination of these key appearances in histogram space. The generative process is described by a Bayesian graphical model. An Online EM algorithm is proposed to estimate the model parameters from the observed histogram in the tracking window and to update the appearance histogram. We applied this approach to track human head motion and to infer the head pose simultaneously in videos. Experiments verify that our online histogram generative model constrained by key appearance histograms alleviates the drifting problem often encountered in tracking with online updating, that the enhanced meanshift algorithm is capable of tracking object of varying appearances more robustly and accurately, and that our tracking algorithm can infer additional information such as the object poses.
Accuracy constraint determination in fixed-point system design
Authors: D. Menard, R. Serizel, R. Rocher, O. Sentieys
Venue: EURASIP Journal on Embedded Systems (2008)

Most of digital signal processing applications are specified and designed with floatingpoint arithmetic but are finally implemented using fixed-point architectures. Thus, the design flow requires a floating-point to fixed-point conversion stage which optimizes the implementation cost under execution time and accuracy constraints. This accuracy constraint is linked to the application performances and the determination of this constraint is one of the key issues of the conversion process. In this paper, a method is proposed to determine the accuracy constraint from the application performance. The fixed-point system is modeled with an infinite precision version of the system and a single noise source located at the system output. Then, an iterative approach for optimizing the fixed-point specification under the application performance constraint is defined and detailed. Finally the efficiency of our approach is demonstrated by experiments on an MP3 encoder.
Monotone piecewise rational cubic interpolation
Authors: Malik Zawwar Hussain, Muhammad Sarfraz
Venue: International Journal of Computer Mathematics (2009)

We present a C1 interpolating scheme to deal with the problem of monotonicity (that is when data is monotone, the interpolant should also preserve the monotonicity). The scheme uses piecewise rational cubic function, in a most general form which involves four free parameters in its description in each interval. We derive data dependent sufficient conditions on these parameters which ensure the monotonicity of monotone data. These parameters are also used to provide freedom to the user to refine the appearance of the curves interactively.
Numerical Approximation of a Free Boundary Problem for a Predator-Prey Model
Authors: Răzvan Ştefănescu, Gabriel Dimitriu
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

This paper is concerned with the numerical approximation of a free boundary problem associated with a predator-prey ecological model. Taking into account the local dynamic of the system, a stable finite difference scheme is used, and numerical results are presented.
Genetic Programming for Feature Ranking in Classification Problems
Authors: Kourosh Neshatian, Mengjie Zhang, Peter Andreae
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Feature ranking (FR) provides a measure of usefulness for the attributes of a classification task. Most existing FR methods focus on the relevance of a single feature to the class labels. Here, we use GP to see how a set of features can contribute towards discriminating different classes and then we score the participating features accordingly. The scoring mechanism is based on the frequency of appearance of each feature in a collection of GP programs and the fitness of those programs. Our results show that the proposed FR method can detect important features of a problem. A variety of different classifiers restricted to just a few of these high-ranked features work well. The ranking mechanism can also shrink the search space of size O(2 n ) of subsets of features to a search space of size O(n) in which there are points that may improve the classification performance.
Matrix-based streamization approach for improving locality and parallelism on FT64 stream processor
Authors: Xuejun Yang, Jing Du, Xiaobo Yan, Yu Deng
Venue: The Journal of Supercomputing (2009)

FT64 is the first 64-bit stream processor designed for scientific computing. It is critical to exploit optimizing streamization approaches for scientific applications on FT64 due to the inefficiency of direct streamization approach. In this paper, we propose a novel matrix-based streamization approach for improving locality and parallelism of scientific applications on FT64. First, a Data Computation Matrix is built to abstract the relationship between loops and arrays of the original programs, and it is helpful for formulating the streamization problem. Second, three key techniques for optimizing streamization approach are proposed based on the transformations of the matrix, i.e., coarse-grained program transformations, fine-grained program transformations, and stream organization optimizations. Finally, we apply our approach to ten typical scientific application kernels on FT64. The experimental results show that the matrix-based streamization approach achieves an average speedup of 2.76 over the direct streamization approach, and performs equally to or better than the corresponding Fortran programs on Itanium 2 except CG. It is certain that the matrix-based streamization approach is a promising and practical solution to efficiently exploit the tremendous potential of FT64.
A high-efficient inter-domain data transferring system for virtual machines
Authors: Dingding Li, Hai Jin, Yingzhe Shao, Xiaofei Liao
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Virtual machine (VM) technologies are becoming more and more important among industrial and academic institutions with the decreasing cost of computer hardware. It can offer a lot of benefits including performance isolation, server consolidation, and live migration. However, the development of virtualization technology is preferred to application isolation as yet, thus the performance overheads of communicate between virtual machines which are resident on the same physical machine are relatively high. In network-intensive applications, such as Internet servers, are consolidated in a physical machine using VM technology, the inter-domain shared memory communication mechanisms is necessary. In other words, nearly all the virtual machine monitors are not very efficient in I/O performance to meet these applications' requirements. As a result, some scholars resort to inter-domain shared memory mechanisms to improve data transferring performance, but some of these solutions only provide one-way tunnel for domains to communicate with each other, and others are not network-bypass, which use the existing AF_INET protocol family, and incur unnecessary overhead brought by TCP/IP stack. In this paper, we present an inter-domain data transferring system, called IDTS, with dual-way tunnels and fully network-bypass features in Xen virtual machine environment. The design of IDTS is different from virtual network scheme in that IDTS uses static circular memory buffer shared between domains instead of the Xen page-flipping mechanism. In order to enable dual-way communication, IDTS provides two shared memory tunnels for co-resident domains to communicate with each other. Our evaluation demonstrates that IDTS can reduce inter-domain round trip latency by nearly a factor of 4, and increase bandwidth by approximately 5 times, and also keep high scalability, compared with traditional TCP/IP approach.