ppxscal/embedding_network huggingface dataset:
On Generalized Feistel Structures Using the Diffusion Switching Mechanism
Authors: Taizo Shirai, Kiyomichi Araki
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

To design secure blockciphers, estimating immunity against differential attack and linear attack is essential. Recently, Diffusion Switching Mechanism (DSM) is proposed as a design framework to enhance the immunity of Feistel structure against differential attack and linear attack. In this paper, we give novel results on the effect of DSM on three generalized Feistel structures, i.e. Type-I, Type-II and Nyberg's structures. We first show a method for roughly estimating lower bounds of a number of active S-boxes in Type-I and Type-II structures using DSM. Then we propose an improved search algorithm to find lower bounds for generalized structures efficiently. Experimental results obtained by the improved algorithm show that DSM raises lower bounds for all of the structures, and also show that Nyberg's structure has the slowest diffusion effect among them when SP-type F-functions are used.
Research on Implementation of Grid Monitoring System Based on GMA
Authors: Hongbin Cai, Fan Min, Jianwei Liao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Grid technology opens the way to build collaborative environments that enable distributed multi-organizational teams to jointly use computing resources. Thus automatic resources/services discovery should be launched with the dynamicity of grid elements. Hardware and software failure can be found and solved in time by monitoring. Analyzing the gathered data could help to find performance bottleneck. In this paper, we analyzed the aims and main tasks of Grid Monitoring and the advantage of GMA (Grid monitoring Architecture), then proposed a java-based design pattern of Grid Monitoring System (JGMS) on the basis of GMA. The JGMS uses special agents to complete the communication between Producers and Consumers in different grid nodes. So, it can work on different platforms, pass through firewalls and be easy to deploy and use.
Product mix problems considering several probabilistic conditions and flexibility of constraints
Authors: Takashi Hasuike, Hiroaki Ishii
Venue: Computers and Industrial Engineering (2009)

This paper considers product mix problems including randomness of future returns, ambiguity of coefficients and flexibility of upper value with respect to each constraint such as budget, human resource, time and several costs. Particularly, the flexibility is assumed to be a fuzzy goal. Then, several models based on maximizing total future profits under a level of satisfaction to each fuzzy goal are proposed. Furthermore, the model considering preference ranking to each fuzzy goal of constraints is proposed. Since these problems are basically formulated as nonlinear programming problems, the transformations into deterministic equivalent problems are introduced and the efficient solution methods are developed. A numerical example for product mix problem is given to illustrate our proposed models.
Development of USN based disaster prevention system in South Korea
Authors: Dae-Hyun Ryu, Seung-Hoon Nam
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

It is possible to construct a systematic and efficient disaster prevention system utilizing ubiquitous sensor networks and wired/wireless communication infrastructure. In this paper, we suggest and design a USN (Ubiquitous Sensor Network) platform to prevent man-maid disasters based on the scenario of a gas leak explosion. Using our proposed system, we can monitor and control relevant facilities in real-time and can protect people within the disaster area by deciding on a course of action before the disaster occurs and quickly informing affected people what the appropriate course of action is. Thus affected individuals would be able to evacuate to a safer area. In addition, timely information about an impending disaster allows for the possibility of preventing a disaster from occurring by removing the root cause. This system may be the key component to new policy that places the safety of citizens as a top priority.
Realizability of Choreographies Using Process Algebra Encodings
Authors: Gwen Salaün, Tevfik Bultan
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange of messages. Interactions among a set of services involved in a new system are described from a global point of view using choreography specification languages such as WS-CDL or collaboration diagrams. In this paper, we present an encoding of collaboration diagrams into the LOTOS process algebra. This encoding allows to (i) check choreography specification using the LOTOS verification toolbox (CADP), (ii) check realizability of collaboration diagrams for both synchronous communication and bounded asynchronous communication, and (iii) automate service peer generation. Realizability indicates whether peers can be generated from a choreography such that they will behave exactly as formalized in its specification. If the collaboration diagram is unrealizable, our approach extends the peer generation process by adding some communications that make the peers respect the choreography specification.
A Graph-Based Framework For Rapid Construction Of Document Integration Tools
Authors: Anne-Thérèse Körtgen, Simon M. Becker, Sebastian Herold
Venue: Journal of Integrated Design Process Science (2007)

In development processes, multiple tools are used to describe different aspects of the product to be developed. Resulting information is stored in heterogeneous documents that are technically independent but whose contents are closely related on the semantic level. Thus, if one document is changed, these changes have to be propagated to dependent documents in order to restore mutual consistency. There is a need for integration tools which assist developers with consistency maintenance, because this is error-prone work if done manually due to complex and big documents. Due to the nature of development processes, these tools have to work incrementally and bidirectionally, and have to support user interaction. Driven by this need, we developed an approach for the realization of such tools which is currently being used in the chemical engineering domain. The core idea of the approach is to define graph-based rules that control change propagation. In (Becker et al, 2002) we gave an overview of the overall approach and in (Becker et al, 2003) we introduced the underlying rule models. The rule execution formalism is described in (Becker et al, 2004). In this paper, we present the architecture and the implementation of a framework realizing the approach and outline how the approach is going to be transferred into practice together with an industrial partner from the chemical engineering domain.
A class of stochastic gradient algorithms with exponentiated error cost functions
Authors: C. Boukis, D. P. Mandic, A. G. Constantinides
Venue: Digital Signal Processing (2009)

A novel class of stochastic gradient descent algorithms is introduced based on the minimisation of convex cost functions with exponential dependence on the adaptation error, instead of the conventional linear combinations of even moments. The derivation is supported by rigourous analysis of the necessary conditions for convergence, the steady state mean square error is calculated and the optimal solutions in the least exponential sense are derived. The normalisation of the associated step size is also considered in order to fully exploit the dynamics of the input signal. Simulation results support the analysis.
High-Precision and Arbitrary-length Fixed-Point Fast Hartley Transform without Multiplications
Authors: Zhenbing Liu, Jianguo Liu, Guoyou Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, based on our previous work of performing DHT via linear sums of discrete moments, we have made development to eliminate multiplications in discrete Hartley transforms by performing appropriate bit operations and shift in binary system, which can be implemented by integer additions of fixed points. An efficient and regular systolic array is designed to implement it, and the complexity analysis is also given. Different to other fast Hartley transforms, our algorithm can deal with arbitrary length signals and get high precision. The approach is also applicable to multi-dimensional DHT and DHT inverses.
A design methodology and device/circuit/architecture compatible simulation framework for low-power magnetic quantum cellular automata systems
Authors: Charles Augustine, Behtash Behin-Aein, Xuanyao Fong, Kaushik Roy
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

CMOS device scaling is facing a daunting challenge with increased parameter variations and exponentially higher leakage current every new technology generation. Thus, researchers have started looking at alternative technologies. Magnetic Quantum Cellular Automata (MQCA) is such an alternative with switching energy close to thermal limits and scalability down to 5nm. In this paper, we present a circuit/architecture design methodology using MQCA. Novel clocking techniques and strategies are developed to improve computation robustness of MQCA systems. We also developed an integrated device/circuit/system compatible simulation framework to evaluate the functionality and the architecture of an MQCA based system and conducted a feasibility/comparison study to determine the effectiveness of MQCAs in digital electronics. Simulation results of an 8-bit MQCA-based Discrete Cosine Transform (DCT) with novel clocking and architecture show up to 290X and 46X improvement (at iso-delay and optimistic assumption) over 45nm CMOS in energy consumption and area, respectively.
Future tenseWebmind says hello
Authors: Robert J. Sawyer
Venue: Communications of the ACM (2009)

Future Tense, one of the revolving features on this page, presents stories and essays from the intersection of computational science and technological speculation, their boundaries limited only by our ability to imagine what will and could be.Artificial intelligence doesn't necessarily require a programmer.
Quantitative Association Analysis Using Tree Hierarchies
Authors: Feng Pan, Lynda Yang, Leonard McMillan, Fernando Pardo Manuel de Villena, David Threadgill, Wei Wang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, association analysis aims to find dependencies of target variables to subsets of measurements. Most previous algorithms adopt a two-stage approach; they first group samples based on the similarity in the subset of measurements, and then they examine the association between these groups and the specified target variables without considering the inter-group similarities or alternative groupings. This can lead to cases where the strength of association depends significantly on arbitrary clustering choices. In this paper, we propose a tree-based method for quantitative association analysis. Tree hierarchies derived from sample similarities represent many possible sample groupings. They also provide a natural way to incorporate domain knowledge such as ontologies and to identify and remove outliers. Given a tree hierarchy, our association analysis evaluates all possible groupings and selects the one with strongest association to the target variable. We introduce an efficient algorithm, TreeQA, to systematically explore the search-space of all possible groupings in a set of input trees, with integrated permutation tests. Experimental results show that TreeQA is able to handlelarge-scale association analysis very efficiently and is more effective and robust in association analysis than previous methods.
On the Check of Accuracy of the Coefficients of Formal Power Series
Authors: Takuya Kitamoto, Tetsu Yamaguchi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Let M(y) be a matrix whose entries are polynomial in y, λ(y) and v(y) be a set of eigenvalue and eigenvector of M(y). Then, λ(y) and v(y) are algebraic functions of y, and λ(y) and v(y) have their power series expansions λ(y) = β0 + β1y + ₀ + βkyk + ₀ (βj ε C),Â Â Â Â Â Â Â Â Â Â Â Â (1) v(y) = γ0 + γ1y + ₀ + γkyk + ₀ (γj ε Cn),Â Â Â Â Â Â Â Â Â Â Â Â (1) provided that y = 0 is not a singular point of λ(y) or v(y). Several algorithms are already proposed to compute the above power series expansions using Newton's method (the algorithm in [4]) or the Hensel construction (the algorithm in [5],[12]). The algorithms proposed so far compute high degree coefficients βk and γk, using lower degree coefficients βj and γj (j = 0,1,₀,k-1). Thus with floating point arithmetic, the numerical errors in the coefficients can accumulate as index k increases. This can cause serious deterioration of the numerical accuracy of high degree coefficients βk and γk, and we need to check the accuracy. In this paper, we assume that given matrix M(y) does not have multiple eigenvalues at y = 0 (this implies that y = 0 is not singular point of λ(y) or v(y)), and presents an algorithm to estimate the accuracy of the computed power series βi,γj in (1) and (2). The estimation process employs the idea in [9] which computes a coefficient of a power series with Cauchy's integral formula and numerical integrations. We present an efficient implementation of the algorithm that utilizes Newton's method. We also present a modification of Newton's method to speed up the procedure, introducing tuning parameter p. Numerical experiments of the paper indicates that we can enhance the performance of the algorithm by 12 ~ 16%, choosing the optimal tuning parameter p.
Numerical solution of a one-dimensional inverse problem by the discontinuous Galerkin method
Authors: Y. Epshteyn, T. Khan, B. Rivière
Venue: Mathematics and Computers in Simulation (2009)

In this paper, we combine a Tikhonov regularization with a discontinuous Galerkin method to solve an inverse problem in one-dimension. We show that the regularization is simpler than in the case of the inversion using continuous finite elements. We numerically demonstrate that there exist optimal step sizes and polynomial degrees for inversion using the DG method. Numerical results are compared with those obtained by applying the standard finite element method with B-splines as a basis.
The role of input devices in the gaming experience
Authors: Eduardo H. Calvillo Gámez
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

This paper reports on my doctoral work done at UCLIC that looks at how novel input devices affect the gaming experience. The paper presents the motivation, question, methodology, expected contributions, partial results and time line to complete the thesis.
Cost- and Collision-Minimizing Forwarding Schemes for Wireless Sensor Networks: Design, Analysis and Experimental Validation
Authors: Michele Rossi, Nicola Bui, Michele Zorzi
Venue: IEEE Transactions on Mobile Computing (2009)

The paper presents an original integrated MAC and routing scheme for wireless sensor networks. Our design objective is to elect the next hop for data forwarding by jointly minimizing the amount of signaling to complete a contention and maximizing the probability of electing the best candidate node. Towards this aim, we represent the suitability of a node to be the relay by means of locally calculated and generic cost metrics. Based on these costs, we analytically model the access selection problem through dynamic programming techniques, which we use to find the optimal access policy. Hence, we propose a contention-based MAC and forwarding technique, called Cost and Collision Minimizing Routing (CCMR). This scheme is then thoroughly validated and characterized through analysis, simulation and experimental results.
Introduction to Monte Carlo simulation
Authors: Samik Raychaudhuri
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This is an introductory tutorial on Monte Carlo simulation, a type of simulation that relies on repeated random sampling and statistical analysis to compute the results. In this paper, we will briefly describe the nature and relevance of Monte Carlo simulation, the way to perform these simulations and analyze results, and the underlying mathematical techniques required for performing these simulations. We will present a few examples from various areas where Monte Carlo simulation is used, and also touch on the current state of software in this area.
Increasing engagement in automata theory with JFLAP
Authors: Susan H. Rodger, Eric Wiebe, Kyung Min Lee, Chris Morgan, Kareem Omar, Jonathan Su
Venue: ACM SIGCSE Bulletin (2009)

We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our results the majority of students felt that having access to JFLAP made learning course concepts easier, made them feel more engaged in the course and made the course more enjoyable. We also describe changes and additions to JFLAP we have made based on feedback from users. These changes include new algorithms such as a CYK parser and a user-controlled parser, and new resources that include a JFLAP online tutorial, a wiki and a listserv.
Classroom Robotics: Case Stories of 21st Century Instruction for Millennial Students
Authors: Kathleen,  P King, Mark Gura
Venue:  (2007)

The purpose of this book is to reach out to teachers, parents, coaches, and students who may be hoping to, or just investigating the possibility of, how to get started with robotics. At the same time, we hope to leverage the efforts of those who have been hard at work and "play" in this massive movement for many years, applaud their efforts, and provide them with documentation, support, and additional resources to reach further into the possibilities they can help create for all of us in bringing the power and potential of learning through robotics to more students, to the classroom and beyond. Not only does this book provide resources and firsthand insight into this exciting field, but it also provides one-of-a-kind perspectives of curricular applications of robotics for student learning.
Neural Predictive Force Control for a Hydraulic Actuator: Simulation and Experiment
Authors: Shouling He
Venue: Applied Artificial Intelligence (2009)

This paper proposes a neural-based predictive control algorithm for online control of a force-acting industrial hydraulic actuator. In the algorithm, a multilayer feedforward neural network is employed to modeling the highly nonlinear hydraulic actuator. The nonlinear neural model is instantaneously linearized at each sampling point. Estimated parameters from the linearized model are used in the generalized predictive control (GPC) algorithm to control the contact force. Simulation and experimental results show that the neural-based predictive controller can adapt to different environments and keep the contact force in a desired value despite high nonlinearity and uncertainty in the hydraulic actuator system.
WeSpace: the design development and deployment of a walk-up and share multi-surface visual collaboration system
Authors: Daniel Wigdor, Hao Jiang, Clifton Forlines, Michelle Borkin, Chia Shen
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present WeSpace -- a collaborative work space that integrates a large data wall with a multi-user multi-touch table. WeSpace has been developed for a population of scientists who frequently meet in small groups for data exploration and visualization. It provides a low overhead walk-up and share environment for users with their own personal applications and laptops. We present our year-long effort from initial ethnographic studies, to iterations of design, development and user testing, to the current experiences of these scientists carrying out their collaborative research in the WeSpace. We shed light on the utility, the value of the multi-touch table, the manifestation, usage patterns and the changes in their workflow that WeSpace has brought about.
Discrete maximum principle for FE solutions of the diffusion-reaction problem on prismatic meshes
Authors: Antti Hannukainen, Sergey Korotov, Tomáš Vejchodský
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper we analyse the discrete maximum principle (DMP) for a stationary diffusion-reaction problem solved by means of prismatic finite elements. We derive geometric conditions on the shape parameters of the prismatic partitions which guarantee validity of the DMP. The presented numerical tests show the sharpness of the obtained conditions.
An e-support system for lifelong learning total quality management (TQM) methodologies and tools in healthcare
Authors: S. Zimeras, P. Kostagiolas
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The concept of quality in healthcare has gradually developed from inspection, quality control and assurance, into total quality management. Quality is indeed a multifaceted concept entailing multiple consequences for the overall management of healthcare services. Total Quality Management methods and tools are designed to be simple and effective in identifying, organizing, quantitative and qualitative operational healthcare data. Healthcare professionals will be empowered through the use of such tools and methods. This work is studying and providing a conceptual framework of a professional-centered e-support system for learning TQM methods and tools. Our methodology is based on British Standards and in particular the BS 8423-2003 "a code of practice for e-support in e-learning systems" as well as novel methods for teaching quantitative statistical methods as well as qualitative approaches for quality in healthcare. Furthermore, the role of a modern hospital library will be exhibited for providing the information services required for the most excellent learning experience. Quality methods and tools are essential; hence they must "communicate" efficiently to the healthcare professionals.
Palettes satellitaires: faciliter les changements d'outils avec la rotation de la souris
Authors: Rodrigo A. B. Almeida
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

The "Satellite Palette" is a novel interaction technique that aims to reduce the roundtrips between the graphic palettes and the objects of interest. This technique, based on a rotation-sensing mouse, provides tool selection through device rotation. A first example of application is discussed.
How anthropomorphism affects empathy toward robots
Authors: Laurel D. Riek, Tal-Chen Rabinowitch, Bhismadev Chakrabarti, Peter Robinson
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

A long-standing question within the robotics community is about the degree of human-likeness robots ought to have when interacting with humans. We explore an unexamined aspect of this problem: how people empathize with robots along the anthropomorphic spectrum. We conducted an experiment that measured how people empathized with robots shown to be experiencing mistreatment by humans. Our results indicate that people empathize more strongly with more human-looking robots and less with mechanical-looking robots.