ppxscal/embedding_network huggingface dataset:
Current Status of Japanese Government PKI Systems
Authors: Yasuo Miyakawa, Takashi Kurokawa, Akihiro Yamamura, Yasushi Matsumoto
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

In Japan, three government PKI systems are constructed as Bridge Model PKI, and they are also bridged with each other. Up to now, all of the three PKI systems have issued certificates mainly for digital signature on digital documents. Only recently, a concern to issue certificates for entity authentication has been raised. Not only "KeyUsage" but also "CertificatePolicies" and related extensions should be carefully used in Bridge Model. As a potential international issue, we have started to discuss on the migration of cryptography in PKI systems. Due to Bridge Model and vertically divided administration, difficulties in enforcing consistent policies thoroughly in these PKI systems is expected in Japan.
Uniqueness Typing Simplified
Authors: Edsko Vries, Rinus Plasmeijer, David M. Abrahamson
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

We present a uniqueness type system that is simpler than both Clean's uniqueness system and a system we proposed previously. The new type system is straightforward to implement and add to existing compilers, and can easily be extended with advanced features such as higher rank types and impredicativity. We describe our implementation in Morrow, an experimental functional language with both these features. Finally, we prove soundness of the core type system with respect to the call-by-need lambda calculus.
An Image Indexing and Searching System Based Both on Keyword and Content
Authors: Nan Zhang, Yonghua Song
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Content-based image retrieval (CBIR) has certain advantages over those pure keyword-based. CBIR indexes images by visual features that are extracted from the images. This may save the effort spent on the manual annotation. However, because low-level visual features, such as colour and texture, often carry no high-level concepts, images retrieved purely based on content may not match with the intention of the user. The work presented in this paper is an image retrieval system that bases both on text annotations and visual contents. It indexes and retrieves images by both keywords and visual features, with the purpose that the keywords may mend the gap between the semantic meaning an image carries and its visual content. Tests were made on the system that have demonstrated that such a hybrid approach did improve retrieval precisions over those pure content-based.
Computing Approximate Nash Equilibria in Network Congestion Games
Authors: Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

We consider the problem of computing ¿-approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every ¿> 0, but the reductions are based on artificial and steep delay functions with the property that already two players using the same resource cause a delay that is significantly larger than the delay for a single player.We consider network congestion games with delay functions such as polynomials, exponential functions, and functions from queuing theory. We analyse which approximation guarantees can be achieved for such congestion games by the method of randomised rounding. Our results show that the success of this method depends on different criteria depending on the class of functions considered. For example, queuing theoretical functions admit good approximations if the equilibrium load of every resource is bounded away appropriately from its capacity.
Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids
Authors: Tomasz Szepieniec, Marian Bubak
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Among many attempts to design DAG scheduling algorithms that would face grid environment requirements, the strategy of number of eligible jobs maximization seems promising. Therefore, this paper presents the results of thorough analysis and evaluation of this strategy and its implementation called PRIO. We have analysed a large space of random DAGs and various resources parameters to compare results of PRIO algorithm with standard critical path length prioritization, FIFO prioritization as well as with quasi-optimal solution. Results of this comparison, in terms of the makespan and robustness, are supplemented by a theoretical and specific case analysis. We conclude with an assessment of usefulness of the current implementation of eligible jobs maximization strategy.
A Short History of Digital Computing in Southern California
Authors: Fred J. Gruenberger
Venue: IEEE Annals of the History of Computing (1980)

This is a written report of a talk given JANUARY-MARCH 17, 1958, at the Digital Computer Association, a local informal group. The Southern California area is today generally regarded as a center of activity in high-speed computing, having perhaps the highest density of machines and active, prominent people of any area in the world; the rise of this intense activity is traced from 1942 to 1957.
Lower Bounds for Generalized Quantum Finite Automata
Authors: Mark Mercer
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We obtain several lower bounds on the language recognition power of Nayak's generalized quantum finite automata (GQFA) [12]. Techniques for proving lower bounds on Kondacs and Watrous' one-way quantum finite automata (KWQFA) were introduced by Ambainis and Freivalds [2], and were expanded in a series of papers. We show that many of these techniques can be adapted to prove lower bounds for GQFAs. Our results imply that the class of languages recognized by GQFAs is not closed under union. Furthermore, we show that there are languages which can be recognized by GQFAs with probability p > 1/2, but not with p > 2/3. 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
A research of the elliptic curve cryptology applies to the IPv6 protocol
Authors: Po-Hsian Huang
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Internet and the Electronic Commerce are popular recently. Not only people start to care about the network security level where they use credit cards to order they want but also they have the idea about the network security.[1] At the moment, the algorithm of RSA (Rivest-Shamir-Adleman) is used by the Public key cryptology and Digital Signature. When end users need to send data to another one through Internet and input important data about one's secrets to a database. In order to avoid someone get their data, their data will be protective by security administrator. But those technologies which can break the RSA (Rivest-Shamir-Adleman) are more and more perfect to make the algorithm of RSA (Rivest-Shamir-Adleman) needing more and more bytes to save our data. This action has long computing time and network transmission over loading. In Elliptic Curve Cryptology, its bytes are less than RSA (Rivest-Shamir-Adleman). It can to let computer performance and network transmission be good and fast. Although the next generation protocol modifies from IPv4 and applies to IPSEC, it is not still perfect for network security. The unit of IP Security Protocol can't coexist with the unit of IPv6 protocol service when IPv6 packets pass IPv4 protocol and Network Address Transfer's field. For those weaknesses, one will discuss Elliptic Curve Cryptology how to translate in IPv6 protocol, and compare the performance of Elliptic Curve Cryptology and RSA in IPv6 protocol.
Simultaneous static output-feedback stabilization for a collection of interval time-delay systems via LMI approach
Authors: Yuan-Chang Chang, Song-Shyong Chen, Jen-Shu Hsiao
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

This paper addresses two control design problems. First, we treat the problem of simultaneously stabilizing static output-feedback controller design for a collection of continuous-time interval time-delay systems. It is shown that this problem is solvable if a matrix measure assignment problem is solvable. We also proved that the admissible solution set of the matrix measure assignment problem is convex. Second, we focus on the simultaneous static output-feedback stabilization problem for a collection of discrete-time interval systems. It is shown that this problem is solvable if a matrix's spectral norm assignment problem is solvable. We also proved hat the admissible solution set of the matrix's spectral norm assignment problem is convex. And further, the matrix's spectral norm assignment problem or the matrix measure assignment problem is shown to be equivalent to a linear matrix inequality (LMI) feasibility problem. Finally, an example is provided to illustrate the proposed methodology.
The Next Frontier
Authors: George Bosilca
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Today, multi/many core systems have become prevalent, with architectures more or less exotic and heterogeneous. The overall theoretical computational power of the new generation processors has thus greatly increased, but their programmability still lacks certainty. The many changes in the newest architectures have come so rapidly that we are still deficient in taking advantage of all the new features, in terms of high performance libraries and applications. Simultaneously, application requirements growat least at the same pace.Obviously,more computations require more data in order to feed the deepest processor pipelines.More data means either faster access to the memory or faster access to the network. But the improvement in access speed to all types of memory (network included) lags behind the increase in computational power. As a result, while extracting the right performance of the current and next generation architectures is still a challenge, it is compulsory to increase the efficiency of the current parallel programming paradigms.
The Fabrication of Reality
Authors: Stan Kelly-Bootle
Venue: Queue (2008)

Is there an "out there" out there? There are always anniversaries, real or concocted, to loosen the columnist's writer's block and/or justify the intake of alcohol. I'll drink to thatto the fact that we are blessed with a reasonably regular solar system providing a timeline of annual increments against which we can enumerate and toast past events. Hic semper hic. When the drinking occurs in sporadic and excessive bursts, it becomes known, disapprovingly, as "bingeing." I'm tempted to claim that this colorful Lincolnshire dialect word binge, meaning soak, was first used in the boozing-bout sense exactly 200 years ago. And that, shurely, calls for a schelebration.
Visual&#x2013;haptic perception of compliant objects in artificially generated environments
Authors: Martin Kuschel, Franziska Freyberger, Berthold F&#x00e4;rber, Martin Buss
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Perception of compliant objects through a human system interface with visual&#x2013;haptic feedback was investigated. Participants had to explore virtual cubes at different compliances by squeezing them with their fingers and observing them visually and haptically. The cubes were rendered by admittance control. Perception of compliance was analyzed using an adaptive staircase method. Results showed that visual&#x2013;haptic perception of compliant environments is less accurate than perception of position and force stimuli. Furthermore, due to the important role of the visual feedback cross-modal comparisons are more difficult than bimodal comparisons.
Load Management and High Availability in the Borealis Distributed Stream Processing Engine
Authors: Nesime Tatbul, Yanif Ahmad, Uğur Çetintemel, Jeong-Hyon Hwang, Ying Xing, Stan Zdonik
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

Borealis is a distributed stream processing engine that has been developed at Brandeis University, Brown University, and MIT. It extends the first generation of data stream processing systems with advanced capabilities such as distributed operation, scalability with time-varying load, high availability against failures, and dynamic data and query modifications. In this paper, we focus on aspects that are related to load management and high availability in Borealis. We describe our algorithms for balanced and resilient load distribution, scalable distributed load shedding, and cooperative and self-configuring high availability. We also present experimental results from our prototype implementation showing the effectiveness of these algorithms.
Spatial updating of objects after rotational and translational body movements in virtual environments
Authors: İpek Sancaktar, Halime Demirkan
Venue: Computers in Human Behavior (2008)

Spatial reasoning in architectural design can be better understood by considering the factors that affect the spatial updating process of the individual in an environment. This study focuses on the issue of spatial updating of viewed and imagined objects after rotational and translational body movements in a virtual environment (VE). Rotational and translational movements based on an egocentric frame of reference where there is no control of the user are compared in a desktop VE. Moreover, preference in architectural drawing medium and gender are analyzed as the factors that affect the spatial updating of objects in each body movement type. The results indicated that translational movement was more efficient than the rotational movement in judgment of relative directions in viewed objects. Furthermore, the viewed objects were more correctly spatially updated than the imagined ones both in translational and rotational body movements. In comparison of hand, computer and both as the drawing media, findings indicated that preference in computer medium in architectural design drawings was an effective one in spatial updating process in a VE. Contrary to the previous studies, it is found that there was no significant difference between gender and movement types.
Infrared Small Moving Target Detection Using Facet Model and Particle Filter
Authors: Yong Yu, Lei Guo
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A new algorithm based on facet model and Particle filter is presented to detect infrared small moving target in image sequence. Firstly, it utilizes a Bayesian based particle filter method to track the target in image sequence and get the target search window. Then the detection is performed on the image intensity surface of search window fitted by cubic facet model. The new partial derivative operators are exploited according to cubic facet model to detect maximum intensity points from search window, which correspond to the small target position in image. Experimental results with the infrared image sequence show that the proposed algorithm can successfully detect the small target, the real-time and anti-noise performance of the algorithm are better than traditional algorithms.
Practical Anonymous Divisible E-Cash from Bounded Accumulators
Authors: Man Ho Au, Willy Susilo, Yi Mu
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unlinkability and anonymity, after the seminal work proposed by Canard and Gouget. The main trick of our scheme is the use of a bounded accumulator in combination with the classical binary tree approach.The aims of this paper are twofold. Firstly, we analyze Canard and Gouget's seminal work on the efficient off-line divisible e-cash. We point out some subtleties on the parameters generation of their scheme. Moreover, spending a coin of small value requires computation of several hundreds of multi-based exponentiations, which is very costly. In short, although this seminal work provides a new approach of achieving a truly anonymous divisible e-cash, unfortunately it is rather impractical. Secondly, we present our scheme that uses a novel approach of incorporating a bounded accumulator. In terms of time and space complexities, our scheme is 50 to 100 times more efficient than Canard and Gouget's work in the spend protocol at the cost of an 10 to 500 (the large range is due to whether pre-processing is taken into account and the probabilistic nature of our withdrawal protocol) times less efficient withdrawal protocol. We believe this trade-off between the withdrawal protocol and the spend protocol is reasonable as the former protocol is to be executed much less frequent than the latter. Nonetheless, while their scheme provides an affirmative answer to whether divisible e-cash can be truly anonymous, our result puts it a step further and we show that truly anonymous divisible e-cash can be practical.
Methods of assessing and ranking probable sources of error
Authors: Nataniel Greene
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

A classical method for ranking n potential events as sources of error is Bayes' theorem. However, a ranking based on Bayes' theorem lacks a fundamental symmetry: the ranking in terms of blame for error will not be the reverse of the ranking in terms of credit for lack of error. While this is not a flaw in Bayes' theorem, it does lead one to inquire whether there are related methods which have such symmetry. Related methods explored here include the logical version of Bayes' theorem based on probabilities of conditionals, probabilities of biconditionals, and ratios or differences of credit to blame. We find that of all the methods described, probabilities of biconditionals and a corresponding notion of logical correlation coefficients provide a particularly attractive method for ranking blame for error and credit for lack of error which has the symmetry property we are interested in.
Kernel methods for learning languages
Authors: Leonid (Aryeh) Kontorovich, Corinna Cortes, Mehryar Mohri
Venue: Theoretical Computer Science (2008)

This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane in that space. Such mappings can often be represented flexibly with string kernels, with the additional benefit of computational efficiency. The paradigm inspected can thus be viewed as that of using kernel methods for learning languages. We initiate the study of the linear separability of automata and languages by examining the rich class of piecewise-testable languages. We introduce a subsequence feature mapping to a Hilbert space and prove that piecewise-testable languages are linearly separable in that space. The proof makes use of word combinatorial results relating to subsequences. We also show that the positive definite symmetric kernel associated to this embedding is a rational kernel and show that it can be computed in quadratic time using general-purpose weighted automata algorithms. Our examination of the linear separability of piecewise-testable languages leads us to study the general problem of separability with other finite regular covers. We show that all languages linearly separable under a regular finite cover embedding, a generalization of the subsequence embedding we use, are regular. We give a general analysis of the use of support vector machines in combination with kernels to determine a separating hyperplane for languages and study the corresponding learning guarantees. Our analysis includes several additional linear separability results in abstract settings and partial characterizations for the linear separability of the family of all regular languages.
On Concentration of Discrete Distributions with Applications to Supervised Learning of Classifiers
Authors: Magnus Ekdahl, Timo Koski
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Computational procedures using independence assumptions in various forms are popular in machine learning, although checks on empirical data have given inconclusive results about their impact. Some theoretical understanding of when they work is available, but a definite answer seems to be lacking. This paper derives distributions that maximizes the statewise difference to the respective product of marginals. These distributions are, in a sense the worst distribution for predicting an outcome of the data generating mechanism by independence. We also restrict the scope of new theoretical results by showing explicitly that, depending on context, independent ('Naïve') classifiers can be as bad as tossing coins. Regardless of this, independence may beat the generating model in learning supervised classification and we explicitly provide one such scenario.
GP Generation of Pedestrian Behavioral Rules in an Evacuation Model Based on SCA
Authors: Stefania Bandini, Sara Manzoni, Giancarlo Mauri, Stefano Redaelli, Leonardo Vanneschi
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

This paper presents a research in the context of pedestrian dynamics according to Situated Cellular Agent (SCA), a Multi-Agent Systems approach whose roots are on Cellular Automata (CA). The aim of this work is to apply Genetic Programming (GP) approach, a well known Machine Learning method belonging to the family of Evolutionary Algorithms, to generate suitable behavioral rules for pedestrians in an evacuation scenario. The main contribution of this work is in the design of a testset of GP generated behaviors to represent basic behavioral models of evacuees populating a only locally known environment, a typical scenario for CA-based models.
A Simple Model of Separation Logic for Higher-Order Store
Authors: Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic.