ppxscal/embedding_network huggingface dataset:
Creating MAGIC: system for generating learning object metadata for instructional content
Authors: Ying Li, Chitra Dorai, Robert Farrell
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper presents our latest work on building a system called MAGIC (Metadata Automated Generation for Instructional Content) that will automatically identify segments and generate critical metadata conforming with the SCORM (Sharable Content Object Reference Model) standard for instructional content. Various content analytics engines are utilized to automatically generate key metadata, which include audiovisual analysis modules that recognize semantic sound categories and identify narrators and informative text segments; text analysis modules that extract title, keywords and summary from text documents; and a text categorizer that classifies a document according to a pre-generated taxonomy. With MAGIC, instructional content developers can generate and edit SCORM metadata to richly describe their content asset for use in distributed learning applications. Experimental results obtained from collections of real data from targeted user communities will be presented.
Transformation from Test Language ATLAS to C++
Authors: Guo De-Gui, Liu Lei, Li Wen-Jin
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

ATLAS is designed to describe tests in terms that are independent of any specific test system, and has been constrained to ensure that it can be implemented on ATE (Automatic Test Equipment). An ATLAS transformation system was designed and implemented. In this paper, we first discuss a transformation technique from standard test language ATLAS to C++ and then present the key methods of this technique. In this system, class is introduced to construct an abstract syntax tree as the intermediate representation of ATLAS. Basing on the test characteristics of ATLAS, we give a search algorithm for device allocation, make use of DFA to describe the state transition rules of the device, and implement the parallelism and timing of the ATLAS bus statement employing the thread and event mechanism provided in Windows API. Furthermore, three languages, Device Description Language, Switch Description Language and ITA Description Language, are well designed for the device, switch and ITA respectively in the ATE system.
The impact of spatial layout of jobs on I/O hotspots in mesh networks
Authors: Jens Mache, Virginia Lo, Sharad Garg
Venue: Journal of Parallel and Distributed Computing (2005)

Network contention hotspots can limit network throughput for parallel disk I/O, even when the interconnection network appears to be sufficiently provisioned. We studied I/O hotspots in mesh networks as a function of the spatial layout of an application's compute nodes relative to the I/O nodes. Our analytical modeling and dynamic simulations show that when I/O nodes are configured on one side of a two-dimensional mesh, realizable I/O throughput is at best bounded by four times the network bandwidth per link. Maximal performance depends on the spatial layout of jobs, and cannot be further improved by adding I/O nodes. Applying these results, we devised a new parallel layout allocation strategy (PLAS) which minimizes I/O hotspots, and approaches the theoretical best case for parallel I/O throughput. Our I/O performance analysis and processor allocation strategy are applicable to a wide range of contemporary and emerging high-performance computing systems.
Timed Probabilistic Constraints over the Distributed Management Taskforce Common Information Model
Authors: Iman Poernomo, Jane Jayaputera, Heinz Schmidt
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

It is now recognized that nonfunctional properties are important to practical software development and maintenance. Many of these properties involve involving time and probabilities - for example, reliability and availability. In this paper, we present a framework for runtime verification of timed and probabilistic nonfunctional properties of component-based architectures, built using the Meta-Object Facility and the Distributed Management Task Force¿s Common Information Model (CIM) standard. We describe a Microsoft .NET-based implementation of our framework. We use a language for contracts based on Probabilistic Computational Tree Logic (PCTL). We provide a formal semantics for this language based on possible application execution traces. The semantics is parametrized with respect to the choice of application states and state changes to be monitored. This enables us to use the language to define a wide range of nonfunctional properties. We explain how our framework associates constraints with systems that expose management information through the CIM, via a novel extension of the CIM metamodel.
Evolution of Bootstrap Techniques in Low-Voltage CMOS Digital VLSI Circuits for SoC Applications, invited
Authors: James B. Kuo
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper reports the evolution of the bootstrap techniques in low-voltage CMOS digital VLSI circuits in the past. Combining bootstrap and DTMOS Techniques, low-voltage CMOS digital VLSI circuits using a very low power supply voltage such as 0.5V have been developed for low-power SOC applications.
XQuery 1.0 is nearing completion
Authors: Andrew Eisenberg, Jim Melton
Venue: ACM SIGMOD Record (2005)

XQuery is a query language designed for querying real and virtual XML documents and collections of these documents. Its development began in the second half of 1999. We provided an early look at XQuery in Dec. 2002 [1]. XQuery 1.0 is now approaching its publication as a W3C Recommendation, and we would like to update you on its progress. We can speak to this area with even more authority than we did last time, as we both became co-chairs of the W3C XML Query Working Group [2] in summer 2004.
Estimating the Costs of a Reengineering Project
Authors: Harry M. Sneed
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Accurate estimation of project costs is an essential prerequisite to making a reengineering project. Existing systems are usually reengineered because it is cheaper to reengineer them than to redevelop or to replace them. However, to make this decision, management must know what the reengineering will cost. This contribution describes an eight step tool supported process for calculating the time and the costs required to reengineer an existing system. The process is derived from the author's 20 year experience in estimating reengineering projects and has been validated by several real life field experiments in which it has been refined and calibrated.
Adding Physical Optimization to Cost Models in Information Mediators
Authors: Justo Hidalgo, Alberto Pan, Jose Losada, Manuel Alvarez
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Optimization of execution plans in information mediators is a critical task, specially when sources are remote and semistructured, as in the case of transactional web sites. Lack of Quality of Service in HTTP connections does not ease the measurement of the mediated query performance. Different solutions based on relational and hierarchical optimization techniques have been proposed, mainly in terms of time and space. This article integrates some of these techniques by using a specialized cost repository but, more importantly, defines a physical layer optimization cost model by means of a configurable pool of browsers , which improves dramatically query execution time in web mediators.
A Design and Test Technique for Embedded Software
Authors: Byeongdo Kang, Young-Jik Kwon, Roger Y. Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In recent years, embedded systems have become so complex and the development time to market is required to be shorter than before. As embedded systems include more functions for new services, embedded software gradually grow in size, and development costs and time are increasing. In order to overcome this serious matter, we need a customized design and test technique for embedded software. In this paper, we present a software architecture style for embedded software. It facilitates the composition of reusable functions and helps developers to reduce development time. Because the costs associated with revealing errors of embedded software in applications are rising, we propose a test method and tools for target environments.
Impact of high-k gate stack material with metal gates on LF noise in n-and p-MOSFETs
Authors: P. Srinivasan, E. Simoen, L. Pantisano, C. Claeys, D. Misra
Venue: Microelectronic Engineering (2005)

The aim of this paper is to study the 1/f noise performance of n-and p-channel MOSFETs with different Hf-based gate stacks, deposited by MOCVD and using metal (PVD TaN) as a gate material. The drain current dependence is different for n-and p-channel devices over the noise spectra, showing different noise origin mechanisms - mobility fluctuations for pMOS and number fluctuations for nMOS. Asymmetric trap density distributions with energy between n-and pMOS have been observed which is a possible reason for the observed lower noise magnitude in pMOS devices. A fair comparison using Hooge's parameter and trap densities as figures of merit shows weak correlation on the Hf-composition, allowing a large window for gate stack processing of devices.
TD(&lambda;) networks: temporal-difference networks with eligibility traces
Authors: Brian Tanner, Richard S. Sutton
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Temporal-difference (TD) networks have been introduced as a formalism for expressing and learning grounded world knowledge in a predictive form (Sutton & Tanner, 2005). Like conventional TD(0) methods, the learning algorithm for TD networks uses 1-step backups to train prediction units about future events. In conventional TD learning, the TD(&lambda;) algorithm is often used to do more general multi-step backups of future predictions. In our work, we introduce a generalization of the 1-step TD network specification that is based on the TD(&lambda;) learning algorithm, creating TD(&lambda;) networks. We present experimental results that show TD(&lambda;) networks can learn solutions in more complex environments than TD networks. We also show that in problems that can be solved by TD networks, TD(&lambda;) networks generally learn solutions much faster than their 1-step counterparts. Finally, we present an analysis of our algorithm that shows that the computational cost of TD(&lambda;) networks is only slightly more than that of TD networks.
Estimation of High-Density Regions Using One-Class Neighbor Machines
Authors: Alberto Munoz, Javier M. Moguerza
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we investigate the problem of estimating high-density regions from univariate or multivariate data samples. We estimate minimum volume sets, whose probability is specified in advance, known in the literature as density contour clusters. This problem is strongly related to One-Class Support Vector Machines (OCSVM). We propose a new method to solve this problem, the One-Class Neighbor Machine (OCNM) and we show its properties. In particular, the OCNM solution asymptotically converges to the exact minimum volume set prespecified. Finally, numerical results illustrating the advantage of the new method are shown.
Large-signal model for microwave FETs under CW laser stimulation: Research Articles
Authors: J. M. Zamanillo, C. Navarro, C. Pérez-Vega, A. Mediavilla
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2006)

This article presents the results of research on the large-signal dynamic behavior (pulsed I&#x002F;V curves) of PHEMT devices, in the overall I&#x002F;V plane, when the incident optical-input-power level is changed. A complete bias and the optical-power dependency of the parameters used in the large-signal model for a PHEMT device are determined from the experimental scattering parameters and the DC and pulsed measurements. All the derivatives of the model shown here are continuous in order to provide a realistic description of the circuit distortion and intermodulation phenomena. The model is also valid for GaAs MESFETs. The results obtained for the model exhibit very good agreement with the measurements. &copy; 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.
Calling for programmed technology transfer and adoption strategies for sustainable LDC growth
Authors: Philip F. Musa, Victor W. Mbarika, Peter Meso
Venue: Communications of the ACM (2005)

Developing nations need a technology jumpstart---via basic technologies geared toward education, farming, and health care.
Microentrepreneurs and Mobiles: An Exploration of the Uses of Mobile Phones by Small Business Owners in Rwanda
Authors: Jonathan Donner
Venue: Information Technologies and International Development (2004)

Despite a worldwide boom in mobile phone ownership, studies of the social and economic implications of mobile telephone use in the developing world are rare. Approaching mobile phone usage from the individual level, the study uses Q methodology to ask 31 owners of urban micro and small enterprises (MSEs) in Kigali, Rwanda to articulate what using the mobile means to them. The exercise identified four distinct perspectives on mobile use among the participants. One perspective sees it as a device for the pursuit of instrumental business goals. A second perspective uses mobiles to satisfy emotional or intrinsic needs. Two other perspectives mix instrumental and intrinsic elements, seeing mobiles as productivity enhancers, or as simply indispensable. Taken together, these distinct perspectives illustrate a range of intended uses and gratifications among MSE owners, and suggest numerous paths for future research. Q methodology is discussed in some detail so that researchers can consider its utility as a way to understand users of information and communication technologies.
Modular correspondence between dependent type theories and categories including pretopoi and topoi
Authors: Maria Emilia Maietti
Venue: Mathematical Structures in Computer Science (2005)

We present a modular correspondence between various categorical structures and their internal languages in terms of extensional dependent type theories &agrave; la Martin-L&ouml;f. Starting from lex categories, through regular ones, we provide internal languages of pretopoi and topoi and some variations of them, such as, for example, Heyting pretopoi.With respect to the internal languages already known for some of these categories, such as topoi, the novelty of these calculi is that formulas corresponding to subobjects can be regained as particular types that are equipped with proof-terms according to the isomorphism &lsquo;propositions as mono types&rsquo;, which was invisible in previously described internal languages.
Classification of Biomedical Data through Model-Based Spatial Averaging
Authors: Keith Marsolo, Srinivasan Parthasarathy, Michael Twa, Mark A. Bullimore
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Ensemble learning is frequently used to reduce classificationerror. The more popular techniques draw multiple samples from the training data and employ a voting procedure to aggregate the decisions of the classifiers constructed from those samples. In practice, such ensemble methods have been shown to work well and improve accuracy. Here we present a meta-learning strategy that combines the decisions of classifiers constructed from spatial models taken at multiple resolutions. By varying the resolution from coarse to fine-grained, we are able to partition the data on global features that describe a majority of the objects, as well as small, local features that are present in just a few problem cases. We test our technique on a biomedical dataset containing surface elevation values for diseased and non-diseased corneas. We transform these elevations into a series of coefficients using two different spatial transformations. Using these coefficients, we determine how well they distinguish between the two classes. We find our algorithm can increase the classification accuracy of a single decision tree up to 10% and can also be used in conjunction with traditional meta-learning techniques such as bagging to further improve performance. In an attempt to improve the execution time of the transformation algorithms, we have developed a distributed, grid-based implementation as well.
Building Robust Wireless LAN for Industrial Control with DSSS-CDMA Cellphone Network Paradigm
Authors: Qixin Wang, Xue Liu, Weiqun Chen, Wenbo He, Marco Caccamo
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Deploying Wireless LAN for Industrial Control (IC-WLAN) has many benefits, such as mobility, low deployment cost and ease of reconfiguration. However, the top concern is robustness of wireless communications. Wireless control loops must be maintained under persistent adverse channel conditions, such as noise, large-scale path loss and fading. Many electro-magnetic interference sources in industrial environments, e.g. electric motor and welding, make wireless communication more challenging. The conventional IEEE 802.11 WLANs, which are designed for providing high bandwidth instead of high robustness, are therefore inappropriate for IC-WLAN. On the other hand, if the low data rate feature of industrial control is fully exploited by the state-of-the-art Direct Sequence Spread Spectrum (DSSS) technology, much higher robustness can be achieved. We hereby propose using DSSS-CDMA to build IC-WLAN, and exploiting the low data rate feature of industrial control loops for enhanced robustness. We carried out fine-grained physical layer simulations and Monte Carlo comparisons. The results show that DSSS-CDMA IC-WLAN provides much higher robustness than IEEE 802.11 WLAN, so that reliable wireless industrial control loops are made feasible. The DSSS-CDMA IC-WLAN scheme also opens up a new problem space for interdisciplinary study, involving real-time scheduling and resource management, communication, networking and control. In this paper, we study the resource management problems on maximizing robustness and minimizing control utility loss. Analytical resource optimization solutions are given.
Techniques for Efficient Routing and Load Balancing in Content-Addressable Networks
Authors: Ozgur D. Sahin, Divyakant Agrawal, Amr El Abbadi
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

As a Distributed Hash Table (DHT), a Content Addressable Network (CAN) provides efficient routing and object location in a decentralized manner while offering fault tolerance and dynamic peer operations. However, as opposed to other DHTs that use a flat ID space, CAN uses a multi-dimensional logical space. DHTs usually require 0(logN) routing information per peer and provide routing in O(logN) hops, where N is the number of peers in the system. In CAN, on the other hand, each peer keeps only constant amount of routing information and the routing takes 0(dN^{{1 \mathord{\left/ {\vphantom {1 d}} \right. \kern-\nulldelimiterspace} d}} ) hops, where d is the dimensionality of the logical space. Hence the routing performance of CAN is worse than other DHTs especially when d is small. In this paper, we describe and evaluate several schemes for efficient routing in CAN by keeping additional routing information at the peers. Futhermore, due to the underlying multidimensional ID space, CAN is used by applications that require content-based mapping of data objects onto the ID space. Since uniform hashing is not used, such mappings introduce skewed object distributions among the peers. Thus we also describe load balancing schemes for CAN and investigate their efficiency.
High-Performance, Power-Aware Distributed Computing for Scientific Applications
Authors: Kirk W. Cameron, Rong Ge, Xizhou Feng
Venue: Computer (2005)

The PowerPack framework enables distributed systems to profile, analyze, and conserve energy in scientific applications using dynamic voltage scaling. For one common benchmark, the framework achieves more than 30 percent energy savings with minimal performance impact.
Versioning Systems for Evolution Research
Authors: Romain Robbes, Michele Lanza
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

Research in evolution goes on par with the use of versioning systems by developers of the case studies. There is a great diversity of versioning systems with advantages and disadvantages both from the technical as well as from the conceptual point of view. In this paper we analyze the currently used versioning systems from the point of view of a software evolution researcher. Thus we do not focus on whether a certain versioning system is technically better than another one, but rather on what kind of information it offers for software evolution research. We present a non-exhaustive list of dimensions that are important for performing research in software evolution, do a survey on the current main-stream versioning systems and discuss what is actually needed for future versioning systems to support both software evolution and the related research field.
The level set method of Jo&#x00f3; and its use in minimax theory
Authors: J. B. G. Frenk, G. Kassay
Venue: Mathematical Programming: Series A and B (2006)

In this paper we discuss the level set method of Jo&#x00f3; and how to use it to give an elementary proof of the well-known minimax theorem of Sion. Although this proof technique was initiated by Jo&#x00f3; and based on the intersection of upper level sets and a clever use of the topological notion of connectedness, it is not very well known and accessible for researchers in optimization. At the same time we simplify the original proof of Jo&#x00f3; and give a more elementary proof of the celebrated minimax theorem of Sion.
MOMI: a calculus for mobile mixins
Authors: Lorenzo Bettini, Betti Venneri, Viviana Bono
Venue: Acta Informatica (2005)

MOMI (Mobile Mixins) is a coordination language for mobile processes that communicate and exchange object-oriented code in a distributed context. MOMI's key idea is structuring mobile object-oriented code by using mixin-based inheritance. Mobile code is compiled and typed locally, and can interact successfully with code present on foreign sites only if its type is subtyping-compliant with the type of what is expected by the receiving site. The key feature of the paper is the definition of this subtyping relation on classes and mixins that enables a significantly flexible, yet still simple, communication pattern. We show that communication by subtyping is type-safe in that exchanged code is merged into local code without requiring further type analysis and recompilation.