ppxscal/embedding_network huggingface dataset:
An empirical analysis of algorithms for partially Clairvoyant scheduling
Authors: K. Subramani, D. Desovski
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

We contrast the performance of three algorithms for the problem of deciding whether a Partially Clairvoyant real-time system with relative timing constraints, as specified in the E-T-C scheduling framework, has a feasible schedule. In the E-T-C scheduling model, real-time scheduling problems are specified through a specialized class of constraint logic programs (CLPs) called Quantified Linear Programs (QLPs) [Subramani, K., 2003, An analysis of quantified linear programs. In: C.S. Calude (Ed.) Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS), volume 2731 of Lecture Notes in Computer Science, July (Springer-Verlag), pp. 265-277]; thus algorithms for determining the schedulability of instances are procedures to determine the satisfiability of CLPs. Two of these algorithms, viz., the primal algorithm and the dual algorithm have already been discussed in the literature, while a third algorithm called the randomized dual algorithm has been recently proposed [Subramani, K. and Desovski, D. 2005, A new verification procedure for partially Clairvoyant scheduling. Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), October; Subramani, K. and Desovski, D., 2005, Out of order quantifier elimination for standard quantified linear programs, Journal of Symbolic Computation, 40, 1383-1396]. Our experiments demonstrate that the dual-based algorithms (i.e. the dual and the randomized dual) are more effective from an implementational perspective; this is surprising since all three algorithms have the same worst case asymptotic complexity.
Imprecise probability trees: Bridging two theories of imprecise probability
Authors: Gert de Cooman, Filip Hermans
Venue: Artificial Intelligence (2008)

We give an overview of two approaches to probability theory where lower and upper probabilities, rather than probabilities, are used: Walley's behavioural theory of imprecise probabilities, and Shafer and Vovk's game-theoretic account of probability. We show that the two theories are more closely related than would be suspected at first sight, and we establish a correspondence between them that (i) has an interesting interpretation, and (ii) allows us to freely import results from one theory into the other. Our approach leads to an account of probability trees and random processes in the framework of Walley's theory. We indicate how our results can be used to reduce the computational complexity of dealing with imprecision in probability trees, and we prove an interesting and quite general version of the weak law of large numbers.
Industry evaluation of the Requirements Abstraction Model
Authors: Tony Gorschek, Per Garre, Stig B. M. Larsson, Claes Wohlin
Venue: Requirements Engineering (2007)

Software requirements are often formulated on different levels and hence they are difficult to compare to each other. To address this issue, a model that allows for placing requirements on different levels has been developed. The model supports both abstraction and refinement of requirements, and hence requirements can both be compared with each other and to product strategies. Comparison between requirements will allow for prioritization of requirements, which in many cases is impossible if the requirements are described on different abstraction levels. Comparison to product strategies will enable early and systematic acceptance or dismissal of requirements, minimizing the risk for overloading. This paper presents an industrial evaluation of the model. It has been evaluated in two different companies, and the experiences and findings are presented. It is concluded that the requirements abstraction model provides helpful improvements to the industrial requirements engineering process.
Comparative study of serial and parallel heuristics used to design combinational logic circuits
Authors: Enrique Alba, Gabriel Luque, Carlos A. Coello Coello, Erika Hernández Luna
Venue: Optimization Methods Software (2007)

In this article, we perform a comparative study of different heuristics used to design combinational logic circuits. This study mainly emphasizes the use of local search hybridized with a genetic algorithm (GA) and the impact of introducing parallelism. Our results indicate that a hybridization of a GA with a local search algorithm (simulated annealing) is beneficial and that the use of parallelism not only introduces a speedup in the algorithms compared (as expected) but also allows us to improve the quality of the solutions found.
The Dynamic Enterprise Bus
Authors: Dag Johansen, Håvard Johansen
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

In this paper we present a prototype enterprise information run-time heavily inspired by the fundamental principles of autonomic computing. Through self-configuration, self-optimization, and self-healing techniques, this run-time targets next-generation extreme scale information-access systems. We demonstrate these concepts in a processing cluster that allocates resources dynamically upon demand.
Approximation of initial loading of infinite-server systems
Authors: S. V. Anulova
Venue: Automation and Remote Control (2008)

For the isolated multi-server system with nonzero initial conditions, obtained were approximations which mark the first step toward solution of the problem of approximation for the networks with common initial conditions where at the initial instant the multi-server system is filled with customers whose empirical age distribution is approximated by a well-known distribution. A fundamentally new approach to the networks of multi-server systems was proposed: for closer approximation to practice, not only the initial conditions, but also the current state must be described in terms of measures.
Localization estimation for autonomous aerial navigation by matching images with different resolutions
Authors: Kamel Bensebaa, Mauricio Pozzobon Martins
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

Reliable localization is an essential component of a successful Autonomous Aerial Navigation. In order to get a precise position before navigation uncertainty becomes incorrigible, the main objective of this work is to investigate efficient algorithms for localization estimation for Autonomous Aerial Navigation by matching Images with Different Resolutions. In this work, we present an approach to localize the UAV (Unmanned Aerial Vehicle) in flight using matching images with different resolutions: a high-resolution image and a low-resolution one. This method consists of firstly to detect the landmarks or feature points in the images using the Harris corner detector. Secondly the method consists of automatic extraction of correspondence points between the first UAV video frame and a georeferengeced image. Finally we use a geometric model estimation to map the high-resolution image onto a low-resolution image, which results in position estimation of the UAV.
Towards acceleration of fault simulation using graphics processing units
Authors: Kanupriya Gulati, Sunil P. Khatri
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper, we explore the implementation of fault simulation on a Graphics Processing Unit (GPU). In particular, we implement a fault simulator that exploits thread level parallelism. Fault simulation is inherently parallelizable, and the large number of threads that can be computed in parallel on a GPU results in a natural fit for the problem of fault simulation. Our implementation fault-simulates all the gates in a particular level of a circuit, including good and faulty circuit simulations, for all patterns, in parallel. Since GPUs have an extremely large memory bandwidth, we implement each of our fault simulation threads (which execute in parallel with no data dependencies) using memory lookup. Fault injection is also done along with gate evaluation, with each thread using a different fault injection mask. All threads compute identical instructions, but on different data, as required by the Single Instruction Multiple Data (SIMD) programming semantics of the GPU. Our results, implemented on a NVIDIA GeForce GTX 8800 GPU card, indicate that our approach is on average 35 x faster when compared to a commercial fault simulation engine. With the recently announced Tesla GPU servers housing up to eight GPUs, our approach would be potentially 238&times; faster. The correctness of the GPU based fault simulator has been verified by comparing its result with a CPU based fault simulator.
Task scheduling in multiprocessing systems using duplication
Authors: Pranay Chaudhuri, Jeffrey Elcock
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of O(d|V|^3), where |V| represents the number of tasks and d the maximum indegree of tasks.
Derivation of Tests from Timed Specifications According to Different Coverage Criteria
Authors: Mercedes G. Merayo, Manuel Núñez
Venue: Proceedings of the Third International Conference on Systems (2008)

The main goal of this paper is to provide an algorithm to derive finite test suites, from timed specifications, according to a given coverage criterium. First, we introduce a timed extension of the finite state machines model. We consider that (output) actions take time to be performed. In addition to present our formalism, we develop a testing theory. Thus, we introduce a notion of timed test and define how to apply tests to implementations under test.
Combining unit-level symbolic execution and system-level concrete execution for testing nasa software
Authors: Corina S. Pǎsǎreanu, Peter C. Mehlitz, David H. Bushnell, Karen Gundy-Burlet, Michael Lowry, Suzette Person, Mark Pape
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We describe an approach to testing complex safety critical software that combines unit-level symbolic execution and system-level concrete execution for generating test cases that satisfy user-specified testing criteria. We have developed Symbolic Java PathFinder, a symbolic execution framework that implements a non-standard bytecode interpreter on top of the Java PathFinder model checking tool. The framework propagates the symbolic information via attributes associated with the program data. Furthermore, we use two techniques that leverage system-level concrete program executions to gather information about a unit's input to improve the precision of the unit-level test case generation. We applied our approach to testing a prototype NASA flight software component. Our analysis helped discover a serious bug that resulted in design changes to the software. Although we give our presentation in the context of a NASA project, we believe that our work is relevant for other critical systems that require thorough testing.
Fuzzy region connection calculus: An interpretation based on closeness
Authors: Steven Schockaert, Martine De Cock, Chris Cornelis, Etienne E. Kerre
Venue: International Journal of Approximate Reasoning (2008)

One of the key strengths of the region connection calculus (RCC) - its generality - is also one of its most important drawbacks for practical applications. The semantics of all the topological relations of the RCC are based on an interpretation of connection between regions. Because of the manner in which the spatial relations are defined, given a particular interpretation of connection, the RCC relations are often hard to evaluate, and their semantics difficult to grasp. Our generalization of the RCC, in which the spatial relations can be fuzzy relations, inherits this limitation of the RCC. To cope with this, in this paper, we provide specific characterizations of the fuzzy spatial relations, corresponding to the particular case where connection is defined in terms of closeness between fuzzy sets. These characterizations pave the way for practical applications in which the notion of connection is graded rather than black-and-white.
Constructing Computer Assisted Dispute Resolution Systems by Developing a Generic Language to Analyse Information Exchange in Conflict Discourse
Authors: Berry Zondag, Arno R. Lodder
Venue: International Review of Law, Computers and Technology (2007)

Online dispute resolution (ODR) may be described as an attempt to use the internet to mainstream alternative dispute resolution (ADR). The question how conflict resolution and information technology interact at a fundamental level has received little attention. Improving information exchange about the substantive issues in a conflict prevents escalation of conflict and assists in resolution. Dispute resolution always involves separation of substantive and emotional issues. This is achieved by means of the process and/or by the involvement of the neutral. Creating ODR systems thus involves the question how this 'separation' may be automated. This paper reports on a project of which the ultimate goal is to create a generic Computer Assisted Dispute Resolution (CADR) system by analysing the structure of conflict and the role of information exchange in it.
Finding the k shortest paths
Authors: D. Eppstein
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m+n log n+k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m+n log n+kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, and maximum inscribed polygons.
Speech Enhancement Using Masking of Noisy Power Estimates
Authors: Soojeong Lee, Soonhyob Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Speech enhancement algorithm is proposed for various noise environments. It is based on calculating the ratio of the standard deviation (STD) of the noisy power spectrum in time-frequency bins to its normalized time-frequency average. If the ratio greater than the adaptive threshold, speech is considered to be present. Our adaptive algorithm tracks the threshold and controls the trade-off between residual noise and distortion. The algorithm has the advantages of simplicity and light computational load for estimating the noise. Specifically, this algorithm reduces the residual noise significantly, and is superior to conventional methods.
Corouting: An IP Hybrid Routing Approach
Authors: Fadi Bizri, Brunilde Sansò
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

We propose a hybrid routing scheme that combines traditional shortest-path based OSPF mechanisms as well as a new form of explicit routing executed at the ?ow level. The scheme consists of ?nding explicit routes for real-time UDP ?ows, on network links that -at ?ow entry time-do not present more than 50% bandwidth utilisation. As for TCP packets, they will be routed on the unique least-cost path found through standard Link State algorithms. The approach improves the robustness and scalability of the network, thanks to its inherent traf?c engineering mechanisms and offers better overall service for jitter and delay-sensitive real-time traf?c.
Geometrically Reciprocal Authentication Scheme Using Shift Tangent Line in Ad Hoc Network Systems
Authors: Chung-Wei Chen, Shiuh-Jeng Wang, Yuh-Ren Tsai
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this paper, we propose a pairwise key scheme in order to setup a secure link between sender and receiver in an ad hoc network. It is a reciprocal authentication among node communications. The operating techniques are inspired by the Shamir secret sharing scheme. The robustness of our scheme is based on the DH problem and the indefinite solutions on coordinate geometry. With our scheme, the sender and receiver can authenticate each other and the pairwise key that they use may be refreshed each session.
Application-driven floorplan-aware voltage island design
Authors: Dipanjan Sengupta, Resve Saleh
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Among the different methods of reducing power for core-based system-on-chip (SoC) designs, the voltage island technique has gained in popularity. Assigning cores to the different supply voltages and floorplanning to create contiguous voltage islands are the two important steps in the design process. We propose a new application-driven, floorplan-aware approach to voltage partitioning and island creation with the objective of reducing overall SoC power, area and runtime. Previous approaches used the voltage assignment table as the starting point for voltage island creation. In this paper, we present a technique to generate a voltage assignment table using dynamic programming. Next, we partition the cores into islands, based on the Power State Model (PSM) of the application, and connectivity information used in floorplanning. Finally, solutions are sent to the floorplanner in sequence until a valid solution is reached. Compared to previously reported techniques, a 10% reduction in power and 8% reduction in area are achieved using our approach, with an average runtime improvement of 2.3X.
Incorporating psychology model of emotion into ant colony optimization algorithm
Authors: Jiann-Horng Lin, Meei-Ru Lin, Chain-Hao Lee
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This paper presents a modification of the ant colony optimization algorithm (ACO) intended to introduce psychology factor of emotion into the algorithm. We define only two emotions ants could have, positive and negative, and correspond to two reaction to perception respectively. For avoiding premature convergence allows Emotional Ant Colony Optimization (EACO) to continue search for better even best optimization in difficult optimization problems, reaching better solutions than ACO with a faster convergence speed.
On two Tur&aacute;n Numbers
Authors: Jian Shen
Venue: Journal of Graph Theory (2006)

Let H(3,1) denote the complete bipartite graph K3,3 with an edge deleted. For given graphs G and F, the Tur&aacute;n numbers (G, F) denote the maximum number of edges in a subgraph of G containing no copy of F. We prove that ${\rm ex} (K_{n,n}, H(3,1)) \le ({4 / \sqrt 7}n ^{3/2} +O(n) \approx 1.5119 n ^{3/2} +O(n)$) and that ${\rm ex} (K_{n}, H(3,1)) \le (1/5) \sqrt {15 }\ n^{3/2} +O(n) \approx 0.7746 n ^{3/2} \,+ O(n)$, which improve earlier results of Mubayi-West [13] and F&uuml;redi-West [10], respectively. The generalized Ramsey parameter r(G, F, q) denotes the minimum number of colors needed to edge-color G such that every copy of F in G receives at least q colors. As an immediate consequence, the above results imply that $r(K_{n,n}, K_{3,3}, 3) > (\sqrt 7 /4 -o(1) ) \sqrt n \approx (0.6614 -o(1) ) \sqrt n$ and that $r(K_{n}, K_{3,3}, 3) > ( \sqrt {15}/6 -o(1) ) \sqrt n \approx ( 0.6455 -o(1) ) \sqrt n$, respectively. These improve the corresponding bounds given by Mubayi [12] recently. &copy; 2005 Wiley Periodicals
A Secure High-Speed Identification Scheme for RFID Using Bloom Filters
Authors: Yasunobu Nohara, Sozo Inoue, Hiroto Yasuura
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

As pervasive computing environments become popular, RFID tags are introduced into our daily life. However, there exists a privacy problem that an adversary can trace users' behavior by linking the tag's ID. Although a hash-chain scheme can solve this privacy problem, the scheme needs a long identification time or a large amount of memory. In this paper, we propose an efficient identification scheme using Bloom filters, which are space-efficient probabilistic data structures. Our Bloom pre-calculation scheme provides a high-speed identification with a small amount of memory by storing pre-calculated outputs of the tags in Bloom filters.
Social tag prediction
Authors: Paul Heymann, Daniel Ramage, Hector Garcia-Molina
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper, we look at the "social tag prediction" problem. Given a set of objects, and a set of tags applied to those objects by users, can we predict whether a given tag could/should be applied to a particular object? We investigated this question using one of the largest crawls of the social bookmarking system del.icio.us gathered to date. For URLs in del.icio.us, we predicted tags based on page text, anchor text, surrounding hosts, and other tags applied to the URL. We found an entropy-based metric which captures the generality of a particular tag and informs an analysis of how well that tag can be predicted. We also found that tag-based association rules can produce very high-precision predictions as well as giving deeper understanding into the relationships between tags. Our results have implications for both the study of tagging systems as potential information retrieval tools, and for the design of such systems.
A Computerized Diagnostic Model Based on Naive Bayesian Classifier in Traditional Chinese Medicine
Authors: Huiyan Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Traditional Chinese Medicine (TCM) is one of the most important complementary and alternative medicines. In this paper, a novel computerized diagnostic model is proposed for promoting standardization and popularization of TCM diagnosis. Firstly, the symptoms are selected by learning Bayesian network structure from a database of cases incorporating with mutual information theory. The Markov blanket of the target variable in the structure is selected as symptom set. Secondly, the mapping relationships between the symptom set and diagnostic results are constructed based on naive Bayesian classifier. The model is used to make the quantitative diagnosis of apoplexy and obtains relative reliable predictions. The rate of predictive accuracy in diagnosing apoplexy reaches 96.7%. The results suggest that the model constructed is feasible and effective and can be expected to be useful in the modernization of TCM.
Towards Identifying Usability and Security Features of Graphical Password in Knowledge Based Authentication Technique
Authors: Muhammad Daniel Hafiz Abdullah, Abdul Hanan Abdullah, Norafida Ithnin, Hazinah Kutty Mammi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Text-based passwords are ubiquitous authentication system. This traditional authentication system is well-known for it flaws in the aspects of usability and security issues that bring problems to users. Hence, there is a need for alternative mechanism to overcome these problems. Graphical passwords, which consist of clicking or dragging activities on the pictures rather than typing textual characters, might be the option to overcome the problems that arise from the text-based passwords system. In this paper, a comprehensive study of the existing graphical password schemes is performed. We compared and categorized these schemes into two groups; recognition-based scheme and recall-based scheme. We also list out several usability and security features for research continuity in this area.