ppxscal/embedding_network huggingface dataset:
Novel diversity combining in OFDM-based MIMO systems
Authors: Jean-Pierre Dubois, Omar Abdul-Latif
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In this paper, we investigate the performance of a novel diversity combining technique, termed root-mean-square diversity combining (RMSGC), for OFDM transmission over flat Rayleigh fading channels in MIMO systems in the presence of co-channel interference (CCI). Prior published results on BPSK transmission over SIMO channels using ML-detected RMSGC diversity signal showed superior bit error rate performance to classical EGC, SC, SLC diversity combining schemes. In addition, the performance of RMSGC was previously shown to be near-optimal in the sense that it was very close to that of the optimal, but complicated and in many cases non-practical, MRC. While this proved to be a very promising technique for fading channels, it suffered from CCI and its performance deteriorated for more than 8 antennas. In this work, we overcame this drawback and showed that CCI can be resolved using RMSGC-combined and ML-detected OFDM-driven MIMO systems. The performance was further improved using SVM detection, which was also successfully tested in previous work.
Joint Coding of Multiple H.264 Video Programs
Authors: Luís Teixeira, Luís Corte-Real
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

This paper presents a joint coding scheme for multiple H.264/AVC video programs. Channel bandwidth is divided among different programs according its complexity. Several complexity metrics are assessed. Initial results are presented and discussed.
${\mathcal{T}}$-Decision by Decomposition
Authors: Maria Paola Bonacina, Mnacho Echenim
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SAT-solver with ${\mathcal{T}}$-satisfiability procedures. The rewrite-based approach to ${\mathcal{T}}$-satisfiability procedures is appealing, because it is general, uniform and it makes combination of theories simple. However, SAT-solvers are unparalleled in handling the large Boolean part of ${\mathcal{T}}$-decision problems of practical interest. In this paper we present a decomposition framework that combines a rewrite-based theorem prover and an SMT solver in an off-line mode, in such a way that the prover "compiles the theory away," so to speak. Thus, we generalize the rewrite-based approach from ${\mathcal{T}}$ -satisfiability to ${\mathcal{T}}$-decision procedures, making it possible to use the rewrite-based prover for theory reasoning and the SAT-solver in the SMT-solver for Boolean reasoning. We prove the practicality of this framework by giving decision procedures for the theories of records, integer offsets and arrays.
Range Medians
Authors: Sariel Har-Peled, S. Muthukrishnan
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We study a generalization of the classical median finding problem to batched query case: given an array of unsorted n items and k (not necessarily disjoint) intervals in the array, the goal is to determine the median in each of the intervals in the array. We give an algorithm that uses O(nlogk + klogk logn) comparisons and show a lower bound of ¿(nlogk) comparisons for this problem. This is optimal for k = O(n/logn).
Accessibility Issues in Game-Like Interfaces
Authors: Roland Ossmann, Dominique Archambault, Klaus Miesenberger
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This is a short position paper which invites to put game accessibility on the agenda of accessibility and assistive technology research. Games are important for social inclusion and concepts of game interfaces enter into standard HCI and web interfaces. This makes game accessibility subject to standard software and web accessibility and asks for according R D activities. New tools and interfaces have to be developed to bring games accessibility into the mainstream games.
The Incremental Funding Method: Data-Driven Software Development
Authors: Mark Denne, Jane Cleland-Huang
Venue: IEEE Software (2004)

The last few years have seen intense scrutiny of the flawed business premises underlying the dot-com bubble of the late 1990s. The prevailing attitude then was that software investment could be repaid through the company's increased capital value in expectation of future profits. The current IT environment is greatly changed. Not only are organizations no longer willing to invest in software development without clear expectations for returns, but they also demand those returns in much less time. This clearly challenges the development community to change the way we do business.The Incremental Funding Methodology is a data-driven, financially informed approach to software development. IFM can analyze and sequence feature delivery to maximize net present value and to provide insight on how development decisions affect other financial metrics.
Probabilistic reachability for stochastic hybrid systems: theory, computations, and applications
Authors: Shankar S. Sastry
Venue:  (2007)

Stochastic Hybrid Systems are probabilistic models suitable at describing the dynamics of variables presenting interleaved and interacting continuous and discrete components. Engineering systems like communication networks or automotive and air traffic control systems, financial and industrial processes like market and manufacturing models, and natural systems like biological and ecological environments exhibit compound behaviors arising from the compositions and interactions between their heterogeneous components. Hybrid Systems are mathematical models that are by definition suitable to describe such complex systems. The effect of the uncertainty upon the involved discrete and continuous dynamics&mdash;both endogenously and exogenously to the system&mdash;is virtually unquestionable for biological systems and often inevitable for engineering systems, and naturally leads to the employment of stochastic hybrid models. The first part of this dissertation introduces gradually the modeling framework and focuses on some of its features. In particular, two sequential approximation procedures are introduced, which translate a general stochastic hybrid framework into a new probabilistic model. Their convergence properties are sketched. It is argued that the obtained model is more predisposed to analysis and computations. The kernel of the thesis concentrates on understanding the theoretical and computational issues associated with an original notion of probabilistic reachability for controlled stochastic hybrid systems. The formal approach is based on formulating reachability analysis as a stochastic optimal control problem, which is solved via dynamic programming. A number of related and significant control problems, such as that of probabilistic safety, are reinterpreted with this approach. The technique is also computationally tested on a benchmark case study throughout the whole work. Moreover, a methodological application of the concept in the area of Systems Biology is presented: a model for the production of antibiotic as a component of the stress response network for the bacterium Bacillus subtilis is described. The model allows one to reinterpret the survival analysis for the single bacterial cell as a probabilistic safety specification problem, which is then studied by the aforementioned technique. In conclusion, this dissertation aims at introducing a novel concept of probabilistic reachability that is both formally rigorous, computationally analyzable and of applicative interest. Furthermore, by the introduction of convergent approximation procedures, the thesis relates and positively compares the presented approach with other techniques in the literature.
Examinations regarding the possibility to continuously control the balance of rotor excavators with an inclinometer
Authors: Florin Dumitru Popescu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

For the machineries and installations that have a small bearing surface compared to their height, an efficient control of balance can be done only if the angle of tilt of the superstructure is known, and if the angle does not exceed certain values. The limit values of the angle of tilt are determined by one condition, i.e. the composite force of both the interior and the exterior forces should pierce the plan, which is bounded by the props of the machinery. In order to continuously measure the angle of tilt of the superstructure, in any direction possible, recent studies highlight the possibility of using inclinometer to be able to control the balance and respectively the stability of rotor excavators. By measuring the angle of tilt for a structure considered rigid with the help of inclinometers, we are looking to evaluate the movement of the center of gravity toward the interior of the bearing surface, which may have consequences on the stability of the machinery. Thus a continuous control using computers over the tilt of the structure can be made considering the two perpendicular directions, so as the limit value of the angle of stability is not exceeded.
An Agent-Based Decision Support System for Ecological-Medical Situation Analysis
Authors: Marina V. Sokolova, Antonio Fernández-Caballero
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

This paper presents an architecture of an agent-based decision support system (ADSS) for ecological-medical situation assessment. The system receives statistical information in form of direct and indirect pollution indicator values. The ultimate goal of the modeled multi-agent system (MAS) is to evaluate the impact of the exposure to pollutants in population health. The proposed ADSS interacts with humans in real-time "what-if" scenarios, providing the user with evidence for optimal decision making. A detailed description of all the agents and their BDI (beliefs, desires, intentions) cards is presented.
DT-CWT Feature Combined with ONPP for Face Recognition
Authors: Yuehui Sun, Minghui Du
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

This paper introduces a novel face recognition method based on DT-CWT feature representation using ONPP. The Dual-Tree Complex Wavelet Transform (DT-CWT) used for representation features of face images, whose kernels are similar to Gabor wavelets, exhibit desirable characteristics of spatial locality and orientation selectivity. And DT-CWT outperforms Gabor with less redundancy and much efficient computing. Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the data samples and the global geometry. ONPP employs an explicit linear mapping between the two. As a result, ONPP can handle new data samples straightforward, as this amount to a simple linear transformation. The experimental results have demonstrated the advantageous characteristics of ONPP in the DT-CWT feature space and achieve the better face recognition performance.
Structural Shape Prototypes for the Automatic Classification of 3D Objects
Authors: Simone Marini, Michela Spagnuolo, Bianca Falcidieno
Venue: IEEE Computer Graphics and Applications (2007)

Search and retrieval of three-dimensional media will rapidly become a key issue in the upcoming panorama of multimedia content: 3D models are indeed expected to represent a huge amount of traffic and data stored in the Internet. This article proposes a novel technique to define and construct 3D shape prototypes, that improve the automatic classification of 3D content. The shape-prototype summarizes the most relevant features of the members of a class. The query object is then classified into the class represented by the prototype more similar to the given query. In the proposed methodology, each member of a class is represented by a structural descriptor encoded as an attributed graph. The prototype is obtained by applying graph-transformation techniques among the shape descriptors associated to the members of the class. The effectiveness of the classification process is finally evaluated on an heterogeneous benchmark of 3D objects.
Semantic Multimedia
Authors: Steffen Staab, Ansgar Scherp, Richard Arndt, Raphael Troncy, Marcin Grzegorzek, Carsten Saathoff, Simon Schenk, Lynda Hardman
Venue: Reasoning Web: 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures (2008)

Multimedia constitutes an interesting field of application for Semantic Web and Semantic Web reasoning, as the access and management of multimedia content and context depends strongly on the semantic descriptions of both. At the same time, multimedia resources constitute complex objects, the descriptions of which are involved and require the foundation on sound modeling practice in order to represent findings of low- and high level multimedia analysis and to make them accessible via Semantic Web querying of resources. This tutorial aims to provide a red thread through these different issues and to give an outline of where Semantic Web modeling and reasoning needs to further contribute to the area of semantic multimedia for the fruitful interaction between these two fields of computer science.
Many Objective Optimisation: Direct Objective Boundary Identification
Authors: Evan J. Hughes
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper describes and demonstrates a new and highly innovative technique that identifies an approximation of the entire bounding surface of the feasible objective region directly, including deep concavities, disconnected regions and the edges of interior holes in the feasible areas. The Pareto front is a subset of the surface of the objective boundary and can be extracted easily. Importantly, if the entire objective boundary is known, breaks and discontinuities in the Pareto front may be identified using automated methods; even with high objective dimensionality. This paper describes a proof-of-principle evolutionary algorithm that implements the new and unique Direct Objective Boundary Identification (DOBI) method.
Use of intelligent evolutionary agents in the analysis of genomic signals
Authors: Paul Dan Cristea
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Surprising regularities in the distribution of nucleotides and pairs of nucleotides along the genomes of both prokaryotes and eukaryotes become evident when converting nucleotide sequences from symbolic to digital form. These regularities make the structure of a genome be less like that of a "plain text", which simply conveys a semantics in accordance to a grammar, and more like that of a "poem", which obeys additional structural rules that give "rhythm" and "rhyme". Direct applications of the rules satisfied by nucleotide sequences are (1) objective evaluation of sequencing process quality, (2) prediction of nucleotides sequences similarly to time series, (3) revealing of genome ancestral structure, (4) analysis of pathogen variability. Intelligent Evolutionary Agents can be used to track pathogen variability, specifically to identify drug resistance mutations, without the need of the conventional lengthily and expensive phenotypic clinical studies that request pathogen culture.
Exploring Reconfigurable Architectures for Binomial-Tree Pricing Models
Authors: Qiwei Jin, David B. Thomas, Wayne Luk, Benjamin Cope
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

This paper explores the application of reconfigurable hardware to the acceleration of financial computations involving binomial-tree pricing models. A parallel pipelined architecture capable of computing multiple binomial trees is presented, which can deal with concurrent requests for option valuations. The architecture is mapped into an xc4vsx55 FPGA. Our results show that an FPGA implementation with fixed-point arithmetic at 87.4MHz can run over 250 times faster than a Core2 Duo processor at 2.2GHz, and more than two times faster than an nVidia Geforce 7900GTX processor with 24 pipelines at 650MHz.
Hardware/Software Co-design of a Secure Ubiquitous System
Authors: Masa-Aki Fukase, Hiroki Takeda, Tomoaki Sato
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Ever growing ubiquitous environment demands security, speed, and power consciousness in processing huge amount of multimedia information. A practical solution to meet these demands is the construction and implementation of a safety aware, highly-performed, and sophisticated architecture. According to this scheme, we have exploited a secure ubiquitous system composed of a hardware cryptography-embedded multimedia mobile architecture and its software support. The architecture is a dedicated single chip processor called HCgorilla. Since one-sided hardware design approach does not always sufficient for the development of HCgorilla, we have followed an H/S co-design scheme. The software support includes a Java interface and parallelizing compilers run on servers to reduce the load and increase the performance of HCgorilla-embedded clients.
Synthesising Abnormal Structures in Mammograms Using Pyramid Decomposition
Authors: Michael Berks, Chris Rose, Caroline Boggis, Susan Astley
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

The appearance of tissue in mammograms is altered by the presence of a mass. Existing mass synthesis methods have not addressed this structural deformation. We present a method for modifying the fine-scale detail in regions of digital mammograms. Regions are decomposed into sub-bands localised in scale and orientation using a wavelet-like decomposition. New structures are synthesised in the high frequency components of the decomposition, leaving coarse levels of the pyramid unchanged. In contrast to existing methods of synthesising mammographic texture, this ensures the global appearance of the region is maintained. Early results in the form of synthesised regions show the promise of this approach.
A Supervised PLS Information Recognition Algorithm
Authors: Fengxiang Jin, Shifei Ding
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper analyzes the basic principle of Partial Least Squares Regression (PLS), and based on PLS, a Supervised Information Recognition (SIR) algorithm is set up. The algorithm is built up by regarding response variables as 0-1 variables, and it organically combines feature extraction and classifier design in pattern recognition. Compared with Fisher discriminative analysis, Bayes discriminative analysis and some other classical pattern recognition algorithms, SIR algorithm has a much more powerful information recognition ability, and it doesn't demand the data to have good distribution, especially it is more effective to collinearity information or explaining variables are more but the sample size is small. Applied this algorithm to classification recognition of land quality, the results show that the algorithm established in this paper is effective and reliable.
Shortest Synchronizing Strings for Huffman Codes
Authors: Marek Tomasz Biskup
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Most complete binary prefix codes have a synchronizing string, that is a string that resynchronizes the decoder regardless of its previous state. This work presents an upper bound on the length of the shortest synchronizing string for such codes. Two classes of codes with a long shortest synchronizing string are presented. It is known that finding a synchronizing string for a code is equivalent to a finding a synchronizing string of some finite automaton. The Černý conjecture for this class of automata is discussed.
Visualization of Blast Waves Created by Exploding Bridge Wires
Authors: M. J. Murphy, R. J. Adrian, D. S. Stewart, G. S. Elliott, K. A. Thomas, J. E. Kennedy
Venue: Journal of Visualization (2005)

Blast waves created by small exploding bridge wires are used as a test bed for the development of a particle image velocimetry (PIV) technique that uses polymers, seeded with scattering particles, as dynamic witness plates. Combined with pulsed, incoherent schlieren photography, the PIV method permits visualization of the instantaneous velocity vector field in a plane cutting through the blast wave.
Kernel Functions Based on Fuzzy Neighborhoods and Agglomerative Clustering
Authors: Sadaaki Miyamoto, Yuichi Kawasaki
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

A fuzzy neighborhood model for analyzing information systems having topological structures on occurrences of keywords is proposed and associated kernel functions are studied. Sufficient conditions when a neighborhood defines a kernel are derived. Accordingly, agglomerative clustering algorithms are applicable which employ kernel functions. An illustrative example is given.
An Integrated Environment for Technology Closure of Deep-Submicron IC Designs
Authors: Louise Trevillyan, David Kung, Ruchir Puri, Lakshmi N. Reddy, Michael A. Kazda
Venue: IEEE Design Test (2004)

With larger chip images and increasingly aggressive technologies, key design processes must interoperate. PDS, a physical-synthesis system, accomplishes technology closure through interacting processes of logic optimization, placement, timing, clock insertion, and routing, all using a common infrastructure with robust variable-accuracy analysis abstractions.
All-IP Based Ultra 3G Network/Service Development in a Competitive Market
Authors: Yutaka Yasuda
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

FMC (Fixed Mobile Convergence) is a key concept of NGN (Next generation Network) and KDDI announced the Ultra 3G concept based on all-IP network configuration, 3 years ago. Now, the Ultra 3G concept has evolved toward FMBC (Fixed Mobile Broadcast Convergence). This talk introduces how KDDI has been swiftly and reliably developing all-IP based networks and FMBC services.
Application of Neural Networks for Foreign Exchange Rates Forecasting with Noise Reduction
Authors: Wei Huang, Kin Keung Lai, Shouyang Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Predictive models are generally fitted directly from the original noisy data. It is well known that noise can seriously limit the prediction performance on time series. In this study, we apply the nonlinear noise reduction methods to the problem of foreign exchange rates forecasting with neural networks (NNs). The experiment results show that the nonlinear noise reduction methods can improve the prediction performance of NNs. Based on the modified Diebold-Mariano test, the improvement is not statistically significant in most cases. We may need more effective nonlinear noise reduction methods to improve prediction performance further. On the other hand, it indicates that NNs are particularly well appropriate to find underlying relationship in the environment characterized by complex, noisy, irrelevant or partial information. We also find that the nonlinear noise reduction methods work more effectively when the foreign exchange rates are more volatile.