ppxscal/embedding_network huggingface dataset:
Plenary lecture I: quadratic optimization models and algorithms. one algorithm for linear bound constraints based on neural networks
Authors: Nicolae Popoviciu
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

The topic begins with several quadratic programming (QP) models (1. unconstrained model; 2. QP with linear and symmetric bound constraints; 3. QP with linear bound constraints; 4. QP with one quadratic constraint; 5. QP in standard form). The solving of QP models 2, 3 and 4 is associated with a neural network frame. For QP models 2 and 3 a preconditioning technique is developed. This technique reduces the susceptibility of the system to round off errors. Two algorithms of preconditioning are presented: the preconditioning algorithm 1 is based on one associated matrix and the preconditioning algorithm 2 is based on two associated matrices. Both algorithms are used in several applications. Each application ends by a test of correctitude of computations, which validates the theory. The solving of models 2 and 3 is done by a general neural network algorithm. For model 5 a dual quadratic problem (DQP) is associated. The DQP is studied in two cases: for invertible matrix and for non-invertible matrix. In the first case an iterative algorithm is developed (based on Hildreth and D' Esopo ideas). Numerical examples illustrate the theory.
Deterrence and Defeasibility in Argumentation Process for ALIS Project
Authors: Michel Rudnianski, Hélène Bestougeff
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

Argumentation issues, which are of core importance to ALIS, are addressed through a particular category of qualitative games called Games of Deterrence. The graphs associated with those games are interpreted as sets of inferences sequences between statements in the framework of non-monotonic logic. Thus an argumentation process is interpreted as a game of deterrence, which resolution determines the truth or falsity of statements, and the possible argumentation strategies of the parties.
IT Security and Privacy Issues in Global Financial Services Institutions: Do Socio-Economic and Cultural Factors Matter?
Authors: Princely Ifinedo
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

Financial services institutions (FSIs) around the globe know they must proactively work toward protecting customer data and thwarting emerging security threats. Deloitte Touche Tohmatsu (DTT), an international firm that provides audit, consulting, and financial advisory services has used its networks and reach to investigate security and privacy issues in FSIs around the world. DTT’s first survey appeared in 2003 and four others have followed since then. This present article draws from last survey. Given that the literature has shown that socio-economic and cultural factors are important considerations for organizations when accepting innovations and new practices. This study was designed to provide a layer of understanding not seen in the DTT’s study by examining whether socio-economic and cultural indicators matter in how IT security and privacy issues are being perceived in global FSIs. Two relevant hypotheses were developed to test our assertions. The main finding of the study was that such contextual factors may not be sufficient in differentiating how global FISs view or respond to key IT security and privacy issues. However, our study found one item related to security awareness training for FISs’ employees to vary significantly across the surveyed regions when the Gross Domestic Product (GDP per capita) variable was used in the analysis. It is hoped that our study’s findings and conclusion will be beneficial to practitioners and researchers.
Content-Based 3D Object Retrieval
Authors: Benjamin Bustos, Daniel Keim, Dietmar Saupe, Tobias Schreck
Venue: IEEE Computer Graphics and Applications (2007)

Methods for automatically extracting descriptors from 3D objects are key to searching and indexing techniques in their growing repositories. The authors present two recently proposed approaches and discuss methods for benchmarking the 3D retrieval systems' qualitative performance.
Fast and Robust Face Tracking for Analyzing Multiparty Face-to-Face Meetings
Authors: Kazuhiro Otsuka, Junji Yamato
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

This paper presents a novel face tracker and verifies its effectiveness for analyzing group meetings. In meeting scene analysis, face direction is an important clue for assessing the visual attention of meeting participants. The face tracker, called STCTracker (Sparse Template Condensation Tracker), estimates face position and pose by matching face templates in the framework of a particle filter. STCTracker is robust against large head rotation, up to ±60 degrees in the horizontal direction, with relatively small mean deviation error. Also, it can track multiple faces simultaneously in real-time by utilizing a modern GPU (Graphics Processing Unit), e.g. 6 faces at about 28 frames/second on a single PC. Also, it can automatically build 3-D face templates upon initialization of the tracker. This paper evaluates the tracking errors and verifies the effectiveness of STCTracker for meeting scene analysis, in terms of conversation structures, gaze directions, and the structure of cross-modal interactions involving head gestures and utterances. Experiments confirm that STCTracker can basically match the performance of from the user-unfriendly magnetic-sensor-based motion capture system.
Rational Design of atomic Gaussian basis sets for Ab initio Calculations of the dipole polarizabilities and hyperpolarizabilities II. Moderate Size Basis Sets for the First-Row Atoms from B to F
Authors: Mikhail B. Zuev, Marina Yu. Balakina, Sergey E. Nefediev
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

The design rules, elaborated earlier in the first paper of this series for the construction of atomic Gaussian basis sets, tailored for the calculations of molecular polarizabilities &alpha;$_{ij}$ and hyperpolarizabilities &beta;$_{ijk}$ at the SCF level, are tested here by the example of the basis set families, generated from the energy-optimized (9s5p) parent set. Adding the polarization sets to contracted sp substrates of various flexibility, we generate the [4s3pNdMf], [5s3pNdMf] and [6s4pNdMf] bases families, which are combined with the corresponding [3sNpMd] and [4sNpMd] bases for Hydrogen. The SCF results for H$_2$CO, CH$_3$CN, and HCN molecules, obtained with (11s7p3d/6s3p)/[6s4p3d/4s3p], are used as a benchmark here. The contraction flexibility is shown to affect the convergence of both &alpha;$_{ij}$ and &beta;$_{ijk}$ values only insignificantly, slightly increasing the uncertainties of the calculated data. The smallest [4s3p3d/3s3p] basis is recommended for the calculation of (hyper)polarizabilities of large molecules within the SCF approximation. For the conjugated organic molecules with dominant &pi;-electron polarization rather reliable SCF results are obtained at the [4s3p2d/3s] level. So, for p-nitroaniline this basis set reproduces the results obtained with [6s4p3d/4s3p] basis with the error 1% for &alpha;$_{ij}$ and 3% for dominant longitudinal hyperpolarizability &beta;$_{zzz}$.
Techniques for streaming, storage and search of video
Authors: David H.C. Du
Venue:  (2008)

Recent developments like better last-hop bandwidth to homes, free video sharing websites, availability of cheap consumer electronics to produce and consume video have led to wide proliferation of video in many aspects of our lives. This leads to many interesting technical challenges that forms the broad topic of this thesis. In this thesis, we make four key contributions towards providing video services over the Internet. (1) Bandwidth and delay properties of a shared, global network like the Internet constantly change over time. Providing Quality of Service (QoS) for Internet-based video streaming applications requires the server and/or client to be network-aware and adaptive. We propose a video server architecture that can adapt to changes in the network conditions with minimal effect on client's perceived video quality. (2) With an increasing variety of video consuming devices, each with its own strengths and limitations, content needs to be tailored to fit every device's capability. We propose a new agent called composing and transcoding (CaT) gateway that intelligently uses two types of video tailoring techniques to suit content for devices better. (3) Delivering video to millions of clients requires large scale bandwidth commitments from a server. With large number of users and phenomena like flash crowds, peer-to-peer (P2P) streaming is a very attractive option to provide scalable streaming services. However, with P2P streaming, scalability comes at the cost of reliability and quality of the delivered video. We propose a framework called StatStream that provides statistical guarantees on the reliability and quality of video delivered through a P2P overlay network. (4) Video sharing websites require good search methods to browse for videos of interest. In that context, richer query models like content-based search techniques look very promising. We point out why todays' systems are not well equipped to handle content-based searches. We propose a new system called SQUAD that can handle content-based searches better. SQUAD also provides a richer query interface to search video metadata in addition to the video content itself.
The INEX 2007 Multimedia Track
Authors: Theodora Tsikrika, Thijs Westerveld
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

The INEX Multimedia track focuses on using the structure of XML documents to extract, relate, and combine the relevance of different multimedia fragments. This paper presents a brief overview of the track for INEX 2007, including the track's test collection, tasks, and goals. We also report the approaches of the participating groups and their main results.
Improved Layout of Phylogenetic Networks
Authors: Philippe Gambette, Daniel H. Huson
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal angle algorithm is used to draw such networks, producing layouts that leave much room for improvement. Addressing the problem of producing better layouts of split networks, this paper presents an algorithm for maximizing the area covered by the network, describes an extension of the equal-daylight algorithm to networks, looks into using a spring embedder and discusses how to construct rooted split networks.
An FPGA Configuration Scheme for Bitstream Protection
Authors: Masaki Nakanishi
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

FPGAs are widely used recently, and security on configuration bitstreams is of concern to both users and suppliers of configuration bitstreams (e.g., intellectual property vendors). In order to protect configuration bitstreams against the threats such as FPGA viruses, piracy and reverse engineering, configuration bitstreams need to be encrypted and authenticated before loaded into FPGAs. In this paper, we propose a new FPGA configuration scheme that can authenticate and/or decrypt a bitstream. The proposed scheme has flexibility in choosing authentication and/or decryption algorithms and causes only a small area overhead since it utilizes programmable logic blocks to implement authentication and/or decryption circuits.
Analysis of energy conserving low-order models
Authors: S. Lakshmivarahan, Ming Xue
Venue:  (2007)

Low-order models of order n, denoted by LOM( n), naturally arise in the application of Galerkin type projection techniques to a system of partial differential equations of interest in geophysical domain. In order for the LOM(n) to represent physically meaningful solution, it is necessary that LOM(n) conserves energy. The Galerkin projection technique does not incorporate any explicit criteria for the choice of the order and the modes to guarantee energy conservation. With this study, we derive a new set of sufficient conditions on the structural parameter of LOM(n) for conserving energy. It is well known in Mathematical Physics that the Volterra gyrostat and many of its special cases including the Euler gyroscope represent a prototype of energy conserving dynamical systems. It is formally proved in this dissertation that the systems of coupled Volterra gyrostats are special cases of LOMs that satisfies the new sufficient conditions. We also introduce the definition of the generalized Volterra gyrostats that contains nonlinear feedback. Exploiting the inherent relation between the energy conserving LOMs satisfying the sufficient conditions and the systems of coupled generalized Volterra gyrostats, it turns out that these two sets of systems are equivalent. Using the class of generalized Volterra gyrostats as basic building block, any energy conserving low-order model that routinely arise in fluid dynamics, turbulence and atmospheric sciences can be converted into a system of coupled generalized gyrostats. An algorithm for doing such a transformation is provided. Motivated by the importance and the central role played by the Volterra gyrostat in studying LOMs, this study also analyze the stability properties of the classical Volterra gyrostat and all of its special cases.
Mobile Service Affordability for the Needy, Addiction, and ICT Policy Implications
Authors: L-F Pau
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

This paper links communications and media usage to social and household economics boundaries. It highlights that in present day society, communications and media are a necessity, but not always affordable, and that they furthermore open up for addictive behaviours which raise additional financial and social risks. A simple and efficient methodology compatible with state-of-the-art social and communications business statistics is developed, which produces the residual communications and media afford ability budget and ultimately the value-at-risk in terms of usage and tariffs. Sensitivity analysis provide sprecious information on communications and media adoption on the basis of affordability. Case data are surveyed from various countries. ICT policy recommendations are made to support widespread and responsible communications access.
Perceptually-Based Functions for Coarseness Textural Feature Representation
Authors: J. Chamorro-Martínez, E. Galán-Perales, B. Prados-Suárez, J. M. Soto-Hidalgo
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Coarseness is a very important textural concept that has been widely analyzed in computer vision for years. However, a model which allows to represent different perception degrees of this textural concept in the same way that humans perceive texture is needed. In this paper we propose a model that associates computational measures to human perception by learning an appropriate function. To do it, different measures representative of coarseness are chosen and subjects assessments are collected and aggregated. Finally, a function that relates these data is fitted.
From ABZ to Cryptography
Authors: Eerke A. Boiten
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

Three Steps from the IdealIdeally correctness is by construction; post-hoc verification is second choice; verification of proofs is the next step down. In the application area of modern cryptographic protocol verification, the latter would be viewed as serious progress.Modern Cryptographic Protocols and SecurityA modern cryptographic protocol may have the following properties: its functionality is clear, but its security definition incomplete;it contains explicit probabilistic elements;its notion of security (correctness) is approximate, and relative to computational resources available for an attack against it;its security is proved relative to some problem being hard;primitives cannot be implemented compositionally.All this means that the standard techniques and good intentions of formal methods do not work straight out of the box. Many approaches to bridging the gap between formal methods and modern cryptography exist --- but none of these are too close in spirit to the ABZ world.
Automating Elementary Number-Theoretic Proofs Using Gröbner Bases
Authors: John Harrison
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

We present a uniform algorithm for proving automatically a fairly wide class of elementary facts connected with integer divisibility. The assertions that can be handled are those with a limited quantifier structure involving addition, multiplication and certain number-theoretic predicates such as `divisible by', `congruent' and `coprime'; one notable example in this class is the Chinese Remainder Theorem (for a specific number of moduli). The method is based on a reduction to ideal membership assertions that are then solved using Gröbner bases. As well as illustrating the usefulness of the procedure on examples, and considering some extensions, we prove a limited form of completeness for properties that hold in all rings.
Efficient Stateful Dynamic Partial Order Reduction
Authors: Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Robert M. Kirby
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

In applying stateless model checking methods to realistic multithreaded programs, we find that stateless search methods are ineffective in practice, even with dynamic partial order reduction (DPOR) enabled. To solve the inefficiency of stateless runtime model checking, this paper makes two related contributions. The first contribution is a novel and conservative light-weight method for storing abstract states at runtime to help avoid redundant searches. The second contribution is a stateful dynamic partial order reduction algorithm (SDPOR) that avoids a potential unsoundness when DPOR is naively applied in the context of stateful search. Our stateful runtime model checking approach combines light-weight state recording with SDPOR, and strikes a good balance between state recording overheads, on one hand, and the elimination of redundant searches, on the other hand. Our experiments confirm the effectiveness of our approach on several multithreaded benchmarks in C, including some practical programs.
Designing energy and user efficient interactions with mobile systems
Authors: Daniel P. Siewiorek
Venue:  (2008)

Mobile computing has thrived to provide unprecedented user experiences beyond the boundary of desks and wires. The increasing demand for mobility faces two major challenges: reduced form factor and limited energy supply. Although each challenge has been addressed by significant research efforts, the correlation between them is underexplored.Energy efficiency should be integrated as an important metric of user interaction design in mobile systems. By carefully considering the specific requirements of the user and the context of usage, energy efficiency can be achieved without sacrificing user performance and satisfaction, and interaction design that facilitates user efficiency can also promote energy efficiency. This dissertation starts with a detailed study of typical workload and screen usage that shows that users seldom use the entire screen on most workloads. Hence, Dark Windows, an energy efficient display design is presented and implemented to optimize display power consumption by adjusting the color and illumination of different screen regions according to the user's workload.This dissertation next presents AstroRDS, a mobile computing system and network infrastructure that displays documents and information from user's mobile devices on ambient ubiquitous display resources, thus facilitates much better viewing experience of the user with comparatively ease of use. The energy consumption and network usage of AstroRDS is several orders of magnitudes less than VNC remote desktop protocol on viewing and controlling tasks, and with similar initial loading overhead.A common challenge in these two efforts is the high cost of measuring user experience and energy consumption. This dissertation further presents KLEM, a quantitative methodology based on cognitive modeling techniques that can predict both user performance and system energy consumption from story boards of an interactive task during early stages of design. KLEM can be used as a convenient tool to compare and make early decisions among different design options, as well to resolve potential design issues before investing in actual user testing and iterative development. While KLEM is presented with a focus on handheld devices, the methodology can be applied on any interactive mobile system.
Does LISP differ from ALGOL essentially?
Authors: Friedemann Simon
Venue: Issue 3 (December 1979) (1979)

A fare spread opinion is that LISP and ALGOL belong to different "families" of programming languages. In our current activities concerning LISP, we are trying to characterise pure LISP as an ALGOL-like programming language in the sense of ALGOL 60 resp. ALGOL 68 /1/, /2/. LISP is considered as a sublanguage of ALGOL 60, where the datatype "s-expression" with its 5 standard functions is introduced and where procedure identifiers are allowed as values of function-procedures (ALGOL 68) in order to have upward FUNARGs /3/. In contrast to the operational semantic definitions via interpreters, this approach gives a precise, mathematical definition of the LISP-semantic. Within this framework we are able to prove properties of LISP-programs much easier than using inductive proofs based on an interpreter. Our method for modelling variable bindings follows the well known ALGOL 60 definitions, which are very close to the FUNARG-feature of LISP 1.5, while other authors prefer the "shallow access binding" method; e. g. M.J. Gordon gives a formal definition of pure LISP by algebraic methods /4/.
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
Authors: Jürgen Dassow, Henning Fernau
Venue: Information and Computation (2008)

We discuss complexity measures which are obtained as norms of vectors whose components are numerical measures of the sets of productions with the same left-hand side. We show that most of the descriptional complexity measures studied hitherto can be covered by this approach. Further we compare some of the measures with each other in the case of 0L systems.
Streaming Systems in FPGAs
Authors: Stephen Neuendorffer, Kees Vissers
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

As FPGA devices have become larger and more capable, they have transitioned from being used primarily as flexible glue logic to being used as central data processing elements in many digital systems. Typically, these systems (including video processing, wired and wireless networking) rely on streaming architectures. These architectures differ significantly from traditional processor architectures and are able to offer unique challenges and benefits for system designers. In particular, streaming architectures in FPGAs are well suited for implementing upcoming digital convergence applications. We summarize how streaming architectures in FPGAs relate to other programmable platforms for embedded applications and focus on key problem areas related to the design tools and platform infrastructure that will drive these new applications.