ppxscal/embedding_network huggingface dataset:
American Digital History
Authors: Orville Vernon Burton
Venue: Social Science Computer Review (2005)

U.S. History and Computing have had a long history of partnership in teaching and research. There currently is a deep divide among historians on the direction this partnership will take in the future. Will the partnership revolutionize theways in which history is taught and researched or will it simply offer additional tools to improve traditional practices? In either case, future success depends on history scholars taking an active role in the partnership. With active and involved historians, great ideas such as digital libraries and online educational materials can be developed into workable and effective teaching and research tools. However, historians must take the initiative. A pioneering group of historians have laid the groundwork, nowthe profession must embrace thiswork and move forward or it will be done for us by those who are not historians.
3D Model Based Head Pose Tracking by Using Weighted Depth and Brightness Constraints
Authors: Guoyuan Liang, Hongbin Zha, Hong Liu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper proposes a robust method of tracking human head poses from a sequence of monocular images. First we estimate the head pose parameters in the first frame by an affine correspondence based method developed in our lab. Then both the linear brightness and depth constraint equations derived from the small interframe rigid motion assumption are used to implement the fast tracking of the head poses. We also take advantage of geometry information of the features on the face surface to weight the brightness and depth constraint equations to get more accurate results. Finally, in order to diminish the effects of gradual illumination changes and occlusions, we estimate the reliability of the features frame by frame and dynamically update the reliable feature set. Experiments show the proposed method can robustly track the head poses especially for the types of motions which make obvious depth variation.
Performance Impact of External Vibration on Consumer-Grade and Enterprise-Class Disk Drives
Authors: Thomas M. Ruwart, Yingping Lu
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

This paper describes a simple but effective method to generate and observe the effects of external vibration on the read and write bandwidth of a disk drive. Furthermore, it quantifies these effects as a first-order numerical approximation. This paper is not intended to rate disk drives relative to manufacturer, model, size, form factor, ...etc. Rather it is simply intended to answer the simple questions of "Is there a performance impact of external vibration on a disk drive?" and "How significant is that impact?" After testing several 3.5- and 2.5-inch consumer-grade and enterprise-class disk drives the conclusion is that the consumer-grade disk drives are more sensitive to external vibration. In the presence of an external vibration caused by adjacent disk drive seek operations the bandwidth performance of a consumer-grade disk drive "feeling" these vibrations will decrease about 10%-15% when reading data and about 25%-40% when writing data. The final qualitative result of this study is that disk drive packaging is likely the most significant factor in reducing the vibrational effects.
Space&ndash;time mapping and tiling: a helpful combination: Research Articles
Authors: Martin Griebl, Peter Faber, Christian Lengauer
Venue: Concurrency and Computation: Practice Experience (2004)

Tiling is a well-known technique for sequential compiler optimization, as well as for automatic program parallelization. However, in the context of parallelization, tiling should not be considered as a stand-alone technique, but should be applied after a dedicated parallelization phase, in our case after space&ndash;time mapping. We show how tiling can benefit from space&ndash;time mapping, and we derive an algorithm for computing tiles which can minimize the number of communication startups, taking the number of physically available processors into account. We also present how the use of a simple cost model reduces real execution time. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Management Perspective on Risk of Security Threats to Information Systems
Authors: Fariborz Farahmand, Shamkant B. Navathe, Gunter P. Sharp, Philip H. Enslow
Venue: Information Technology and Management (2005)

Electronic commerce and the Internet have enabled businesses to reduce costs, attain greater market reach, and develop closer partner and customer relationships. However, using the Internet has led to new risks and concerns. This paper provides a management perspective on the issues confronting CIO's and IT managers: it outlines the current state of the art for security in e-commerce, the important issues confronting managers, security enforcement measure/techniques, and potential threats and attacks. It develops a scheme for probabilistic evaluation of the impact of security threats with some illustrative examples. This methodology may be used to assess the probability of success of attacks on information assets in organizations, and to evaluate the expected damages of these attacks. The paper also outlines some possible remedies, suggested controls and countermeasures. Finally, it proposes the development of cost models which quantify damages of these attacks and the effort of confronting these attacks. The construction of one such cost model for security risk assessment is also outlined. It helps decision makers to select the appropriate choice of countermeasure(s) to minimize damages/losses due to security incidents. Finally, some recommendations for future work are provided to improve the management of security in organizations on the whole.
Relational languages for metadata integration
Authors: Catharine M. Wyss, Edward L. Robertson
Venue: ACM Transactions on Database Systems (TODS) (2005)

In this article, we develop a relational algebra for metadata integration, Federated Interoperable Relational Algebra (FIRA). FIRA has many desirable properties such as compositionality, closure, a deterministic semantics, a modest complexity, support for nested queries, a subalgebra equivalent to canonical Relational Algebra (RA), and robustness under certain classes of schema evolution. Beyond this, FIRA queries are capable of producing fully dynamic output schemas, where the number of relations and/or the number of columns in relations of the output varies dynamically with the input instance. Among existing query languages for relational metadata integration, only FIRA provides generalized dynamic output schemas, where the values in any (fixed) number of input columns can determine output schemas.Further contributions of this article include development of an extended relational model for metadata integration, the Federated Relational Data Model, which is strictly downward compatible with the relational model. Additionally, we define the notion of Transformational Completeness for relational query languages and postulate FIRA as a canonical transformationally complete language. We also give a declarative, SQL-like query language that is equivalent to FIRA, called Federated Interoperable Structured Query Language (FISQL).While our main contributions are conceptual, the federated model, FISQL/FIRA, and the notion of transformational completeness nevertheless have important applications to data integration and OLAP. In addition to summarizing these applications, we illustrate the use of FIRA to optimize FISQL queries using rule-based transformations that directly parallel their canonical relational counterparts. We conclude the article with an extended discussion of related work as well as an indication of current and future work on FISQL/FIRA.
Prioritized Multiplicative Schwarz Procedures for Solving Linear Systems
Authors: David Wingate, Nathaniel Powell, Quinn Snell, Kevin Seppi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We describe a new algorithm designed to quickly and robustly solve general linear problems of the form Ax = b. We describe both serial and parallel versions of the algorithm, which can be considered a prioritized version of an Alternating Multiplicative Schwarz procedure. We also adopt a general view of alternating Multiplicative Schwarz procedures which motivates their use on arbitrary problems (even which may not have arisen from problems that are naturally decomposable) by demonstrating that, even in a serial context, algorithms should use many, many partitions to accelerate convergence; having such an over-partitioned system also allows easy parallelization of the algorithm, and scales extremely well. We present extensive empirical evidence which demonstrates that our algorithm, with a companion subsolver, can often improve performance by several orders of magnitude over the subsolver by itself and over other algorithms.
Simultaneous Divisor Class Addition-Subtraction Algorithm and Its Applications to Hyperelliptic Curve Cryptosystem
Authors: Xinxin Fan, Yumin Wang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In [1], the authors proposed efficient algorithms for the ¿-adic sliding window method and applied the algorithms to Koblitz elliptic curve cryptosystem. In this paper, we extend their ideas to hyperelliptic curve cryptosystem. We give respectively explicit formulae of simultaneous divisor class addition-subtraction algorithm for genus 2 hyperelliptic curves in affine and projective coordinate system and analyze the case of genus 3 hyperelliptic curves. Using this idea and Montgomery trick, we can reduce the number of inversions, multiplications and squares. In addition, we apply the idea to speed up the precomputation part of two scalar multiplication algorithms for hyperelliptic curve cryptosystem and discuss the efficiency of improved algorithms in detail.
Gram matrix of a Laguerre model: application to model reduction of irrational transfer function
Authors: N. Tanguy, P. Bréhonnet, P. Vilbé, L. C. Calvez
Venue: Signal Processing (2005)

An efficient method for evaluating inner products of repeated integrals and derivatives of a function described by a Laguerre model is presented. An immediate and promising application is model reduction of infinite-dimensional transfer functions.
Privacy-Enhanced Internet Storage
Authors: Willy Sisilo, Fangguo Zhang, Yi Mu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

One of the main important uses of Internet is its ability to connect people through the use of email or internet storage. However; it is often desirable to limit the use of email or Internet storage due to organization's restriction, avoiding spams etc. In this paper, we propose cryptographic schemes that can be used to stop unwanted messages to be stored in the Internet server. We refer this technique as privacy enhancement for Internet storage, since the Internet server will not learn any information directed to its users, other than performing its task to deliver or stop the messages. Firstly, we describe a notion of non-interactive publicly verifiable 1-out-of-n encryption by proposing a model together with its security requirements. Then, we extend this notion to a publicly verifiable ring-to- 1-out-of-n encryption, that provides sender anonymity. We note that the previously known interactive versions of the publicly verifiable 1-out-of-n encryption cannot be used to construct publicly varifiable ring-to- I-out-of-n encryption.
Applied Computational Fluid Dynamics in Support of Aircraft/Store Compatibility and Weapons Integration - 2004 Edition
Authors: Jacob A. Freeman, Bruce A. Jolly
Venue: Proceedings of the 2004 Users Group Conference (2004)

The Air Force SEEK EAGLE Office (AFSEO), Eglin Air Force Base (AFB), FL, is the United States Air Force (USAF) authority for weapons certification efforts. AFSEO performs test and evaluation for aircraft/store compatibility certification and uses Computational Fluid Dynamics (CFD) to support this process. Determining the flow about an aircraft/store combination can be extremely difficult. Complicated geometry such as pylons, launchers, and internal weapons bays can create severe acoustic and aerothermodynamic environments, which arechallenging to numerically simulate. The additional challenge of rapidly and accurately simulating the trajectory of a store separation in a high-volume simulation environment is beyond the capabilities of most CFD programs. The USAF requirement for numerous, simultaneous and quick-reaction solutions for a wide variety of stores and aircraft can only be accomplished through application of parallel high-performance computing resources that meet the significant computational and memory demands of the various cases. This project increases combat capability for the current USAF fleet of tactical and strategic aircraft with associated weapon systems. Before operational use, all aircraft/ store configurations must be certified for safe loading, carriage and jettison/release. AFSEOprovides flight certification recommendations, which are based on combinations of engineering analysis, ground, and flight testing. Engineering analyses come from disciplines in carriage loads, store separations, flutter, ballistics, stability and control, and electromagnetic compatibility and interference. The AFSEO CFD team provides time-critical support for engineering analyses-in the form of computed aircraft/store carriage aerodynamic loads, predicted store separation characteristics, and visualized flow field physics-used to optimizethe application of ground and flight testing, reducing risk and lowering cost of fielding new weapons. This paper discusses four of the most recently applied AFSEO CFD tasks and code development, related to specific aircraft/store certifications.
Knowledge-based expert systems: a brief bibliography
Authors: Michael D. Rychener
Venue: Issue 78 (October 1981) (1981)

This research was sponsored by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 3597, monitored by the Air Force Avionics Laboratory Under Contract F33615-78-C-1551. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government.
Scale and performance in the Denali isolation kernel
Authors: Andrew Whitaker, Marianne Shaw, Steven D. Gribble
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

This paper describes the Denali isolation kernel, an operating system architecture that safely multiplexes a large number of untrusted Internet services on shared hardware. Denali's goal is to allow new Internet services to be "pushed" into third party infrastructure, relieving Internet service authors from the burden of acquiring and maintaining physical infrastructure. Our isolation kernel exposes a virtual machine abstraction, but unlike conventional virtual machine monitors, Denali does not attempt to emulate the underlying physical architecture precisely, and instead modifies the virtual architecture to gain scale, performance, and simplicity of implementation. In this paper, we first discuss design principles of isolation kernels, and then we describe the design and implementation of Denali. Following this, we present a detailed evaluation of Denali, demonstrating that the overhead of virtualization is small, that our architectural choices are warranted, and that we can successfully scale to more than 10,000 virtual machines on commodity hardware.
On the Bursty Evolution of Blogspace
Authors: Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
Venue: World Wide Web (2005)

We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing link creation as a point phenomenon in time. Second, we develop definitions and algorithms for time-dense community tracking, to crystallize the notion of community evolution. We develop these tools in the context of Blogspace, the space of weblogs (or blogs). Our study involves approximately 750 K links among 25 K blogs. We create a time graph on these blogs by an automatic analysis of their internal time stamps. We then study the evolution of connected component structure and microscopic community structure in this time graph. We show that Blogspace underwent a transition behavior around the end of 2001, and has been rapidly expanding, not just in metrics of scale but also in metrics of community structure and connectedness. By randomizing link destinations in Blogspace, but retaining sources and timestamps, we introduce a concept of randomized Blogspace. Herein, we observe similar evolution of a giant component, but no corresponding increase in community structure. Having demonstrated the formation of micro-communities over time, we then turn to the ongoing activity within active communities. We extend recent work of Kleinberg (2002) to discover dense periods of "bursty" intra-community link creation. Furthermore, we find that the blogs that give rise to these communities are significantly more enduring than an average blog.
The Effect of Fingertip Microstructures on Tactile Edge Perception
Authors: Gregory J. Gerling, Geb W. Thomas
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

People rely on tactile edge localization to ascertain the location and structure of edges. When pressure is applied to the skin, skin mechanoreceptors convert compressive stress/strain into neural signals. Many attempts to model this conversion neglect intermediate ridges, on the inside of the stiff epidermis. The receptors associated with detecting compressive and shear stresses reside at the tips of these ridges, suggesting a functional importance in the detection of stress. This work considers how underlying microstructure affects the mechanical propagation of stress to receptors. Two unique indenters are applied to two finite element models of idealized, fingerpad skin ¿ one with ridge microstructure. Findings indicate that microstructure produces high, local stress concentrations at ridge tips near receptors. Because stress is focused at ridges beneath edges, there is a higher contrast of stress between ridge tips near the indenterýs edge and those adjacent. This lensing effect mechanism appears to help distinguish edges.
Note on the pre-conditioning of matrices
Authors: C. P. Huang
Venue: ACM SIGNUM Newsletter (1976)

In [1] Osborne presents and proves the convergence of an iterative process for pre-conditioning an irreducible matrix A or order n. The process involves the construction of the non-singular diagonal matrix D(k), and the formation of the similarity transformations
A computing architecture for physics
Authors: Edward Fredkin
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

In this paper, we show how a computing architecture, called "Salt", might be able to implement the workings of a particular Discrete Space-Time-State model of Physics (DSTSP). While what is presented is certainly not a correct model of fundamental processes in physics, it illustrates how such models could give us insights into new methods of modeling some attributes of microscopic physical systems. The main novelty of the approach is an unusual definition of a discrete space-time where time itself is made more complex in order to allow for simple representations of quantities that have properties in common with QM spin, charge and fractional charge, QCD color and reversibility with CPT symmetry.
Resource-aware conference key establishment for heterogeneous networks
Authors: Wade Trappe, Yuke Wang, K. J. Ray Liu
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

The Diffie-Hellman problem is often the basis for establishing conference keys. In heterogeneous networks, many conferences have participants of varying resources, yet most conference keying schemes do not address this concern and place the same burden upon less powerful clients as more powerful ones. The establishment of conference keys should minimize the burden placed on resource-limited users while ensuring that the entire group can establish the key. In this paper, we present a hierarchical conference keying scheme that forms subgroup keys for successively larger subgroups en route to establishing the group key. A tree, called the conference tree, governs the order in which subgroup keys are formed. Key establishment schemes that consider users with varying costs or budgets are built by appropriately designing the conference tree. We then examine the scenario where users have both varying costs and budget constraints. A greedy algorithm is presented that achieves near-optimal performance, and requires significantly less computational effort than finding the optimal solution. We provide a comparison of the total cost of tree-based conference keying schemes against several existing schemes, and introduce a new performance criterion, the probability of establishing the session key (PESKY), to study the likelihood that a conference key can be established in the presence of budget constraints. Simulations show that the likelihood of forming a group key using a tree-based conference keying scheme is higher than the GDH schemes of Steiner et al.. Finally, we study the effect that greedy users have upon the Huffman-based conference keying scheme, and present a method to mitigate the detrimental effects of the greedy users upon the total cost.
Correspondence assertions for process synchronization in concurrent communications
Authors: Eduardo Bonelli, Adriana Compagnoni, Elsa Gunter
Venue: Journal of Functional Programming (2005)

High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types (Honda et al., 1998). However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions (Clarke & Marrero, 1998; Gordon & Jeffrey, 2003b). The resulting type discipline augments the types of long-term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. This new type system can be used to check: source of information, whether data is propagated as specified across multiple parties, if there are unspecified communications between parties, and if the data being exchanged has been modified by the code in an unspecified way. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address shortcomings present in the pure theory of session types.
m-learning: a new stage of e-learning
Authors: Tsvetozar Georgiev, Evgenia Georgieva, Angel Smrikarov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Distance learning, electronic learning and mobile learning offer methods, which decrease the limitations of traditional education. This paper discusses the existing devices and technologies appropriate to realise mobile learning. Mobile learning as new stage of distance and e-learning is also examined.