ppxscal/embedding_network huggingface dataset:
Nonlinear optical response from periodic molecular structures
Authors: M. Mestechkin
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

The explicit expressions of all independent components of the molecular crystal nonlinear susceptibility (NS) tensor (of any order) are given through the independent components of hyperpolarizability (HP) tensors of the constituting molecules. This expression has a polynomial form of convolutions of HP components and includes local field tensor components; each product contains from 1 to k&minus;1 HP cofactors of all preceding ranks, and k is NS rank. The Bloembergen-Armstrong formula for the first NS and Hurst-Munn for the second NS are particular cases of this expression. The reciprocal equation for molecular HP in terms of crystal NS is also presented. The Lorentz formula of the phenomenological reaction field theory is derived from the microscopic crystal Hartree-Fock HP equations with the Madelung polarization potential included. The derivation is based on the expansion of the Madelung polarization interaction over the inter-ion distances. The second order term of this expansion is expressed through the Lorentz tensor components. The expansion is obtained due to a convenient method of calculation of the Madelung crystal sums. This technique enabled to reformulate for a molecular crystal the existing computational quantum methods for lone molecules. In particular, Hartree-Fock equations for HP of molecules are adjusted for the optical properties of molecular crystals and layers. The illustrative examples, demonstrating various aspects of the mentioned techniques, are presented.
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
Authors: Eligijus Sakalauskas, Povilas Tvarijonas, Andrius Raulynaitis
Venue: Informatica (2007)

The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are used: the conjugator search problem (CSP) and modified discrete logarithm problem (DLP). The modified DLP in our approach is a matrix DLP and is different from that's used in other publications. The algorithm construction does not allow to perform a crypto-analysis by replacing the existing CSP solution to the decomposition problem (DP) solution. The group presentation level serves for two commuting subgroups and invertible group's word image matrix construction. The group representation level allows reliable factors disguising in the initial word. The word equivalence problem (WEP) solution is transformed from the group presentation level to the group representation level. Hence there are not necessary to solve WEP in the group presentation level and hence there are no restrictions on the group complexity in this sense. The construction of irreducible representation of group is required. The presented protocol is a modernization of protocol declared in (Sakalauskas et al., 2005).
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
Authors: David Coudert, Florian Huc, Dorian Mazauric
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

Treewidth and pathwidth have been introduced by Robertson and Seymour as part of the graph minor project. Those parameters are very important since many problems can be solved in polynomial time for graphs with bounded treewidth or pathwidth. By definition, the treewidth of a tree is one, but its pathwidth might be up to log n. A linear time centralized algorithms to compute the pathwidth of a tree has been proposed in [1], but so far no dynamic algorithm exists.
An Evaluation of Local Features for Face Detection and Localization
Authors: M. Asbach, P. Hosten, M. Unger
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

Local features have the ability to overcome the major drawback of traditional, holistic object detection approaches, because they are inherently invariant to geometric deformation and pose; in addition scale and rotation invariance can be easily achieved as well. However, the selection of discriminative feature locations and local descriptions is a complex task that has not been generally solved. In case of face detection, features must possess the discriminative power to differentiate between facial parts and cluttered backgrounds while they have to remain person agnostic. A multitude of suggestions for selecting facial features for tracking or identification / recognition can be found in literature, most of which rely on semi-automatic or manual definition of the feature locations. In contrast, fully automatic feature selection and generic description approaches like SIFT and SURF have been shown to provide excellent performance for rigid as well as non-rigid registration and even for object class recognition. While quantitative evaluations exist that give a hint on the registration performance of the competing designs, these scenarios are not directly transferable to object detection. In this paper we provide qualitative and quantitative analysis of existing interest point detectors as well as local descriptions in the context of face detection and localization.
Design of a 10 Credit Masters Level Assistive Technologies and Universal Design Module
Authors: Mike Wald
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The paper reports on the design and evaluation of a 10 credit module that has been designed and taught for the first time to 35 full time Computer science and software engineering Masters students.
Satisficing scrolls: a shortcut to satisfactory layout
Authors: Nathan Hurst, Kim Marriott
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

We present at a new approach to finding aesthetically pleasing page layouts. We do not aim to find an optimal layout, rather the aim is to find a layout which is not obviously wrong. We consider vertical scroll-like layout with floating figures referenced within the text where floats can have alternate sizes, may be optional, move from one side to the other and change their order. We also allow pagination. Our approach is to use a randomised local search algorithm to explore different configurations of floats, i.e. choice of floats and relative ordering. For a particular float configuration we use an efficient gradient projection-like continuous optimization algorithm. The resulting system is fast and provides an efficient warm start option to improve interactive support.
A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids
Authors: Riky Subrata, Albert Y. Zomaya, Bjorn Landfeldt
Venue: IEEE Transactions on Computers (2008)

A grid differs from traditional high performance computing systems in the heterogeneity of the computing nodes as well as the communication links that connect the different nodes together. In grids there exist users and service providers. The service providers provide the service for jobs that the users generate. Typically the amount of jobs generated by all the users are more than any single provider can handle alone with any acceptable quality of service (QoS). As such, the service providers need to cooperate and allocate jobs among them so that each is providing an acceptable QoS to their customers. QoS is of particular concerns to service providers as it directly affects customers' satisfaction and loyalty. In this paper, we propose a game theoretic solution to the QoS sensitive, grid job allocation problem. We model the QoS based, grid job allocation problem as a cooperative game and present the structure of the Nash Bargaining Solution. The proposed algorithm is fair to all users and represents a Pareto optimal solution to the QoS objective. One advantage of our scheme is the relatively low overhead and robust performance against inaccuracies in performance prediction information.
User-Centered Design with Illiterate Persons: The Case of the ATM User Interface
Authors: Anita H. Cremers, Jacomien G. Jong, Johan S. Balken
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

One of the major challenges in current user interface research and development is the accommodation of diversity in users and contexts of use in order to improve the self-efficacy of citizens. A common banking service, which should be designed for diversity, is the Automated Teller Machine (ATM). This paper describes the various user-centered design techniques to involve the future users of an ATM for illiterate persons, and reports the results of applying the techniques to a group of six Dutch functional illiterate persons. First, it has resulted in a set of user requirements and promising redesign concepts for the current ATM, relating to hardware, functionality, order of actions, lay-out, interaction modalities, and the mental model of cash withdrawal. Second, it has provided insight into how user-centered design techniques should be applied to this specific, but heterogeneous, user group.
Proactively Adapting Interfaces to Individual Users for Mobile Devices
Authors: Melanie Hartmann, Daniel Schreiber
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

The amount of functionality offered by nowadays applications is constantly growing, mostly leading to more and more complex user interfaces. This often decreases their usability, especially in mobile settings where we have to deal with limited input and output capabilities. We state that adapting the interface to the available devices as well as to the user's current needs is the key to improving usability. In this paper, we present the AUGUR system that can automatically generate user- and device-adapted interfaces. We thereby focus on the FxL* algorithm that determines which user interface elements are currently relevant for a user. We show that it clearly outperforms algorithms that do not take the user or her situation into account.
An investigation of the relationship between automated machine translation evaluation metrics and user performance on an information extraction task
Authors: Eric V. Slud, Bonnie J. Dorr
Venue:  (2007)

This dissertation applies nonparametric statistical techniques to Machine Translation (MT) Evaluation using data from a MT Evaluation experiment conducted through a joint Army Research Laboratory (ARL) and Center for the Advanced Study of Language (CASL) project. In particular, the relationship between human task performance on an information extraction task with translated documents and well-known automated translation evaluation metric scores for those documents is studied. Findings from a correlation analysis of the connection between autometrics and task-based metrics are presented and contrasted with current strategies for evaluating translations. A novel idea for assessing partial rank correlation within the presence of grouping factors is also introduced. Lastly, this dissertation presents a framework for task-based machine translation (MT) evaluation and predictive modeling of task responses that gives new information about the relative predictive strengths of the different autometrics (and re-coded variants of them) within the statistical Generalized Linear Models developed in analyses of the Information Extraction Task data. This work shows that current autometrics are inadequate with respect to the prediction of task performance but, near adequacy can be accomplished through the use of re-coded autometrics in a logistic regression setting. As a result, a class of automated metrics that are best suitable for predicting performance is established and suggestions are offered about how to utilize metrics to supplement expensive and time-consuming experiments with human participants. Now users can begin to tie the intrinsic automated metrics to the extrinsic metrics for task they perform. The bottom line is that there is a need to average away MT dependence (averaged metrics perform better in overall predictions than original autometrics). Moreover, combinations of recoded metrics performed better than any individual metric. Ultimately, MT evaluation methodology is extended to create new metrics specially relevant to task-based comparisons. A formal method to establish that differences among metrics as predictors are strong enough not to be due by chance remains as future work. Given the lack of connection in the field of MT Evaluation between task utility and the interpretation of automated evaluation metrics, as well as the absence of solid statistical reasoning in evaluating MT, there is a need to bring innovative and interdisciplinary analytical techniques to this problem. Because there are no papers in the MT evaluation literature that have done statistical modeling before or that have linked automated metrics with how well MT supports human tasks, this work is unique and has high potential for benefiting the Machine Translation research community.
Cache-Oblivious Red-Blue Line Segment Intersection
Authors: Lars Arge, Thomas Mølhave, Norbert Zeh
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plane. Our algorithm uses $O(\frac{N}{B}\log_{M/B}\frac{N}{B}+T/B)$ memory transfers, where N is the total number of segments, M and B are the memory and block transfer sizes of any two consecutive levels of any multilevel memory hierarchy, and T is the number of intersections.
Convergence of the variational iteration method for solving linear systems of ODEs with constant coefficients
Authors: Davod Khojasteh Salkuyeh
Venue: Computers Mathematics with Applications (2008)

In this paper, He's variational iteration method is applied for solving linear systems of ordinary differential equations with constant coefficients. A theorem for the convergence of the method is presented. Some illustrative examples are given to show the efficiency of the method.
New Differential Fault Analysis on AES Key Schedule: Two Faults Are Enough
Authors: Chong Hee Kim, Jean-Jacques Quisquater
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

In this paper we show a new differential fault analysis (DFA) on the AES-128 key scheduling process. We can obtain 96 bits of the key with 2 pairs of correct and faulty ciphertexts enabling an easy exhaustive key search of 232 keys. Furthermore we can retrieve the entire 128 bits with 4 pairs. To the authors' best knowledge, it is the smallest number of pairs to find the entire AES-128 key with a fault attack on the key scheduling process. Up to now 7 pairs by Takahashi et al. were the best. By corrupting state, not the key schedule, Piret and Quisquater showed 2 pairs are enough to break AES-128 in 2003. The advantage of DFA on the key schedule is that it can defeat some fault-protected AES implementations where the round keys are not rescheduled prior to the check. We implemented our algorithm on a 3.2 GHz Pentium 4 PC. With 4 pairs of correct and faulty ciphertexts, we could find 128 bits less than 2.3 seconds.
A Two-Pass Classification Method Based on Hyper-Ellipsoid Neural Networks and SVM's with Applications to Face Recognition
Authors: Chengan Guo, Chongtao Yuan, Honglian Ma
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper we propose a two-pass classification method and apply it to face recognitions. The method is obtained by integrating together two approaches, the hyper-ellipsoid neural networks (HENN's) and the SVM's with error correcting codes. This method realizes a classification operation in two passes: the first one is to get an intermediate classification result for an input sample by using the HENN's, and the second pass is followed by using the SVM's to re-classify the sample based on both the input data and the intermediate result. Simulations conducted in the paper for applications to face recognition showed that the two-pass method can maintain the advantages of both the HENN's and the SVM's while remedying their disadvantages. Compared with the HENN's and the SVM's, a significant improvement of recognition performance over them has been achieved by the new method.
Methods and Tools for Formal Software Engineering
Authors: Zhiming Liu, R. Venkatesh
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

We propose a collaboration project to integrate the research effort and results obtained at UNU-IIST on formal techniques in component and object systems with research at TRDDC in modelling and development of tools that support object-oriented and component-based design. The main theme is an integration of verification techniques with engineering methods of modelling and design, and an integration of verification tools and transformation tools. This will result in a method in which a correct program can be developed through transformations that are either proven to be correct or by showing that the transformed model can be proven correct by a verification tool.
Self-synchronization Blind Audio Watermarking Based on Feature Extraction and Subsampling
Authors: Xiaohong Ma, Bo Zhang, Xiaoyan Ding
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

A novel embedding watermark signal generation scheme based on feature extraction is proposed in this paper. The original binary watermark image is divided into two blocks with the same size and each block is changed into one dimension sequences. After that, Independent Component Analysis (ICA) is used to extract the independent features of them, which are regarded as two embedding watermark signals. In the embedding procedure, the embedding watermark signals are embedded in some selected wavelet coefficients of the subaudios obtained by subsampling. And Self-synchronization is implemented by applying special peak point extraction scheme. The blind extraction procedure is basically the converse procedure of the embedding one. And the original watermark image can be recovered with the help of the mixing matrix of the ICA. Experimental results show the validity of this scheme.
Applying Space State Models in Human Action Recognition: A Comparative Study
Authors: M. Ángeles Mendoza, Nicolás Pérez De La Blanca
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents comparative results of applying different architectures of generative classifiers (HMM, FHMM, CHMM, Multi-Stream HMM, Parallel HMM ) and discriminative classifier as Conditional Random Fields (CRFs) in human action sequence recognition. The models are fed with histogram of very informative features such as contours evolution and optical-flow. Motion orientation discrimination has been obtained tiling the bounding box of the subject and extracting features from each tile. We run our experiments on two well-know databases, KTH´s database and Weizmann´s. The results show that both type of models reach similar score, being the generative model better when used with optical flow features and being the discriminative one better when uses with shape-context features.
An Adaptive Fast Transform Based Image Compression
Authors: Kamil Stokfiszewski, Piotr S. Szczepaniak
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The paper deals with image compression performed using an adaptive fast transform-based method. The point of departure is a base scheme for fast computation of certain discrete transforms. The scheme can be interpreted in terms of the neural architecture whose parameters (neurons' weights) can be adjusted during learning on set data, here images. The same basic network topology enables realization of diverse transformations. The results obtained for the task of image compression are presented and evaluated.
Engineering self-organizing multi-agent systems
Authors: Radhika Nagpal, Chih-han Yu, Daniel Yamins
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

In this demo session, we will present two examples of how one can systematically program self-organizing multi-agent systems, using inspiration from biology. The first system is a modular robot that autonomously adapts to satisfy complex environmentally-adaptive goals through the cooperation of multiple module agents. The second is a global-to-local compiler that can transform a user-specified pattern formation goal into a multi-agent program and reason about the agent resources required. These systems show (1) how biological design principles can be formally captured and theoretically analyzed, and (2) how global goals can be translated into local interactions amongst many simple agents. Both systems will be demonstrated in real-time and interactively with the audience.
Multi-level Particle Filter Fusion of Features and Cues for Audio-Visual Person Tracking
Authors: Keni Bernardin, Tobias Gehrig, Rainer Stiefelhagen
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

In this paper, two multimodal systems for the tracking of multiple users in smart environments are presented. The first is a multi-view particle filter tracker using foreground, color and special upper body detection and person region features. The other is a wide angle overhead view person tracker relying on foreground segmentation and model-based blob tracking. Both systems are completed by a joint probabilistic data association filter-based source localizer using the input from several microphone arrays. While the first system fuses audio and visual cues at the feature level, the second one incorporates them at the decision level using state-based heuristics.The systems are designed to estimate the 3D scene locations of room occupants and are evaluated based on their precision in estimating person locations, their accuracy in recognizing person configurations and their ability to consistently keep track identities over time.The trackers are extensively tested and compared, for each separate modality and for the combined modalities, on the CLEAR 2007 Evaluation Database.
A Study on Two New Protection Strategies
Authors: Alfred Bashllari, Dritan Nace
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

In this paper we propose two new protection strategies based on the end-to-end survivability concept. The first one, called Shared Protection Robust Routing (SPRR) strategy can be seen as a generalized version of end-to-end rerouting with stub release. Numerical tests give encouraging performances for this scheme in comparison to the conventional end-to-end rerouting ones. However, as expected, it requires a higher (still not excessive) number of routes comparing to conventional schemes. A new, slightly different, scheme, called Elastic Robust Routing (ERR) strategy is provided next. Computational results for realistic network instances provide a comparison of both protection strategies and end-to-end rerouting with stub release in terms of overall network cost.