ppxscal/embedding_network huggingface dataset:
Understanding Cloned Patterns in Web Applications
Authors: Andrea De Lucia, Rita Francese, Giuseppe Scanniello, Genoveffa Tortora
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

We propose a tool to identify and analyze cloned patterns in web applications using clone analysis and clustering of static and dynamic web pages. The tool first detects cloned pages, which are then grouped into clusters as well as the groups of links between clusters. In this way the navigational schema is simplified and the duplicated functionalities corresponding to cloned navigational patterns can be more easily analyzed. The tool also allows filtering out uninteresting parts of the restructured navigational schema, thus to further improve the understanding.
Centralized authorization using a directory service, Part II
Authors: Alf Wachsmann
Venue: Linux Journal (2005)

Single sign-on is one step closer as we replace /etc/passwd entries with a centralized directory of users and groups.
Adaptive Optimization of Convex Functionals in Banach Spaces
Authors: Claudio Canuto, Karsten Urban
Venue: SIAM Journal on Numerical Analysis (2004)

This paper is concerned with optimization or minimization problems that are governed by operator equations, such as partial differential or integral equations, and thus are naturally formulated in an infinite dimensional function space V. We first construct a prototype algorithm of steepest descent type in V and prove its convergence. By using a Riesz basis in V we can transform the minimization problem into an equivalent one posed in a sequence space of type $\ell_p$. We convert the prototype algorithm into an adaptive method in $\ell_p$. This algorithm is shown to be convergent under mild conditions on the parameters that appear in the algorithm. Under more restrictive assumptions we are also able to establish the rate of convergence of our algorithm and prove that the work/accuracy balance is asymptotically optimal. Finally, we give two particular examples.
Impact of Event Logger on Causal Message Logging Protocols for Fault Tolerant MPI
Authors: Aurelien Bouteiller, Boris Collin, Thomas Herault, Pierre Lemarinier, Franck Cappello
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Fault tolerance in MPI becomes a main issue in the HPC community. Several approaches are envisioned from user or programmer controlled fault tolerance to fully automatic fault detection and handling. For this last approach, several protocols have been proposed in the literature. In a recent paper, we have demonstrated that uncoordinated checkpointing tolerates higher fault frequency than coordinated checkpointing.Moreover causal message logging protocols have been proved the most efficient message logging technique. These protocols consist in piggybacking non deterministic events to computation message. Several protocols have been proposed in the literature. Their merits are usually evaluated from four metrics: a) piggybacking computation cost, b) piggyback size, c) applications performance and d) fault recovery performance. In this paper, we investigate the benefit of using a stable storage for logging message events in causal message logging protocols. To evaluate the advantage of this technique we implemented three protocols: 1) a classical causal message protocol proposed in Manetho, 2) a state of the art protocol known as LogOn, 3) a light computation cost protocol called Vcausal. We demonstrate a major impact of this stable storage for the three protocols, on the four criteria for micro benchmarks as well as for the NAS benchmark.
Statistical significance of MUC-6 results
Authors: Nancy Chinchor
Venue: Proceedings of the 6th conference on Message understanding (1995)

The results of the MUC-6 evaluation must be analyzed to determine whether close scores significantly distinguish systems or whether the differences in those scores are a matter of chance. In order to do such an analysis, a method of computer intensive hypothesis testing was developed by SAIC for the MUC-3 results and has been used for distinguishing MUC scores since that time. The implementation of this method for the MUC evaluations was first described in [1] and later the concepts behind the statistical model were explained in a more understandable manner in [2]. This paper gives the results of the statistical testing for the three MUC-6 tasks where a single metric could be associated with a system's performance.
Methods for stiff differential equations
Authors: G. Bjurel, B. Lindberg
Venue: ACM SIGNUM Newsletter (1973)

Under supervision of professor G. Dahlquist different approaches to the numerical solution of stiff differential equations have been studied at our institute. As an introduction to the subject a survey of methods and applications up to 1970 (1) was made.
Fisher+Kernel Criterion for Discriminant Analysis
Authors: Shu Yang, Shuicheng Yan, Dong Xu, Xiaoou Tang, Chao Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We simultaneously approach two tasks of nonlinear discriminant analysis and kernel selection problem by proposing a unified criterion, Fisher+Kernel Criterion. In addition, an efficient procedure is derived to optimize this new criterion in an iterative manner. More specifically, original input vector is first transformed into a higher dimensional feature matrix through a battery of nonlinear mappings involved in different kernels. Then, based on the feature matrices, FKC is presented within two coupled projection spaces: one projection space is used to search for the optimal combinations of kernels; while the other encodes the optimal nonlinear discriminating projection directions. Our proposed method is a unified framework for both kernel selection and nonlinear discriminant analysis. Besides, the algorithm potentially alleviates overfitting problem existing in traditional KDA and has no singularity problems in most cases. The effectiveness of our proposed algorithm is validated by extensive face recognition experiments on several datasets.
A generic anti-spyware solution by access control list at kernel level
Authors: Sherman S. M. Chow, Lucas C. K. Hui, S. M. Yiu, K. P. Chow, Richard W. C. Lui
Venue: Journal of Systems and Software (2005)

Spyware refers to programs that steal the user information stored in the user's computer and transmit this information via the internet to a designated home server without the user being aware of this transmission. Existing anti-spyware solutions are not generic and flexible. These solutions either check for the existence of known spyware or try to block the transmission of the private information at the packet level. In this paper, we propose a more generic and flexible anti-spyware solution by utilizing an access control ist in kernel mode of the operating system. The major difference between our approach and the existing approaches is that instead of asking a guard to look for the theft (spyware) or control the exit of the computer (and hence giving the spyware enough time to hide the information to be transmitted). we put a guard besides the treasure (the private information) and carefully control the access to it in the kernel mode. We also show the details of an implementation that realizes our proposed solution.
Analysis of Liberty Single-Sign-on with Enabled Clients
Authors: Birgit Pfitzmann, Michael Waidner
Venue: IEEE Internet Computing (2003)

Channel-based enabled-client protocols, such as the Liberty-enabled client and proxy profile, offer Web single-sign-on service; however, several security concerns remain.
BIND: A Fine-Grained Attestation Service for Secure Distributed Systems
Authors: Elaine Shi, Adrian Perrig, Leendert Van Doorn
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

In this paper, we propose BIND (Binding Instructions aNd Data), a fine-grained attestation service for securing distributed systems. Code attestation has recently received considerable attention in trusted computing. However, current code attestation technology is relatively immature. First, due to the great variability in software versions and configurations, verification of the hash is difficult. Second, the time-of-use and time-of-attestation discrepancy remains to be addressed, since the code may be correct at the time of the attestation, but it may be compromised by the time of use. The goal of BIND is to address these issues and make code attestation more usable in securing distributed systems. BIND offers the following properties: 1) BIND performs fine-grained attestation. Instead of attesting to the entire memory content, BIND attests only to the piece of code we are concerned about. This greatly simplifies verification. 2) BIND narrowsthe gap between time-of-attestation and time-of-use. BIND measures a piece of code immediately before it is executed and uses a sand-boxing mechanism to protect the execution of the attested code. 3) BIND ties the code attestation with the data that the code produces, such that we can pinpoint what code has been run to generate that data. In addition, by incorporating the verification of input data integrity into the attestation, BIND offers transitive integrity verification, i.e., through one signature, we can vouch for the entire chain of processes that have performed transformations over a piece of data. BIND offers a general solution toward establishing a trusted environment for distributed system designers.
Conversion and Proxy Functions for Symmetric Key Ciphers
Authors: Debra L. Cook, Angelos D. Keromytis
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

As a general design criterion, a symmetric key cipher should not be closed under functional composition due to the implications on the security of the cipher. However, there are scenarios in which this property is desirable and can be obtained without reducing the security of a cipher by increasing the computational workload of the cipher. We expand the idea of a symmetric key cipher being closed under functional composition to a more general scenario where there exists a function that converts the ciphertext resulting from encryption under a specific key to the ciphertext corresponding to encryption with another key. We show how to perform such a conversion without exposing the plain-text. We discuss the tradeoff between the computational workload and security, and the relationship between such conversions and proxy cryptography. We conclude with a description of some practical applications of our results.
Efficient realization of the Galerkin method in view of new properties of Chebyshev polynomials
Authors: Yu. G. Bulychev, E. Yu. Bulycheva
Venue: Cybernetics and Systems Analysis (2005)

The Galerkin method is used taking account of new properties of Chebyshev polynominals of the first and second kinds to demonstrate the possibility of simplifying the asymptotic analysis and synthesis of various systems governed by operator equations.
First international workshop on the modeling and analysis of concerns in software (MACS 2005)
Authors: Martin P. Robillard, Peri Tarr
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Many software engineering activities are organized around the idea of concerns. Separation of concerns is a basic tenet of software engineering intended to facilitate the development and evolution of software systems. Unfortunately, separation of concerns is not always possible in practice, and concerns often end up scattered and tangled. The goal of the MACS workshop is to bring together researchers and practitioners with interest and experience in techniques for modeling and analyzing the realization of concerns in software systems.
On searching strategies, parallel questions, and delayed answers
Authors: Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Venue: Discrete Applied Mathematics (2004)

In this paper we study the effect that delayed answers can have on binary search procedures.
Logic-level mapping of high-level faults
Authors: F. Fummi, C. Marconcini, G. Pravadelli
Venue: Integration, the VLSI Journal (2005)

Many high-level fault models have been proposed in the past to perform verification at functional level, however high-level automatic test pattern generators (ATPGs) are still in a prototyping phase, while very efficient logic-level ATPGs are available.On the other side, coverage metrics and functional fault models are used to guide the generation of functional tests achieving high fault coverage in a relatively short time with respect to traditional gate-level ATPGs. However, what is the effectiveness of test sequences generated at functional level with respect to the more traditional gate-level stuck-at fault model?The paper presents an accurate analysis of the correlation between high-level fault models and the gate-level stuck-at fault model and it proposes a strategy to map high-level faults into logic-level faults. Thus, functional verification, based on a high-level fault model, can be performed by exploiting the capability of state of the art logic-level ATPGs. Experimental results highlight the effectiveness of the methodology.
An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
Authors: Peter Brass
Venue: SIAM Journal on Discrete Mathematics (2005)

In this paper it is shown that for any set of n points selected from the d-dimensional unit cube, d odd, the volume of the smallest simplex spanned by the set is $O(n^{-(1+{1\over 2d})})$, which is a slight improvement on the only known upper bound O(n-1)$, although still far from the lower bound $\Omega(n^{-d}\log n)$.
LaTeX equations and graphics in PHP
Authors: Titus Barik
Venue: Linux Journal (2005)

Put the math you want on your Web site, right inside the pages you're already building.
An Identity Based Encryption system
Authors: Louise Owens, Adam Duffy, Tom Dowling
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

We describe an Identity Based Encryption (IBE) cryptosystem based on a scheme presented by Boneh and Franklin [3]. We implement the abstract mathematical concepts underlying this system. We reuse an existing Elliptic curve arithmetic API, [4] to reduce the development time of the IBE system. We present a Java Cryptographic Architecture (JCA) integrated implementation of IBE that will allow Java developers to easily take advantage of this new encryption system and thus eliminate some of the most serious practical problems associated with existing public key infrastructure systems. The JCA implementation facilitates the hiding of all the complicated mathematical details of the system and further demonstrates the utility of Java as security development language.
The minimum period of the Ehrhart quasi-polynomial of a rational polytope
Authors: Tyrrell B. McAllister, Kevin M. Woods
Venue: Journal of Combinatorial Theory Series A (2005)

If P ⊆ Rd is a rational polytope, then ip(n) := #(nP ∩ Zd) is a quasi-polynomial in n, called the Ehrhart quasi-polynomial of P. The minimum period of ip(n) must divide D(P) = min{n ∈ Z >0:nP is an integral polytope}. Few examples are known where the minimum period is not exactly D(P). We show that for any D, there is a 2-dimensional triangle P such that D(P) = D but such that the minimum period of ip(n) is 1, that is, ip(n) is a polynomial in n. We also characterize all polygons P such that ip(n) is a polynomial. In addition, we provide a counterexample to a conjecture by T. Zaslavsky about the periods of the coefficients of the Ehrhart quasi-polynomial.
A Fully Integrated Class 1 Bluetooth 0.25 μm CMOS PA
Authors: Koen Mertens, Michiel Steyaert
Venue: Analog Integrated Circuits and Signal Processing (2005)

A fully integrated 0.25 ¿m CMOS bluetooth class 1 power amplifier is presented. On this chip all inductors and decoupling capacitors are situated on the silicon die. Due to the high level of integration, a cheap flip chip assembly method has been used. The chip delivers 138 mW (21.4 dBm) of output power with a power added efficiency of 25.8%. When the amplifier is tuned to its optimum frequency of 2.1 GHz, the output power increases to 184 mW and the power added efficiency increases to 29.5%. To compare the performance of this realisation with other recently published PA, a figure of merit for saturated (switched) power amplifiers is introduced.
Legacy database replacement with LAMP
Authors: Richard Hulse
Venue: Linux Journal (2005)

Chalk up another victory for Do-It-Yourself IT, as one in-house project replaced three incompatible proprietary applications.
MENIX: A UNIX USER ADAPTABLE INTERFACE
Authors: Yves Chauvin
Venue: ACM SIGCHI Bulletin (1991)

Menix is an adaptive user interface that presents to a user a limited set of Unix commands as a function of a predefined level of information. The commands presented in an adaptable menu are functions of the user and of his/her past interaction with Unix. Menix infers the level of information of a command from information theoretic principles. Commands/units are also connected by adaptable weights. A level of activation is computed for each command and commands with high levels of activation (high information content) are then presented to the user. For each command typed by the user, Menix learns by adjusting the weights between commands. At first, each user is considered as an "average" user. Following a number of sessions, the system adapts and attempts to infer current knowledge and goals of each user. The theoretical principles can be adapted to other systems of complexity comparable to Unix.
AAAI president's message
Authors: Allen Newell
Venue: Issue 73 (October 1980) (1980)

Births are always interesting affairs. According to some, births are always traumatic - a shock to come from the womb to the world. The birth we give witness to here is that of a new society, the American Association for Artificial Intelligence - AAAI. It has not seemed to me traumatic, but rather almost wholly benign. In a world where not much is benign at the moment, such an event is devoutly to be cherished.
A case for multi-level main memory
Authors: Magnus Ekman, Per Stenstrom
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

Current trends suggest that the number of memory chips per processor chip will increase at least a factor of ten in seven years. This will make DRAM cost, the space and the power it consumes a serious problem. The main question raised in this research is how cost, size, and power consumption can be reduced by transforming traditional flat main-memory systems into a multi-level hierarchy. We make the case for a multi-level main memory hierarchy by proposing and evaluating the performance of an implementation that enables aggressive use of memory compression, sharing of memory resources among computers, and dynamic power management of unused regions of memory. This paper presents the key design strategies to make this happen. We evaluate our implementation using complete runs of applications from the Spec 2K suite, SpecJBB, and SAP --- typical desktop and server applications. We show that only 30% of the entire memory resources typically needed must be accessed at DRAM speed whereas the rest can be accessed at a speed that is a magnitude slower. The resulting performance overhead is shown to be only 1.2% on average.
Performance Analysis of Distributed-Antenna Communication Systems Using Beam-Hopping Under Strong Directional Interference
Authors: Honglin Hu, Jinkang Zhu
Venue: Wireless Personal Communications: An International Journal (2005)

In order to efficiently mitigate the interference of directional jammers, we investigate a beam-hopping (BH) communication scheme, which includes slow beam-hopping (SBH) and fast beam-hopping (FBH) schemes. In the BH communication scheme, only one pair of the beams is used for transmission and it hops from one to the next according to an assigned BH pattern. In this contribution, a range of expressions in terms of the symbol error rate (SER) performance of the BH and conventional single-beam (SB) schemes have been derived, when both the downlink and uplink are considered. The SER performance of the BH scheme is compared with that of the SB scheme, for M-ary phase-shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) signals under composite log normal shadowing/Nakagami-m fading channels. Our analysis and results show that the proposed BH scheme is suitable for communications, when several distributed antenna arrays are available around a mobile.
Efficient Hodge-Helmholtz decomposition of motion fields
Authors: Qinghong Guo, Mrinal K. Mandal, Micheal Y. Li
Venue: Pattern Recognition Letters (2005)

Motion analysis is an active but challenging research area. In this paper, we propose a simplified implementation of the recently developed discrete Hodge-Helmholtz field decomposition (DHHFD) using the finite element method. The DHHFD can decompose an arbitrary flow field into three components: a curl-free component, a divergence-free component, and a harmonic remainder. Experimental results show that the proposed implementation provides an excellent motion field decomposition performance.
Using XML to represent knowledge by frames
Authors: Milko Marinov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Recent fashion in knowledge representation languages is to use XML as the low-level syntax. This tends to make the output of these knowledge representation languages easy for machines to parse, at the expense of human readability. The strength of XML lies in its simplicity to represent data and knowledge. It is used to develop modeling languages that are tailored to specific knowledge, and specific data structures and hierarchies. This paper considers an approach to frame knowledge representation using XML. A generalized XML model of the frame-based representation is proposed. The implementation of the XML generator, which is built into the interactive tool for frame representation is described.
Efficient Algorithms for the Smallest Enclosing Ball Problem
Authors: Guanglu Zhou, Kim-Chuan Tohemail, Jie Sun
Venue: Computational Optimization and Applications (2005)

Consider the problem of computing the smallest enclosing ball of a set of m balls in ¿n. Existing algorithms are known to be inefficient when n > 30. In this paper we develop two algorithms that are particularly suitable for problems where n is large. The first algorithm is based on log-exponential aggregation of the maximum function and reduces the problem into an unconstrained convex program. The second algorithm is based on a second-order cone programming formulation, with special structures taken into consideration. Our computational experiments show that both methods are efficient for large problems, with the product mn on the order of 107. Using the first algorithm, we are able to solve problems with n = 100 and m = 512,000 in about 1 hour.