ppxscal/embedding_network huggingface dataset:
SableVM: a research framework for the efficient execution of java bytecode
Authors: Etienne M. Gagnon, Laurie J. Hendren
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

SableVM is an open-source virtual machine for Java intended as a research framework for efficient execution of Java bytecode. The framework is essentially composed of an extensible bytecode interpreter using state-of-the-art and innovative techniques. Written in the C programming language, and assuming minimal system dependencies, the interpreter emphasizes high-level techniques to support efficient execution. In particular, we introduce a biderectional layout for object instances that groups reference fields sequentially to allow efficient garbage collection. We also introduce a sparse interface virtual table layout that reduces the cost of interface method calls to that of normal virtual calls. Finally, we present a technique to improve thin locks[13] by eliminating busy-wait in presence of contention.
Using java reflection to automate extension language parsing
Authors: Dale Parson
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

An extension language is an interpreted programming language designed to be embedded in a domain-specific framework. The addition of domain-specific primitive operations to an embedded extension language transforms that vanilla extension language into a domain-specific language. The LUxWORKS processor simulator and debugger from Lucent uses Tcl as its extension language. After an overview of extension language embedding and LUxWORKS experience, this paper looks at using Java reflection and related mechanisms to solve three limitations in extension language - domain framework interaction. The three limitations are gradual accumulation of ad hoc interface code connecting an extension language to a domain framework, over-coupling of a domain framework to a specific extension language, and inefficient command interpretation. Java reflection consists of a set of programming interfaces through which a software module in a Java system can discover the structure of classes, methods and their associations in the system. Java reflection and a naming convention for primitive domain operations eliminate ad hoc interface code by supporting recursive inspection of a domain command interface and translation of extension language objects into domain objects. Java reflection, name-based dynamic class loading, and a language-neutral extension language abstraction eliminate language over-coupling by transforming the specific extension language into a run-time parameter. Java reflection and command objects eliminate inefficiency by bypassing the extension language interpreter for stereotyped commands. Overall, Java reflection helps to eliminate these limitations by supporting reorganization and elimination of handwritten code, and by streamlining interpretation.
Theory of optimal orthonormal filter banks
Authors: P. P. Vaidyanathan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In a previous paper we derived a set of necessary and sufficient conditions for maximizing the coding gain in an orthonormal filter bank. These are referred to as the decorrelation and majorization conditions. While each of these two conditions is individually only necessary and not sufficient, they together form a set of necessary and sufficient conditions. In this paper we show how to relate these to the idea of energy compaction. This relation is then used to identify the optimum analysis filters one at a time.
Cooperation Activity for Leaders of the Next Generation Internet
Authors: Tohru Kondo, Atsushi Hikita
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Even though the Internet is necessary infrastructure for a global information society, there is still a disparity between enough developed regions and the others. developing regions are excluded from the benefits of the global information society. Digital divide has been a big issue. Development of next generation peoples has an essential role to bridge the digital divide in the future Internet. It is important for the young researcher, engineer and non-engineering user to consider the development of global network and inter-regional cooperation toward the issues. This activity will be engine for the advancement of the global Internet. Therefore, in this paper, we introduce several case examples for fostering of next generation peoples who will take a major role in development of the Internet. They can learn and share various experiences about the Internet development by creating networks for inter-regional and intergenerational exchange through the activity. We consider effectiveness and management issue of the activity from these case examples.
Building a self-contained auto-configuring Linux system on an iso9660 filesystem
Authors: Klaus Knopper
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

Bootable CD-Roms with a small Linux rescue system in business card size [1, 2] or regular size live demonstration CDs [3] are becoming popular recently. Also, some of the commercial Linux distributors as well as non-profit Open Source groups are developing self-running demos that are preconfigured for certain hardware, or contain a configuration frontend. Knoppix (Knopper's *nix) is an attempt to not only create a fully featured rescue/demo system on a single CD, but also to unburden the user from the task of hardware identification and configuration of drivers, devices and X11 for his or her specific hardware. The resulting product is supposed to be a platform CD with a stable GNU/Linux base system, that can be used to customize static installations for a specific purpose.
Acoustic-phonetic characteristics of hyperarticulated speech for different speaking styles
Authors: S. Koster
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This study aims to describe differences between hyperarticulated and normal speech. Hyperarticulated, or clear speech is produced when addressing to hearing-impaired listeners. It also appears quite often in spoken language systems as the user's reaction on previous recognition errors. We present a comparison of the acoustic-phonetic characteristics of normal and hyperarticulated speech for three different types of utterances, single words, single sentences and spontaneous speech. Duration, fundamental frequency, formants and formant bandwidths change significantly. Significant differences between the three speaking styles are observable, especially for spontaneous speech vs. words and sentences. We report on an auditory test investigating the perceived changes in the two speech types.
A Generic API for Retrieving Human-Oriented Information from Social Network Services
Authors: Teruaki Yokoyama, Shigeru Kashihara, Takeshi Okuda, Youki Kadobayashi, Suguru Yamaguchi
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

A unique type of Web service, called a Social Network Service (SNS), first appeared in 2003. Some researches suggested a method to extract meaningful information from SNSs. Such meaningful information helps computers to understand human interests, concerns, and perceptions. We consider that socially aware computing has the potential to lead a new type of metric such human oriented information to access control, searches, and suggestions for contents. Accordingly, in this paper we propose the access Application Programmable Interface (API) to find human-oriented information from outside a given SNS. We use the result of experiments on the API to demonstrate a network comprising relationships among communities. The results reveal that our proposed method can support developers in creating socially aware applications with SNSs.
Towards a logical account of declassification
Authors: Anindya Banerjee, David A. Naumann, Stan Rosenberg
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

Declassification is a vital ingredient for practical use of secure systems. Several recent efforts to formulate an end-to-end policy for declassification seem inconclusive and have focused on apparently different aspects. (e.g., what values are involved, where in the code declassification occurs, when declassification happens and who (which principal) releases information.) In this informal paper, we argue that key security goals addressed by the proposed notions can be expressed using assertions and auxiliary state (such as event history), building on a recently developed logic for noninterference that provides for local reasoning about the heap
Promoting emergence in information discovery by representing collections with composition
Authors: Andruid Kerne, Eunyee Koh, Steven Smith, Hyun Choi, Ross Graeber, Andrew Webb
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

While sometimes the task that motivates searching, browsing, and collecting information resources is finding a particular fact, humans often engage in intellectual and creative tasks, such as comparison, understanding, and discovery. Information discovery tasks involve not only finding relevant information, but also seeing relationships among collected information resources, and developing new ideas. Prior studies of search have focused on time and accuracy, metrics of limited value for measuring creativity. We develop new experimental methods to evaluate the efficacy of representational systems for information discovery by measuring the emergence of new ideas. We also measure the variety of web sites that participants visit when engaging in a creative task, and gather experience report data. We compare the efficacy of the typical format for collections, the textual list with a new format, the composition of image and text surrogates. We conduct an experiment that establishes that representing collections with composition of image and text surrogates promotes emergence in information discovery.
On Three Types of Covering-Based Rough Sets
Authors: William Zhu, Fei-Yue Wang
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Rough set theory is a useful tool for data mining. It is based on equivalence relations and has been extended to covering-based generalized rough set. This paper studies three kinds of covering generalized rough sets for dealing with the vagueness and granularity in information systems. First, we examine the properties of approximation operations generated by a covering in comparison with those of the Pawlak's rough sets. Then, we propose concepts and conditions for two coverings to generate an identical lower approximation operation and an identical upper approximation operation. After the discussion on the interdependency of covering lower and upper approximation operations, we address the axiomization issue of covering lower and upper approximation operations. In addition, we study the relationships between the covering lower approximation and the interior operator and also the relationships between the covering upper approximation and the closure operator. Finally, this paper explores the relationships among these three types of covering rough sets.
Creating a Web-Based Collaboration Tool to Support Research Work
Authors: Minna Isomursu, Pekka Isomursu
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

This paper explores if a collaboration-based shared knowledge base would be a useful tool for supporting the collaboration of researchers working with the same research theme. The research question is explored with a constructive approach, i.e. a prototype of Web-based collaboration system for sharing knowledge of a certain research areas is created. This paper discusses both the design issues related to implementing such a system, and experiences on the adoption and usage of the system. The results indicate that a Web-based knowledge sharing tool can be valuable for increasing collaboration of an established research group. The useful features included a blog for small and informal announcements, introducing new researchers with the subject and recommending resources to other researchers. However, several problems were also recognized. These include encouraging and supporting interdisciplinary co-operation, limitations on accessing online databases of scientific publishers, and integration with personal research citation databases.
A Study of Intention on Continuous Use of Online Financial Services: The Mediated Effects of Website Trust
Authors: Shih-Ming Pi, Shih-Hua Li, Tsang-Yao Chen, Hui-Min Chen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The lack of trust is one of the most frequently cited reasons for customer's not returning to Internet service providers. As a new form of commercial activity, online financial services and stock trading involve more uncertainty and risk than traditional financial services. Trust is therefore a relatively influential factor of customer behavior in online financial services. The purpose of this study is to propose a framework of Intention to continuously adopt online financial services. Furthermore, the mediated effects of website trust are trusted. The main method of data collection for this study is a survey instrument designed by the author. The data were gathered from the survey and tested by using partial least squares. The research findings showed that: 1. website trust influences on the intention to continuous use of online financial services; 2. cognitive trust of online customers influences on affective trust; 3. factors of transaction security, website and company awareness, prior Internet experience, and navigation functionality directly influence on cognitive trust of online customers, and; 4. transaction security is the only factor that influences on affective trust of online customers.
Design and evaluation of a high-level Grid communication infrastructure: Research Articles
Authors: Fabrizio Messina, Giuseppe Pappalardo, Emiliano Tramontana
Venue: Concurrency and Computation: Practice Experience (2007)

Developing a distributed application in a Grid context is likely to require considerable effort, whether to evolve existing code or to upgrade programmers' skills, for the sake of adapting to Grid-specific communication technologies. As a solution, targeted to the Java technology, this paper proposes HiC, a high-level communication infrastructure, which hides the low-level data transfer mechanisms and hides concerns about them from applications. HiC adheres to a service-aware, connection-oriented, object stream paradigm. It can easily cater for a new data-transfer technology, without any impact on the application built on top of it and, furthermore, without undergoing much adaptation itself. Architecturally, HiC consists of two layers. The upper layer allows software to obtain remote services through simple but powerful abstractions, while the lower layer provides the upper layer with uniform access to a specific underlying data-transfer technology, such as GridRPC and XIO. The performance of HiC has been evaluated, and found to be acceptable even for relatively small amounts of data and the faster XIO data transfer. A standard interfacing architecture is also proposed, whereby all dependencies on HiC of user software can be confined within just an &lsquo;intermediary&rsquo; pair per service. Furthermore, HiC has proven useful as a communication infrastructure for our ReD reflective framework for transparent distributed object allocation. The combination of HiC and ReD affords an advantageous synergy, which frees developers from the concerns of retargeting ReD to specific transfer technologies, and implementing the intermediaries between an application and HiC. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Solving multiclass support vector machines with LaRank
Authors: Antoine Bordes, Léon Bottou, Patrick Gallinari, Jason Weston
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optimization algorithms that rely on the full gradient are not effective because, unlike the solution, the gradient is not sparse and is very large. The LaRank algorithm sidesteps this difficulty by relying on a randomized exploration inspired by the perceptron algorithm. We show that this approach is competitive with gradient based optimizers on simple multiclass problems. Furthermore, a single LaRank pass over the training examples delivers test error rates that are nearly as good as those of the final solution.
Incremental Specification Validation and Runtime Adaptivity of Distributed Component Information systems
Authors: Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Despite all colossal efforts and investments by Information Systems (IS) practitioners and researchers, today's IS still remain far from timely exhibiting the required levels of adaptivity dictated by highly volatile, competitive and inter-organizational ('sociotechno- business') distributed environment. Difficulties in approaching dynamic adaptivity in IS remain essentially on how promoting manageability (e.g. simplicity/ understandability/incrementality) without compromising correctness and distribution.
OpenJIT 2: the design and implementation of application framework for JIT compilers
Authors: Fuyuhiko Maruyama, Satoshi Matsuoka, Hirotaka Ogawa, Naoya Maruyama, Kouya Shimura
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

We are currently working on a new architecture for Java JIT compilers to allow coexistence of multiple, customized JIT compilers in a single Java VM simultaneously without prohibitive space or programming costs, called OpenJIT2. The project builds on the success of OpenJIT1, the first open-ended JIT compiler for Java written in Java. Not only that our new architecture subsumes the so-called 'bi-level' or 'tri-level' JIT compilers of today, but allows application, environment, or user-specific JIT compilers to coexist and invoked at appropriate moments as decided by the runtime. The compiler fragment modules can either be built-in or even dynamically downloaded from the network on demand to tailor the compiler for specific needs. We believe such customization allows the best performance to be squeezed out of applications in a way not possible with generic optimization strategies. OpenJIT2 will also be publically distributed for free and supported just as was with OpenJIT1 to serve as application framework for general compiler research by others, having a very clean and customizable object-oriented framework structure as opposed to OpenJIT1. We also hope that it will serve as commercial quality replacement JIT compiler for various platforms.
Minitrack: Advanced Data Management Tools for Biomedical Informatics
Authors: Hesham H. Ali, Simon Sherman
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Further progress of Biology and Medical Sciences requires successful integration with Computational and Information Sciences. The papers of this Mini-track provide a diverse spectrum of innovative ways of how such integration can be achieved. The focus of this mini-track is on the development and implementation of advanced data management tools in Biomedical Informatics. The first three papers in the mini-track focus on the development and implementation of computational and IT tools for Biomedical Informatics, while the forth paper presents advanced statistical methods for data analysis.
Electing an Eventual Leader in an Asynchronous Shared Memory System
Authors: Antonio Fernandez, Ernesto Jimenez, Michel Raynal
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in message-passing systems, very few solutions have been proposed for shared memory systems. As an eventual leader cannot be elected in a pure asynchronous system prone to process crashes, the paper first proposes to enrich the asynchronous system model with an additional assumption. That assumption, denoted AWB, requires that after some time (1) there is a process whose write accesses to some shared variables are timely, and (2) the timers of the other processes are asymptotically well-behaved. The asymptotically well-behaved timer notion is a new notion that generalizes and weakens the traditional notion of timers whose durations are required to monotonically increase when the values they are set to increase. Then, the paper presents two AWB-based algorithms that elect an eventual leader. Both algorithms are independent of the value of t (the maximal number of processes that may crash). The first algorithm enjoys the following noteworthy properties: after some time only the elected leader has to write the shared memory, and all but one shared variables have a bounded domain, be the execution finite or infinite. This algorithm is consequently optimal with respect to the number of processes that have to write the shared memory. The second algorithm enjoys the following property: all the shared variables have a bounded domain. This is obtained at the following additional price: all the processes are required to forever write the shared memory. A theorem is proved which states that this price has to be paid by any algorithm that elects an eventual leader in a bounded shared memory model. This second algorithm is consequently optimal with respect to the number of processes that have to write in such a constrained memory model. In a very interesting way, these algorithms show an inherent tradeoff relating the number of processes that have to write the shared memory and the bounded/unbounded attribute of that memory.
An architecture for wavelet-packet based speech enhancement for hearing aids
Authors: M. A. Trenas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Wavelet packets have been applied in order to compensate the speech signal to improve the intelligibility for a common hearing impairment known as recruitment of loudness, a sensorineural hearing loss of cochlear origin. We present an architecture that allows selection of the best decomposition tree for each patient, in order to apply this wavelet-packet based parametric compression algorithm.