ppxscal/embedding_network huggingface dataset:
Reasoning about large taxonomies of actions
Authors: Yilan Gu, Mikhail Soutchanski
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to more compact and modular basic action theories (BATs) for reasoning about actions than currently possible. We compare our representation with Reiter's BATs and prove that our representation inherits all useful properties of his BATs. Moreover, we show that our axioms can be more succinct, but extended Reiter's regression can still be used to solve the projection problem (this is the problem of whether a given logical expression will hold after executing a sequence of actions). We also show that our representation has significant computational advantages. For taxonomies of actions that can be represented as finitely branching trees, the regression operator can work exponentially faster with our theories than it works with Reiter's BATs. Finally, we propose general guidelines on how a taxonomy of actions can be constructed from the given set of effect axioms in a domain.
Verification of Use Case with Petri Nets in Requirement Analysis
Authors: Jinqiang Zhao, Zhenhua Duan
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Requirement analysis plays a very important role in reliability, cost, and safety of a software system. The use case approach remains the dominant approach during requirement elicitation in industry. Unfortunately, the use case approach suffers from several shortcomings, such as lacking accuracy and being difficult to analyze and validate the dynamic behavior of use cases for concurrency, consistency, etc. This paper proposes an approach for overcoming limitations of the use case approach and applies the approach in Model Driven Development (MDD). Timed and Controlled Petri Nets are used as the formal description and verification mechanism for the acquired requirements. Use cases are used to elicit the requirements and to construct scenarios. After specifying the scenarios, each of them can be transformed into its correspondent Petri-net model. Through analyzing these Petri-net models, some flaws or errors of requirements can be detected. The proposed approach is demonstrated by an E-mail client system.
KATAN and KTANTAN -- A Family of Small and Efficient Hardware-Oriented Block Ciphers
Authors: Christophe Cannière, Orr Dunkelman, Miroslav Knežević
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

In this paper we propose a new family of very efficient hardware oriented block ciphers. The family contains six block ciphers divided into two flavors. All block ciphers share the 80-bit key size and security level. The first flavor, KATAN, is composed of three block ciphers, with 32, 48, or 64-bit block size. The second flavor, KTANTAN, contains the other three ciphers with the same block sizes, and is more compact in hardware, as the key is burnt into the device (and cannot be changed).The smallest cipher of the entire family, KTANTAN32, can be implemented in 462 GE while achieving encryption speed of 12.5 KBit/sec (at 100 KHz). KTANTAN48, which is the version we recommend for RFID tags uses 588 GE, whereas KATAN64, the largest and most flexible candidate of the family, uses 1054 GE and has a throughput of 25.1 Kbit/sec (at 100 KHz).
Bounded distance decoding of linear error-correcting codes with Gröbner bases
Authors: Stanislav Bulygin, Ruud Pellikaan
Venue: Journal of Symbolic Computation (2009)

The problem of bounded distance decoding of arbitrary linear codes using Grobner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite field. The peculiarity of this system is that, when we want to decode up to half the minimum distance, it has a unique solution even over the algebraic closure of the considered finite field, although field equations are not added. The equations in the system have degree at most 2. As our experiments suggest, our method is much faster than the one of Fitzgerald-Lax. It is also shown via experiments that the proposed approach in some range of parameters is superior to the generic syndrome decoding.
Faster $\mathbb{F}_p$-Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves
Authors: Junfeng Fan, Frederik Vercauteren, Ingrid Verbauwhede
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

This paper describes a new method to speed up $\mathbb{F}_p$-arithmetic for Barreto-Naehrig (BN) curves. We explore the characteristics of the modulus defined by BN curves and choose curve parameters such that $\mathbb{F}_p$ multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. With this algorithm, the performance of pairings on BN curves can be significantly improved, resulting in a factor 5.4 speed-up compared with the state-of-the-art hardware implementations. Using this algorithm, we implemented a pairing processor in hardware, which runs at 204 MHz and finishes one ate and R-ate pairing computation over a 256-bit BN curve in 4.22 ms and 2.91 ms, respectively.
A customisable downscaling approach for local-scale meteorological and air pollution forecasting: Performance evaluation for a year of urban meteorological forecasts
Authors: M. Thatcher, P. Hurley
Venue: Environmental Modelling Software (2010)

In this paper we develop a customisable downscaling approach for local-scale air quality and meteorological forecasting applications, using The Air Pollution Model (TAPM) with the Conformal Cubic Atmospheric Model (CCAM). The CCAM-TAPM system allows users to define their own local pollution emissions, terrain and land-use data and then downscale the meteorological and air pollution forecast on PC hardware. To evaluate the meteorological component of the CCAM-TAPM system, we have produced 7-day forecasts dynamically downscaled to 3km resolution, centred on Melbourne (Australia). We produce 365, 7-day forecasts with a forecast starting on each day during 2003, initialised with National Centre for Environmental Prediction (NCEP) 1^o Global Forecasting System (GFS) analyses (i.e., no boundary conditions are needed). We estimate that CCAM-TAPM can simulate 10-m wind speeds and 2-m temperatures for up to two forecast days with errors within 10% of previous TAPM studies in which air pollution was successfully predicted.
Shape Representation and Recognition in High Dimensional Feature Space
Authors: Hong Gu, Guangzhou Zhao, Hongbo Wang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

We present a novel approach for shape representation using support vector domain description (SVDD). The shape contour of an object is mapped to spherical surface in high dimensional feature space, where similar contours with different size look like concentric spheres in the learned feature/kernel space. Shape matching in cluttered image, therefore, can be seen as finding the corresponding super spherical surface after the nonlinear transformation. The shape model, which consists of several Support Vectors (SVs), is partially invariant to contour scaling and rotation. A coarse-to-fine strategy is then adopted for shape matching in the forward matching process. Experimental results show that the approach is robust and suitable for shape-based image retrieval. In addition, our approach enables the user to fast construct the template shape by a small quantity of points which represent the shape roughly. The precise shape contour is not needed. It can greatly improve the human-machine interaction friendliness of practical image retrieval systems. Though our analysis is based on 2D shapes, this idea can be easily extended to the 3D shapes.
A scalable jointree algorithm for diagnosability
Authors: Anika Schumann, Jinho Huang
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in a discrete-event system is diagnosable iff its occurrence can always be deduced once sufficiently many subsequent observable events have occurred. A classical approach to diagnosability checking constructs a finite state machine known as a twin plant for the system. which has a critical path iff some fault event is not diagnosable. Recent work attempts to avoid the often impractical construction of the global twin plant by exploiting system structure. Specifically, local twin plants are constructed for components of the system, and synchronized with each other until diagnosability is decided. Unfortunately, synchronization of twin plants can remain a bottleneck for large systems; in the worst case, in particular, all local twin plants would be synchronized, again producing the global twin plant. We solve the diagnosability problem in a way that exploits the distributed nature of realistic systems. In our algorithm consistency among twin plants is achieved by message passing on a jointree. Scalability is significantly improved as the messages computed are generally much smaller than the synchronized product of the twin plants involved. Moreover we use an iterative procedure to search for a subset of the jointree that is sufficient to decide diagnosability. Finally, our algorithm is scalable in practice: it provides an approximate and useful solution if the computational resources are not sufficient.
A Novel Multiple Watermarking Algorithm Based on Bandelet Transform
Authors: Yuancheng Li, Xiaolei Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In this paper, the authors proposed a novel multiple watermarking algorithm which embedded two watermarks into original image in different frequency by using bandelet transform. Firstly, we can get frequency coefficients after performing a 2 dimensional discrete wavelet transform (DWT) to original image. Secondly, we implemented a bandeletization to higher coefficients then got the bandeletization coefficients. Thirdly, we embedded two watermarks into DWT coefficients and bandeletization coefficients separately. At last, we reconstructed the watermarked image. Experimental results demonstrate that the watermarking algorithm based on bandelet has a good performance both in invisibility and robustness. Compare to the common watermarking algorithms, our methods could make up for disadvantages in some respects.
Visual Complexity: Is That All There Is?
Authors: Alexandra Forsythe
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Visual complexity is conventionally defined as the level of detail or intricacy contained within an image. This paper evaluates different measures of complexity and the extent to which they may be compromised by a familiarity bias. It considers the implications with reference to measures of visual complexity based on users' subjective judgments and explores other metrics which may provide a better basis for evaluating visual complexity in icons and displays. The interaction between shading and complexity is considered as a future direction for the empirical study of visual complexity.
Incremental Learning in the Non-negative Matrix Factorization
Authors: Sven Rebhan, Waqas Sharif, Julian Eggert
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

The non-negative matrix factorization (NMF) is capable of factorizing strictly positive data into strictly positive activations and base vectors. In its standard form, the input data must be presented as a batch of data. This means the NMF is only able to represent the input space contained in this batch of data whereas it is not able to adapt to changes afterwards. In this paper we propose a method to overcome this limitation and to enable the NMF to incrementally and continously adapt to new data. The proposed algorithm is able to cover the (possibly growing) input space without putting further constraints on the algorithm. We show that using our method the NMF is able to approximate the dimensionality of a dataset and therefore is capable to determine the required number of base vectors automatically.
An Improved Cellular Automaton Model for Urban Walkway Bi-directional Pedestrian Flow
Authors: Tao Wang, Jun Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In order to describe traffic operation characteristics of bi-directional pedestrian flow in urban pedestrian walkways and work for walking safe, authors proposed an improved cellular automaton bi-directional pedestrian flow model. This model takes into account many basic pedestrian behaviors, forward move, side stepping, position exchange, lateral-move and step back, and, using MOORE Neighborhood method, provides rules of pedestrian movement combining with the characteristics of walking process , for instance, intelligent, flexible and complicated. With computer simulation, authors studied the influence of position exchange and lateral-move on the model, the parameters of bi-directional pedestrian flow such as velocity and volume were discussed also. The results demonstrated that position exchange and lateral-move make the pedestrian behavior more comprehensive; the model could be better applied to simulate the high-density bi-directional pedestrian flow and provided reasonable traffic operation parameters of bi-directional pedestrian flow.
Laser range scanner based on self-calibration techniques using coplanarities and metric constraints
Authors: Ryo Furukawa, Hiroshi Kawasaki
Venue: Computer Vision and Image Understanding (2009)

In this paper, we propose a novel method to achieve both dense 3D reconstruction of the scene and estimation of the camera intrinsic parameters by using coplanarities and other constraints (e.g., orthogonalities or parallelisms) derived from relations between planes in the scene and reflected curves of line lasers captured by a single camera. In our study, we categorize coplanarities in the scene into two types: implicit coplanarities, which can be observed as reflected curves of line lasers, and explicit coplanarities, which are, for example, observed as walls of a building. By using both types of coplanarities, we can construct simultaneous equations and can solve them up to four degrees of freedom. To upgrade the solution to the Euclidean space and estimate the camera intrinsic parameters, we can use metric constraints such as orthogonalities of the planes. Such metric constraints are given by, for example, observing the corners of rectangular boxes in the scene, or using special laser projecting device composed of two line lasers whose laser planes are configured to be perpendicular.
Age Related Cognitive Impairments and Diffusion of Assistive Web-Base Technologies
Authors: Senaka Fernando, Tony Elliman, Arthur Money, Lorna Lines
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

Several researchers argue that age related cognitive impairments have detrimental affect on use of web services by older adults. However little and systematic applied research has been conducted on how age related cognitive impairments might affect the usage of web services by older adults. Undoubtedly, understanding the relationship between the cognitive changes that accompany aging and their impact on older adults' usage of web services will be beneficial for designing web services for this group. The paper demonstrates how such understanding has been employed to develop an assistive technology in order to improve older adults' interaction with online forms (e.g. state benefit application form). However the paper acknowledges that this new assistive technology does not guarantee that people with age related cognitive impairments accept it, as diffusion of innovation research shows that getting a new technology adopted even when it has noticeable advantage is often very difficult. Consequently the paper identifies critical factors that need to be considered when adopting this new assistive technology, drawing on Rogers (2003) theory of Diffusion of Innovations.
A Novel Image Compression Algorithm Using Ridgelet Transformation with Modified EBCOT
Authors: Zhenghua Shu, Guodong Liu, Shengqian Wang, Chengzhi Deng, Lixin Gan, Lin Zhan
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

JPEG2000 is the image compression standard which includes three core techniques: wavelet lifting scheme and EBCOT and MQ arithmetic coder. The EBCOT algorithm uses a Wavelet transform to generate the subband samples, which are quantized and coded. Normal Wavelet transforms fail to represent such functions effectively while Ridge functions are effective in representing functions that have discontinuities along straight lines. If the coefficients obtained from Ridgelet transform of the image with more discontinuities along straight lines have to be subject to quantization and coding process with EBCOT, the existing structure of the EBCOT should be modified to suit with the output of the Finite Ridgelet Transform (FRIT). In this paper, an effective image coding technique is proposed. The technique, which involves transforming the image into another domain with Ridgelet function and then quantizing and coding the coefficients with modified EBCOT, is similar to JPEG2000. A modified EBCOT algorithm for FRIT coefficients has been also proposed in this paper. Experimental results show the combination of modified EBCOT with FRIT which is used to code novel images such as images with straight lines and galaxy images significantly outperforms the combination of EBCOT with Wavelet Transform in novel image coding in terms of PSNR.
Intelligent Laboratory Resource Supply Chain Conceptual Network Model with Process and Information Integration, Visibility and Flexibility
Authors: Chin-Ming Hsu, Hui-Mei Chao
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

This paper proposes a web-based laboratory resource supply chain conceptual model for an educational institution to increase the process and information integration, visibility and flexibility. The proposed model utilizes a reasoning engine with fuzzy, parallel fuzzy rules, and de-fuzzy processes to decide the optimal purchase ordering quantity and the best constant stocks in the laboratory. The fuzzy takes the crisp input data through the characteristic function and maps the input data into its corresponding membership degree. The fuzzy rules are processed with different degree of membership and all rules in the system are processed before triggering an action. The de-fuzzy takes each item's purchase ordering degree of membership through the singleton output membership function and generates corresponding crisp data. The model allows users keying in their required experimental materials via the Web Site, uses the database management system to integrate all related information, and applies the fuzzy reasoning engine to generate the final purchase order reports to support the executor making the optimal decisions.
The RUNES Architecture for Reconfigurable Embedded and Sensor Networks
Authors: Frank Oldewurtel, Janne Riihijarvi, Krisakorn Rerkrai, Petri Mahonen
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

We present the RUNES architecture for reconfigurable embedded networked systems and wireless sensor networks. It is the first systems-level architecture for such networks to explicitly deal with heterogeneity in hardware platforms, link-layer technologies and networking protocols while offering a simple programming language independent set of APIs together with a component-oriented middleware for the application developers to work on. The solutions developed are particularly appropriate for use in various emergency response scenarios, in which reconfigurability is often a key requirement. We also report on an example realisation of our architecture in a prototypical demonstration environment in a particular emergency scenario. The evaluation of architectural aspects such as reconfigurability shows that great programming flexibility can be achieved at low implementation overhead. The experience gained from RUNES modular architecture are very promising both in academic and industry projects context.
A New Community Detection Algorithm Based on Makov-Chains and a Team Formation Model
Authors: Patrick J. McSweeney, Kishan Mehrotra, Jae C. Oh
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Detecting community structure in complex networks is an active area of research that locates dense regions of connections in networks. We suggest a novel algorithm for community detection using a new node-node association metric (based on Markov-Chains) and a team formation model.
Gaze-Assisted Pointing for Wall-Sized Displays
Authors: Hans-Joachim Bieg, Lewis L. Chuang, Harald Reiterer
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Previous studies have argued for the use of gaze-assisted pointing techniques (MAGIC) in improving human-computer interaction. Here, we present experimental findings that were drawn from human performance of two tasks on a wall-sized display. Our results show that a crude adoption of MAGIC across a range of complex tasks does not increase pointing performance. More importantly, a detailed analysis of user behavior revealed several issues that were previously ignored (such as, interference of corrective saccades, increased decision time due to variability of precision, errors due to eye-hand asynchrony, and interference with search behavior) which should influence the development of gaze-assisted technology.
JXTA resource access control by means of advertisement encryption
Authors: Joan Arnedo-Moreno, Jordi Herrera-Joancomartí
Venue: Future Generation Computer Systems (2010)

JXTA is an open-source initiative that provides a middleware for the creation and deployment of peer-to-peer (P2P) applications. Resources in a JXTA network are accessed through advertisements, special metadata documents published by its owner. By controlling access to advertisements, it is also possible to restrict access to resources. However, in an overlay multihop network, the final recipient of an advertisement is not the only one that obtains it, since intermediate peers may copy it. This paper presents a method for JXTA advertisement encryption in order to effectively control access to published resources. The scheme is fully distributed, based on a P2P pure model and does not disrupt core discovery services. The advertisement publisher controls which information should be globally disclosed and which will be restricted to only a particular subset of peers.