ppxscal/embedding_network huggingface dataset:
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
Authors: Erich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

We generalize the technique by Peyrl and Parillo [Proc. SNC 2007] to computing lower bound certificates for several well-known factorization problems in hybrid symbolic-numeric computation. The idea is to transform a numerical sum-of-squares (SOS) representation of a positive polynomial into an exact rational identity. Our algorithms successfully certify accurate rational lower bounds near the irrational global optima for benchmark approximate polynomial greatest common divisors and multivariate polynomial irreducibility radii from the literature, and factor coefficient bounds in the setting of a model problem by Rump (up to n = 14, factor degree = 13. The numeric SOSes produced by the current fixed precision semi-definite programming (SDP) packages (SeDuMi, SOSTOOLS, YALMIP) are usually too coarse to allow successful projection to exact SOSes via Maple 11's exact linear algebra. Therefore, before projection we refine the SOSes by rank-preserving Newton iteration. For smaller problems the starting SOSes for Newton can be guessed without SDP ("SDP-free SOS"), but for larger inputs we additionally appeal to sparsity techniques in our SDP formulation.
A distributed expansible authentication model based on Kerberos
Authors: Hongjun Liu, Ping Luo, Daoshun Wang
Venue: Journal of Network and Computer Applications (2008)

There is a potential server bottleneck problem when the Kerberos model is applied in large-scale networks because the model uses centralized management. To enlarge its application scope, researchers must consider how to build a trust relation among those Kerberos servers located on different isolated domains, but have not provided a way to prevent the potential bottleneck that can occur with Kerberos servers. With the development of across-domain authentication techniques, the local server bottleneck problem has not been alleviated; in fact, it has become more serious. Adopting the rigorous binary tree code algorithm, we present an authentication model based on Kerberos. Compared with similar models, our model has several advantages. First, it overcomes the potential server bottleneck problem and can balance the load automatically. Second, it can process across-domain authentication and enlarge the authentication boundary. Finally, its authentication path is short, with no more than two Kerberos servers being involved when authenticating a user.
Design and Evaluation of a Bayesian-filter-based Image Spam Filtering Method
Authors: Masahiro Uemura, Toshihiro Tabata
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In recent years, with the spread of the Internet, the number of spam e-mail has become one of the most serious problems. A recent report reveals that 91% of all e-mail exchanged in 2006 was spam. Using the Bayesian filter is a popular approach to distinguish between spam and legitimate e-mails. It applies the Bayes theory to identify spam. This filter proffers high filtering precision and is capable of detecting spam as per personal preferences. However, the number of image spam, which contains the spam message as an image, has been increasing rapidly. The Bayesian filter is not capable of distinguishing between image spam and legitimate e-mails since it learns from and examines only text data. Therefore, in this study, we propose an anti-image spam technique that uses image information such as file size. This technique can be easily implemented on the existing Bayesian filter. In addition, we report the results of the evaluations of this technique.
Spanning subgraphs of graphs partitioned into two isomorphic pieces
Authors: Anthony Bonato
Venue: Journal of Graph Theory (2006)

A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced by the closed non-neighbor set of x. As proved by Bonato and Nowakowski [5], graphs with the ncc property are characterized by the existence of perfect matchings satisfying certain local conditions. In the present article, we investigate the spanning subgraphs of ncc graphs, which we name sub-ncc. Several equivalent characterizations of finite sub-ncc graphs are given, along with a polynomial time algorithm for their recognition. The infinite sub-ncc graphs are characterized, and we demonstrate the existence of a countable universal sub-ncc graph satisfying a strong symmetry condition called pseudo-homogeneity. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory Dedicated to the memory of G&uuml;nter Bruns
Linear Feedback Control: Analysis and Design with MATLAB (Advances in Design and Control), 1 edition
Authors: Dingyu Xue, YangQuan Chen, Derek P. Atherton
Venue:  (2008)

A discussion of analysis and design techniques for linear feedback control systems using MATLAB software. By reducing the mathematics, increasing MATLAB working examples, and inserting short scripts and plots within the text, the authors have created a text suitable for almost any type of user. Suitable for beginners entering the field; for students who wish to bridge the gap between control theory and the use of MATLAB for control systems; and as a handy reference for practising engineers. The MATLAB companion package, CtrlLAB, allows readers to learn quickly while simply clicking through options with a mouse. Each chapter ends with a set of problems to help readers strengthen their understanding of the material. All example scripts within the book, as well as the CtrlLAB package, are freely downloadable from MATLAB Central, an open exchange for the MATLAB and Simulink community (www.mathworks.com/matlabcentral/index.shtml).
Towards a classification framework for interoperability of enterprise applications
Authors: H. Panetto
Venue: International Journal of Computer Integrated Manufacturing (2007)

Software applications interoperability is a challenge for modern enterprises. It needs establishing standards and protocols for data exchange between different enterprise systems. Nevertheless, since there is no methodology for collecting data, exchanged information is generally incomplete. Business process modelling aims at specifying object flows and processes inside enterprise levels and among networked enterprises. Enterprise-control systems aim at driving and scheduling the manufacturing resources based on information coming from the whole enterprise. However, the increased complexity of these models does not help to ensure coherent relationships between its components. In the current paper, the author will analyse how enterprise applications, models and standards used at different levels of the enterprise could be classified to come to a framework of many interoperability types.
Analyzing worms and network traffic using compression
Authors: Stephanie Wehner
Venue: Journal of Computer Security (2007)

Internet worms have become a widespread threat to system and network operations. In order to fight them more efficiently, it is necessary to analyze newly discovered worms and attack patterns. This paper shows how techniques based on Kolmogorov Complexity can help in the analysis of internet worms and network traffic. Using compression, different species of worms can be clustered by type. This allows us to determine whether an unknown worm binary could in fact be a later version of an existing worm in an extremely simple, automated, manner. This may become a useful tool in the initial analysis of malicious binaries. Furthermore, compression can also be useful to distinguish different types of network traffic and can thus help to detect traffic anomalies: Certain anomalies may be detected by looking at the compressibility of a network session alone. We furthermore show how to use compression to detect malicious network sessions that are very similar to known intrusion attempts. This technique could become a useful tool to detect new variations of an attack and thus help to prevent IDS evasion. We provide two new plugins for Snort which demonstrate both approaches.
Question classification with semantic tree kernel
Authors: Yan Pan, Yong Tang, Luxin Lin, Yemin Luo
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Question Classification plays an important role in most Question Answering systems. In this paper, we exploit semantic features in Support Vector Machines (SVMs) for Question Classification. We propose a semantic tree kernel to incorporate semantic similarity information. A diverse set of semantic features is evaluated. Experimental results show that SVMs with semantic features, especially semantic classes, can significantly outperform the state-of-the-art systems.
Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
Authors: H. Mansouri, C. Roos
Venue: Optimization Methods Software (2007)

In Roos [Roos, C., 2006, A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM Journal on Optimization, 16(4), 1110-1136.] presented a new primal-dual infeasible interior-point algorithm that uses full-Newton steps and whose iteration bound coincides with the best-known bound for infeasible interior-point algorithms. Each iteration consists of a step that restores the feasibility for an intermediate problem (the so-called feasibility step) and a few (usual) centering steps. No more than O(nlog(n/ε)) iterations are required for getting an ε-solution of the problem at hand, which coincides with the best-known bound for infeasible interior-point algorithms. In this article, we introduce a different feasibility step and show that the same complexity result can be obtained with a relatively simpler analysis.
Algebraic reasoning for probabilistic action systems and while-loops
Authors: Larissa Meinicke, Ian J. Hayes
Venue: Acta Informatica (2008)

Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness framework using the refinement calculus. We extend their work to reasoning about probabilistic loops in the probabilistic refinement calculus. We apply our algebraic reasoning to derive transformation rules for probabilistic action systems and probabilistic while-loops. In particular we focus on developing data refinement rules for these two constructs. Our extension is interesting since some well known transformation rules that are applicable to standard programs are not applicable to probabilistic ones: we identify some of these important differences and we develop alternative rules where possible.
Chaos Detection in the Firing Activities of Retinal Ganglion Cells in Response to Natural Stimuli
Authors: Chao-Feng Cai, Ying-Ying Zhang, Xue Liu, Pei-Ji Liang, Pu-Ming Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The correlation dimension method and the nonlinear forecasting method are applied to analyze the firing activities recorded by a multi-electrode array (MEA) from the retinal ganglion cells (GCs) of chicken in response to natural stimuli. The results show that neither the correlation dimension method nor the nonlinear forecasting method provides any evidences for chaos in the inter-spike interval (ISI) series derived from retinal GCs. Then the first difference of the ISI (DISI) series is analyzed in the same way and different conclusions are drawn. The correlation dimension method fails again to provide evidences for chaos in the DISI series. The nonlinear forecasting method, however, demonstrates some weak but distinct evidences for chaos in the DISI series, which indicates that the nonlinear forecasting method is more efficient and reliable than the correlation dimension method for chaos detection. On the other hand, the first difference operation of the ISI series makes it comparatively easier for chaos detection in the firing activities of retinal GCs in response to natural stimuli.
Privacy preserving multi-factor authentication with biometrics
Authors: Abhilasha Bhargav-Spantzel, Anna C. Squicciarini, Shimon Modi, Matthew Young, Elisa Bertino, Stephen J. Elliott
Venue: Journal of Computer Security (2007)

An emerging approach to the problem of identity theft is represented by the adoption of biometric authentication systems. Such systems however present several challenges, related to privacy, reliability and security of the biometric data. Inter-operability is also required among the devices used for authentication. Moreover, very often biometric authentication in itself is not sufficient as a conclusive proof of identity and has to be complemented with multiple other proofs of identity such as passwords, SSN, or other user identifiers. Multi-factor authentication mechanisms are thus required to enforce strong authentication based on the biometric and identifiers of other nature. In this paper we propose a two-phase authentication mechanism for federated identity management systems. The first phase consists of a two-factor biometric authentication based on zero knowledge proofs. We employ techniques from the vector-space model to generate cryptographic biometric keys. These keys are kept secret, thus preserving the confidentiality of the biometric data, and at the same time exploit the advantages of biometric authentication. The second phase combines several authentication factors in conjunction with the biometric to provide a strong authentication. A key advantage of our approach is that any unanticipated combination of factors can be used. Such authentication system leverages the information of the user that are available from the federated identity management system.
A machine-learning approach to multi-robot coordination
Authors: Ying Wang, Clarence W. de Silva
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper presents a machine-learning approach to the multi-robot coordination problem in an unknown dynamic environment. A multi-robot object transportation task is employed as the platform to assess and validate this approach. Specifically, a flexible two-layer multi-agent architecture is developed to implement multi-robot coordination. In this architecture, four software agents form a high-level coordination subsystem while two heterogeneous robots constitute the low-level control subsystem. Two types of machine learning-reinforcement learning (RL) and genetic algorithms (GAs)-are integrated to make decisions when the robots cooperatively transport an object to a goal location while avoiding obstacles. A probabilistic arbitrator is used to determine the winning output between the RL and GA algorithms. In particular, a modified RL algorithm called the sequential Q-learning algorithm is developed to deal with the issues of behavior conflict that arise in multi-robot cooperative transportation tasks. The learning-based high-level coordination subsystem sends commands to the low-level control subsystem, which is implemented with a hybrid force/position control scheme. Simulation and experimental results are presented to demonstrate the effectiveness and adaptivity of the developed approach.
Intelligent Method for Designing Exact Orthogonal Blocking Matrix into Robust Wideband Beamformer Using Auxiliary Sensors
Authors: Jafar Ramadhan Mohammed
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

An innovative method for wideband adaptive beamforming is presented. This method can allow large desired-direction error by generating a wide and deep null around the desired-direction at the blocking matrix output. Moreover, it can provide good suppression performance for both directional and omni-directional interference and noise signals. Simulation results are included to illustrate the effectiveness of the proposed method.
Note: Inclusion matrices and chains
Authors: E. Ghorbani, G. B. Khosrovshahi, Ch. Maysoori, M. Mohammad-Noori
Venue: Journal of Combinatorial Theory Series A (2008)

Given integers t, k, and v such that 0=
Creating Mashups with Adobe Flex and AIR
Authors: Chris Korhonen, David Hassoun
Venue:  (2008)

Web applications no longer need be powered by any one individual's data, and they don't need to be confined to the desktop. Developers can draw on a wealth of publicly available content, from providers such as Flickr, Amazon, Google, Twitter, and Last.fm, and combine it for use in their own applications. Adobe Integrated Runtime (AIR) makes it simple to bring previously web-only applications to the desktop, allowing them to run alongside traditional applications on an end user's computer. In this book, you'll learn how to create mashup applications from the vast array of web services, feeds, and APIs using Adobe Flash and Flex together with HTML and JavaScript (Ajax). You'll be introduced to the various sources of information and the tools necessary to gather and reuse that information, and then you'll learn how to combine that content in a variety of ways. You'll learn how to have desktop applications interact with online services such as Flickr, you'll learn how to use Amazon S3 for enterprise-level data storage, and you'll embrace technologies such as OpenID. In addition, you'll create abstract visualizations based on music sourced from Last.fm and consume Twitter content via RSS. You will also see how to use the Flash-native data format SWX along with PHP to create a Yahoo! weather widget. You'll discover just why you may want to build a widget or a desktop application rather leaving things web-based; then you'll create an application using Flex Builder and AIR and learn how best to distribute it. With so many tools and so much data available, the possibilities for mashup creation are endless. Creating Mashups with Adobe Flex and AIR provides all you need to get you up and running quickly, while also giving you a solid understanding of the technologies involved so you can take things furtherto a place limited only by your imagination. In this book you'll learn how to use Flex 3 in conjunction with ActionScript 3.0 to build powerful applications; how you can use Adobe AIR to take your application from the Web and onto the desktop; the differences between developing for the Web and for the desktop; how you can use the APIs of popular web services such as Flickr, Amazon, Google, Twitter, and Last.fm as data sources for your application; and how to optimize your applications for fast and efficient performance. Summary of Contents Chapter 1 Introduction to Mashups Chapter 2 Technologies to Mash With! Chapter 3 An Introduction to Flex Chapter 4 Flex Components Chapter 5 Flexing Your Muscles Chapter 6 Performance Management in Flex Applications Chapter 7 Debugging Flex 3: The Tried-and-True, Plus the New Chapter 8 Getting the Most out of APIs Chapter 9 Mashing Up Functionality Chapter 10 SWX: A Native Flash Data Format Chapter 11 Taking It to the Desktop Chapter 12 Developing for the Desktop with AIR Chapter 13 Adding More Desktop Elements to the Web Chapter 14 Building a Desktop Experience Chapter 15 Completing the Experience
Resource Optimization for 60 GHz Indoor Networks Using Dynamic Extended Cell Formation
Authors: Bao Linh Dang, R. Venkatesha Prasad, Ignas Niemegeers, M. Garcia Larrode, A. M. J. Koonen
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

With the advent of opening up 60GHz Radio with 5GHzof available spectrum, many bandwidth-hungry applicationscan be supported. The immediate concern, however,is the constraint on the line-of-sight transmission as well as the short transmission range of signals. As a result, in an indoor network, a mobile user might experience frequentbreaks or losses of connection when one moves from onecell to another. To mitigate this problem, the Extended Cell(EC) architecture is proposed. In this paper, a dynamic Extended Cell formation algorithm is proposed based on theactual floor plan and the traffic situation under the network. Moreover, by applying this dynamic EC formation algorithm, we show that the call blocking probability is reduced. The dynamic EC formation also eases the deployment and maintenance cost due to its adaptability to the changing environment.
Intuitive Mapping of UML 2 Activity Diagrams into Fundamental Modeling Concept Petri Net Diagrams and Colored Petri Nets
Authors: Tony Spiteri Staines
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

This paper describes how UML 2 Activity diagrams can be intuitively translated into Petri net notations. The UML2 specification states that activities are based on Petri net semantics. The transformation of UML 2 Activity diagrams into Petri net semantics have been researched for various reasons. Translating UML activities into Petri nets creates new problems. The Petri net diagrams are i) more complex ii) contain more nodes and edges, iii) unsuitable for visualization by stakeholders. A solution to this problem is to translate the UML activity diagram into a Fundamental Modeling Concepts Petri net diagram compact notation. This can be converted to a colored Petri net (CPN) for execution and validation. A case study taken from a web ordering system activity is used for explaining and illustrating this concept.
Data mining in course management systems: Moodle case study and tutorial
Authors: Cristóbal Romero, Sebastián Ventura, Enrique García
Venue: Computers Education (2008)

Educational data mining is an emerging discipline, concerned with developing methods for exploring the unique types of data that come from the educational context. This work is a survey of the specific application of data mining in learning management systems and a case study tutorial with the Moodle system. Our objective is to introduce it both theoretically and practically to all users interested in this new research area, and in particular to online instructors and e-learning administrators. We describe the full process for mining e-learning data step by step as well as how to apply the main data mining techniques used, such as statistics, visualization, classification, clustering and association rule mining of Moodle data. We have used free data mining tools so that any user can immediately begin to apply data mining without having to purchase a commercial tool or program a specific personalized tool.
An Improvement of Password-Only Authenticated Key Establishment Protocol without Public Key Cryptography
Authors: Eun-Jun Yoon, Kee-Young Yoo
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In 2005, Laih et al. proposed a password-only authenticated key establishment protocol without public key cryptography. The current paper, however, demonstrates that Laih et al.'s protocol does not provide perfect forward secrecy, then an improved protocol, based on the elliptic curve discrete logarithm problem, will be presented in order to isolate such a problem.