ppxscal/embedding_network huggingface dataset:
CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis
Authors: Marc Eaddy, Alfred V. Aho, Giuliano Antoniol, Yann-Gaël Guéhéneuc
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

The concern location problem is to identify the source code within a program related to the features, requirements, or other concerns of the program. This problem is central to program development and maintenance. We present a new technique called prune dependency analysis that can be combined with existing techniques to dramatically improve the accuracy of concern location. We developed CERBERUS, a potent hybrid technique for concern location that combines information retrieval, execution tracing, and prune dependency analysis. We used CERBERUS to trace the 360 requirements of RHINO, a 32,134 line Java program that implements the ECMAScript international standard. In our experiment, prune dependency analysis boosted the recall of information retrieval by 155% and execution tracing by 104%. Moreover, we show that our combined technique outperformed the other techniques when run individually or in pairs.
Deterministic Secure Positioning in Wireless Sensor Networks
Authors: Sylvie Delaët, Partha Sarathi Mandal, Mariusz A. Rokicki, Sébastien Tixeuil
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Position verification problem is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location information in order to fake their actual position. In this paper we propose the first deterministic distributed protocol for accurate identification of faking sensors in a WSN. Our scheme does not rely on a subset of trusted nodes that cooperate and are not allowed to misbehave. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN.On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most $\lfloor \frac{n}{2} \rfloor-2$ faking sensors. When the time of flight (ToF) technique is used, our protocol manages at most $\lfloor \frac{n}{2} \rfloor - 3$ misbehaving sensors. On the negative side, we prove that no deterministic protocol can identify faking sensors if their number is $\lceil \frac{n}{2}\rceil -1$. Thus, our scheme is almost optimal with respect to the number of faking sensors.We discuss application of our technique in the trusted sensor model. More specifically, our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones.
Covering the alternating groups by products of cycle classes
Authors: Marcel Herzog, Gil Kaplan, Arieh Lev
Venue: Journal of Combinatorial Theory Series A (2008)

Given integers k,l>=2, where either l is odd or k is even, we denote by n=n(k,l) the largest integer such that each element of A"n is a product of k cycles of length l. For an odd l, k is the diameter of the undirected Cayley graph Cay(A"n,C"l), where C"l is the set of all l-cycles in A"n. We prove that if k>=2 and l>=9 is odd and divisible by 3, then 23kl=
Impact of transmit power on throughput performance in wireless ad hoc networks with variable rate control
Authors: Xu Zhang, Qiang Gao, Jun Zhang, Gang Wang
Venue: Computer Communications (2008)

In this paper, the capacity of ad hoc networks employing pure aloha MAC protocol is studied under the effect of different transmission power levels and variable data rate control. The data rate of a certain link is related to SINR, and SINR is, in turn, related to transmitted power and link distance. The increasing of power conducts a high data rate, while results in a high interference of the network. Consequently, the optimum power that yields maximum network throughput is a tradeoff between transmission rate and network interference. Mathematical models for analysis of ad hoc networks capacity is presented, and a revised expression to approximate the capture probability of the network is also proposed. It is demonstrated that the optimal transmission power, thus the optimal range, which maximize the throughput of the network by theoretical and simulation results.
Effect of Anode/Filter Combination on the Dose and Image Quality of a Digital Mammography System Based on an Amorphous Selenium Detector
Authors: Paola Baldelli, Niall Phelan, Gillian Egan
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

A comparison of image quality and glandular breast dose was carried out on two digital mammography systems using ¿-Se flat panel detectors. The two digital mammography systems currently available from Hologic were compared. The original system utilises Mo/Mo and Mo/Rh as target/filter combinations, while the new system uses W/Rh and W/Ag. Images of mammography phantoms with different simulated breast thickness and various glandular tissue equivalency were acquired under different spectral conditions. The contrast of five details, corresponding to five glandular compositions, was calculated and the AGD needed to visualize a detail with a CNR of 5 was estimated. For each phantom thickness and target/filter combination, there is an optimum voltage which maximizes the AGD. Using the Tungsten tube system there is a dose reduction of 16% at 4 cm and 5 cm, and 35% for 6 cm compared with the dose needed with the Mo/Mo combination.
Discussion on the Spike Train Recognition Mechanisms in Neural Circuits
Authors: Yan Liu, Liujun Chen, Jiawei Chen, Fangfeng Zhang, Fukang Fang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The functions of neural system, such as learning, recognition and memory, are the emergences from the elementary dynamic mechanisms. To discuss how the dynamic mechanisms in the neurons and synapses work in the function of recognition, a dynamic neural circuit is designed. In the neural circuit, the information is expressed as the inter-spike intervals of the spike trains. The neural circuit with 5 neurons can recognize the inter-spike intervals in 5-15ms. A group of the neural circuits with 6 neurons recognize a spike train composed of three spikes. The dynamic neural mechanisms in the recognition processes are analyzed. The dynamic properties of the Hodgkin-Huxley neurons are the mechanism of the spike trains decomposition. Based on the dynamic synaptic transmission mechanisms, the synaptic delay times are diverse, which is the key mechanism in the inter-spike intervals recognition. The neural circuits in the group connect variously that every neuron can join in different circuits to recognize different inputs, which increases the information capacity of the neural circuit group.
Fuzzy Matrix Games Multi-Criteria Model for Decision-Making in Engineering
Authors: Friedel Peldschus, Edmundas Kazimieras Zavadskas
Venue: Informatica (2005)

When handling engineering problems associated with optimal alternative selection a researcher often deals with not sufficiently accurate data. The alternatives are usually assessed by applying several different criteria. A method takes advantage of the relationship between fuzzy sets and matrix game theories can be offered for multicriteria decision-making. Practical investigations have already been discussed for selecting the variants water supply systems.
Active Volume Models with Probabilistic Object Boundary Prediction Module
Authors: Tian Shen, Yaoyao Zhu, Xiaolei Huang, Junzhou Huang, Dimitris Metaxas, Leon Axel
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We propose a novel Active Volume Model (AVM) which deforms in a free-form manner to minimize energy. Unlike Snakes and level-set active contours which only consider curves or surfaces, the AVM is a deforming object model that has both boundary and an interior area. When applied to object segmentation and tracking, the model alternates between two basic operations: deform according to current object prediction, and predict according to current appearance statistics of the model. The probabilistic object prediction module relies on the Bayesian Decision Rule to separate foreground (i.e. object represented by the model) and background. Optimization of the model is a natural extension of the Snakes model so that region information becomes part of the external forces. The AVM thus has the efficiency of Snakes while having adaptive region-based constraints. Segmentation results, validation, and comparison with GVF Snakes and level set methods are presented for experiments on noisy 2D/3D medical images.
The Symbolic Approach to Repeated Games (Abstract)
Authors: Luca Alfaro
Venue: Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic (2007)

We consider zero-sum repeated games with omega-regular goals. Such hgames are played on a finite state space over an infinite number of rounds: at every round, the players select moves, either in turns or simultaneously; the current state and the selected moves determine the successor state. A play of the game thus consists in an infinite path over the state space or, if randomization is present, in a probability distribution over paths. Omega-regular goals generalize the class of regular goals (those expressible by finite automata) to infinite sequences, and include many well-known goals, such as the reachability and safety goals, as well as the Büchi and parity goals.The algorithms for solving repeated games with omega-regular goals can be broadly divided into enumerative and symbolic/ algorithms. Enumerative algorithms consider each state individually; currently, they achieve the best worst-case complexity among the known algorithms. Symbolic algorithms compute in terms of sets of states, or functions from states to real numbers, rather than single states; such sets or functions can often be represented symbolically (hence the name of the algorithms). Even though symbolic algorithms often cannot match the worst-case complexity of the enumerative algorithms, they are often efficient in practice.We illustrate how symbolic algorithms provide uniform solutions of many classes of repeated games, from turn-based, non-randomized games where at each state one of the players can deterministically win, to concurrent and randomized games where the ability to win must be characterized in probabilistic fashion. We also show that the symbolic algorithms, and the notation used to express them, are closely related to game metrics which provide a notion of distance between game states. Roughly, the distance between two states measures how closely a player can match, from one state, the ability of winning from the other state with respect to any omega-regular goal.
IRPS --- An Efficient Test Data Generation Strategy for Pairwise Testing
Authors: Mohammed I. Younis, Kamal Zuhairi Zamli, Nor Ashidi Mat Isa
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Software testing is an integral part of software engineering. Lack of testing often leads to disastrous consequences including loss of data, fortunes, and even lives. In order to ensure software reliability, many combinations of possible input parameters, hardware/software environments, and system configurations need to be tested and verified against for conformance. Due to costing factors as well as time to market constraints, considering all exhaustive test possibilities would be infeasible (i.e. due to combinatorial explosion problem). Earlier work suggests that pairwise sampling strategy (i.e. based on two-way parameter interaction) can be effective. Building and complementing earlier work, this paper discusses an efficient pairwise test data generation strategy, called IRPS. In doing so, IRPS is compared against existing strategies including AETG and its variations, IPO, SA, GA, ACA, and All Pairs. Empirical results demonstrate that IRPS strategy, in most cases, outperformed other strategies as far as the number of test data generated within reasonable time.
Upper Bounds on the D(β)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs
Authors: Tian Jing-Jing, Liu Xin-Sheng, Zhang Zhong-Fu, Deng Fang-An
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In this paper, let d be the maximum degree of G, we study the upper bounds for the D(β)-vertex-distinguishing edge-chromatic number by probability method and prove that $$ \chi^\prime_{\beta-vd}(G)\leq \left\{ \begin{array}{ll} 2\sqrt{2(\beta-1)}d^{\frac{\beta+2}{2}},&\ \ d\geq 4, \beta \geq4;\\ 8d^{\frac{5}{2}},&\ \ d\geq 6, \beta=3;\\ 32d^2,&\ \ d\geq 4, \beta=2. \end{array}\right.$$
Using FCA for Encoding Closure Operators into Neural Networks
Authors: Sebastian Rudolph
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

After decades of concurrent development of symbolic and connectionist methods, recent years have shown intensifying efforts of integrating those two paradigms. This paper contributes to the development of methods for transferring present symbolic knowledge into connectionist representations. Motivated by basic ideas from formal concept analysis, we propose two ways of directly encoding closure operators on finite sets in a 3-layered feed forward neural network.
Notarized federated ID management and authentication
Authors: Michael T. Goodrich, Roberto Tamassia, Danfeng (Daphne) Yao
Venue: Journal of Computer Security (2008)

We propose a notarized federated identity management model that supports efficient user authentication when providers are unknown to each other. Our model introduces a notary service, owned by a trusted third-party, to dynamically notarize assertions generated by identity providers. An additional feature of our model is the avoidance of direct communications between identity providers and service providers, which provides improved privacy protection for users. We present an efficient implementation of our notarized federated identity management model based on the Secure Transaction Management System (STMS). We also give a practical solution for mitigating aspects of the identity theft problem and discuss its use in our notarized federated identity management model. The unique feature of our cryptographic solution is that it enables one to proactively prevent the leaking of secret identity information.
Extending Hough Transform to a Points' Cloud for 3D-Face Nose-Tip Detection
Authors: Vitoantonio Bevilacqua, Pasquale Casorio, Giuseppe Mastronardi
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper describes an extension of Generalized Hough Transform (GHT) to 3D point cloud for biometric applications. We focus on the possibility to applying this new GHT on a dataset representing point clouds of 3DFaces in order to obtain a nose-tip detection system.
Computing the Minkowski Value of the Exponential Function over a Complex Disk
Authors: Hyeong In Choi, Rida T. Farouki, Chang Yong Han, Hwan Pyo Moon
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

Basic concepts, results, and applications of the Minkowski geometric algebra of complex sets are briefly reviewed, and preliminary ideas on its extension to evaluating transcendental functions of complex sets are discussed. Specifically, the Minkowski value of the exponential function over a disk in the complex plane is considered, as the limit of partial---sum sets defined by the monomial or Horner evaluation schemes.
It/cs workshop: multimodal, multimedia courseware for teaching technical concepts in humanistic context
Authors: Mark S. Schmalz, Lynn Conway
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

As global competition in IT increases, IT/CS students must learn concepts, theory, and implementation more efficiently, more broadly (e.g., technical and humanistic context) and in greater technical depth. IT (esp. CS and mathematics) is data-intensive - teaching can suffer from information overload, particularly in Web-based courseware. Efforts to simplify IT/CS teaching sometimes result in technology overload, where students encounter technical detail without humanistic context (e.g., history, ethics, business aspects). Overload usually correlates with decreased comprehension, increased boredom, decreased learning, and potentially lower performance in applicative tasks. In response to this problem, our paper describes IT/CS Workshop (ICW), an innovative, interactive Web-based paradigm for teaching and learning of technical concepts in a multi-level, multi-media humanistic context. ICW, under development at University of Florida, complements established undergraduate and graduate coursework and texts, by interactively presenting concepts at three modes or levels of abstraction: (1) WorkShop - Students are assigned tasks similar to jobs in an industrial workshop, with interactive suggestions and helps; (2) WorkBench - Technical views of Tools (e.g., concept, theory, example) and Techniques (implementation and analysis) are integrated with humanistic views of Environment (history and recycling of previous technology) and Society (ethics, interactive collaboration with experts and friends); and (3) TestBench - Interactive analysis of results, quizzes, practice exams, and progress tracking help students evaluate their work, with pointers to remedial web pages. For example, ICW's multi-media (audio-video lectures, animated examples, and sophisticated interactive analysis programs) support teaching of computer systems performance analysis (IT), algorithm complexity analysis (CS), and error propagation theory (Mathematics). Links to related Internet groups, websites, and scholarly articles support in-depth learning. ICW's multi-level, multi-media approach enriches teaching and learning, while reinforcing different learning styles and cultural views. Additional features of ICW include creative exploration, whereby students can collaborate competitively, within loose constraints. This opens many new applications and approaches, and provides multiple data sources to support the semi-automatic or (eventually) automatic monitoring and modification of student learning behavior. Thus, instructors could extract metaphors for exploration, then apply these to the process of evaluating student progress. This paper describes ICW's software architecture, interfaces, and courseware generation techniques, with examples from IT (hardware performance) and CS (complexity analysis).
Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem
Authors: Kai Sun, Gen-Ke Yang, Yu-Wang Chen
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Capacitated vehicle routing problem (CVRP) is one of the most well-known and well-studied scheduling problems in operation research and logistics. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. The paper focuses on developing a hybrid optimization algorithm by incorporating the extremal optimization into a scatter search conceptual framework to solve the CVRP. The proposed algorithm is applied to a set of benchmark problems and the performance of the algorithm is evaluated by comparing the obtained results with the results published in the literature. Comparing results indicate that this new method is an effective and competitive approach for the capacitated vehicle routing problem.
Business Metrics Discovery by Business Rules
Authors: Franceso Arigliano, Paolo Ceravolo, Cristiano Fugazza, Davide Storelli
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

This work contributes to the results of the TEKNE projec, a project aimed at developing a framework for Business Process Management (BPM), supporting the designer with a set of performance indicators. The indicators drive the designer in estimating if the process comply to the objectives and when necessary enable re-engineering of the process. In particular this paper discuses how to derive performance indicators directly from requirements expressed in a Business Rules (BR) format.
Focusing in Linear Meta-logic
Authors: Vivek Nigam, Dale Miller
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a variety of sequent calculus proof systems. Here, we show that if we adopt different focusing annotations for such linear logic specifications, a range of other proof systems can also be specified. In particular, we show that natural deduction (normal and non-normal), sequent proofs (with and without cut), tableaux, and proof systems using general elimination and general introduction rules can all be derived from essentially the same linear logic specification by altering focusing annotations. By using elementary linear logic equivalences and the completeness of focused proofs, we are able to derive new and modular proofs of the soundness and completeness of these various proofs systems for intuitionistic and classical logics.
RFI Mitigation Researches and Implements in Radio Astronomy
Authors: Shi-Yuan Li, Esamdin Ali, Zheng-Wen Sun
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Increasing Radio Frequency Interference (RFI) is a serious problem for researches in modern radio astronomy. Various techniques to excise RFI from signals data are being tried out. In this paper, various methods of RFI excision at radio astronomy are described. RFI mitigation researches and implements in radio astronomy society are also presented. Especially, RFI mitigation researches in China radio astronomy and the importance of RFI mitigation for Chinese next generation radio astronomy equipments are introduced.
Color Image Watermarking and Self-recovery Based on Independent Component Analysis
Authors: Hanane Mirza, Hien Thai, Zensho Nakao
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The digital image watermarking field addresses the problem of digital image authentication and integrity. In this paper we propose a novel color image watermarking scheme based on image self-embedding and self-recovery techniques. The main idea of this algorithm is to embed a reduced content of the original image to itself, in order to be able to partially recover the deleted features from the watermarked image. Separately, the red and blue color channels are embedded, respectively in the wavelet domain by a compressed version of the original image, and in the spatial domain by binary encoded sequences generated from the original image. This allowed us, in detection stage, to prove the ownership, detect the altered blocks, and recover them. The detection and recovery bits extraction is computed using an ICA algorithm. The experimental results were satisfactory and show a high robustness against most common attacks as well as a reassuring rate of image recovery.