ppxscal/embedding_network huggingface dataset:
Computational intelligence and active networks
Authors: Behzad Moshiri, Mahdi Jalili-Kharaajoo
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

In this paper, some application of computational intelligence techniques in active networking technology well be presented. Computational intelligent techniques, e.g., neural networks, fuzzy systems, neuro-fuzzy systems, and evolutionary algorithms have been successfully applied for many engineering problems. The introduction of active networking adds a high degree of flexibility in customizing the network infrastructure and introduces new functionality. Therefore, there is a clear need for investigating both the applicability of computational intelligence techniques in this new networking environment, as well as the provisions of active networking technology that computational intelligence techniques can exploit for improved operation.
Revealing Significant Biological Knowledge via Gene Ontologies and Pathways
Authors: Michalis E. Blazadonakis, Michalis Zervakis
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Many scientific works in the field of bioinformatics and marker selection deal with the problem of deriving a gene signature with significant statistical properties without paying much attention on the biological aspect of the produced result. In this paper we asses the problem of revealing possible significant knowledge which might be hidden under a given gene signature, using previous biological information provided through gene ontologies and pathways.
Compiler-driven register re-assignment for register file power-density and temperature reduction
Authors: Xiangrong Zhou, Chenjie Yu, Peter Petrov
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Temperature hot-spots have been known to cause severe reliability problems and to significantly increase leakage power. The register file has been previously shown to exhibit the highest temperature compared to all other hardware components in a modern high-end embedded processor, which makes it particularly susceptible to faults and elevated leakage power. We show that this is mostly due to the highly clustered register file accesses where a set of few registers physically placed close to each other are accessed with very high frequency. In this paper we propose a compiler-based register reassignment methodology, which purpose is to break such groups of registers and to uniformly distribute the accesses to the register file. This is achieved with no performance and no hardware overheads. We show that the underlying problem is NP-hard, and subsequently introduce an efficient algorithmic heuristic.
Bringing School Science to Life: Personalization, Contextualization and Reflection of Self-Collected Data
Authors: Dawn Woodgate, Danaë Stanton Fraser, Mark Paxton, David Crellin, Adrian Woolard, Teresa Dillon
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

We investigate the use of mobile and sensor technologies for school science investigations, to bring about a more engaging and hands-on approach to science learning. We report early findings from two trials carried out within the Participate project, where schoolchildren were given a range of off the shelf and newly developed technologies to carry out data collection and analysis tasks. Indications are that, not only are the tasks engaging for the pupils, but aspects such as personalization of data, contextual information, and reflection upon both the data and its collection, are important factors in obtaining and retaining their interest.
Elliptic curve cryptography
Authors: Vivek Kapoor, Vivek Sonny Abraham, Ramesh Singh
Venue: Ubiquity (2008)

This paper describes the Elliptic Curve Cryptography algorithm and its suitability for smart cards.
Towards Improving Visual-Facial Emotion Recognition through Use of Complementary Keyboard-Stroke Pattern Information
Authors: George A. Tsihrintzis, Maria Virvou, Efthymios Alepis, Ioanna-Ourania Stathopoulou
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we investigate the possibility of improving the accuracy of visual-facial emotion recognition through use of additional (complementary) keyboard-stroke information. The investigation is based on two empirical studies that we have conducted involving human subjects and human observers. The studies were concerned with the recognition of emotions from a visual-facial modality and keyboard-stroke information, respectively. They were inspired by the relative shortage of such previous research in empirical work concerning the strengths and weaknesses of each modality so that the extent can be determined to which the keyboard-stroke information complements and improves the emotion recognition accuracy of the visual-facial modality. Specifically, our research focused on the recognition of six basic emotion states, namely happiness, sadness, surprise, anger and disgust as well as the emotionless state which we refer to as neutral. We have found that the visual-facial modality may allow the recognition of certain states, such as neutral and surprise, with sufficient accuracy. However, its accuracy in recognizing anger and happiness can be improved significantly if assisted by keyboard-stroke information.
Analytical and Numerical Analysis of Fringing Field at Aperture Open-Ended Waveguides
Authors: You Kok Yeow, Zulkifly Abbas
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents an improved formulation of the admittance model for open-ended waveguides by including its fringing field effects. The results were compared to both measured and calculated values using finite element method for free space.
Contextual motion field-based distance for video analysis
Authors: Yadong Mu, Shuicheng Yan, Thomas Huang, Bingfeng Zhou
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

In this work, we propose a general method for computing distance between video frames or sequences. Unlike conventional appearance-based methods, we first extract motion fields from original videos. To avoid the huge memory requirement demanded by the previous approaches, we utilize the &#x201c;bag of motion vectors&#x201d; model, and select Gaussian mixture model as compact representation. Thus, estimating distance between two frames is equivalent to calculating the distance between their corresponding Gaussian mixture models, which is solved via earth mover distance (EMD) in this paper. On the basis of the inter-frame distance, we further develop the distance measures for both full video sequences. Our main contribution is four-fold. Firstly, we operate on a tangent vector field of spatio-temporal 2D surface manifold generated by video motions, rather than the intensity gradient space. Here we argue that the former space is more fundamental. Secondly, the correlations between frames are explicitly exploited using a generative model named dynamic conditional random fields (DCRF). Under this framework, motion fields are estimated by Markov volumetric regression, which is more robust and may avoid the rank deficiency problem. Thirdly, our definition for video distance is in accord with human intuition and makes a better tradeoff between frame dissimilarity and chronological ordering. Lastly, our definition for frame distance allows for partial distance.
Cryptography and canonical number systems in quadratic fields
Authors: Viktor Fedoseev, Vladimir Chernov
Venue: Machine Graphics Vision International Journal (2006)

This paper proposes an encryption method based on representation of messages in the canonical number systems (CNS) in quadratic fields. The essence of the encryption method is conversion of the representation of integers from the conventional number system to their representation in the CNS in a certain quadratic field. A sufficiently wide range of CNS with a given number of digits ensures resistance of the method to "accidental guessing" of the secret keys. Nonlinear nature of the conversion ensures its resistance to frequency analysis.
Object/relational mapping 2008: hibernate and the entity data model (edm)
Authors: Elizabeth J. O'Neil
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Object/Relational Mapping (ORM) provides a methodology and mechanism for object-oriented systems to hold their long-term data safely in a database, with transactional control over it, yet have it expressed when needed in program objects. Instead of bundles of special code for this, ORM encourages models and use of constraints for the application, which then runs in a context set up by the ORM. Today's web applications are particularly well-suited to this approach, as they are necessarily multithreaded and thus are prone to race conditions unless the interaction with the database is very carefully implemented. The ORM approach was first realized in Hibernate, an open source project for Java systems started in 2002, and this year is joined by Microsoft's Entity Data Model for .NET systems. Both are described here.
Extracting related named entities from blogosphere for event mining
Authors: Yoshihiko Suhara, Hiroyuki Toda, Akito Sakurai
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

We propose a method of extracting named entities that are related to a single input word. Focusing on the syntactic dependency relation in sentences, it is reasonable to extract a case element that syntactically depends on the predicate that the input word depends on. In Japanese, though, a word which has appeared in a previous sentence is often omitted or replaced. Our proposed method, first, extracts "predicate patterns" consisting of case elements with case particles and a predicate. Then it combines predicate patterns that have the same predicate to form possible unabridged dependence relations.
An Efficient Method for Sampling and Computing Molecular Surface
Authors: Junping Xiang, Maolin Hu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

An atom-centered protocol based method for surface sampling in grid space is proposed. Van der Waals, solvent-accessible and solvent-excluded surface can be generated in a unified framework. A spherical hash function is used to mark whether the points are inside a sphere, and the hash tables are used to record which spheres the surface points locate on. The proposed method can be modified to apply in the parallel computation directly, which is useful for molecular dynamics simulation, docking and surface comparison and so on. Our tests indicate that the proposed method is efficient and the generated surfaces are suitable for quantitative analysis and visualization.
Augmenting reflective middleware with an aspect orientation support layer
Authors: Bholanathsingh Surajbali, Geoff Coulson, Phil Greenwood, Paul Grace
Venue: Proceedings of the 6th international workshop on Adaptive and reflective middleware: held at the ACM/IFIP/USENIX International Middleware Conference (2007)

Reflective middleware provides an effective way to support adaptation in distributed systems. However, as distributed systems become increasingly complex, certain drawbacks of the reflective middleware approach are becoming evident. In particular, reflective APIs are found to impose a steep learning curve, and to place too much expressive power in the hands of developers. Recently, researchers in the field of Aspect-Oriented Programming (AOP) have argued that 'dynamic aspects' show promise in alleviating these drawbacks. In this paper, we report on work that attempts to combine the reflective middleware and AOP approaches. We build an AOP support layer on top of an underlying reflective middleware substrate in such a way that it can be dynamically deployed/undeployed where and when required, and imposes no overhead when it is not used. Our AOP approach involves aspects that can be dynamically (un)weaved across a distributed system on the basis of pointcut expressions that are inherently distributed in nature, and it supports the composition of advice that is remote from the advised joinpoint. An overall goal of the work is to effectively combine reflective middleware and AOP in a way that maximises the benefits and minimises the drawbacks of each.
Modified big-M method to recognize the infeasibility of linear programming models
Authors: M. Soleimani-damaneh
Venue: Knowledge-Based Systems (2008)

This paper provides an effective modification to the big-M method which leads to reducing the iterations of this method, when it is used to recognize the infeasibility of linear systems.
Direct neural network-based self-tuning control for a class of nonlinear systems
Authors: Heng Yue, Han-Xiong Li, Tianyou Chai
Venue: International Journal of Systems Science (2007)

Most self-tuning control algorithms for nonlinear systems become invalid when the controlled systems have nonminimum phase property. In this article, a direct neural network-based self-tuning control strategy is developed to deal with this problem under the certainty equivalence principle. Based on an equivalent linearized model from the local linearization, the controller structure is designed using a modified Clarke index with the guaranteed closed-loop stability and without the traditional requirement of the globally boundedness. For the system with unknown parameters, the controller is self-tuned by an on line RBF neural network identifier. Satisfactory simulations illustrate the effectiveness and adaptability of the proposed strategy even under system parameter variations.
Mathematical Logic
Authors: George Tourlakis
Venue:  (2008)

* This book presents mathematical or "symbolic" logic as a reliable tool for deductive reasoning. * It trains the student in both the established "Hilbert" style of writing proofs in mathematics, as well as in the emerging "equational" style that finds fruitful application in computer science curricula, especially in the areas of software engineering and program correctness. * There are extensive sets of examples, remarks, problems, references, and textual discussions that aim to help the reader understand what makes logic a powerful tool in the scheme of mathematical truths.
Synthesis for Broadside Testability of Transition Faults
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

We describe a synthesis-for-testability approach targeting broadside testing of transition faults. We refer to this process as synthesis for broadside testability. Unlike design-for-testability (DFT) procedures that require additional control inputs to implement DFT modes of operation, synthesis for broadside testability uses only the standard scan design and relies on broadside tests to detect target faults. The proposed procedure improves the testability of a circuit by changing next-states of state-transitions from its unreachable states, i.e., states that the circuit cannot enter during functional operation. In this way, it replaces broadside tests of the original circuit with new broadside tests that are more effective in detecting target faults.
Dynamic friendship network and breakfast-eating behavior
Authors: Hsieh-Hua Yang, Hung-Jen Yang
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

A longitudinal data was collected at six time points, Oct. and Dec. in 2005, Jan., Feb., Apr., and June in 2006. The questionnaires contain questions on health behaviors, and friendship data. The Markov model is based on transition tables that describe the transition from network position and breakfast-eating behavior at time points 1 to 2, 2 to 3, 3 to 4, 4 to 5, and 5 to 6. The states are classified into isolate breakfast-eater (ISb), group member breakfast-eater (GPb), isolate breakfast-skipper (ISNb), and group member breakfast-skipper (GPNb). The results indicate that most of the students keep their breakfast eating behavior, the transition probabilities are constant at the later stages, and group members have longer sojourn time. We conclude that friendship network is an evolution process, and will eventually reach an equilibrium status. The influences of friendship network can not ignored and the difference between "micro" and "macro" level of social network transition under Markov model needs further scrutinized.
Managing Cancellations and No-Shows of Reservations with Overbooking to Increase Resource Revenue
Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar Buyya
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Advance reservation allows users to request available nodes in the future, whereas economy provides an incentive for resource owners to be part of the Grid, and encourages users to utilize resources optimally and effectively. In this paper, we use overbooking models from Revenue Management to manage cancellations and no-shows of reservations in a Grid system. Without overbooking, the resource owners are faced with a prospect of loss of income and lower system utilization. Thus, the models aim to find an ideal limit that exceeds the maximum capacity, without incurring greater compensation cost. Moreover, we introduce several novel strategies for selecting which bookings to deny, based on compensation cost and user class level, namely Lottery, Denied Cost First (DCF), and Lower Class DCF. The result shows that by overbooking reservations, a resource gains an extra 6-9% in the total net revenue.
(t, λ)-Uniqueness: Anonymity Management for Data Publication
Authors: Qiong Wei, Yansheng Lu, Qiang Lou
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Recent work has shown that the adversary’s background knowledge is a very important factor in privacy-preserving data publishing. In this paper, we formalize background knowledge ħ of form “an individual X’s sensitive value belongs to class C or range R”. Through analyzing the drawbacks of previous approaches in dealing with this form of background knowledge, we develop a novel privacy criterion (τ, λ)-uniqueness that sufficiently defends against attacks leveraging the background knowledge ħ. We accompany the criterion with an effective algorithm, which computes a privacy-guarded published table that permits retrieval of accurate aggregate information about the microdata. We illustrate its advantages through theoretical analysis and experimental validation.
Unit commitment using embedded greedy search particle swarm optimization with mutation operation
Authors: Sun Liyong, Zhang Yan, Jiang Chuanwen
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A hybrid particle swarm optimization (PSO) is presented for solving unit commitment (UC) problems. Using fixed threshold to cope with unit status variables, the proposed algorithm can directly solve UC and avoid coping with economic dispatch (ED) problems. Mutation operation is used to renew slow evolution particles for enhancing the algorithm's performance. The greedy search based on priority list is applied to improve the search speed and the solutions quality. The proposed algorithm is tested in 10 up to 100 unit systems. The results show that the proposed algorithm for UC is feasibility and efficiency.
Non-parametric policy gradients: a unified treatment of propositional and relational domains
Authors: Kristian Kersting, Kurt Driessens
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Policy gradient approaches are a powerful instrument for learning how to interact with the environment. Existing approaches have focused on propositional and continuous domains only. Without extensive feature engineering, it is difficult - if not impossible - to apply them within structured domains, in which e.g. there is a varying number of objects and relations among them. In this paper, we describe a non-parametric policy gradient approach - called NPPG - that overcomes this limitation. The key idea is to apply Friedmann's gradient boosting: policies are represented as a weighted sum of regression models grown in an stage-wise optimization. Employing off-the-shelf regression learners, NPPG can deal with propositional, continuous, and relational domains in a unified way. Our experimental results show that it can even improve on established results.
Nowhere zero 4-flow in regular matroids
Authors: Hong-Jian Lai, Xiangwen Li, Hoifung Poon
Venue: Journal of Graph Theory (2005)

Jensen and Toft [8] conjectured that every 2-edge-connected graph without a K5-minor has a nowhere zero 4-flow. Walton and Welsh [19] proved that if a coloopless regular matroid M does not have a minor in {M(K3,3), M*(K5)}, then M admits a nowhere zero 4-flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5), M*(K5)}, then M admits a nowhere zero 4-flow. Our result implies the Jensen and Toft conjecture. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
The probabilistic program dependence graph and its application to fault diagnosis
Authors: George K. Baah, Andy Podgurski, Mary Jean Harrold
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

This paper presents an innovative model of a program's internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates probabilistic analysis and reasoning about uncertain program behavior, particularly that associated with faults. The PPDG is an augmentation of the structural dependences represented by a program dependence graph with estimates of statistical dependences between node states, which are computed from the test set. The PPDG is based on the established framework of probabilistic graphical models, which are widely used in applications such as medical diagnosis. This paper presents algorithms for constructing PPDGs and applying the PPDG to fault diagnosis. This paper also presents preliminary evidence indicating that PPDGs can facilitate fault localization and fault comprehension.
Erratum: A note on "Soft Set Theory" [Comput. Math. Appl. 45 (4-5) (2003) 555-562]
Authors: Cheng-Fu Yang
Venue: Computers Mathematics with Applications (2008)

It is pointed out that the assertion of Maji, Biswas and Roy [P. K. Maji, R. Biswas, A.R. Roy, Soft set theory, Comput. Math. Appl. 45 (2003) 555-562], (F,A)@?@?@F=@F, is incorrect by a counterexample.