ppxscal/embedding_network huggingface dataset:
An Empirical Comparison of Individual Machine Learning Techniques in Signature and Fingerprint Classification
Authors: Márjory Abreu, Michael Fairhurst
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

This paper describes an empirical study to investigate the performance of a wide range of classifiers deployed in applications to classify biometric data. The study specifically reports results based on two different modalities, the handwritten signature and fingerprint recognition. We demonstrate quantitatively how performance is related to classifier type, and also provide a finer-grained analysis to relate performance to specific non-biometric factors in population demographics. The paper discusses the implications for individual modalities, for multiclassifier but single modality systems, and for full multibiometric solutions.
The nonexistence of near-extremal formally self-dual codes
Authors: Sunghyu Han, Jon-Lark Kim
Venue: Designs, Codes and Cryptography (2009)

A code $${\mathcal {C}}$$ is called formally self-dual if $${\mathcal {C}}$$ and $${\mathcal {C}^{\perp}}$$ have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over $${\mathbb {F}_2,\,\mathbb {F}_3}$$ , and $${\mathbb F_4}$$ . These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally self-dual (f.s.d.) codes. With Zhang's systematic approach, we determine possible lengths for which the four types of near-extremal formally self-dual codes as well as the two types of near-extremal formally self-dual additive codes cannot exist. In particular, our result on the nonexistence of near-extremal binary f.s.d. even codes of any even length n completes all the cases since only the case 8|n was dealt with by Han and Lee.
Trend forecasting based on Singular Spectrum Analysis of traffic workload in a large-scale wireless LAN
Authors: George Tzagkarakis, Maria Papadopouli, Panagiotis Tsakalides
Venue: Performance Evaluation (2009)

Network traffic load in an IEEE802.11 infrastructure arises from the superposition of traffic accessed by wireless clients associated with access points (APs). An accurate load characterization can be beneficial in modeling network traffic and addressing a variety of problems including coverage planning, resource reservation and network monitoring for anomaly detection. This study focuses on the statistical analysis of the traffic load measured in a campus-wide IEEE802.11 infrastructure at each AP. Using the Singular Spectrum Analysis approach, we found that the time-series of traffic load at a given AP has a small intrinsic dimension. In particular, these time-series can be accurately modeled using a small number of leading (principal) components. This proved to be critical for understanding the main features of the components forming the network traffic. Statistical analysis of leading components has demonstrated that even a few first components form the main part of the information. The residual components capture the small irregular variations, which do not fit in the basic part of the network traffic and can be interpreted as a stochastic noise. Based on these properties, we also studied contributions of the various components to the overall structure of the traffic load of an AP and its variation over time. Finally, we designed and evaluated the performance of a traffic predictor for the trend component, obtained by projecting the original time-series on the set of leading components.
Solving Ordinary Differential Equations by Simplex Integrals
Authors: Yongxiong Zhou, Shuhuang Xiang
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

This paper is devoted to the proper discrete solution for ordinary differential equations, especially to oscillating solution. In contrast to Lipschitz condition, we define a new condition following that $$\left|\int_{t_{0}}^{t_{1}}f(t)dt\right|\leq R\max\limits_{\xi_{1},\xi_{2}\in [t_{0},t_{1}]} |f(\xi_{1})-f(\xi_{2})|$$ with small R for all t 0, t 1 in the correlative intervals. Under the assumption of this new condition, we obtain a new asymptotic formula $$\phi_{v}(t)-Q_{v-1}(t)=O((Rh)^{v}),$$ where simplex integral &phi; v (t) denotes $$\int_{t_{0}}^{t}\cdots\int_{t_{0}}^{\xi_{v-2}}\int_{t_{0}}^{\xi_{v-1}}f(\xi_{v}) d\xi_{v}d\xi_{v-1}\cdots d\xi_{1}$$ and the v&thinsp;&minus;&thinsp;1-th polynomials Q v&thinsp;&minus;&thinsp;1(t) in which coefficient correspond to simplex integrals $\phi_{n_{k}}(t)$ with n k &thinsp;>&thinsp;v, k&thinsp;=&thinsp;1, 2,..., v. In other words, the accuracy for approximation increasing rapidly as the integrable functions oscillate rapidly or for small step h while it&rsquo;s difficult for us to pursuit a polynomial to approximate a highly oscillatory function. Applying this idea of approximation to ODE, this paper surveys the algorithmic issues. If ODE has the form $$P_{n}y^{(n)}+P_{n-1}y^{(n-1)}+\cdots+P_{1}y'+P_{0}y=g(t),$$ where P n (t),P n&thinsp;&minus;&thinsp;1(t),..., P 0(t) are arbitrary degree polynomials, then we can solve it by the recursive relation about simplex integrals altogether with approximate relation. Finally, numerical examples about Airy and Bessel equations illustrate the efficiency of this technique.
A full-synthesizable high-precision built-in delay time measurement circuit
Authors: Ming-Chien Tsai, Ching-Hwa Cheng
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Delay testing has become a major issue for manufacturing advanced Systems on a Chip. Automatic Test Equipment and scan techniques are usually applied in delay testing. However, the circuits under test have many circuit paths and dependent input patterns; it is hard to measure delay times accurately, especially when debugging small delay defects. We propose a Built-In Delay Measurement (BIDM) circuit that is modified from Vernier Delay Lines. All digitally designed BIDMs with small area overhead can be easily embedded within testing circuits. BIDMs can be used to record the data propagation delay times within circuit path segments, for delay testing, diagnosis, and calibration requirements internal to the chip. Our BIDM was implemented in a 32bit error correction circuit by a chip using TSMC 0.18u technology. The instruments measured results showing that the BIDM chip correctly reported the CUT segment path delay times. The chip measurement results were a 95.83% match to the postlayout SPICE simulation values. This BIDM makes it possible to debug small delay defects in chips.
Crossing and Weighted Crossing Number of Near-Planar Graphs
Authors: Sergio Cabello, Bojan Mohar
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

A nonplanar graph G is near-planar if it contains an edge e such that G&thinsp;&minus;&thinsp;e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from different combinatorial viewpoints. On the one hand, we develop min-max formulas involving efficiently computable lower and upper bounds. These min-max results are the first of their kind in the study of crossing numbers and improve the approximation factor for the approximation algorithm given by Hliněn&yacute; and Salazar (Graph Drawing GD 2006). On the other hand, we show that it is NP-hard to compute a weighted version of the crossing number for near-planar graphs.
Safe open-nested transactions through ownership
Authors: Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore ``low-level'' memory operations of an open-nested transaction when detecting conflicts for its parent transaction, and instead perform abstract concurrency control for the ``high-level'' operation that the nested transaction represents. To support this methodology, TM systems use an open-nested commit mechanism that commits all changes performed by an open-nested transaction directly to memory, thereby avoiding low-level conflicts. Unfortunately, because the TM runtime is unaware of the different levels of memory, unconstrained use of open-nested commits can lead to anomalous program behavior. We describe the framework of ownership-aware transactional memory which incorporates the notion of modules into the TM system and requires that transactions and data be associated with specific transactional modules or Xmodules. We propose a new ownership-aware commit mechanism, a hybrid between an open-nested and closed-nested commit which commits a piece of data differently depending on which Xmodule owns the data. Moreover, we provide a set of precise constraints on interactions and sharing of data among the Xmodules based on familiar notions of abstraction. The ownership-aware commit mechanism and these restrictions on Xmodules allow us to prove that ownership-aware TM has clean memory-level semantics. In particular, it guarantees serializability by modules, an adaptation of the definition of multilevel serializability from database systems. In addition, we describe how a programmer can specify Xmodules and ownership in a Java-like language. Our type system can enforce most of the constraints required by ownership-aware TM statically, and can enforce the remaining constraints dynamically. Finally, we prove that if transactions in the process of aborting obey restrictions on their memory footprint, then ownership-aware TM is free from semantic deadlock.
Generating all distributions of objects to bins
Authors: Muhammad Abdullah Adnan, Md. Saidur Rahman
Venue: International Journal of Computer Mathematics (2009)

In this paper, we give an elegant algorithm to generate all distributions of n identical objects to m bins without repetition. The best known previous algorithm, due to Klingsberg, generates each distribution in constant time in average sense. Using a new technique of efficient tree traversal, in this paper we improve the time complexity to constant time (in ordinary sense). By modifying our algorithm, we can generate the distributions in anti-lexicographic order. Overall space complexity of our algorithm is O(mlgn), where m is the number of bins and n is the number of objects.
Recognition of objects of a living room of class through a pyramidal method
Authors: Elias Garcia-Santillan, Carlos Avilés-Cruz
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The present work describes a recognition system of objects through the computer using color, forms and texture descriptors. In the classification of the objects the classifier "K nearest neighbor" was used in a sequential way for characteristics of color, forms and texture. In the classification by color the format RGB was used; in the classification by form was used the idiosyncrasy and the factor of compactness; finally, in the classification by texture was only used the energy descriptor. Initially, the recognition system was planned to help blind people in the recognition of objects around their environment; but due to the existent problem in the design of general algorithms for the recognition, A proposal was given for its implementation within a classroom, being limited only to the recognition of 10 small objects. With the method proposed in this work the percentage of success in the recognition is improved more than 94.58%. Using the traditional method "K nearest neighbor" in the classification, the distances of the vector are calculated by characteristic up to the point of classification; using the proposed method the number of classes in each classification is reduced, in this way the classifier is able to classify a bigger number of objects in each classification in a sequential manner and with a bigger certainty when there is not confusion of classes.
An Empirical Research on the Relationship between Leadership and Personal Initiative
Authors: Xianfang Xue
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The relationship between Leadership and Personal Initiative was explored. 255 employees and 45 superiors were surveyed by MLQ (5X), work-related self-efficacy questionnaire and personal initiative questionnaire. The results showed that leadership had close relationship with personal initiative, transformational leadership had augmentation validity based on transactional leadership in predicting personal initiative, self-efficacy played a mediator role in the relationship between leadership and personal initiative.
Optimal tests against the alternative hypothesis of panel unit roots
Authors: Yonghee Lee, Dong Wan Shin
Venue: Computational Statistics Data Analysis (2009)

For panel models with random individual and time effects, locally best invariant (LBI) tests are constructed for the null hypothesis of stationarity against the alternative hypothesis of panel unit root. Finite sample properties of the proposed test and an existing test are compared by a Monte Carlo simulation.
Requirements and compliance in legal systems: a logic approach
Authors: Wa ël Hassan, Luigi Logrippo
Venue: Proceedings of the 2008 Requirements Engineering and Law (2008)

It is shown that the concepts of requirements and implementation exist in normative systems, in particular in law, and are similar to homologous concepts in software engineering. Concepts of compliance and conformance are also similar in the two areas. Further, it is shown how a logic analyzer such as Alloy can be used in order to verify legal compliance by checking consistency between legal and enterprise requirements. Examples are taken from privacy law and financial reporting law.
Communication: On intermediate factorial languages
Authors: Arseny M. Shur
Venue: Discrete Applied Mathematics (2009)

We prove that factorial languages defined over non-trivial finite alphabets under some natural conditions have intermediate complexity functions, i.e., the number of words in such a language grows faster than any polynomial but slower than any exponential function.
Nagios: System and Network Monitoring, 2nd edition
Authors: Wolfgang Barth
Venue:  (2008)

Good system administrators recognize problems long before anyone asks, "Hey, is the Internet down?" Nagios, an open source system and network monitoring tool, has emerged as the most popular solution for sys admins in organizations of all sizes. It's robust but also complex, and Nagios: System and Network Monitoring, 2nd Edition, updated to address Nagios 3.0, will help you take full advantage of this program. Nagios, which runs on Linux and most *nix variants, can be configured to continuously monitor network services such as SMTP, POP3, HTTP, NNTP, SSH, and FTP. It can also supervise host resources (processor load, disk and memory usage, running processes, log files, and so on) and environmental factors, such as temperature and humidity. This book is your guide to getting the most out of this versatile and powerful monitoring tool. Inside Nagios, you'll learn how to:Install and configure the Nagios core, all standard plugins, and selected third-party plugins Configure the notification system to alert you of ongoing problems-and to alarm others in case of a serious crisis Program event handlers to take automatic action when trouble occurs Write Perl plugins to customize Nagios for your unique needs Quickly understand your Nagios data using graphing and visualization tools Monitor Windows servers, SAP systems, and Oracle databasesThe book also includes a chapter that highlights the differences between Nagios versions 2 and 3 and gives practical migration and compatibility tips. Nagios: System and Network Monitoring, 2nd Edition is a great starting point for configuring and using Nagios in your own environment. About the Author Wolfgang Barth has written several books for professional network administrators, including Firewall (Suse Press), Network Analysis (Suse Press), and Backup Solutions with Linux (Open Source Press). He is a professional system administrator with considerable experience using Nagios.
Detect and Recognize Clock Time in Sports Video
Authors: Fan Bu, Li-Feng Sun, Xi-Feng Ding, Yin-Jun Miao, Shi-Qiang Yang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Analyzing overlay content in sports video could help us to get reference information about the game. For example, the digital clock on score board, which indicates elapsed time of the game, is very useful to sports game summarization, indexing and retrieval. However, existing methods can only handle well when time clock is on a clean background and appears all the time. This paper has proposed a more general approach to locate and recognize the digit characters on soccer videos. It is notably efficient in reading the clock digits on a transparent overlay, where the clock digits appear and disappear, and they are blurred due to compression. Experimental results show that this approach is robust regardless of contrast, font-size, font-color and background complexity. It is also simple and quick enough for real time clock reading while the video is playing.
Treelike comparability graphs
Authors: Sabine Cornelsen, Gabriele Di Stefano
Venue: Discrete Applied Mathematics (2009)

An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the Partitioning into Bounded Cliques problem on special subgraphs of treelike permutation graphs.
Training ANFIS as an identifier with intelligent hybrid stable learning algorithm based on particle swarm optimization and extended Kalman filter
Authors: Mahdi Aliyari Shoorehdeli, Mohammad Teshnehlab, Ali Khaki Sedigh
Venue: Fuzzy Sets and Systems (2009)

This paper proposes a novel hybrid learning algorithm with stable learning laws for Adaptive Network-based Fuzzy Inference System (ANFIS) as a system identifier. The proposed hybrid learning algorithm is based on the particle swarm optimization (PSO) for training the antecedent part and the extended Kalman filter (EKF) for training the conclusion part. Lyapunov stability theory is used to study the stability of the proposed algorithm. Comparison results of the proposed approach, PSO algorithm for training the antecedent part and recursive least squares (RLSs) or EKF algorithm for training the conclusion part, with the other classical approaches such as, gradient descent, resilient propagation, quick propagation, Levenberg-Marquardt for training the antecedent part and RLSs algorithm for training the conclusion part are provided. Moreover, it is shown that applying PSO, a powerful optimizer, to optimally train the parameters of the membership function on the antecedent part of the fuzzy rules in ANFIS system is a stable approach which results in an identifier with the best trained model. Stability constraints are obtained and different simulation results are given to validate the results. Also, the stability of Levenberg-Marquardt algorithms for ANFIS training is analyzed.
Proto: a compiler construction toolkit for DSELs
Authors: Eric Niebler
Venue: Proceedings of the 2007 Symposium on Library-Centric Software Design (2007)

A Domain-Specific Embedded Language (DSEL) is a miniature language-within-a-language for solving problems in a particular domain. One technique for creating efficient and expressive DSELs in C++ is to use expression templates, but this technique is not for the faint of heart. Such libraries are difficult to write and maintain due to the esoteric nature of template meta-programming, and difficult to use because of the often impenetrable compiler error messages they generate. Existing tools help somewhat, but do not provide the support that language designers have come to expect: something like BNF for defining the language's grammar and associated semantic actions. This paper describes Proto, a C++ library that implements a compiler construction toolkit for embedded languages. The benefits of grammar-based DSELs are shown by contrasting them to other existing approaches to DSEL design. The nature of embedded languages with constrained grammars and their implications for a embedded compiler construction toolkit is briefly explored. Some examples are shown where library interfaces can be made more expressive through the use of grammar-based DSELs.
Development of Rural Amenity Resources Information System
Authors: Kim Sang Bum, Rhee Sang Young, Kim Young Wook
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

The major countries of Organization for Economic Cooperation and Development (OECD) have been promoting the Rural Development Policies for practical application of valuable resources in rural area since 1990th. They have been trying to change their agricultural industry policy from the Agricultural Policies, which promotes an intensive agriculture, an endogenous rural development, which promotes the Rural Development Policies, after the Doha Development Agenda (DDA) and the Free Trade Agreement (FTA) reinforcement. After 1960th in Korea, we focused on urban amenity and agriculture productivity. We had strived to do living environments, Agricultural Infrastructure, and Agricultural buildings for rural area developing; therefore, we obtained good results. However, our policy had been inclined too heavily toward beneficial urban type, so that we hadn’t been able to give meticulous care about rural resources, consideration of environment, and organized development. We accordingly require systematically discovering and developing the rural resources for the rural area’s develop competitive power as a basically settlement area. Political interest is increased in the Rural Amenity for Rural Development, off-farm Income. The Rural Amenity is presented, as the Rural Development Policies, in those interpretations for a solution of Rural Development and off-farm Income.
Novel numerical techniques based on Fokas transforms, for the solution of initial boundary value problems
Authors: Theodore S. Papatheodorou, Anastasia N. Kandili
Venue: Journal of Computational and Applied Mathematics (2009)

The unified transform method of A. S. Fokas has led to important new developments, regarding the analysis and solution of various types of linear and nonlinear PDE problems. In this work we use these developments and obtain the solution of time-dependent problems in a straightforward manner and with such high accuracy that cannot be reached within reasonable time by use of the existing numerical methods. More specifically, an integral representation of the solution is obtained by use of the A. S. Fokas approach, which provides the value of the solution at any point, without requiring the solution of linear systems or any other calculation at intermediate time levels and without raising any stability problems. For instance, the solution of the initial boundary value problem with the non-homogeneous heat equation is obtained with accuracy 10^-^1^5, while the well-established Crank-Nicholson scheme requires 2048 time steps in order to reach a 10^-^8 accuracy.