ppxscal/embedding_network huggingface dataset:
A Novel Website Structure Optimization Model for More Effective Web Navigation
Authors: Wen-long Lin, Ye-zheng Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

A novel website structure optimization model for more effective web navigation is proposed. First, web page group with low access efficiency is discovered by its support and its topology average distance; Then a measure degree, website topology interest, which can overall indicate the website access efficiency is proposed as guidance rule to optimize the website hyperlink structure; Finally, users' navigation are facilitated by optimizing website linkage structure that reduces the number of steps to locate their target web pages. Experiments result on a distance education website show that our approach is efficient and practical for adaptive website.
Particle graphics on reconfigurable hardware
Authors: John S. Beeckler, Warren J. Gross
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2008)

Particle graphics simulations are well suited for modeling complex phenomena such as water, cloth, explosions, fire, smoke, and clouds. They are normally realized in software as part of an interactive graphics application. The computational complexity of particle graphics simulations restricts the number of particles that can be updated in software at interactive frame rates. This article presents the design and implementation of a hardware particle graphics engine for accelerating real-time particle graphics simulations. We explore the design process, implementation issues, and limitations of using field-programmable gate arrays (FPGAs) for the acceleration of particle graphics. The FPGA particle engine processes million-particle systems at a rate from 47 to 112 million particles per second, which represents one to two orders of magnitude speedup over a 2.8 GHz CPU. Using three FPGAs, a maximum sustained performance of 112 million particles per second was achieved.
An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences
Authors: Elham Parvinnia, Mohammad Taheri, Kourush Ziarati
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The comparison of biological sequences is one of the oldest problems in computational biology. Global alignment is designed to search for highly similar regions in two DNA sequences, where appear in the same order and orientation. Longest Common Subsequence (LCS) is the most typical algorithm for global alignment that has optimal solution and independent to the shape of its input sequences. Since the space complexity of this algorithm is the multiplication of sequence lengths; we cannot use it for long sequences. In this paper, some rules are extracted to reduce amount of redundant information. Remained information is stacked to be used in backward iteration for finding the optimal path. As we examined in the proposed algorithm, the stack size in comparison with space consumed by LCS algorithm is reduced about 10 times and we could increase the length of input DNA sequences in global alignment.
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
Authors: Ki-Woong Park, Sang Seok Lim, Kyu Ho Park
Venue: IEEE Transactions on Computers (2008)

In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource constrained device leads to user-obstructive latency or an additional circuitry for the operations. To alleviate these limitations, we propose a new PKI-based authentication protocol and security infrastructure, PKASSO, which is enhanced with the single sign-on and delegation technology that is used especially for mobile devices with restricted computing power. The PKASSO offloads complex PKI operations from the mobile devices to the infrastructure so as to keep the hardware and software complexity of the devices as low as possible. In addition, even though a conventional delegation mechanism cannot support a non-repudiation mechanism against malicious user behavior, the PKASSO can provide such a mechanism by devising a referee server that, on the one hand, generates binding information between a device and authentication messages and, on the other hand, retains the information in its local storage for future accusation. We present the detailed design and performance evaluation of the PKASSO, and offer a protocol analysis in terms of user authentication latency and the completeness of the protocol.
Protectit: trusted distributed services operating on sensitive data
Authors: Jiantao Kong, Karsten Schwan, Min Lee, Mustaque Ahamad
Venue: ACM SIGOPS Operating Systems Review (2008)

Protecting shared sensitive information is a key requirement for today's distributed applications. Our research uses virtualization technologies to create and maintain trusted data paths across distributed machines, for the services being run and their information exchanges. For trusted data paths, runtime protection methods control what data is visible to which distributed services operating on it, guided by online monitoring that determines the levels of trust inherent in the paths' machines, services, and service actions. This paper presents a key functional element of trusted data paths, which is the ProtectIT interception mechanism for controlling the data exchanges between the different virtual machines running trusted services. ProtectIT can be applied to any communication and/or I/O performed by virtual machines, and because ProtectIT does not require application, middleware, or operating system modifications, it can be used to construct trusted data paths without the knowledge or consent of such entities. Further, since ProtectIT operates in virtual machines isolated from those used by applications, it is not subject to the attacks faced by services exposed to the open Internet. ProtectIT's functionality consists of dynamic protection rules represented as data filters applied to virtual machines' communications. Examples presented in this paper include email services for which ProtectIT's filters control data visibility to mail servers and clients, and unsecured virtual machine communications morphed into secure ones via ProtectIT-based message interception.
Perturb+mutate: Semisynthetic circuit generation for incremental placement and routing
Authors: David Grant, Guy Lemieux
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2008)

CAD tool designers are always searching for more benchmark circuits to stress their software. In this article we present a heuristic method to generate benchmark circuits specially suited for incremental place-and-route tools. The method removes part of a real circuit and replaces it with an altered version of the same circuit to mimic an incremental design change. The alteration consists of two steps: mutate followed by perturb. The perturb step exactly preserves as many circuit characteristics as possible. While perturbing, reproduction of interconnect locality, a characteristic that is difficult to measure reliably or reproduce exactly, is controlled using a new technique, ancestor depth control (ADC). Perturbing with ADC produces circuits with postrouting properties that match the best techniques known to-date. The mutate step produces targetted mutations resulting in controlled changes to specific circuit properties (while keeping other properties constant). We demonstrate one targetted mutation heuristic, scale, to significantly change circuit size with little change to other circuit characteristics. The method is simple enough for inclusion in a CAD tool directly, and fast enough for use in on-the-fly benchmark generation.
Linear subband predictive filters for wideband signals
Authors: Yan Wu
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this paper we present the design of multiband linear subband prediction (LSP) filters for wideband signals. A wideband signal is divided into narrowband subband signals via an array of lowpass/bandpass filters. A linear prediction filter is designed for each subband channel, which has its own designated frequency interval. The filter coefficients are fixed throughout the coding process. A closed form bound on the error of prediction shows that the LSP approach is accurate for wideband signals, which is further supported by simulations.
The role of context in query input: using contextual signals to complete queries on mobile devices
Authors: Maryam Kamvar, Shumeet Baluja
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

The difficulty of entering queries from impoverished keyboards impedes the use of web search on mobile devices. On average, it takes a mobile user approximately 60 seconds to enter a query from a 9-key keypad [1]. In this paper, we explore the use of contextual signals to facilitate query entry on mobile phones. We present a query prediction system which offers automatically generated word completions as the user is typing her query. The query prediction system redefines the prediction dictionary after considering contextual signals such as the application being used (e.g. search vs. general text messaging), the inferred location of the user, the time of day and day of week. We demonstrate a 46.4% improvement in query entry, measured by number of key presses needed to enter queries. We found that the two contextual signals that make the largest impact are knowledge of the application being used and the location of the user.
Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions
Authors: M. S. Paterson
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A general theory is developed for constructing the shallowest possible circuits and the shortest possible formulas for the carry-save addition of n numbers using any given basic addition unit. More precisely, it is shown that if BA is a basic addition unit with occurrence matrix N, then the shortest multiple carry-save addition formulas that could be obtained by composing BA units are of size n/sup 1/p+o(1)/, where p is the unique real number for which the L/sub p/ norm of the matrix N equals 1. An analogous result connects the delay matrix M of the basic addition unit BA and the minimal q such that multiple carry-save addition circuits of depth (q+o(1)) log n could be constructed by combining BA units. On the basis of these optimal constructions of multiple carry-save adders, the shallowest known multiplication circuits are constructed.
Conditional LZ Complexity of DNA Sequences Analysis and its Application in Phylogenetic Tree Reconstruction
Authors: Jingjun Liu, Dachao Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

A DNA sequence can be identified with a word over analphabet N =A, C, G, T. Characteristic sequences of a DNA sequence are given in term of classifications of bases of nucleic acids. Here we propose a new measure for the similarity analysis of DNA sequences. It is based on conditional LZ complexity and (0,1) characteristic sequences of DNA primary sequences. This measure enables biologists to extract similarity information from biological sequences according to their requirements. For example, by this measure, one can obtain either the full similarity information or a similarity analysis from a given biological aspect. Moreover,the length of DNA primary sequence is not problematic. This new measure has been applied to phylogenetic tree construction, Based on conditional LZ complexity distance matrix. The application of the measure to the phylogenetic tree construction of 22 species shows its flexibility.
Mining the classification rules: the egyptian rice diseases as case study
Authors: Mohammed E. El-Telbany
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Applications of learning algorithms in knowledge discovery are promising and relevant area of research. It is offering new possibilities and benefits in real-world applications, helping us understand better mechanisms of our own methods of knowledge acquisition. Decision trees is one of learning algorithms which posses certain advantages that make it suitable for discovering the classification rule for data mining applications. This paper, intended to discover classification rules for the Egyptian rice diseases using the C4.5 decision trees algorithm. Experiments presenting a preliminary result to demonstrate the capability of C4.5 mine accurate classification rules suitable for diagnosis the disease.
On the numerical solutions of second order macroscopic models of pedestrian flows
Authors: C. Dogbé
Venue: Computers Mathematics with Applications (2008)

The main target of this paper is focused on the numerical simulation of macroscopic models-two-dimensional hyperbolic conservation law - of pedestrian flows. Therefore, finite volume methods can be used to discretize the equations. Actually, the algorithms that have been used are particularly suited for solving hyperbolic problems. Moreover, simulations using first order accurate numerical solvers and first Godunov type schemes [S.K. Godunov, A finite difference method for the numerical computation of discontinuous solutions of the equations of fluid dynamics, Mathematik Sbornik 47 (1959) 271-290] have been developed. This article is motivated by recent research activity focused on the problem of modelling systems of the living matter.
Resource allocation in grid computing
Authors: Ger Koole, Rhonda Righter
Venue: Journal of Scheduling (2008)

Grid computing, in which a network of computers is integrated to create a very fast virtual computer, is becoming ever more prevalent. Examples include the TeraGrid and Planet-lab.org, as well as applications on the existing Internet that take advantage of unused computing and storage capacity of idle desktop machines, such as Kazaa, SETI@home, Climateprediction.net, and Einstein@home. Grid computing permits a network of computers to act as a very fast virtual computer. With many alternative computers available, each with varying extra capacity, and each of which may connect or disconnect from the grid at any time, it may make sense to send the same task to more than one computer. The application can then use the output of whichever computer finishes the task first. Thus, the important issue of the dynamic assignment of tasks to individual computers is complicated in grid computing by the option of assigning multiple copies of the same task to different computers. We show that under fairly mild and often reasonable conditions, maximizing task replication stochastically maximizes the number of task completions by any time. That is, it is better to do the same task on as many computers as possible, rather than assigning different tasks to individual computers. We show maximal task replication is optimal when tasks have identical size and processing times have a NWU (New Worse than Used; defined later) distribution. Computers may be heterogeneous and their speeds may vary randomly, as is the case in grid computing environments. We also show that maximal task replication, along with a c μ rule, stochastically maximizes the successful task completion process when task processing times are exponential and depend on both the task and computer, and tasks have different probabilities of completing successfully.
Randomness-efficient oblivious sampling
Authors: M. Bellare
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log /spl delta//sup -1//spl middot/log l) coins to output m=poly(/spl epsiv//sup -1/, log /spl delta//sup -1/, log l) sample points x/sub 1/, ..., x/sub m/, /spl isin/ {0, 1}/sup 1/ such that Pr[|1/m/spl Sigma//sub i=1//sup m/f(x/sub i/)-E[f]|
Sub-optimal Step-by-Step Node Deployment Algorithm for User Localization in Wireless Sensor Networks
Authors: Yuh-Ren Tsai, Yuan-Jiun Tsai
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

User/object localization is one of the promising applications for WSNs. So far, there is no flexible node deployment algorithm targeting on optimizing the lo-calization performance. To facilitate node deployment for localization applications in WSNs, we propose, based on a universal performance evaluation metric, a low-complexity, step-by-step node deployment algorithm which provides sub-optimal solutions feasible for large-scale WSNs. This proposed node deployment algorithm has the computational complexity linearly proportional to the number of available nodes, and is flexible for different system scenarios, including the cases with a non-homogeneous user distribution and with an irregular sensing area. The performance of our proposed algorithm is compared with some other available benchmarks. It is found that the proposed deployment algorithm can provide flexible network topologies with very good location estimation performance.
Soft Body Simulation with Leaking Effect
Authors: Jaruwan Mesit, Ratan K. Guha
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Though there is much research on physically-based animation of soft bodies, simulating soft body objects in real-time remains challenging problem. This paper presents an algorithm for simulating leaking effects in real-time soft body simulations where fast calculation is priority. To simulate leaking effects in a soft body, geometrical cases of broken springs are defined and an algorithm rearranges the topology of neighbors in which the broken springs are connected. Then, internal forces are applied to surface points to model the leaking effect and deform the soft body. Experiments show that the soft body objects with leaking effects can be realistically simulated at interactive speeds on common hardware.
Context-based Profiling for Anomaly Intrusion Detection with Diagnosis
Authors: Benferhat Salem, Tabia Karim
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Anomaly detection approaches are generally efficient in detecting new attacks. However, they fail in providing any further information regarding the nature of attacks. The first contribution of this paper is to equip an anomaly detection approach with a diagnosis module that classifies anomaly approach outputs in one among well known attack categories. The second contribution concerns a context-based definition of normal network traffic profiles. We provide experimental studies showing for instance that considering normal profile for each service provides better results than considering a unique global normal profile.
Design and architecture for an embedded 32-bit QueueCore
Authors: Ben A. Abderazek, Sotaro Kawata, Masahiro Sowa
Venue: Journal of Embedded Computing (2006)

Queue based instruction set architecture processor offers an attractive option in the design of embedded systems by providing high performance for a specific application. This work describes the design results and methodology of a queue processor core, named QueueCore, as a starting point for application-specific processor (ASP) design. By using simple and common base queue instruction set, the design space exploration is focused on the application-specific aspects of performance. In any new architecture, verification, which usually requires complicated and lengthy software simulation of an emulated model, is an important aspect. We show how cooperative hardware emulation, based on programmable logic, can be integrated into a co-design flow to evaluate the performance of the novel QueueCore processor and to verify the functional correctness of a specific benchmark on the system core. To avoid duplication of the design effort, different target implementations are derived from a common source. We present the evaluation results of the QueueCore for three different platforms.
Topologically-constrained latent variable models
Authors: Raquel Urtasun, David J. Fleet, Andreas Geiger, Jovan Popović, Trevor J. Darrell, Neil D. Lawrence
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In dimensionality reduction approaches, the data are typically embedded in a Euclidean latent space. However for some data sets this is inappropriate. For example, in human motion data we expect latent spaces that are cylindrical or a toroidal, that are poorly captured with a Euclidean space. In this paper, we present a range of approaches for embedding data in a non-Euclidean latent space. Our focus is the Gaussian Process latent variable model. In the context of human motion modeling this allows us to (a) learn models with interpretable latent directions enabling, for example, style/content separation, and (b) generalise beyond the data set enabling us to learn transitions between motion styles even though such transitions are not present in the data.
Supporting Evolving Multi-agent Systems with a System Evolution Directory
Authors: Bin Lu, Leon Sterling, Kuldar Taveter
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

In order to describe how a structure - System Evolution Directory (SED), can be used to facilitate the evolution of multi-agent systems, we first introduce a case study on citation finding. We use this case study to explain the components within a SED and the process to build a SED. A unified and simple model directory is used to describe the life cycle of a system and a goal model to describe the meaning among system artefacts. Developers can not only get all necessary information ranging from high level system requirements to low level source code from the model, but also can understand semantic connections between system artefacts. Different versions of a system can be recorded easily in the structure. We believe the structure has potential for further speeding up and automating the process of system evolution. All in all, the structure complements current agent-oriented methodologies.
Mining pure linguistic associations from numerical data
Authors: Vilém Novák, Irina Perfilieva, Antonín Dvořák, Guoqing Chen, Qiang Wei, Peng Yan
Venue: International Journal of Approximate Reasoning (2008)

This paper contains a method for direct search of associations from numerical data that are expressed in natural language and so, we call them ''linguistic associations''. The associations are composed of evaluative linguistic expressions, for example ''small, very big, roughly medium'', etc. The main idea is to evaluate real-valued data by the corresponding linguistic expressions and then search for associations using some of the standard data-mining technique (we have used the GUHA method). One of essential outcomes of our theory is high understandability of the found associations because when formulated in natural language they are much closer to the way of thinking of experts from various fields. Moreover, associations characterizing real dependencies can be directly taken as fuzzy IF-THEN rules and used as expert knowledge about the problem.