ppxscal/embedding_network huggingface dataset:
Intelligent day trading agent: a natural language processing approach to financial information analysis
Authors: Wei Jiang
Venue:  (2005)

Traders with immediate access to real-time news services (such as Dow Jones News Wire, Bloomberg News Service) constantly monitor and track financial news that is expected to have a significant impact on stock prices. A precondition for successful news-based trading is fast and accurate analysis of the news content. However, manually identifying relevant newswire articles and performing human analysis on the selected news items within a reasonable timeframe represents a daunting task due to the fact that traders face large amounts of financial news releases and reports throughout the trading hours. This research seeks to develop a prototype trading system that automates the procedure of news tracking and analysis. The design of our system adopts an integrated approach using a variety of natural language processing (NLP) techniques to extract the relevant information from merger and acquisition news announcements and generate trading signals based on a set of predefined rules. First, a learning algorithm is employed to identify and classify merger-and-acquisition-related newswire articles from Dow Jones News Wire database. Then the selected news texts are run through an Information Extraction system that performs in sequence the individual tasks of preprocessing, name entity recognition and semantic analysis. Finally, by simulating human-like analysis of all the collected informational elements, the system produces a trading signal by following the simple rule of &ldquo;buying the target firm and shorting the acquiring firm&rdquo;. The core of our system is built with hand-crafted rules that are obtained through an iterative training process. Following the Knowledge Engineering approach enables us to achieve a high level of system performance, which is critical to the practical application of automated trading systems. Our system reports a precision rate of 98.3% and high scores in other performance measurements as well. Further empirical evidence is obtained through an event study to lend support to the hypothesis that our prototype system is capable of capturing a small portion of the post-announcement stock price movement despite the fact that the bulk of the price reaction is completed within the first few trades.
Metastability Requirements for a 2 GHz CMOS ΔΣ Modulator
Authors: Peter Stubberud, Elias H. Dagher
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper presents the design of a second order, single bit, CMOS, continuous-time analog to digital delta sigma modulator (ΔΣΜ) which samples at 2 GHz, consumes 18 mW at 1.8 V and has a 79 dB signal-to-noise ratio (SNR) over a 1.23 MHz bandwidth. Because the comparator s metastability limited the ΔΣΜ s performance, this paper focuses on the design, analysis and testing of the ΔΣΜ s comparator. The ΔΣΜ s measured performance is also presented.
Mini KDE for a lightweight desktop
Authors: Marco Fioretti
Venue: Linux Journal (2005)

See how the RULE Project helps schools and charities run current KDE apps on older hardware using a customized, bare-bones KDE implementation.
Integrating sequence and structure data for identifying functional sites on protein structures
Authors: Russ B. Altman, Douglas L. Brutlag
Venue:  (2005)

Genomes of hundreds of organisms have now been sequenced, and the sequencing of many more continues to accelerate. These sequencing projects have revealed many new proteins whose functions are unknown. Many of these proteins have no sequence similarity to known functionally characterized proteins. To aid in functionally annotating these proteins, structural genomics initiatives are developing high-throughput methods for determining the 3D structure of these uncharacterized proteins. An important challenge in analyzing this data is to utilize the increasingly available 3D structure data to help identify protein function. To address this challenge, I have developed a method for integrating 3D structure information with 1D sequence information to identify functional sites on protein structures. I have developed a method for automatically characterizing the 3D physicochemical descriptions of the environment around a 1D sequence pattern. I have shown that the resulting 3D structural model has better sensitivity and specificity than using the 1D sequence pattern alone. I have evaluated my method on calcium binding sites and serine protease active sites. I have also automatically created a 3D structural library of protein functional sites for automatic function prediction of protein structures. I have implemented a web-accessible system for automatic function annotation of 3D protein structures and made the structural library of functional sites available at http://feature.stanford.edu/webfeature/.
Numerical analysis of electric field formulations of the eddy current model
Authors: Alfredo Berm&#x00fa;dez, Rodolfo Rodr&#x00ed;guez, Pilar Salgado
Venue: Numerische Mathematik (2005)

This paper deals with finite element methods for the numerical solution of the eddy current problem in a bounded conducting domain crossed by an electric current, subjected to boundary conditions involving only data easily available in applications. Two different cases are considered depending on the boundary data: input current intensities or differences of potential. Weak formulations in terms of the electric field are given in both cases. In the first one, the input current intensities are imposed by means of integrals on curves lying on the boundary of the domain and joining current entrances and exit. In the second one, the electric potentials are imposed by means of Lagrange multipliers, which are proved to represent the input current intensities. Optimal error estimates are proved in both cases and implementation issues are discussed. Finally, numerical tests confirming the theoretical results are reported.
The Common Instrument Middleware Architecture: Overview of Goals and Implementation
Authors: Tharaka Devadithya, Kenneth Chiu, Kianosh Huffman, Donald F. McMullen
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Instruments and sensors and their accompanying actuators are essential to the conduct of scientific research. In many cases they provide observations in electronic format and can be connected to computer networks with varying degrees of remote interactivity. These devices vary in their architectures and type of data they capture and may generate data at various rates. In this paper we present an overview of the design goals and initial implementation of the Common Instrument Middleware Architecture (CIMA), a framework for making instruments and sensors network accessible in a standards-based, uniform way, and for interacting remotely with instruments and the data they produce. Some of the issues CIMA addresses include: flexibility in network transport, efficient and high throughput data transport, the availability (or lack of) computational, storage and networking resources at the instrument or sensor platform, evolution of instrument design, and reuse of data acquisition and processing codes.
A Web Census is Possible
Authors: Darcy Benoit, Devin Slauenwhite, Andre Trudel
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

How big is the World Wide Web? Over the last few years, researchers have used various approaches to estimate the size of the Web. The large size of the Web and the technology available at the time dictated that only estimation experiments were feasible. We hypothesize that an exact measurement (i.e., a census) of the Web is now possible. We present evidence for our hypothesis, and describe an upcoming census we will perform to test the hypothesis.
Technological Enablers of the IEEE Wireless Metropolitan Area Network (IEEE 802.16)
Authors: Anthony C. K. Soong
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

There has been keen interest in the literature recently on the IEEE wireless metropolitan area network (MAN) developed within IEEE 802.16. Through the use of flexible physical layer features and medium access control (MAC) layer mechanisms, this system can be used to deliver broadband voice and data into areas that may have a wide range of population densities, cell radii, propagation environments, and Quality of Service (QoS) requirements. The physical layer provides flexibilities of time or frequency domain duplexing, multiple bandwidths, adjustable subchannelization, scalable OFDM formats, adaptive coded modulation, and advanced antenna system. The IEEE 802.16 MAC layer offers a connection-oriented service to upper layers of the protocol stack. The QoS of each connection takes one of four levels: constant bit rate grant, real time polling, non-real-time polling, and best effort. The MAC layer also offers packing, fragmentation and ARQ. The MAC privacy sublayer performs authentication, key exchange and encryption of MAC packet data units. The MAC Convergence sublayers at the top of the MAC enable Ethernet, ATM, TDM voice and IP (Internet Protocol) services to be offered. This presentation will endeavor to provide a high level overview of the system. It will discuss, from an information theoretic point of view, the key enablers of the system.
Software-Defined Radio Basics
Authors: Benny Bing
Venue: IEEE Distributed Systems Online (2005)

A review of Software Defined Radio: Architectures, Systems and Functions by Markus Dillinger, Kambiz Madani, and Nancy Alonistioti.
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
Authors: Wei Sun, Kang G. Shin
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

This paper evaluates, via both analysis and simulation, the end-to-end (e2e) delay performance of aggregate scheduling with guaranteed-rate (GR) algorithms. Deterministic e2e delay bounds for a single aggregation are derived under the assumption that all incoming flows at an aggregator conform to the token bucket model. An aggregator can use any of three types of GR scheduling algorithms: stand-alone GR, two-level hierarchical GR, and rate-controlled two-level hierarchical GR. E2e delay bounds are also derived for the case of multiple aggregations within an aggregation region when aggregators use the rate-controlled two-level hierarchical GR. By using the GR scheduling algorithms for traffic aggregates, we show not only the existence of delay bounds for each flow, but also the fact that, under certain conditions (e.g., when the aggregate traverses a long path after the aggregation point), the bounds are smaller than that of per-flow scheduling. We then compare the analytic delay bounds numerically and conduct in-depth simulation to: 1) confirm the analytic results and 2) compare the e2e delays of aggregate and per-flow scheduling. The simulation results have shown that aggregate scheduling is very robust and can exploit statistical multiplexing gains. It performs better than per-flow scheduling in most of the simulation scenarios we considered.Overall, aggregate scheduling is shown theoretically to provide bounded e2e delays and practically to provide excellent e2e delay performance. Moreover, it incurs lower scheduling and state-maintenance overheads at routers than per-flow scheduling. All of these salient features make aggregate scheduling very attractive for use in Internet core networks.
Dynamic Split: Flexible Border Between Instruction and Data Cache
Authors: Pedro Trancoso
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Current microprocessors are optimized for the average use. Nevertheless, it is known that different applications impose different demands on the system. This work focuses on the reconfiguration of the first-level caches. In order to achieve good performance, the first-level cache is split physically into two parts, one for instruction and one for data. This separation has the benefit of avoiding interference between instructions and data. Nevertheless, this separation is strict and determined at design-time. In this work we show a cache design that is able to change the split dynamically at runtime. The proposed design was tested using simulation of a variety of benchmark applications from the MiBench suite on two baseline architectures: embedded XScale and high-end PowerPC. The results show that, while the average miss rate reduction may seem small, certain applications show a benefit larger than 90%. For miss rate reduction, the dynamic split cache seems to be more relevant for the cache with the smaller associativity (PowerPC). Lastly, the dynamic split cache was also used to reduce the energy consumption without loss of performance. This feature resulted in a signifi- cant energy reduction and the results showed that it has a bigger impact for the caches with larger associativity (42% for a large data set size). energy reduction for the XScale and 28% for the PowerPC
Cfs: time-frequency representations of acoustic signals based on redundant wavelet methodologies
Authors: Steven T. Parker
Venue:  (2005)

In this dissertation, we develop high quality representations for acoustic signals based on wavelet methodologies. These representations, the Cardinal Framelet Synthesis (CFS) representations , use wavelets in a redundant context to improve the ability to localize signal information and to suppress time-dependent artifacts that are typical of non-redundant, e.g., orthogonal, representations. The basic building blocks of the CFS representations are redundant wavelet constructions, known in the literature as framelets, which we have generalized to the framelet-packet setting. We have developed for this purpose new framelet systems based on interpolating refinable functions. A significant component is the development of CFS based algorithms for acoustic signal denoising. We present the results of extensive numerical experimentation in CFS denoising with respect to a large collection of acoustic signals from a variety of sources. The CFS denoising algorithms tend to exhibit fewer artifacts and distortions in the recovered signals compared to orthogonal-based denoising methods.
Efficient Optimistic Concurrency Control for Mobile Real-Time Transactions in a Wireless Data Broadcast Environment
Authors: Guohui Li, Bing Yang, Jixiong Chen
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In this paper, we introduce a variant of the optimistic concurrency control protocols.The broadcast cycle is divided into multiple sub-cycles. Between two sub-cycles, there is a reserved space to accomodate identities for all the data objects which are updated by transactions in the server after the first sub-cycle begins. A read-only mobile transaction can validate its consistency autonomously by comparing its read-set with the committed write-set of the update transactions. If a read-only transaction cannot pass the partial validation, it is not simply aborted and restarted. Instead, an enhanced forward validation policy is applied, which help read-only transactions have more chances to commit. Extensive experiments are conducted to evaluate the performance of the proposed algorithms.
Towards the Formal Verification of a C0 Compiler: Code Generation and Implementation Correctnes
Authors: Dirk Leinenbach, Wolfgang Paul, Elena Petrova
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

In the spirit of the famous CLI stack project [2] the Verisoft project [31] aims at the pervasive verification of entire computer systems including hardware, system software, compiler, and communicating applications, with a special focus on industrial applications. The main programming language used in the Verisoft project is C0 (a subset of C which is similar to MISRA C [20]). This paper reports on (i) an operational small steps semantics for C0 which is formalized in Isabelle/HOL [25], (ii) the formal specification of a compiler from C0 to the DLX machine language [14, 23] in Isabelle/HOL, (iii) a paper and pencil correctness proof for this compiler and the status of the formal verification effort for this proof, and (iv) the implementation of the compiler in C0 and a formal proof in Isabelle/HOL that the implementation produces the same code as the specification.
Dense 3D Reconstruction with an Uncalibrated Stereo System using Coded Structured Light
Authors: Ryo Furukawa, Hiroshi Kawasaki
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper, we describe a new uncalibrated active vision system. Normally, active vision systems need either precise calibrations or relatively fixed cameras and light sources, which require 3D measurement systems to make use of complicated measurement processes or measurement equipment. Recently, several uncalibrated active vision systems have been studied. Since calibrations of these systems are done either while or after shape data is obtained, the user can simply place the equipment arbitrarily and scan the objects. The proposed system is an uncalibrated active vision system which consists of a camera and a video projector. Geometrically, this is a camera-to-camera system with one camera replaced by a projector. Uncalibrated vision systems based on perspective projection devices are prone to unmeasured scaling parameters. To solve this problem, a laser pointer is attached to the projector. In the present work, coded structured light is used to obtain dense correspondence points, resulting in more detailed shape representations. Experiments using the implemented system show that it is able to reconstruct dense and precise 3D shapes.
Color Active Appearance Model Analysis Using a 3D Morphable Model
Authors: Nathan Faggian, Sami Romdhani, Jamie Sherrah, Andrew Paplinski
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Active Appearance Models (or AAMs) are fast linear models for appearance variation in images. A key disadvantage of AAMs is the requirement for hand-labeled correspondence points. We use Morphable Model (or MM) data to avoid hand-labeling error and test the convergence performance of a well known fitting method, Inverse Compositional Image Alignment (or ICIA). The 3D MM data is in dense correspondence forms the ground truth for AAM fitting. Using ICIA, we investigate the robustness of AAM convergence with respect to rigid-body transformations and lighting of these 3D models. It is found that a contour fitting problem arises in AAMs and dominates the standard RMS error computation; an alternative measure is presented. A different composition method using QR factorization is presented, and also preliminary results of fitting AAMs built using MM training data to real images is presented.
Extended Skip Graphs for Efficient Key Search in P2P Environment
Authors: Satoshi Fujita, Akira Ohtsubo, Masaya Mito
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper, we propose three techniques to improve the cost/performance of the skip graph that was recently proposed by Aspnes and Shah in 2003. More concretely, the skip graph, in which each node is connected with exactly log2 N neighbors among N nodes contained in the system, is extended in the following two directions: 1) proposal of a subgraph of the skip graph which realizes a graceful degradation of the routing performance when the number of neighbors reduces from log2N, and 2) proposal of a supergraph of the skip graph which realizes a significant performance improvement when the number of neighbors increases from log2N. The performance of those extended graphs will be evaluated analytically with concrete numerical results.
Review of "Introduction to Demographic Analysis: Principles and Methods by Guillaume J. Wunsch and Marc G. Termote", Plenum Press, 1978
Venue: ACM SIGSIM Simulation Digest (1979)

This volume offers the reader a unified introduction to the principles and methods essential to conduct a formal analysis of population trends and composition. With the increased used of social policy models and simulation as well as the health care delivery systems models and simulation, there is a need for the modeler to have a better understanding of this aspect of the model. 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
Pedestrian Navigation System for Mobile Phones Using Panoramic Landscape Images
Authors: Yoji Miyazaki, Toshiyuki Kamiya
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

We have developed a pedestrian navigation system that delivers photorealistic panoramic landscape images using 3D models of a city and related information to mobile phones. In this paper, we define the requirements for smooth mobile phone navigation: low processing load and quick data delivery. To satisfy these requirements, we propose a server-side panoramic image generation mechanism and a divided guidance information transfer technique. This paper presents our proposed mechanism, technique, and developed prototype that achieved smooth pedestrian navigation in experimental results.
Automatic Parameter Configuration Mechanism for Data Transfer Protocol GridFTP
Authors: Takeshi Ito, Hiroyuki Ohsaki, Makoto Imase
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

In this paper, we propose an automatic parameter configuration mechanism for GridFTP, which optimizes the number of parallel TCP connections by utilizing analytic results in [1]. The proposed mechanism first measures the network status (e.g., the goodput and the round-trip time of GridFTP data channels) at the GridFTP client. Based on these measurement results, it adjusts the number of parallel TCP connections for maximizing the GridFTP goodput. Three operational modes, MI (Multiplicative Increase), MI+ (Multiplicative Increase Plus), and AIMD (Additive Increase and Multiplicative Decrease) are proposed in this paper, each of which takes a different strategy for adjusting the number of parallel TCP connections. We evaluate performance of the proposed automatic parameter configuration mechanism through simulation experiments. We demonstrate that the proposed automatic parameter configuration mechanism significantly improves the performance of GridFTP.
An Analytical Model and A Fast Mechanism for Fault Restoration in IP over WDM Networks Based on n: m Scheme
Authors: Tan Xiansi, Ou Liang, Cheng Wenqing
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The fault restoration technique based on n:m scheme can improve system availability with small cost increases for WDM networks, where it is possible that n faults occur synchronously in a protection domain or a protection entity, but it has rarely been implemented or standardized. In this paper, an analytical model for mean restoration time of restoration mechanism based on n:m scheme is developed. As a general model, it aims at the WDM networks with the restoration paths created in advance of fault occurrence without wavelength reserved. In particular, the proposed protocol for processing faults has been improved to make the restoration based on n:m scheme as fast as that based on 1:1 or n:1 scheme.