ppxscal/embedding_network huggingface dataset:
Polynomials with real zeros and Pólya frequency sequences
Authors: Yi Wang, Yeong-Nan Yeh
Venue: Journal of Combinatorial Theory Series A (2005)

Let f(x) and g(x) be two real polynomials whose leading coefficients have the same sign. Suppose that f(x) and g(x) have only real zeros and that g interfaces f or g alternates left of f. We show that if ad ≥ bc then the polynomial (bx + a)f(x) + (dx + c)g(x) has only real zeros. Applications are related to certain results of Brenti (Mem. Amer. Math. Soc. 413 (1989)) and transformations of Pólya-frequency (PF) sequences. More specifically, suppose that A(n, k) are nonnegative numbers which satisfy the recurrence A(n,k) = (rn + sk + t)A(n - 1,k - 1) + (an + bk + c)A(n - 1,k) for n ≥ 1 and 0 ≤ k ≤ n, where A(n,k) = 0 unless 0≤k≤n. We show that if rb≥as and (r+s+t)b≥(a+c)s, then for each n≥0, A(n, 0), A(n, 1),..., A(n, n) is a PF sequence. This gives a unified proof of the PF property of many well-known sequences including the binomial coefficients, the Stirling numbers of two kinds and the Eulerian numbers.
Memory System Design Space Exploration for Low-Power, Real-Time Speech Recognition
Authors: Rajeev Krishna, Scott Mahlke, Todd Austin
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

The recent proliferation of computing technology has generated new interest natural I/O interface technologies such as speech recognition. Unfortunately, the computational and memory demands of such applications currently prohibit their use on low-power portable devices in anything more than their simplest forms. Previous work has demonstrated that the thread level concurrency inherent in this application domain can be used to dramatically improve performance with minimal impact on overall system energy consumption, but that such benefits are severely constrained by memory system bandwidth. This work presents a design space exploration of potential memory system architectures. A range of low-power memory organizations are considered, from conventional caching to more advanced system-on-chip implementations. We find that, given architectures able to exploit concurrency in this domain, large L2 based cache hierarchies and high bandwidth memory systems employing data stream partitioning and on-chip embedded DRAM and ROM technologies can provide much of the performance of idealized memory systems without violating the power constraints of the low-power domain.
A new approach to risk estimation in many-criteria automatic control systems. II
Authors: L. V. Zhukovskaya, E. A. Mirkin
Venue: Automation and Remote Control (2005)

The concept of a risk-guaranteed solution for many-criteria problems under uncertainty, which is typical of emergency situations, and a solution algorithm for these problems are described in Part I of this paper. In Part II, this algorithm is realized for a two-criteria problem under bounded uncertainties and linear-quadratic criteria.
Constructed narratives a tangible social interface
Authors: Pamela Jennings
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Constructed Narratives is a tangible social interface designed for use in public spaces where people have the opportunity to encounter the game and subsequently learn about each other. The hardware and software system architecture developed for this project could be applied for experimental computer-based interfaces for several human computer interaction domains including collaborative learning (CSCL), and collaborative design activities in the tradition of computer supported collaborative work (CSCW). The current domain explored for Constructed Narratives is that of computer systems designed to enable shared experience through play, or computer supported collaborative play (CSCP).
Network measurement and path characterization using user datagram protocol
Authors: Dulal C. Kar
Venue: Journal of Computing Sciences in Colleges (2004)

The Internet is very dynamic, unreliable, and complex in nature. Many of its characteristics are not very visible since TCP (Transmission Control Protocol) provides a reliable end-to-end data delivery between two communicating hosts. However, it is possible to design some experiments using UDP (User Datagram Protocol) to observe and measure some of the characteristics of the Internet as well as of a network that supports UDP as a transport protocol. In this paper, some experiments on observing and measuring network characteristics such as round-trip time, throughput, packet loss or duplication, and path bandwidth between two communicating hosts are presented. In addition, an instructive project idea using UDP for understanding the operation of a reliable transport protocol like TCP is presented. These experiments can provide students a good insight on the complexity of the Internet environment and teach how to characterize and measure performance of an Internet path for data delivery.
Congestion prediction in early stages
Authors: Chiu-wing Sham, Evangeline F. Y. Young
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominant factor of the overall performance of a circuit. In order to optimize interconnect cost, we need a good congestion estimation method to predict routability in the early stages of the design cycle. Many congestion models have been proposed but there's still a lot of room for improvement. Some existing models [6] are dependent on parameters that are related to the actual congestion of the circuits. Besides, routers will perform rip-up and re-route operations to prevent overflow but most models do not consider this case. The outcome is that the existing models will usually under-estimate the routability. In this paper, we propose a new congestion model to solve the above problems. The estimation process is divided into three steps: preliminary estimation, detailed estimation and congestion redistribution. We have compared our new model and some existing models with the actual congestion measures obtained by global routing some placement results with a publicly available maze router [2]. Results show that our model has significant improvement in prediction accuracy over the existing models.
A Method of Target Detection and Tracking in Video Surveillance
Authors: Fang Shuai, Tong Shi-zhong, Xu Xin-he, Xie Zhi
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Multi-target detection and tracking are the two key issues of video surveillance. This paper presents the methods to solve the two problems. Firstly, a moving object detection algorithm based on background modeling is given, which can effectively deal with the background disturbance and illumination changes. Then, a multi-targets tracking algorithm based on particle filter is described. Some special problems in multi-targets tracking include computational complexity, new target entry, target exit and occlusion are also discussed. Experiment results show that presented method is effective.
Richer File System Metadata Using Links and Attributes
Authors: Alexander Ames, Carlos Maltzahn, Nikhil Bobb, Ethan L. Miller, Scott A. Brandt, Alisa Neeman, Adam Hiatt, Deepa Tuteja
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Traditional file systems provide a weak and inadequate structure for meaningful representations of file interrelationships and other context-providing metadata. Existing designs, which store additional file-oriented metadata either in a database, on disk, or both are limited by the technologies upon which they depend. Moreover, they do not provide for user-defined relationships among files. To address these issues, we created the Linking File System (LiFS), a file system design in which files may have both arbitrary user- or application-specified attributes, and attributed links between files. In order to assure performance when accessing links and attributes, the system is designed to store metadata in non-volatile memory. This paper discusses several use cases that take advantage of this approach and describes the user-space prototype we developed to test the concepts presented.
Enhancing performance of protein and gene name recognizers with filtering and integration strategies
Authors: Wen-Juan Hou, Hsin-Hsi Chen
Venue: Journal of Biomedical Informatics (2004)

Named entity (NE) recognition is a fundamental task in biological relationship mining. This paper considers protein/gene collocates extracted from biological corpora as restrictions to enhance the precision rate of protein/gene name recognition. In addition, we integrate the results of multiple NE recognizers to improve the recall rates. Yapex and KeX, and ABGene and Idgene are taken as examples of protein and gene name recognizers, respectively. The precision of Yapex increases from 70.90 to 85.84% at the low expense of the recall rate (i.e., it only decreases 2.44%) when collocates are incorporated. When both filtering and integration strategies are employed together, the Yapex-based integration with KeX shows good performance, i.e., the F-score increases by 7.83% compared to the pure Yapex method. The results of gene recognition show the same tendency. The ABGene-based integration with Idgene shows a 10.18% F-score increase compared to the pure ABGene method. These successful methodologies can be easily extended to other name finders in biological documents.
An FPGA-based digital logic lab for computer organization and architecture
Authors: Mark Hoffman
Venue: Journal of Computing Sciences in Colleges (2004)

The number of core hours devoted to digital logic in the knowledge unit Computer Architecture (AR) has been significantly reduced with the publication of Computing Curricula 2001 (CC2001). Over half of core hours removed come at the expense of digital logic and digital systems. We have argued elsewhere that more digital logic must be included in Computer Architecture. In this paper, we present our experience with an FPGA-based digital logic lab offered with our undergraduate Computer Organization and Architecture course including objectives, curricular issues, equipment and costs, staffing, process and grading policy, and observations from faculty and students. The lab gives students at least 9 hours of digital logic in a hands-on environment supplementing at least 3 core hours included in CC2001 Computer Architecture course models. Also, students are exposed to hardware used in modern computing applications, such as embedded systems.
Creating a finite-state parser with application semantics
Authors: Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexis Nasr, Richard Sproat
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon is defined in terms of a lexicalized Tree Adjoining Grammar, which is subsequently mapped to a FS representation. This approach gives the application designer better and easier control over the natural language understanding component than using an off-the-shelf parser. We present results using Parsli on an application that creates 3D-images from typed input.
An Approach for Service Description and a Flexible Way to Discover Services in Distributed Systems
Authors: Oussama Kassem Zein, Yvon Kermarrec
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In an earlier context, we have developed and implemented tools which constitute a trader based on ontologies and knowledge representation in order to discover a service based on its static properties (like its location, its provider name, etc). In this paper, we extend these tools by addressing the dynamic properties of a service (its behavior) and its interface (parameters, methods, etc). These three levels provide a complete vision about the service description. They can be used by clients to query and discover services. The association of an ontology and knowledge representation provide a powerful combination that we will examine in the document. This development is compatible with the trader interface as defined by ODP and CORBA. We show an example to demonstrate the flexibility of our trader. We also present our approach for adapting services to the needs of different users. We define for each user a profile. These profiles will be taken into account in the searching tools defined in our trader to filter the service queries and to provide to the client its appropriate services.
Homophily in online dating: when do you like someone like yourself?
Authors: Andrew T. Fiore, Judith S. Donath
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Psychologists have found that actual and perceived similarity between potential romantic partners in demographics, attitudes, values, and attractiveness correlate positively with attraction and, later, relationship satisfaction. Online dating systems provide a new way for users to identify and communicate with potential partners, but the information they provide differs dramatically from what a person might glean from face-to-face interaction. An analysis of dyadic interactions of approximately 65,000 heterosexual users of an online dating system in the U.S. showed that, despite these differences, users of the system sought people like them much more often than chance would predict, just as in the offline world. The users' preferences were most strongly same-seeking for attributes related to the life course, like marital history and whether one wants children, but they also demonstrated significant homophily in self-reported physical build, physical attractiveness, and smoking habits.
User research as kool-aid
Authors: Jonathan Arnowitz, Elizabeth Dykstra-Erickson
Venue: interactions (2005)

drink the Kool-Aid, v. To become a firm believer in something; to accept an argument or philosophy wholeheartedly or blindly. This phrase stems from the 1978 "Jonestown massacre" in which members of the Peoples Temple cult committed suicide by drinking cyanide-laced Kool-Aid (although some say the drink of choice was actually Flav-R-Aid) [1].
Sparse Matrix Block-Cyclic Realignment on Distributed Memory Machines
Authors: Ching-Hsien Hsu
Venue: The Journal of Supercomputing (2005)

Modifying the data distribution over the course of a program to adapt to variations in the data access patterns may leads to significant computational benefits in many scientific applications. Therefore, dynamic realignment of data is used to enhance algorithm performance in parallel programs on distributed memory machines. This paper presents a new method aims to the efficiency of block-cyclic data realignment of sparse matrix. The main idea of the proposed technique is first todevelop closed forms for generating the Vector Index Set (VIS) of each source/destination processor. Based on the vector index set and the nonzero structure of sparse matrix, two efficient algorithms,vector2message (v2m) and message2vector (m2v) can be derived. The proposed technique uses v2m to extract nonzero elements from source compressed structures and packs them into messages in the source stage; and uses m2v to unpack each received messages and construct the destination matrix in the destination stage. A significant improvement of this approach is that a processor does not need to determine the complicated sending or receiving data sets for dynamic data redistribution. The indexing cost is reduced obviously. The second advantage of the present techniques is the achievement of optimal packing/unpacking stages consequent upon the informative VIS tables. Another contribution of our methods is the ability to handle sparse matrix redistribution under two disjoint processor grids in the source and destination phases. A theoretical model to analyze the performance of the proposed technique is also presented in this work. To evaluate the performance of our methods, we have implemented the present algorithms on an IBM SP2 parallel machine along with the Histogram method and a dense redistribution strategy. The experimental results show that our technique provides significant improvement for runtime data redistribution of sparse matrices in most test samples.
A uniform approach to accelerated PageRank computation
Authors: Frank McSherry
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate their current probability values to their neighbors at each step, nodes instead communicate only changes in probability value. This reformulation enables a large degree of flexibility in the manner in which nodes update their values, leading to an array of optimizations and features, including faster convergence, efficient incremental updating, and a robust distributed implementation.While the spirit of many of these optimizations appear in previous literature, we observe several cases where this unification simplifies previous work, removing technical complications and extending their range of applicability. We implement and measure the performance of several optimizations on a sizable (34M node) web subgraph, seeing significant composite performance gains, especially for the case of incremental recomputation after changes to the web graph.
Dermi: A New Distributed Hash Table-Based Middleware Framework
Authors: Carles Pairot Gavaldà, Pedro Garcia Lopez, Skarmeta Skarmeta
Venue: IEEE Internet Computing (2004)

DERMI is P2P decentralized event-based object middleware built on top of a structured overlay network, which provides an event notification service that DERMI uses as its principal building block. DERMI makes three innovative contributions: P2P call abstractions, distributed interception, and a decentralized object location service. Developers can use these three pillars to build a wide variety of global-scale distributed applications.
Accumulation-based congestion control
Authors: Yong Xia, David Harrison, Shivkumar Kalyanaraman, Kishore Ramachandran, Arvind Venkatesan
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

This paper generalizes the TCP Vegas congestion avoidance mechanism and uses accumulation, buffered packets of a flow inside network routers, as a congestion measure based on which a family of congestion control schemes can be derived. We call this model Accumulation-based Congestion Control (ACC), which fits into the nonlinear optimization framework proposed by Kelly. The ACC model serves as a reference for packet-switching network implementations. We show that TCP Vegas is one possible scheme under this model. It is well known that Vegas suffers from round trip propagation delay estimation error and reverse path congestion. We therefore design a new Monaco scheme that solves these problems by employing an out-of-band, receiver-based accumulation estimator, with the support of two FIFO priority queues from the (congested) routers. Comparisons between these two schemes demonstrate that Monaco does not suffer from the problems mentioned above and achieves better performance than Vegas. We use ns-2 simulations and Linux implementation experiments to show that the static and dynamic performance of Monaco matches the theoretic results. One key issue regarding the ACC model in general, i.e., the scalability of bottleneck buffer requirement, and a solution using a virtual queueing algorithm are discussed and evaluated.
Site abstraction for rare category classification in large-scale web directory
Authors: Tie-Yan LIU, Hao WAN, Tao QIN, Zheng CHEN, Yong REN, Wei-Ying MA
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Automatically classifying the Web directories is an effective way to manage Web information. However, our experiments showed that the state-of-the-art text classification technologies could not lead to acceptable performance in this task. Due to our analysis, the main problem is the lack of effective training data in rare categories of Web directories. To tackle this problem, we proposed a novel technology named Site Abstraction to synthesize new training examples from the website of the existing training document. The main idea is to propagate features through parent-child relationship in the sitemap tree. Experiments showed that our method significantly improved the classification performance.
Effects of Collaborative and Individual Learning in a Blended Learning Environment
Authors: Pierre J. Eijl, Albert Pilot, Peter De Voogd
Venue: Education and Information Technologies (2005)

In courses using a virtual learning environment (VLE), some students like to work together, and some do not. If we give students the opportunity to choose either teamwork or individual study, how does this affect their marks and their appraisal and assessment of the course?This question has been investigated in the context of an English Literature course at the University of Utrecht. In this course, students work intensively with a VLE, and attend lectures: a blended learning environment. Previous research has shown that the pedagogical design used provides a powerful learning environment. This time, students had the choice of working on the course assignments in small teams (2--4 students), or individually. Both groups were compared based on their study results, and the answers to a questionnaire. Students valued the choice. Mainly those students with high marks for a previous course, which had a similar pedagogical design, preferred collaboration. Statistical analysis showed that collaboration resulted in significantly better marks.
Fabrication of built-in copper microstructures on epoxy resin
Authors: Shuichi Asakura, Shuhei Fukutani, Akio Fuwa
Venue: Microelectronic Engineering (2004)

This paper describes a simple and effective method to fabricate built-in copper microstructures on a polymer substrate. Our method uses a micropatterned amino (NH"2)-terminated self-assembled monolayer (SAM) as a template to fabricate patterned copper (Cu) film for transfer to an epoxy resin. Cu microstructures were first formed on a photolithographically micropatterned NH"2-SAM-covered SiO"2/Si substrate through conventional electroless plating, in which Cu deposition proceeded selectively on the NH"2-terminated areas while the photo-irradiated areas remained free of copper deposits. Next, epoxy glue (resin) was poured into a Teflon^(R) O-ring placed so as to surround the Cu-micropatterned substrate. Finally, after the resin completely hardened, it was removed from the substrate. Due to the weak adhesion between the Cu film and the NH"2-terminated surface, the area-selectively deposited Cu film could be readily peeled off and removed from the SiO"2/Si substrate and thus transferred to the resin surface. Through this technique, high-resolution 10-@mm-wide Cu microstructures were successfully fabricated on the epoxy resin surface. These embedded Cu microstructures were tightly adhered to the resin. No peeling of the copper structures was observed in a Scotch^(R) tape peeling test.