ppxscal/embedding_network huggingface dataset:
Largest dual ellipsoids inscribed in dual cones
Authors: M. J. Todd
Venue: Mathematical Programming: Series A and B (2008)

Suppose x&#x0304; and s&#x0304; lie in the interiors of a cone K and its dual K *, respectively. We seek dual ellipsoidal norms such that the product of the radii of the largest inscribed balls centered at x&#x0304; and s&#x0304; and inscribed in K and K *, respectively, is maximized. Here the balls are defined using the two dual norms. When the cones are symmetric, that is self-dual and homogeneous, the solution arises directly from the Nesterov&#x2013;Todd primal&#x2013;dual scaling. This shows a desirable geometric property of this scaling in symmetric cone programming, namely that it induces primal/dual norms that maximize the product of the distances to the boundaries of the cones.
Multiplication Of Polynomials Over The Ring Of Integers
Authors: M. Kaminski
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Let R be a ring, and let f(/spl alpha/), g(/spl alph/) /spl epsi/ R[/spl alpha/] be univariate polynomials over R of degree n. We Present an algorithm for computing the coefficients of the product f(/spl alpha/)G (/spl alpha/) by O (nlgn) multiplications. This algorithm is based on an algorithm for multiplying polynomials over the ring of integers, and does not depend on R. Also we prove that multiplying the third degree polynomials over the ripg of integers requires at least nine multiplications. This bound is tight. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fast integer multiplication using modular arithmetic
Authors: Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We give an O(N • log N • 2O(log*N)) algorithm for multiplying two N-bit integers that improves the O(N • log N • log log N) algorithm by Schönhage-Strassen. Both these algorithms use modular arithmetic. Recently, Fürer gave an O(N • log N • 2O(log*N)) algorithm which however uses arithmetic over complex numbers as opposed to modular arithmetic. In this paper, we use multivariate polynomial multiplication along with ideas from Fürer's algorithm to achieve this improvement in the modular setting. Our algorithm can also be viewed as a p-adic version of Fürer's algorithm. Thus, we show that the two seemingly different approaches to integer multiplication, modular and complex arithmetic, are similar.
Security Requirements Variability for Software Product Lines
Authors: Daniel Mellado, Eduardo Fernandez-Medina, Mario Piattini
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Software product line engineering has proven to be one of the most successful paradigms for developing a diversity of similar software applications and software-intensive systems at low costs, in short time, and with high quality, by exploiting commonalities and variabilities among products to achieve high levels of reuse. At the same time, due to the complexity and extensive nature of product line development, security and requirements engineering are critical success factors in the development of a software product line. However, most of the current product line practices in requirements engineering do not adequately address the security requirements engineering. Therefore, in this paper we will propose a security requirements decision model driven by security standards along with a security variability model to manage the variability of the security requirements related artefacts. The aim of this approach is to deal with security requirements from the early stages of the product line development in a systematic way, in order to facilitate the conformance to the most relevant security standards with regard to the management of security requirements, such as ISO/IEC 27001 and ISO/IEC 15408.
A survey of image classification methods and techniques for improving classification performance
Authors: D. Lu, Q. Weng
Venue: International Journal of Remote Sensing (2007)

Image classification is a complex process that may be affected by many factors. This paper examines current practices, problems, and prospects of image classification. The emphasis is placed on the summarization of major advanced classification approaches and the techniques used for improving classification accuracy. In addition, some important issues affecting classification performance are discussed. This literature review suggests that designing a suitable image-processing procedure is a prerequisite for a successful classification of remotely sensed data into a thematic map. Effective use of multiple features of remotely sensed data and the selection of a suitable classification method are especially significant for improving classification accuracy. Non-parametric classifiers such as neural network, decision tree classifier, and knowledge-based classification have increasingly become important approaches for multisource data classification. Integration of remote sensing, geographical information systems (GIS), and expert system emerges as a new research frontier. More research, however, is needed to identify and reduce uncertainties in the image-processing chain to improve classification accuracy.
Personal & soho archiving
Authors: Stephan Strodl, Florian Motlik, Kevin Stadler, Andreas Rauber
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Digital objects require appropriate measures for digital preservation to ensure that they can be accessed and used in the near and far future. While heritage institutions have been addressing the challenges posed by digital preservation needs for some time, private users and SOHOs (Small Office/Home Office) are less prepared to handle these challenges. Yet, both have increasing amounts of data that represent considerable value, be it office documents or family photographs. Backup, common practice of home users, avoids the physical loss of data, but it does not prevent the loss of the ability to render and use the data in the long term. Research and development in the area of digital preservation is driven by memory institutions and large businesses. The available tools, services and models are developed to meet the demands of these professional settings. This paper analyses the requirements and challenges of preservation solutions for private users and SOHOs. Based on the requirements and supported by available tools and services, we are designing and implementing a home archiving system to provide digital preservation solutions specifically for digital holdings in the small office and home environment. It hides the technical complexity of digital preservation challenges and provides simple and automated services based on established best practice examples. The system combines bit preservation and logical preservation strategies to avoid loss of data and the ability to access and use them. A first software prototype, called Hoppla, is presented in this paper.
Principal Component Analysis of Infectomes in Human Brain Endothelial Cell after C. neoformans Infection
Authors: Ambrose Y. Jong, Luo Feng, Steven H. M. Chen, Sheng-He Huang
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Cell surface molecule CD44 of human brain microvascular endothelial cells (HBMEC) is the receptor of Cryptococcus neoformans during the infection. We performed microarray analysis and used principle component analysis to examine gene profiles of HBMEC in responses to C. neoformans infection. The CD44 levels increases, peaking at the 4-hour time point and then declined gradually. Seventy genes displayed a similar gene profile. Our results showed a dynamic relationship between pathogen-host interactions. The data is useful for the analysis of invasion mechanism of C. neoformans into HBMEC.
Speedups and energy reductions from mapping DSP applications on an embedded reconfigurable system
Authors: Michalis D. Galanis, Gregory Dimitroulakos, Costas E. Goutis
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents performance improvements and energy savings from mapping real-world benchmarks on an embedded single-chip platform that includes coarse-grained reconfigurable logic with a micro-processor. The reconfigurable hardware is a 2-D array of processing elements connected with a mesh-like network. Analytical results derived from mapping seven real-life digital signal processing applications, with the aid of an automated design flow, on six different instances of the system architecture are presented. Significant overall application speedups relative to an all-software solution, ranging from 1.81 to 3.99 are reported being close to theoretical speedup bounds. Additionally, the energy savings range from 43% to 71%. Finally, a comparison with a system coupling a micro-processor with a very long instruction word core shows that the micro-processor/coarse-grained reconfigurable array platform is more efficient in terms of performance and energy consumption.
A BAT in the Lab: Experimental Results of New Link State Routing Protocol
Authors: Makoto Ikeda, Giuseppe De Marco, Leonard Barolli, Makoto Takizawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, we analyze the common problems of link state routing protocols along with an evolution of the Optimized Link State Routing protocol, called BATMAN. BATMAN uses a weighted and auto-selective flooding which makes it a sort of gossip protocol. The flooding uses short control packets to make every mesh node aware of network topology.However, there is no topology information dissemination and no multi-point relaying node selection. While routing loops are easily avoided by this modified flooding mechanism, there are still problems about self-interference. Due the broadcast nature of the radio channel, traffic data can disturb control data, and localized control data may cause interference on neighboring control data as well. In fact there is a complicated interaction between MAC and routing protocols. We demonstrate this fact by extensive field tests carried out by our measurement framework based on statistical tests. In particular, we show that the so called hop horizon of multi-hop network can be due to the routing and MAC protocols.These analysis can be a useful hint for the design of more intelligent routing, or rather a less cross-layer dependence of protocols.
A New Algorithm for Finding Convex Hull with a Maximum Pitch of the Dynamical Base Line
Authors: Zhou Qihai, Huang Tao, Wu Hongyu, Li Zhongjun, Lin Xun
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In this paper, a representative algorithm convex hull with half-dividing and recurrence is commented; and according to the isomorphic fundamental theorem of the convex hull construction, a more efficient new algorithm to find a convex hull based on the dynamical base line with a maximum pitch of the dynamical base line is given. The general characters of the new algorithm are: 1) find out the outside-most poles which are the leftmost, rightmost, topmost and bottommost points of the given 2D point set, i.e. the four initial poles which have the maximum or the minimum coordinate value of the X or Y axis among all the points in the given 2D point set; 2) divide the original distributed domain into four sub-domains with the initial poles; 3) in every sub-domain, construct a current pole with a maximum pitch to its base line based on the last pole got just dynamically and sequentially, and draw the rims of this convex polygon with these poles for intelligent approximating for a convex hull of the given 2D point set step by step.
Java Program and Progress
Authors: Mahmood Shanbedi
Venue:  (2007)

Book Description Java was a revolutionary approached to the modern programming languages. Today all colleges, Universities and educational institutions are using Java programming as a language of choice. It is certainly a dominant language of the technological and industrial for software developers and design. This book is written and organized to solve all the related programming problems. Java Program and Progress starts at the beginner level and reaches the advanced programming level. The approach taken by the book introduces topics gradually, and makes it easy to pick up the skills needed to program in Java and be ready for the new challenging in today's software design. The author focuses his considerable teaching skills upon the important parts of the language you really need to understand in order to be a good Java programmer. The book is designed in a simple manner of simplicity and organized in sequences of examples and enriched with high programming materials. In fact it is written as if a teacher is guiding you. One of the great author's abilities is to put a long discussion in just few simple sentences, this will save reader's times and energy. The book starts from introduction to Java programming and shows how to write a basic and simple java program, Input/Output (I/O) using standard and JOptionPane format, If/Else statement, Switch statement, Loops, Methods, Array systems, Introduction to the Object Oriented Programming (OOP), Advanced Object Oriented Programming, Encapsulation and data hiding, Inheritance and reusable codes, Interfaces, Polymorphism, Exception and Errors handling, creating Packages, String manipulation, File and streams, Applets programming, Internet programming using Applets, GUI programming and drawing objects, Java Foundation Classes (JFC) Swing programming. There are two chapters in Applets and two chapters in Swing programming. The book covers everything from the beginning and ended with an author's goal which makes you a knowledgeable programmer.
MUSEMBLE: A novel music retrieval system with automatic voice query transcription and reformulation
Authors: Seungmin Rho, Byeong-jun Han, Eenjun Hwang, Minkoo Kim
Venue: Journal of Systems and Software (2008)

So far, many researches have been done to develop efficient music retrieval systems, and query-by-humming has been considered as one of the most intuitive and effective query methods for music retrieval. For the voice humming to be a reliable query source, elaborate signal processing and acoustic similarity measurement schemes are necessary. On the other hand, recently, there has been an increased interest in query reformulation using relevance feedback with evolutionary techniques such as genetic algorithm for multimedia information retrieval. However, these techniques have not been exploited widely in the field of music retrieval. In this paper, we develop a novel music retrieval system called MUSEMBLE (MUSic enEMBLE) based on two distinct features: (i) A sung or hummed query is automatically transcribed into a sequence of pitch and duration pairs with improved accuracy for music representation. More specifically, we developed two new and unique techniques called WAE (windowed average energy) and dynamic ADF (amplitude-based difference function) onsets for more accurate note segmentation and onset/offset detection in acoustic signal, respectively. The former improved energy-based approaches such as AE by defining small but coherent windows with local and global threshold values. On the other hand, the latter improved the AF (amplitude function) that calculates the summation of the absolute values of signal differences for the clustering energy contour. (ii) A user query is reformulated using user relevance feedback with a genetic algorithm to improve retrieval performance. Even though we have especially focused on humming queries in this paper, MUSEMBLE provides versatile query and browsing interfaces for various kinds of users. We have carried out extensive experiments on the prototype system to evaluate the performance of our voice query transcription and genetic algorithm-based relevance feedback schemes. We demonstrate that our proposed method improves the retrieval accuracy up to 20-40% compared with other popular RF methods. We also show that both WAE and Dynamic ADF methods improve the transcription accuracy up to 95%.
Analysis of a photonic device through Laplace transform
Authors: V. Aboites, J. H. Garcia-Lopez, V. Pinto, A. V. Kiryanov, M. A. Barrera
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The present work presents a laser model, showing that if a two level simplification is used, and both, low pumping and no losses, are supposed, the second order control system model obtained, is not a laser any more, but only a photonic device. The system response to a step input is analyzed and the results compared with experimental data obtained when pumping a Neodymium crystal with a diode laser. Both theoretical and experimental results are then compared with the analyzed photonic device. A good qualitative agreement is shown between analytical, experimental and computational results.
Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
Authors: Li Zhang, Weijun Zhou, Donghui Li
Venue: Optimization Methods Software (2007)

Generally, global convergence of the conjugate gradient methods for unconstrained optimization problems needs Wolfe line search or strong Wolfe line search. In this article, we propose a cautious DY conjugate gradient method and prove that this method with Armijo line search converges globally if the objective function has Lipschitz continuous gradients. We also present some preliminary numerical results to show the efficiency of the proposed method.
Multilanguage Programming
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2008)

Integration projects inherently involve diverse technologies. Even so, many integration developers try to force problems to fit their favorite programming language, regardless of how well that language helps solve the problem, and regardless of whether other languages offer a better fit. Multilingual programmers embrace the diversity of programming languages, enabling them to apply different languages to different integration problems to produce higher-quality solutions that are faster, easier, and less expensive to develop, maintain, and enhance.
Differential fault analysis on the ARIA algorithm
Authors: Wei Li, Dawu Gu, Juanru Li
Venue: Information Sciences: an International Journal (2008)

The ARIA algorithm is a Korean Standard block cipher, which is optimized for lightweight environments. On the basis of the byte-oriented model and the differential analysis principle, we propose a differential fault attack on the ARIA algorithm. Mathematical analysis and simulating experiment show that our attack can recover its 128-bit secret key by introducing 45 faulty ciphertexts. Simultaneously, we also present a fault detection technique for protecting ARIA against this proposed analysis. We believe that our results in this study will also be beneficial to the analysis and protection of the same type of other iterated block ciphers.
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
Authors: Nicolas Loeff, David Forsyth, Deepak Ramachandran
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We describe a manifold learning framewor that naturally accommodates supervised learning, partially supervised learning and unsupervised clustering as particular cases. Our method chooses a function by minimizing loss subject to a manifold regularization penalty. This augmented cost is minimized using a greedy, stagewise, functional minimization procedure, as in Gradientboost. Each stage of boosting is fast and efficient. We demonstrate our approach using both radial basis function approximations and trees. The performance of our method is at the state of the art on many standard semi-supervised learning benchmarks, and we produce results for large scale datasets.
Operational Space Control: A Theoretical and Empirical Comparison
Authors: Jun Nakanishi, Rick Cory, Michael Mistry, Jan Peters, Stefan Schaal
Venue: International Journal of Robotics Research (2008)

Dexterous manipulation with a highly redundant movement system is one of the hallmarks of human motor skills. From numerous behavioral studies, there is strong evidence that humans employ compliant task space control, i.e. they focus control only on task variables while keeping redundant degrees-of-freedom as compliant as possible. This strategy is robust towards unknown disturbances and simultaneously safe for the operator and the environment. The theory of operational space control in robotics aims to achieve similar performance properties. However, despite various compelling theoretical lines of research, advanced operational space control is hardly found in actual robotics implementations, in particular new kinds of robots like humanoids and service robots, which would strongly profit from compliant dexterous manipulation. To analyze the pros and cons of different approaches to operational space control, this paper focuses on a theoretical and empirical evaluation of different methods that have been suggested in the literature, but also some new variants of operational space controllers. We address formulations at the velocity, acceleration, and force levels. First, we formulate all controllers in a common notational framework, including quaternion-based orientation control, and discuss some of their theoretical properties. Second, we present experimental comparisons of these approaches on a seven-degree-of-freedom anthropomorphic robot arm with several benchmark tasks. As an aside, we also introduce a novel parameter estimation algorithm for rigid body dynamics, which ensures physical consistency, as this issue was crucial for our successful robot implementations. Our extensive empirical results demonstrate that one of the simplified acceleration-based approaches can be advantageous in terms of task performance, ease of parameter tuning, and general robustness and compliance in the face of inevitable modeling errors.
A QoS-aware service selection algorithm for multimedia service overlay networks
Authors: Wenzhong Li, Yilin Wang, Chunhong Li, Sanglu Lu, Daoxu Chen
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Multimedia applications are becoming more and more popular on today&#x2019;s Internet. Given the enormous development costs and less flexibility, traditional monolithic based approaches are not suitable for building large-scale multimedia systems. By composing of distributed, autonomous services dynamically to provide more complex tasks, service composition provides an attractive way for building large-scale Internet applications. So, multimedia service composition provides a viable solution to large-scale complex multimedia systems. One of the challenging issues of multimedia service composition is how to find service paths to route the data flows through while meeting the applications&#x2019; resource requirements and specific QoS constraints. However, QoS-aware service routing problem is typically NP-hard. In this paper, we propose a heuristic algorithm named Greedy-EF to solve this problem more effectively. More specially, Greedy-EF uses an aggregate function to evaluate the QoS conditions for each service instance, and a hop-by-hop service selection approach to explore the proper service path. Simulations show that Greedy-EF algorithm can achieve desired QoS assurances as well as load balancing in multimedia service overlay networks.