ppxscal/embedding_network huggingface dataset:
Spline Fit Made Easy
Authors: Ming-Lei Liou
Venue: IEEE Transactions on Computers (1976)

In this paper, a new algorithm for a cubic spline fit with equally spaced data points and given end conditions is described. It provides a new understanding of how a spline fit works and possesses the following computational advantages: 1) It can solve large size problems (virtually unlimited). 2) The accuracy can be realistically controlled based on the characteristics of data. 3) The computation time-is linearly proportional to the size of the problem. 4) It can handle a localized fit. 4) It can handle a localizd. The new algorithm is particularly suitable to be implemented in minicomputers for cutting surfaces by numerically controlled machines and for other applications.
Laser Menace Identifying Based on Fuzzy Decision
Authors: Tao Shen, Jian-she Song
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Identification of laser menaces is an important aspect in laser warning and data disposing. The identifying method has direct effect on its veracity. Based on the fact that technique parameters of laser signal have some fuzzy characters in presenting menaces, a method of identifying laser menaces based on such as fuzzy decision is presented. The fuzziness mathematical models of laser technique parameters laser energy, wavelength, repeat frequency, and fuzzy decision rules library of identifying laser menaces are built, which are set up by using fuzzy decision theory. Professional system of fuzzy decision is designed. Using different kinds of sensors orientation, wavelength, repeat frequency, and in the laser characteristic warning of pulse system, such as laser are acquired. In virtue of the professional system of fuzzy decision, the type of the laser menace is identified. Simulation result shows practical value and method is the most feasible.
A novel Cognitive Radio Concept deploying Petri Net based Scheduling
Authors: A. Viessmann, A. Burnic, C. Spiegel, G. H. Bruck, P. Jung
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

This paper will give a detailed discussion about the authors view on Software Defined and Cognitive Radio. After an introduction on different aspects of software radio and a novel approach on cognitive radio is presented. As proof of concept a software defined cognitive radio demonstrator termed Falcon was built up which is described afterwards. The Falcon is entirely based on a modular signal processing concept. In particular, the receiver deploys modules which process and generate log-likelihood ratio (LLR) signals, hence, providing the capability of a plug-and-play-type reconfigurability.
Structured Programming: a Review of Some Practical Concepts
Authors: C. McGowan
Venue: Computer (1975)

The software development process is being reexamined critically these days. There are at least two reasons for this renewed scrutiny: First, the inexorable advance of hardware technology has now made software costs the clearly dominant component of computing costs. Second, amidst the furor over SP, we have collectively realized that we can indeed do better (in at least the coding subprocess of software production). This realization leads us to reconsider current design and implementation strategies for possibly better ways.
Comparative annotation of viral genomes with non-conserved gene structure
Authors: Saskia de Groot, Thomas Mailund, Jotun Hein
Venue: Bioinformatics (2007)

Motivation: Detecting genes in viral genomes is a complex task. Due to the biological necessity of them being constrained in length, RNA viruses in particular tend to code in overlapping reading frames. Since one amino acid is encoded by a triplet of nucleic acids, up to three genes may be coded for simultaneously in one direction. Conventional hidden Markov model (HMM)-based gene-finding algorithms may typically find it difficult to identify multiple coding regions, since in general their topologies do not allow for the presence of overlapping or nested genes. Comparative methods have therefore been restricted to likelihood ratio tests on potential regions as to being double or single coding, using the fact that the constrictions forced upon multiple-coding nucleotides will result in atypical sequence evolution. Exploiting these same constraints, we present an HMM based gene-finding program, which allows for coding in unidirectional nested and overlapping reading frames, to annotate two homologous aligned viral genomes. Our method does not insist on conserved gene structure between the two sequences, thus making it applicable for the pairwise comparison of more distantly related sequences. Results: We apply our method to 15 pairwise alignments of six different HIV2 genomes. Given sufficient evolutionary distance between the two sequences, we achieve sensitivity of ~84–89% and specificity of ~97–99.9%. We additionally annotate three pairwise alignments of the more distantly related HIV1 and HIV2, as well as of two different hepatitis viruses, attaining results of ~87% sensitivity and ~98.5% specificity. We subsequently incorporate prior knowledge by ‘knowing’ the gene structure of one sequence and annotating the other conditional on it. Boosting accuracy close to perfect we demonstrate that conservation of gene structure on top of nucleotide sequence is a valuable source of information, especially in distantly related genomes. Availability: The Java code is available from the authors. Contact: degroot@stats.ox.ac.uk
On three families of extended tilde geometries
Authors: Antonio Pasini
Venue: European Journal of Combinatorics (2008)

Let @C be an extended tilde geometry of rank n>2 such that there exists a 1-covering @c:@C->@F where @F is a c.C"n"-"1-geometry with orders 1,2,...,2. Suppose that the normalizer in Aut(@C) of the deck group of @c acts flag-transitively on @C. We prove that, under these hypotheses, only three possibilities exist for the universal cover of @C.
A multi-agent architecture with cooperative fuzzy control for a mobile robot
Authors: Bianca Innocenti, Beatriz López, Joaquim Salvi
Venue: Robotics and Autonomous Systems (2007)

The challenges of robotics have led the researchers to develop control architectures composed of distributed, independent and asynchronous behaviors. One way to approach decentralization is through cooperative control, since it allows the development of complex behavior based on several controllers combined to achieve the desired result. Robots, however, require high-level cognitive capacities, and multi-agent architectures provide the appropriate level of abstraction to define them. This article describes a multi-agent architecture combined with cooperative control developed within the agent. The experiments were carried out on an ActivMedia Pioneer 2DX mobile robot.
On the Properties of Sensitized Paths
Authors: I. Koren
Venue: IEEE Transactions on Computers (1979)

In this note we investigate the conditions under which the paths which propagate a fault in a combinational network to the network output are not necessarily entirely sensitized.
Programming execution-time servers in Ada 2005
Authors: A. Burns, A. J. Wellings
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

Much of the research on scheduling schemes is prevented from being used in practice by the lack of implementations that provide the necessary abstractions. An example of this lack of provision is the support of execution-time servers, these important building blocks are not generally available to the system developer. In this paper, we show how new Ada 2005 mechanisms can be used to construct various execution-time servers. We also outline the different server types that could form part of a library of real-time utilities for Ada.
Real-time navigation of independent agents using adaptive roadmaps
Authors: Avneesh Sud, Russell Gayle, Erik Andersen, Stephen Guy, Ming Lin, Dinesh Manocha
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

We present a novel algorithm for navigating a large number of independent agents in complex and dynamic environments. We compute adaptive roadmaps to perform global path planning for each agent simultaneously. We take into account dynamic obstacles and inter-agents interaction forces to continuously update the roadmap by using a physically-based agent dynamics simulator. We also introduce the notion of 'link bands' for resolving collisions among multiple agents. We present efficient techniques to compute the guiding path forces and perform lazy updates to the roadmap. In practice, our algorithm can perform real-time navigation of hundreds and thousands of human agents in indoor and outdoor scenes.
Credit risk assessment with a multistage neural network ensemble learning approach
Authors: Lean Yu, Shouyang Wang, Kin Keung Lai
Venue: Expert Systems with Applications: An International Journal (2008)

In this study, a multistage neural network ensemble learning model is proposed to evaluate credit risk at the measurement level. The proposed model consists of six stages. In the first stage, a bagging sampling approach is used to generate different training data subsets especially for data shortage. In the second stage, the different neural network models are created with different training subsets obtained from the previous stage. In the third stage, the generated neural network models are trained with different training datasets and accordingly the classification score and reliability value of neural classifier can be obtained. In the fourth stage, a decorrelation maximization algorithm is used to select the appropriate ensemble members. In the fifth stage, the reliability values of the selected neural network models (i.e., ensemble members) are scaled into a unit interval by logistic transformation. In the final stage, the selected neural network ensemble members are fused to obtain final classification result by means of reliability measurement. For illustration, two publicly available credit datasets are used to verify the effectiveness of the proposed multistage neural network ensemble model.
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn
Authors: Nicholas J. A. Harvey
Venue: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (2008)

We consider the number of queries needed to solve the matroid intersection problem, a question raised by Welsh (1976). Given two matroids of rank r on n elements, it is known that O(nr1.5) independence queries suffice. However, no non-trivial lower bounds are known for this problem. We make the first progress on this question. We describe a family of instances of rank r = n/2 based on a pointer chasing problem, and prove that (log2 3) n-o (n) queries are necessary to solve these instances. This gives a constant factor improvement over the trivial lower bound of n for matroids of this rank. Our proof uses methods from communication complexity and group representation theory. We analyze the communication matrix by viewing it as an operator in the group algebra of the symmetric group and explicitly computing its spectrum.
Linux kernel integrity measurement using contextual inspection
Authors: Peter A. Loscocco, Perry W. Wilson, J. Aaron Pendergrass, C. Durward McDonell
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

This paper introduces the Linux Kernel Integrity Monitor (LKIM) as an improvement over conventional methods of software integrity measurement. LKIM employs contextual inspection as a means to more completely characterize the operational integrity of a running kernel. In addition to cryptographically hashing static code and data in the kernel, dynamic data structures are examined to provide improved integrity measurement. The base approach examines structures that control the execution flow of the kernel through the use of function pointers as well as other data that affect the operation of the kernel. Such structures provide an efficient means of extending the kernel operations, but they are also a means of inserting malicious code without modifying the static parts. The LKIM implementation is discussed and initial performance data is presented to show that contextual inspection is practical
A New Clustering Algorithm Based on Token Ring
Authors: Yongquan Liang, Jiancong Fan, Zhongying Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Token is a kind of symbol. It has some controlling powers. A special token-ring structure is designed according to the characteristics of the token. The token-ring structure consists of a controlling token and a sub-token. The controlling token includes some controlling information such as clustering center. The sub-token is designed to search for data and mark the qualified data. Based on the token-ring structure, a new clustering algorithm is designed. The algorithm can modify class structure dynamically in the process of clustering. The theoretical and practical analysis showed that the algorithm had good performances in some indexes, such as scalability, accuracy and velocity.
Built-in Self Testing of Embedded Memories
Authors: Sunil Jain, Charles Stroud
Venue: IEEE Design Test (1986)

The authors present a built-in self-test (BIST) method for testing embedded memories. Two algorithms are proposed for self-testingof embedded bedded RAMs, both of which can detect a large variety of stuck-at and non-stuck-at faults. The hardware implementationof the methods requires a hardware test-pattern generator, which produces address, data, and read/write inputs. The outputresponses of the memory can be compressed by using a parallel input signature analyzer, or they can be compared with expectedresponses by an output comparator. The layout of memories has been considered in the design of additional BIST circuitry.The authors conclude by evaluating the two schemes on the basis of area overhead, performance degradation, fault coverage,test application time, and testing of self-test circuitry. The BIST overhead is very low and test time is quite short. Sixdevices, with one of the test schemes, have been manufactured and are in the field.
Fuzzy Many-Valued Context Analysis Based on Formal Description
Authors: Wang Yan, Cao Baoxiang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Formal Concept Analysis (FCA) is an effective formal tool for data analysis. However, when FCA is applied to documents knowledge discovery, there are many situations in which uncertainty information also occurs. This paper proposed an approach to fuzzy many-valued context analysis by using formal descriptions instead of scaling. Within this approach, we extended the many-valued context by using the theory of Fuzzy Set. It certainly does not provide a better analysis than scaling, but it allows to do document knowledge discovery with the theory of FCA and to reduce the complexity of fuzzy concept lattice by using the conjunction and disjunction of confidence thresholds of different attributes.
Decoupling of Computation and Communication with a Communication Assist
Authors: Arno Moonen, Marco Bekooij, Rene van den Berg, Jef van Meerbergen
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In an embedded multiprocessor system the minimum throughput and maximum latency of real-time applications are usually derived given the worst-case execution time of the software tasks. Derivation of the worst-case execution time becomes easier if it is independent of the available communication bandwidth. In this paper we show that the worst-case execution time of tasks does not depend on communication bandwidth if a Communication Assist (CA) is applied, despite that memory ports are shared. Furthermore we show that adding a CA increases the processor utilization and reduces the required communication bandwidth. Finally we show that the difference between the measured and computed worst-case processor utilization is less than 6%, for our MP3 playback application.
Speech-filtered bubble ray: improving target acquisition on display walls
Authors: Edward Tse, Mark Hancock, Saul Greenberg
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

The rapid development of large interactive wall displays has been accompanied by research on methods that allow people to interact with the display at a distance. The basic method for target acquisition is by ray casting a cursor from one's pointing finger or hand position; the problem is that selection is slow and error-prone with small targets. A better method is the bubble cursor that resizes the cursor's activation area to effectively enlarge the target size. The catch is that this technique's effectiveness depends on the proximity of surrounding targets: while beneficial in sparse spaces, it is less so when targets are densely packed together. Our method is the speech-filtered bubble ray that uses speech to transform a dense target space into a sparse one. Our strategy builds on what people already do: people pointing to distant objects in a physical workspace typically disambiguate their choice through speech. For example, a person could point to a stack of books and say "the green one". Gesture indicates the approximate location for the search, and speech 'filters' unrelated books from the search. Our technique works the same way; a person specifies a property of the desired object, and only the location of objects matching that property trigger the bubble size. In a controlled evaluation, people were faster and preferred using the speech-filtered bubble ray over the standard bubble ray and ray casting approach.
Schemata evolution and building blocks
Authors: Chris Stephens, Henri Waelbroeck
Venue: Evolutionary Computation (1999)

In the light of a recently derived evolution equation for genetic algorithms we consider the schema theorem and the building block hypothesis. We derive a schema theorem based on the concept of effective fitness showing that schemata of higher than average effective fitness receive an exponentially increasing number of trials over time. The equation makes manifest the content of the building block hypothesis showing how fit schemata are constructed from fit sub-schemata. However, we show that, generically, there is no preference for short, low-order schemata. In the case where schema reconstruction is favored over schema destruction, large schemata tend to be favored. As a corollary of the evolution equation we prove Geiringer's theorem.
Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
Authors: Crina Grosan, Ajith Abraham
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficient point. Once the first Pareto solution is obtained, a simplified version of the former one is used in the context of Pareto dominance to obtain a set of efficient points, which will assure a thorough distribution of solutions on the Pareto frontier. In the current form, the proposed technique is well suitable for problems having multiple objectives (it is not limited to bi-objective problems) and require the functions to be continuous twice differentiable. In order to assess the effectiveness of this approach, some experiments were performed and compared with two recent well known population-based meta-heuristics. When compared to the population-based meta-heuristic, the proposed approach not only assures a better convergence to the Pareto frontier but also illustrates a good distribution of solutions. We propose a fuzzy logic controller to adapt the parameter required to control the distribution of solutions in the spreading phase. Our goal is to find a good distribution of solutions as quick as possible. From a computational point of view, both stages of the line search converge within a short time (average about 150 milliseconds for the first stage and about 20 milliseconds for the second stage). Apart from this, the proposed technique is very simple, easy to implement to solve multiobjective problems.
Robust iris location in close-up images of the eye
Authors: Emanuele Trucco, Marco Razeto
Venue: Pattern Analysis Applications (2005)

This paper presents a robust, reliable iris location system for close-up, grey scale images of a single eye. The system is meant as a bootstrap or recovery module for automated iris tracking within medical applications. We model the iris contour with an active ellipse, sensitive to intensity gradients across its perimeter. In this way, we avoid modelling the noisy appearance of the iris (e.g. corneal reflections). The iris&#x2013;sclera intensity transition is modelled at two spatial scales with Petrou&#x2013;Kittler optimal ramp filters. The optimal ellipse is identified by a simulated annealing algorithm tuned to the problem characteristics. The system performed accurately and robustly with 327 real images against substantial occlusion levels and varying image quality, subject, eye shape and skin colour.
Using the ROA Index to Analyze the Value of Optimum Stock
Authors: Songtao Wu, Feng Dai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

There are many analyses and evaluating indexes in economics that are of great importance to an enterprise's optimum stock decision. Based on the analysis of these indexes, this paper tends to propose a method about ROA (return of assets) that could be used in analyzing an enterprise's running situation, and give a suggested calculating method and solvable idea as well to an enterprise's optimum stock. Key words ROA optimum stock evaluating-index
Analyzing the vulnerability of superpeer networks against attack
Authors: Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy Ganguly
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degree dependent attack have been introduced here. We formally model the superpeer networks with the help of bimodal structure and different attacks with the help of graph dynamics. Our analysis shows that fraction of superpeers and their connectivity have profound impact upon the stability of the network. The results obtained from the theoretical analysis are validated through simulation. The agreement between the simulation results and theoretical predictions is almost perfect.
Characterizing PPStream across Internet
Authors: Jinkang Jia, Chunxi Li, Changjia Chen
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Since the appearance of various P2P IPTV systems which timely broadcast live streaming to peers, they have attracted millions of users from all over the world. It is reported that the online audience have reached more than 1.2 million in peak time by the official website of PPStream, one of the most popular IPTV system in China. However, at the same time the popularity of these systems make the amounts of video traffic grow exponentially. In order to study the global playback performance, users' behaviors and network characteristics as well, we developed our dedicated crawler of PPStream. Based on the measurements, we make some extensive performance evaluation on this commercially successful P2P IPTV system, and some characteristics on geographic clustering, connection stability, arrival/departure pattern, playback quality, sharing ratio and topology have been revealed. We think these findings can help other researchers model such streaming systems and system operators make further optimizations.