ppxscal/embedding_network huggingface dataset:
Integrated QOS Management for Disk I/O
Authors: Ravi Wijayaratne, A. L. Narasimha Reddy
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we address the problem of providing different levels of performance guarantees or quality-of-service (QOS) for disk I/O. We classify disk requests into three categories based on the provided level of service. We propose an integrated scheme that provides different levels of performance guarantees in a single system. The proposed method uses admission control and bandwidth allocation to isolate the different categories of requests and appropriate disk scheduling to achieve the desired performance goals. It is shown that the proposed method achieves the performance goals of individual requests while allowing seek optimizations at the disk. In particular, it is shown that the proposed scheme for integrated QOS management at disk provides significantly better performance than SCAN.
Approximate similarity search: A multi-faceted problem
Authors: Marco Patella, Paolo Ciaccia
Venue: Journal of Discrete Algorithms (2009)

We review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along several independent coordinates. Then, we discuss the impact that scheduling of index nodes can have on performance and show that, unlike exact similarity queries, no provable optimal scheduling strategy exists for approximate queries. On the positive side, we show that optimal-on-the-average schedules are well-defined and that their performance is indeed the best among practical schedules.
The defensive use of IT in a newly vulnerable market: The New York Stock Exchange, 1980-2007
Authors: Henry C. Lucas,  Jr., Wonseok Oh, Bruce W. Weber
Venue: The Journal of Strategic Information Systems (2009)

New technologies enable entrants to create business models that threaten incumbents in a range of industries. This paper extends the framework of newly vulnerable markets to explore the dynamics of competition between entrants and an incumbent through a study of the New York Stock Exchange. For over 200 years, the NYSE has operated a physical market for trading securities. Beginning in the 1960s, it employed information technology to process increasing trading volumes and to disseminate data on stock prices and volumes. The Exchange invested heavily in IT for its trading floor, and defended it against electronic markets enabled by new technologies. In 2005 various pressures forced the NYSE into a merger with Archipelago, a leading electronic exchange. The NYSE's latest market system, Hybrid, launched in 2006, is the first at the NYSE that enables investors to bypass the trading floor completely. Despite the new technology, its share of trading volumes fell. This paper documents four eras of IT management at the exchange, presenting a detailed 27-year history. The evidence shows that while IT investments helped the Exchange defend floor trading and its market share for a number of years, it finally had to adopt the technology of all-electronic exchanges.
Proceedings of the 13th international conference on Intelligent user interfaces
Venue: International Conference on Intelligent User Interfaces (2009)

The 2009 International Conference on Intelligent User Interfaces (IUI 2009) is the 14th such meeting since the first international conference in 1997. This series of annual conferences is the principal international forum for the presentation and discussion of outstanding research and applications involving intelligent user interfaces, a field at the intersection of Human-Computer Interaction and Artificial Intelligence. IUI focuses on interfaces that incorporate machine learning and artificial intelligence techniques. The interests and creative outlets of the community span a wide range of topics reflected in this year's meeting. These include automatic summarization techniques, recommendations and intelligent Web systems, intelligent information and knowledge management, example and demonstration based interfaces, novel approaches to input and output, mobile interaction, intelligent assistants and visualization and designer tools. This year's submitted papers came from all continents. In addition, both the program committee and submitted papers included members from industry and academia. This year's IUI conference counted with 134 long papers and 59 short papers submitted. Of the papers submitted, this program includes 35 long papers (26%) and 21 short papers, including long papers accepted as short papers. The papers program is complemented by the always popular Posters and Demonstrations session where authors of accepted short papers can showcase their work and where many published authors present live demos of their systems. This year's eight demonstrations will be presented during the Poster session. Intelligent User Interfaces are increasingly becoming a reality in our daily interactions with computers. Therefore, this year's invited speakers represent an interesting mix between industry and academia: Professor Trevor Darrell, from ICSI and University of Berkeley, Dr Jun Rekimoto from Sony Labs and University of Tokyo, and Dr. Alon Halvey, from Google. Seven workshops, each a full day, will also take place at IUI this year: Common Sense and Intelligent User Interfaces 2009: Story Understanding and Generation for Context-Aware Interface Design; Multimodal Interfaces for Automotive Applications (MIAA); Human Interaction with Intelligent & Networked Systems; Users' Preferences Regarding Intelligent User Interfaces: Differences Among Users and Changes Over Time; Visual Interfaces to the Social and the Semantic Web; Sketch Recognition and Model Driven Development of Advanced User Interfaces (MDDAUI 2009). Interestingly, this year's IUI has a record number of workshops, counterbalanced by a lack of tutorials. Perhaps this signifies a change of focus in the IUI community?
Design And Implementation Of A Gene Network Reverse Engineering Method Based On Mutual Information
Authors: Azad M. Madni, Mircea Andrecut
Venue: Journal of Integrated Design Process Science (2007)

In this paper, the authors describe a gene network reverse engineering method, which employs mutual information to infer the connections between the genes. Given the expression profile of the genes, determined for different conditions, the method calculates the similarity matrix corresponding to the mutual information between each pair of genes. The approximated matrix can be subsequently refined by using a data processing inequality and an analytically estimated threshold for the statistical significance of mutual information. The authors have used the proposed method to reconstruct a network of 2041 gene transcription factors, measured over 79 human tissues. The numerical results show that the connectivity of the transcription factors network is characterized by a scale free distribution, with an exponent of the power law between 1.5 and 2. The power law for the connectivity distribution implies that the network is extremely heterogeneous; i.e., its topology is dominated by a few highly connected genes, which link the rest of the loosely-connected genes to the system.
Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays
Venue: International Symposium on Field Programmable Gate Arrays (2009)

FPGA 2009 is the 17th annual meeting of the ACM International Symposium on Field-Programmable Gate Arrays. As we gather again in Monterey, CA, we welcome you to this premier conference for the presentation of the latest research and advances in all areas related to FPGAs. This year, we received 92 submissions from which we selected 24 excellent quality full papers for presentation at the Symposium (acceptance rate of 26%). This cohort of full-length papers provides a balanced program with strong contributions in the three areas of FPGA architecture (6), CAD tools (10) and applications (8). In an effort to widen participation, we also introduce a new category known as "short papers", each having a 4-page publication, a short (5 minutes) presentation and a poster presentation. In all, eleven short papers were chosen. We will also have over 30 poster presentations that provide additional opportunities for researchers to present their work. Delegates to this year's Symposium will enjoy an interesting pre-conference workshop on research challenges and opportunities in emerging applications, and an interesting debate during the Panel Session on Monday evening on "CMOS vs Nano: Comrades or Rivals?".
Fault tolerant mechanism of bio-inspired adaptive routing system
Authors: Akiyuki Iwasaki, Tadasuke Nozoe, Takashi Kawauchi, Masahiro Okamoto
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

The routing algorithm of SPF (Shortest Path First) is widely distributed in the Internet. Since this routing algorithm is designed in order to improve throughput of each packet, it is not suitable for averaging load balance in the network. On the contrary, metabolic networks in the cell can realize load balance and achieve fault-tolerance by using enzymatic feedback mechanism. That is, a metabolic pathway in the cell is composed of a lot of enzymatic reaction steps in which biochemical reactant (substrate) is converted to the product by unique enzyme, and the product of a late step frequently acts as an inhibitor of the first committed step in this pathway (feedback control). This way, the end product of a pathway controls its own synthesis and prevents useless accumulation of intermediates and of end product. Recently, by mimicking enzymatic feedback mechanism in the cell, we have designed a fault-tolerant adaptive routing algorithm to avoid the partial and time-variant congestions in the network. We evaluated and compared the proposed algorithm with SPF and ECMP (Equal Cost Multi-path Protocol) by using the simulation of test data. This study shows the mechanism how the proposed algorithm can remarkably improve both latency, load balance and fault tolerance. Since there are enormous numbers of nodes in the Internet, however, it is difficult to replace all existing nodes to the proposed nodes. We shall next propose an efficient method for the allocation of adaptive nodes in random and a scale-free network composed of 100 nodes. And we describe the method of the proposed algorithm without useless. Examined the time-variant traffic at each node, and only focused on around 10% top ranked heavy-traffic nodes, we replace such nodes to our proposed adaptive nodes. By doing this, we could design a fault-tolerant adaptive routing, which can dynamically average load-balance within the network.
Note: Testing avoidability on sets of partial words is hard
Authors: F. Blanchet-Sadri, Raphaël M. Jungers, Justin Palumbo
Venue: Theoretical Computer Science (2009)

We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-hard for any alphabet of size larger than or equal to two, which is in contrast with the well-known feasability results for unavoidability of a set of full words. We raise some related questions on avoidability of sets of partial words.
Robust Linear Transmit/Receive Processing for Correlated MIMO Downlink with Imperfect CSI
Authors: Hao Li, Changqing Xu, Pingzhi Fan
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper we investigate designing optimal linear transmit/receive processing filters for multiuser MIMO downlinks with imperfect channel state information (CSI) and spatial fading correlation between antenna array at BS. A robust scheme is proposed to obtain the optimal linear transmit/receive filters in the sense of minimizing the average sum mean square error (SMSE) conditional on noisy channel estimates under a per-user transmit power constraint. Using an iterative procedure, the proposed scheme extends the existing optimization algorithm for uncorrelated single-user MIMO systems with perfect CSI to solve the problem of minimizing SMSE in spatially correlated MIMO downlinks with imperfect CSI. Comparing with non-robust scheme, we show that robust scheme efficiently mitigates the BER loss induced by imperfect CSI. In addition, the impact of fading correlation at BS on the performance of the proposed robust scheme is analyzed.
A Trust-Based Incentive Mechanism for E-Marketplaces
Authors: Jie Zhang, Robin Cohen, Kate Larson
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

In the context of electronic commerce, when modeling the trustworthiness of selling agent relies (in part) on propagating ratings provided by buying agents that have personal experience with the seller, the problem of unfair ratings arises. Extreme diversity of open and dynamic electronic marketplaces causes difficulties in handling unfair ratings in trust management systems. To ease this problem, we propose a novel trust-based incentive mechanism for eliciting fair ratings of sellers from buyers. In our mechanism, buyers model other buyers, using an approach that combines both private and public reputation values. In addition, however, sellers model the reputation of buyers. Reputable buyers provide fair ratings of sellers, and are likely considered trustworthy by many other buyers. In marketplaces operating with our mechanism, sellers will offer more attractive products to satisfy reputable buyers, in order to build their reputation. In consequence, our mechanism creates incentives for buyers to provide fair ratings of sellers, leading to more effective e-marketplaces where honest buyers and sellers can gain more profit.
Industrial clock design
Authors: Pei-Hsin Ho
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Power and variation are the biggest concerns of physical design today. Clock distribution network is at the center of both the power and variation concerns. Clock distribution networks consume a lion's share of the total IC power consumption for two reasons. First, the clock distribution network requires many large buffers to deliver crisp clock signals across a large area of the IC. Second, the clock distribution network uses many small buffers to balance the clock skews. Clock distribution networks are also most susceptible to variation for two reasons. First, both the latency and length of a clock path are usually much longer than those of typical timing paths. Second, variations to clock path delays may have a 2X impact to the timing of a timing path. Let's consider a timing path between a launching and a capturing flop and suppose that the clock path to the launching flop is sped up by 100ps and the clock path to the capturing flop is slowed down by 100ps due to variation. The impact to the hold constraint of the timing path would be 200ps. Our customers have seen chip failures due to hold violations caused by variation in this manner. Therefore, for 45nm technology nodes and beyond, we believe that a power-efficient and variation-tolerant clock distribution network is a necessary condition for a competitive IC product. In this talk we discuss the industrial clock design problems, designers' strategies for resolving the problems and the capabilities of commercial tools that we must provide to support the designers.
Multi-fingerprint Information Fusion for Personal Identification Based on Improved Dempster-Shafer Evidence Theory
Authors: Xiaohui Ren, Jinfeng Yang, Henghui Li, Renbiao Wu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

With the rapid development of the social information, more attention has been paid to the accurate and efficient personal identification methods recently. Since the personal fingerprints are unique and readily available for use, fingerprint identification techniques have been widely used in many applications. However, these methods have some inherent limitations in accuracy due to the varieties of the fingerprint images in quality. Hence, an improved information fusion method based on D-S evidence theory is proposed in this paper to combine fingerprint information together for personal identification. Experimental results show that the performance of the proposed algorithm can well solve the evidence conflict problem and effectively improve the precision and performance of fingerprint identification.
Gröbner bases in universal enveloping algebras of Leibniz algebras
Authors: Manuel A. Insua, Manuel Ladra
Venue: Journal of Symbolic Computation (2009)

We give a proof of the Poincaré-Birkhoff-Witt theorem for universal enveloping algebras of finite dimensional Leibniz algebras using Grobner bases in a free associative algebra. We also construct Gröbner bases for two-sided ideals in universal enveloping algebras using the concept of Factor-Gröbner basis introduced by Nordbeck [Nordbeck, P., 2001. On the finiteness of Gröbner bases computation in quotients of the free algebra. Appl. Algebra Engrg. Comm. Comput. 11, 157-180]. Our approach differs from the one applied to PBW algebras or G-algebras since our algebras have zero divisors. We use this technique to obtain an algorithm to solve the ideal membership problem.
Mitigating control-channel jamming attacks in multi-channel ad hoc networks
Authors: Loukas Lazos, Sisi Liu, Marwan Krunz
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

We address the problem of control-channel jamming attacks in multi-channel ad hoc networks. Deviating from the traditional view that sees jamming attacks as a physical-layer vulnerability, we consider a sophisticated adversary who exploits knowledge of the protocol mechanics along with cryptographic quantities extracted from compromised nodes to maximize the impact of his attack on higher-layer functions. We propose new security metrics that quantify the ability of the adversary to deny access to the control channel, and the overall delay incurred in re-establishing the control channel. We also propose a randomized distributed scheme that allows nodes to establish a new control channel using frequency hopping. Our method differs from classic frequency hopping in that no two nodes share the same hopping sequence, thus mitigating the impact of node compromise. Furthermore, a compromised node is uniquely identified through its hop sequence, leading to its isolation from any future information regarding the frequency location of the control channel.
The determinants of cumulative endogeneity bias in multivariate analysis
Authors: David Mayston
Venue: Journal of Multivariate Analysis (2009)

The BLU properties of OLS estimators under known assumptions have encouraged the widespread use of OLS multivariate regression analysis in many empirical studies that are based upon a conceptual model of a single explanatory equation. However, such a model may well be an imperfect empirical approximation to the valid underlying conceptual model, that may well contain several important additional inter-relationships between the relevant variables. In this paper, we examine the conditions under which we can predict the direction of the resultant endogeneity bias that will prevail in the OLS asymptotic parameter estimates for any given endogenous or predetermined variable, and the extent to which we can rely upon simple heuristics in this process. We also identify the underlying structural parameters to which the magnitude of the endogeneity bias is sensitive. The importance of such sensitivity analysis has been underlined by an increasing awareness of the inability of standard diagnostic tests to shed light upon the extent of the endogeneity bias, rather than upon merely its existence. The paper examines the implications of the analysis for statistical inferences about the true value of the regression coefficients and the validity of associated t-statistics.
A Multithreaded Framework for Sequential Monte Carlo Methods on CPU/FPGA Platforms
Authors: Markus Happe, Enno Lübbers, Marco Platzner
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Sequential Monte Carlo techniques are among the principal tools for the on-line estimation of the state of a non-linear dynamic system. We propose a framework for the multithreaded implementation of the widely popular sampling importance resampling (SIR) method on hybrid CPU/FPGA systems. The framework is based on the multithreaded reconfigurable operating system ReconOS which allows for an easy repartitioning of threads between hard- and software. We demonstrate the framework on a case study for visual object tracking and evaluate the performance of different hardware/software partitionings.
Short Note: Shape and topology optimization for electrothermomechanical microactuators using level set methods
Authors: Zhen Luo, Liyong Tong, Haitao Ma
Venue: Journal of Computational Physics (2009)

In this short note, a shape and topology optimization method is presented for multiphysics actuators including geometrically nonlinear modeling based on an implicit free boundary parameterization method. A level set model is established to describe structural design boundary by embedding it into the zero level set of a higher-dimensional level set function. The compactly supported radial basis functions (CSRBF) are introduced to parameterize the implicit level set surface with a high level of accuracy and smoothness. The original more difficult shape and topology optimization driven by the Hamilton-Jacobi partial differential equation (PDE) is transferred into a relatively easier parametric (size) optimization, to which many well-founded optimization algorithms can be applied. Thus the structural optimization is transformed to a numerical process that describes the design as a sequence of motions of the design boundaries by updating the expansion coefficients of the size optimization. Two widely studied examples are chosen to demonstrate the effectiveness of the proposed method.
Comparing load & go and link/load compiler organizations
Authors: William L. Wilder
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Compilers usually produce either absolute code that is executed immediately upon conclusion of the compilation or object code that is transformed by a linking loader into absolute code. These compiler organizations will be called Load & Go and Link/Load. Both Load & Go and Link/Load compilers use a number of passes to translate the source program into absolute code. A pass reads some form of the source program, transforms it into an another form, and normally outputs this form to an intermediate file which may be the input of a later pass.
Exploiting In-Zone Broadcasts for Cache Sharing in Mobile Ad Hoc Networks
Authors: Ge-Ming Chiu, Cheng-Ru Young
Venue: IEEE Transactions on Mobile Computing (2009)

The problem of cache sharing for supporting data access in mobile ad hoc networks is studied in this paper. The key to this problem is to discover a requested data item in an efficient manner. In the paper, we propose two caching protocols, IXP and DPIP, which distinguish themselves from the existing ones in that they fully exploit in-zone broadcasts to facilitate cache sharing operation. In particular, the DPIP protocol offers an implicit index push property, which is highly useful for enhancing cache hit ratio in the neighborhood of a data requester node. Moreover, our protocols also exploit the broadcasts to facilitate the design of a simple but efficient count-based cache replacement scheme. Performance study shows that the proposed protocols can significantly improve the performance of data access in a mobile ad hoc network.