ppxscal/embedding_network huggingface dataset:
Secure Implementation of Meta-predicates
Authors: Paulo Moura
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

This paper identifies potential security loopholes in the implementation of support for meta-predicates. Closing these loopholes depends on three conditions: a clear distinction between closures and goals, support for an extended meta-predicate directive that allows the specification of closures, and the availability of the call/2-N family of built-in meta-predicates. These conditions provide the basis for a set of simple safety rules that allows meta-predicates to be securely supported. These safety rules are currently implemented by Logtalk, an object-oriented logic programming language, and may also be applied in the context of Prolog predicate-based module systems. Experimental results illustrate how these rules can prevent several security problems, including accidental or malicious changes to the original meta-predicate arguments and bypassing of predicate scope rules and predicate scope directives.
Practical solution techniques for first-order MDPs
Authors: Scott Sanner, Craig Boutilier
Venue: Artificial Intelligence (2009)

Many traditional solution approaches to relationally specified decision-theoretic planning problems (e.g., those stated in the probabilistic planning domain description language, or PPDDL) ground the specification with respect to a specific instantiation of domain objects and apply a solution approach directly to the resulting ground Markov decision process (MDP). Unfortunately, the space and time complexity of these grounded solution approaches are polynomial in the number of domain objects and exponential in the predicate arity and the number of nested quantifiers in the relational problem specification. An alternative to grounding a relational planning problem is to tackle the problem directly at the relational level. In this article, we propose one such approach that translates an expressive subset of the PPDDL representation to a first-order MDP (FOMDP) specification and then derives a domain-independent policy without grounding at any intermediate step. However, such generality does not come without its own set of challenges-the purpose of this article is to explore practical solution techniques for solving FOMDPs. To demonstrate the applicability of our techniques, we present proof-of-concept results of our first-order approximate linear programming (FOALP) planner on problems from the probabilistic track of the ICAPS 2004 and 2006 International Planning Competitions.
A Simulation of a Billiards Game Based on Marker Detection
Authors: Lucio T. De Paolis, Giovanni Aloisio, Marco Pulimeno
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Performance improvements in graphics hardware have made it possible to visualize complex virtual environments and provided opportunities to interact with these in a more realistic way. In this paper a Virtual Reality application for simulating a billiards game is presented. A real billiard cue is used and its movements are reproduced in the virtual environment using a visual marker detection system. No force feedback is provided to the player. In the game simulation the virtual environment has been built using the development environment OpenSceneGraph and rigid body dynamics have been simulated utilizing the PhysX physics engine. ARToolkit was the visual marker-based detection system utilized to replicate the movements of the real cue used by the player in the virtual environment.
Detecting distributed network traffic anomaly with network-wide correlation analysis
Authors: Li Zonglin, Hu Guangmin, Yao Xingmiao, Yang Dan
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Distributed network traffic anomaly refers to a traffic abnormal behavior involving many links of a network and caused by the same source (e.g., DDoS attack, worm propagation). The anomaly transiting in a single link might be unnoticeable and hard to detect, while the anomalous aggregation from many links can be prevailing, and does more harm to the networks. Aiming at the similar features of distributed traffic anomaly on many links, this paper proposes a network-wide detection method by performing anomalous correlation analysis of traffic signals' instantaneous parameters. In our method, traffic signals' instantaneous parameters are firstly computed, and their network-wide anomalous space is then extracted via traffic prediction. Finally, an anomaly is detected by a global correlation coefficient of anomalous space. Our evaluation using Abilene traffic traces demonstrates the excellent performance of this approach for distributed traffic anomaly detection.
A review of WPAN security: attacks and prevention
Authors: Todd Kennedy, Ray Hunt
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

WPANs (Wireless Personal Area Networks) fill an important role in local area network technology complementing traditional IEEE 802.11 Wireless LANs. Bluetooth, ZigBee and NFC (Near Field Communications) have emerged as the key WPAN technologies. They are however subject to the usual range of security vulnerabilities found in wireless LANs such as spoofing, snooping, man-in-the-middle, denial of service and other attacks. However security in WPANs is not as mature as it is in Wireless LANs and further work is needed in order to provide comparable protection. This paper examines a range of vulnerabilities and security attacks that can be performed on Bluetooth, ZigBee and NFC WPANs and proposes protection mechanisms that can mitigate risk in each case.
Selection and optimization of cut-points for numeric attribute values
Authors: L. Shang, S. Y. Yu, X. Y. Jia, Y. S. Ji
Venue: Computers Mathematics with Applications (2009)

Data discretization is the process of setting several cut-points which can represent attribute values using different symbols or integer values for continuous numeric attribute values. A hybrid method based on neural network and genetic algorithm is proposed to select and optimize the cut-points for numeric attribute values. The values of cuts are trained through the four-layer neural network and the number of cut-points is optimized by the genetic algorithm. The results for intervals through the presented method can be more precise. The experimental results show that the cut-points are well obtained compared with the other method.
PaRS: fast and near-optimal grid-based cell sizing for library-based design
Authors: Tai-Hsuan Wu, Azadeh Davoodi
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We propose PaRS, a parallel and randomized tool which solves the discrete gate sizing (cell sizing) problem on a grid. PaRS is formulated based on an optimization framework known as Nested Partitions which uses parallelism and randomization from a novel perspective to better identify the optimization direction. It achieves nearoptimal solutions for minimizing total power and area subject to meeting a delay constraint. The embarrassingly-parallel nature of PaRS makes it highly efficient. We show small algorithm run-times, in at most minutes for circuits with over 47,000 cells. We make comparison with the optimal solution generated by a custom and parallel branch-and-bound algorithm. Consequently, we are able to generate the optimal solution within hours. While the optimal algorithm uses up to 200 nodes in our grid, PaRS achieves its speedups and near-optimal solutions using only 20 nodes.
New performance/power/area efficient, reliable full adder design
Authors: Sohan Purohit, Martin Margala, Marco Lanuzza, Pasquale Corsonello
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Arithmetic circuits have always played one of the most important roles in the designs of processors, FPGAs, and the rapidly evolving domain of media processing architectures. The full adder cell forms the basic building block of majority of these arithmetic circuits. In this paper we describe a hybrid pseudo static full adder cell designed using Data Driven Dynamic Logic. Simulation results show the adder to out perform its competitors, both static as well as dynamic topologies in terms of performance, while maintaining relatively similar area and power characteristics. This paper presents a complete characterization of the popular adder cells in terms of delay, area, power, noise margin and reliability analysis for both super threshold and sub threshold operating regimes.
On the use of negation in Boolean IR queries
Authors: Shmuel T. Klein
Venue: Information Processing and Management: an International Journal (2009)

The negation operator, in various forms in which it appears in Information Retrieval queries, is investigated. The applications include negated terms in Boolean queries, more specifically in the presence of metrical constraints, but also negated characters used in the definition of extended keywords by means of regular expressions. Exact definitions are suggested and their usefulness is shown on several examples. Finally, some implementation issues are discussed, in particular as to the order in which the terms of long queries, with or without negated keywords, should be processed, and efficient heuristics for choosing a good order are suggested.
Congestion-aware power grid optimization for 3D circuits using MIM and CMOS decoupling capacitors
Authors: Pingqiang Zhou, Karthikk Sridharan, Sachin S. Sapatnekar
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In three-dimensional (3D) chips, the amount of supply current per package pin is significantly more than in two-dimensional (2D) designs. Therefore, the power supply noise problem, already a major issue in 2D, is even more severe in 3D. CMOS decoupling capacitors (decaps) have been used effectively for controlling power grid noise in the past, but with technology scaling, they have grown increasingly leaky. As an alternative, metal-insulator-metal (MIM) decaps, with high capacitance densities and low leakage current densities, have been proposed. In this paper, we explore the tradeoffs between using MIM decaps and traditional CMOS decaps, and propose a congestion-aware 3D power supply network optimization algorithm to optimize this tradeoff. The algorithm applies a sequence-of-linear-programs based method to find the optimum tradeoff between MIM and CMOS decaps. Experimental results show that power grid noise can be more effectively optimized after the introduction of MIM decaps, with lower leakage power and little increase in the routing congestion, as compared to a solution using CMOS decaps only.
Test Access Mechanism in the Quad-Core AMD Opteron Microprocessor
Authors: Kedarnath J. Balakrishnan, Grady Giles, James Wingfield
Venue: IEEE Design Test (2009)

Multicore microprocessors provide a natural application environment for IEEE Std 1500 and, as this article proves, allow for innovative approaches that capitalize on the fact that the various cores are identical.
Implicit Surface Reconstruction with an Analogy of Polar Field Model
Authors: Yuxu Lin, Chun Chen, Mingli Song, Jiajun Bu, Zicheng Liu
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Implicit surface reconstruction has been a challenging work for decades. In this paper, motivated by the concept of classic physical polar field model and off-set points strategy, we present a new approach, called Field Fitting. In this approach, we express a 3D surface as an equipotential surface of scalar polar field which is produced by a number of paired field generating primitives, then a surface reconstruction process is cast as a primitives localization process, and finally, we solve this problem with a greedy method. Experimental results demonstrate that the proposed method outperforms the previous by providing better surface reconstruction results.
A formal model of adjudication dialogues
Authors: Henry Prakken
Venue: Artificial Intelligence and Law (2008)

This article presents a formal dialogue game for adjudication dialogues. Existing AI & law models of legal dialogues and argumentation-theoretic models of persuasion are extended with a neutral third party, to give a more realistic account of the adjudicator's role in legal procedures. The main feature of the model is a division into an argumentation phase, where the adversaries plea their case and the adjudicator has a largely mediating role, and a decision phase, where the adjudicator decides the dispute on the basis of the claims, arguments and evidence put forward in the argumentation phase. The model allows for explicit decisions on admissibility of evidence and burden of proof by the adjudicator in the argumentation phase. Adjudication is modelled as putting forward arguments, in particular undercutting and priority arguments, in the decision phase. The model reconciles logical aspects of burden of proof induced by the defeasible nature of arguments with dialogical aspects of burden of proof as something that can be allocated by explicit decisions on legal grounds.
A-contrario Detectability of Spots in Textured Backgrounds
Authors: Bénédicte Grosjean, Lionel Moisan
Venue: Journal of Mathematical Imaging and Vision (2009)

Using the a-contrario framework recently introduced in the modeling of human visual perception, we build a statistical model to predict the detectability of a spot on a textured background. Contrary to classical formalisms (ideal observer and its extensions), which assume a known probability distribution for the signal to be detected, the a-contrario observer we build only relies on gestalt-driven measurements and on an approximate representation of the background texture. It extends the scope of previous a-contrario detectors by using a non-i.i.d. naive model and a notion of local context. The models we propose are first validated theoretically in the case of powerlaw textures, which are, in particular, classical models for mammograms. Then, going to more general microtextures (colored noise processes), we compute the relationship between the size of a spot and the minimum contrast required to reach a given detectability threshold according to the a-contrario observer. Three main types of microtextures pop out from this characterization, and in particular low-frequency textures for which curiously enough, the contrast being given, the most salient spots are the smallest ones. Last, we illustrate the interest of the a-contrario observer for two real applications: the detectability of opacities in mammograms and the perception of stains on pieces of clothing.
A comparison of mobile money-transfer UIs for non-literate and semi-literate users
Authors: Indrani Medhi, S.N. Nagasena Gautama, Kentaro Toyama
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Due to the increasing penetration of mobile phones even into poor communities, mobile payment schemes could bring formal financial services to the "unbanked". However, because poverty for the most part also correlates with low levels of formal education, there are questions as to whether electronic access to complex financial services is enough to bridge the gap, and if so, what sort of UI is best. In this paper, we present two studies that provide preliminary answers to these questions. We first investigated the usability of existing mobile payment services, through an ethnographic study involving 90 subjects in India, Kenya, the Philippines and South Africa. This was followed by a usability study with another 58 subjects in India, in which we compared non-literate and semi-literate subjects on three systems: text-based, spoken dialog (without text), and rich multimedia (also without text). Results confirm that non-text designs are strongly preferred over text-based designs and that while task-completion rates are better for the rich multimedia UI, speed is faster and less assistance is required on the spoken-dialog system.
Everyday aspects
Authors: Gail C. Murphy
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Everyday, programmers perform software evolution tasks that require accessing information from, and often making changes to, multiple modules comprising the target software system. For some of these tasks, aspect-oriented programming languages provide a means of improving the modularization of the target system, making it easier to perform desired evolutionary changes. For other tasks, it can be either too difficult or considered too costly to use a language to describe the modularization associated with a task. In many of these cases, we have found it effective to infer a task-specific form of modularity based on how programmers interact with the source comprising the system. This approach is the basis of the Eclipse Mylyn tools and frameworks, which are being used daily by hundreds of thousands of programmers to reduce information overload, enable recall of modularity associated with tasks and improve programming productivity. Everyday, information workers also perform tasks that require accessing information from, and often making changes to, documents spread across their computer desktops, their organization and the world. How do the tasks of these information workers compare to those of programmers? Could these workers benefit from expressing modularity across information using ideas from aspect-oriented languages? Could these workers benefit from task-specific modularity based on how they access documents and related artifacts? This talk will consider how ideas from the aspect-oriented community can extend beyond the software domain to improve the interaction of information workers with digital information.
Encrypted Voice Calls with IP Enabled Wireless Phones over GSM/ CDMA/ WiFi Networks
Authors: Mohammed A. Qadeer, Robin Kasana, Sarvat Sayeed
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

A research on the related technology and implementation of IP phone based on WiFi network is discussed in this paper; it includes the net structure of the technology used in designing the terminal of IP phone. This technology is a form of telecommunication that allows data and voice transmissions to be sent across a wide range of interconnected networks. A WiFi enabled IP phone is used which is preinstalled with the Symbian Operating System and a software application is developed using J2ME which allows free and secured communication between selected IP phones in the WiFi network. This communication is done with the use of routing tables organized in the WiFi routers. Using the free bandwidth of 2.4 GHz communication channels are established. The communication channel being a free bandwidth is vulnerable to external attacks and hacking. Thereby this challenge of creating a secure communication channel is addressed by using two different encryption mechanisms. The payload and header of the voice data packets are encrypted using two different algorithm techniques. Hence the communication system is made almost fully secure. Also the WiFi server can tunnel the calls to the GSM network using UNC. Moreover the creation of a vertical handoff protocol will provide seamless communication for users. This handoff is defined in the context of a diverse network environment. It is cost effective, it allows easier communication, is great for international usages, and it can be very useful for large corporations. In time this will become a cheap and secure way to communicate and will have a large effect on university, business and personal communication.
The relationship between seismic frequency and magnitude as based on the Maximum Entropy Principle
Authors: Li-Hua Feng, Gao-Yuan Luo
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Entropy is a state function. The entropy increase principle tells us that under isolated or adiathermal conditions, the spontaneous development of a system from a state of non-equilibrium to a state of equilibrium is a process of entropy increase, in which a state of equilibrium corresponds to a state of maximum entropy. When the system is in a state of equilibrium, it is also at its most chaotic and disordered. The occurrence of earthquakes can be classified as a random event and can be described using entropy. Earthquakes occur in the most disordered way, indicating that entropy has reached its maximum value, so we can use the Maximum Entropy Method to determine the distribution of earthquakes that occur within a certain area curing a particular period of time. Results show that the formula representing the relationship between seismic frequency and magnitude (based on data and experience) is in fact a negative exponential distribution under given restraints and supposing seismic entropy is set as the maximum value. Therefore, we can theoretically explain the origin of the relationship between seismic frequency and magnitude.
Hybrid robust approach for TSK fuzzy modeling with outliers
Authors: Chen-Chia Chuang, Jin-Tsong Jeng, Chin-Wang Tao
Venue: Expert Systems with Applications: An International Journal (2009)

This study proposes a hybrid robust approach for constructing Takagi-Sugeno-Kang (TSK) fuzzy models with outliers. The approach consists of a robust fuzzy C-regression model (RFCRM) clustering algorithm in the coarse-tuning phase and an annealing robust back-propagation (ARBP) learning algorithm in the fine-tuning phase. The RFCRM clustering algorithm is modified from the fuzzy C-regression models (FCRM) clustering algorithm by incorporating a robust mechanism and considering input data distribution and robust similarity measure into the FCRM clustering algorithm. Due to the use of robust mechanisms and the consideration of input data distribution, the fuzzy subspaces and the parameters of functions in the consequent parts are simultaneously identified by the proposed RFCRM clustering algorithm and the obtained model will not be significantly affected by outliers. Furthermore, the robust similarity measure is used in the clustering process to reduce the redundant clusters. Consequently, the RFCRM clustering algorithm can generate a better initialization for the TSK fuzzy models in the coarse-tuning phase. Then, an ARBP algorithm is employed to obtain a more precise model in the fine-tuning phase. From our simulation results, it is clearly evident that the proposed robust TSK fuzzy model approach is superior to existing approaches in learning speed and in approximation accuracy.
Interconnection of distributed memory models
Authors: Vicent Cholvi, Ernesto Jiménez, Antonio Fernández Anta
Venue: Journal of Parallel and Distributed Computing (2009)

In this paper, we present a framework to formally describe and study the interconnection of distributed shared memory systems. Using it allows us to classify the consistency models in two groups, depending on whether they are fast or not. In the case of non-fast consistency models, we show that they cannot be interconnected in any way. In contrast, in the case of fast consistency models we provide protocols to interconnect some of them.