ppxscal/embedding_network huggingface dataset:
Maze: A Social Peer-to-Peer Network
Authors: Chen Hua, Yang Mao, Han Jinqiang, Deng Haiqing, Li Xiaoming
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Tianwang Maze system is a hybrid peer-to-peer system. Maze employs the idea of social networks to help peers discover each other, and as a result, reduces the load on the heartbeat server. Maze network is a dynamic network in which peers connect to each other according to their social relation, group of peers with common interest is naturally formed, and similar resources are found in neighborhood. This paper will discuss how Maze realizes a social network, and how the social relationships help to discover peers and resources on the Internet.
Min-Max Checkpoint Placement under Incomplete Failure Information
Authors: Tatsuya Ozaki, Tadashi Dohi, Hiroyuki Okamura, Naoto Kaio
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In this paper we consider two kinds of sequential checkpointplacement problems with infinite/finite time horizon.For these problems, we apply the approximation methodsbased on the variational principle and develop the computationalgorithms to derive the optimal checkpoint sequenceapproximately. Next, we focus on the situation where theknowledge on system failure is incomplete, i.e. the systemfailure time distribution is unknown. We develop theso-called min-max checkpoint placement methods to determinethe optimal checkpoint sequence under the uncertaincircumstance in terms of the system failure time distribution.In numerical examples, we investigate quantitativelythe min-max checkpoint placement methods, and refer totheir potential applicability in practice.
Connectivity restrictions in overlay multicast
Authors: Aditya Ganjam, Hui Zhang
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

A large number of overlay multicast protocols have been developed, almost all of which assume universal connectivity between end hosts. However, in reality, this assumption is not valid with widespread use of Network Address Translators (NAT) and firewalls. The impact of NAT and firewall connectivity restrictions on overlay multicast, especially in the application-endpoint setting, has not been seriously considered. In this paper, we argue that it is critical to consider connectivity restrictions because NAT and firewall hosts make up a large fraction of the endpoints, affecting proper functionality as well as performance of overlay multicast protocols. We present several design enhancements that explicitly consider connectivity restrictions in overlay multicast and evaluate the design space and tradeoffs based on real Internet broadcasts and Internet testbed experiments.
Evaluating the Imagine Stream Architecture
Authors: Jung Ho Ahn, William J. Dally, Brucek Khailany, Ujval J. Kapasi, Abhishek Das
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

This paper describes an experimental evaluation of theprototype Imagine stream processor. Imagine [Imagine: Media processing with streams] is a stream processor that employs a two-level register hierarchy with9.7 Kbytes of local register file capacity and 128 Kbytesof stream register file (SRF) capacity to capture producer-consumerlocality in stream applications. Parallelism is exploitedusing an array of 48 floating-point arithmetic unitsorganized as eight SIMD clusters with a 6-wide VLIW percluster. We evaluate the performance of each aspect ofthe Imagine architecture using a set of synthetic micro-benchmarks,key media processing kernels, and full applications.These micro-benchmarks show that the prototypehardware can attain 7.96 GFLOPS or 25.4 GOPS of arithmeticperformance, 12.7 Gbytes/s of SRF bandwidth, 1.58Gbytes/s of memory system bandwidth, and accept up to2 million stream processor instructions per second from ahost processor.On a set of media processing kernels, Imagine sustainedan average of 43% of peak arithmetic performance. Anevaluation of full applications provides a breakdown ofwhere execution time is spent. Over full applications, Imagineachieves 39.4% of peak performance, of the remainderon average 36.4% of time is lost due to load imbalancebetween arithmetic units in the VLIW clusters and limitedinstruction-level parallelism within kernel inner loops,10.6% is due to kernel startup and shutdown overhead becauseof short stream lengths, 7.6% is due to memory stalls,and the rest is due to insufficient host processor bandwidth.Further analysis included in the paper presents the impactof host instruction bandwidth on application performance,particularly on smaller datasets. In summary, the experimentalmeasurements described in this paper demonstratethe high performance and efficiency of stream processing:operating at 200 MHz, Imagine sustains 4.81 GFLOPS onQR decomposition while dissipating 7.42 Watts.
Optimal location and design of a competitive facility
Authors: Frank Plastria, Emilio Carrizosa
Venue: Mathematical Programming: Series A and B (2004)

A single facility has to be located in competition with fixed existing facilities of similar type. Demand is supposed to be concentrated at a finite number of points, and consumers patronise the facility to which they are attracted most. Attraction is expressed by some function of the quality of the facility and its distance to demand. For existing facilities quality is fixed, while quality of the new facility may be freely chosen at known costs. The total demand captured by the new facility generates income. The question is to find that location and quality for the new facility which maximises the resulting profits.It is shown that this problem is well posed as soon as consumers are novelty oriented, i.e. attraction ties are resolved in favour of the new facility. Solution of the problem then may be reduced to a bicriterion maxcovering-minquantile problem for which solution methods are known. In the planar case with Euclidean distances and a variety of attraction functions this leads to a finite algorithm polynomial in the number of consumers, whereas, for more general instances, the search of a maximal profit solution is reduced to solving a series of small-scale nonlinear optimisation problems. Alternative tie-resolution rules are finally shown to result in problems in which optimal solutions might not exist.
3Si: A Computer Program for the Optimal Design of Short Interfering RNA (siRNA) for Gene Silencing
Authors: WeiPing Chen, Wei Zha, Terry Cox, Xiujun Zhao, Paul Russell
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

siRNA is a powerful technique for gene silencing. However, it is still not clear how toaccurately determine an effective gene targeting region for siRNA. It is also controversial ifthe targeted mRNA secondary structure would have a significant impact on the genesilencing by the siRNA. Understanding the relationship between the secondary structure andgene silencing by siRNA could help in high throughput function-based genetic screens andfor development of therapeutic tools. Our hypothesis is that the selection of a single-strandedregion as the target region should increase the efficiency of siRNA silencing. For the firsttime, a formula and a computer program were developed to select the single-strandedregions for siRNA silencing. We statistically analyzed quantitative relationships betweengene silencing by the siRNA and ten parameters from published siRNA sequences. The fournonlinear significant parameters for designing siRNA are the RNA Single-Stranded Index(SSi), a new parameter that identifies the target position and its related secondarystructures, the GC content, G free energy of the siRNA, and the 5 'GC content of the firstfour bases of the antisense siRNA. The nonlinear complexity suggested that one should notuse simple criteria such as a GC content of around 30 to 50% or the absence of the sequence pattern GGG for designing siRNA. Our results indicate that the targeted mRNA secondary structure is a statistically significant determinant in gene silencing and should be used to optimize RNAi technology.
Convex approximations for complete integer recourse models
Authors: Maarten H. van der Vlerk
Venue: Mathematical Programming: Series A and B (2004)

We consider convex approximations of the expected value function of a two-stage integer recourse problem. The convex approximations are obtained by perturbing the distribution of the random right-hand side vector. It is shown that the approximation is optimal for the class of problems with totally unimodular recourse matrices. For problems not in this class, the result is a convex lower bound that is strictly better than the one obtained from the LP relaxation.
Using narrative as a motivating device to teach binary arithmetic and logic gates
Authors: Atif Waraich
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper briefly describes the design, development and evaluation of a prototype multimedia Interactive Learning Environment (ILE). This incorporated narrative in an attempt to provide a rich and engaging learning experience for first year undergraduate students studying a computer architecture unit at Manchester Metropolitan University. The main problem addressed was how to ensure that the ILE would appeal to students who found the domain difficult and to increase their learning and motivation to learn. A design approach has been developed which aims to address these issues using a narrative based framework. The ILE is (briefly) described and an initial evaluation of its use presented. The paper concludes by identifying the aspects of the ILE, which appealed to the students.
Silicon crystal distortions at the Si(100)-SiO2 interface from analysis of ion-scattering
Authors: Angelo Bongiorno, Alfredo Pasquarello, Mark S. Hybertsen, L. C. Feldman
Venue: Microelectronic Engineering (2004)

The structure of the Si(100)-SiO2 interface is investigated at the atomic scale by combining Rutherford ion scattering measurements and theoretical modeling. Ion-scattering experiments are performed in the channeling geometry using ion energies between 0.4 and 2.0 MeV. These measurements are sensitive to Si displacements at the interface between 0.07 and 0.14 A. To interpret our experimental results, we perform ion-scattering simulations on two realistic model structures of the Si(100)-SiO2 interface. The comparison between experiment and simulation over the full range of considered ion energies supports a Si(100)-SiO2 interface model presenting a disordered pattern of Si-Si dimers in the transition region.
Paper models of surfaces with curvature creative visualization labs baltimore joint mathematics meetings
Authors: Howard Iseri
Venue: Smarandache Notions Journal (2004)

A model of a cone can be constructed from a piece of paper by removing a wedge and taping the edges together. The paper models discussed here expand on this idea (one or more wedges are added and/or removed). These models are fiat everywhere, except at the "cone points," so the geodasics are locally straight lines in a natured sense, Non-Euclidean "effects" are easily quantifiable using basic geometry, the Gauss-Bonnet theorem im a naturally intuitive concept, and the connection between hyperbolic and elliptic geometry and curvature is clearly seen.
Understanding expression simplification
Authors: Jacques Carette
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We give the first formal definition of the concept of simplification for general expressions in the context of Computer Algebra Systems. The main mathematical tool is an adaptation of the theory of Minimum Description Length, which is closely related to various theories of complexity, such as Kolmogorov Complexity and Algorithmic Information Theory. In particular, we show how this theory can justify the use of various "magic constants" for deciding between some equivalent representations of an expression, as found in implementations of simplification routines.
Supporting multiple information-seeking strategies in a single system framework (abstract only)
Authors: Xiaojun Yuan
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This research explores the relationship between information-seeking strategies (ISSs) and information retrieval (IR) system design. When people seek information they engage in a variety of ISSs in order to search for specific items, learn about the contents of the database, evaluate retrieved information, and so on.The theoretical foundations of the work are based on the information-seeking episode model developed by Belkin (1996), and the multi-facet classification scheme of information behaviors proposed by Cool & Belkin (2002).The goal of this research is to construct and evaluate an interactive retrieval system which uses different combinations of IR techniques to support different ISSs. Example IR techniques include comparison using exact and probabilistic matching algorithms; summarization of information objects using titles, snippets or abstracts; visualization techniques such as lists or classified results; and navigation techniques such as scrolling or following links. By designing a retrieval system with diverse strategies in mind, we can adaptively support multiple ISSs, permitting a user to move seamlessly from one strategy to another, choosing instantiations of each support technique tailored to the specific ISS.The research will be conducted in a series of four steps. (1) Develop an object-oriented framework for representing basic IR techniques. (2) Design, implement and evaluate systems which support individual ISSs such as browsing and searching. (3) Specify an interaction structure for guiding and controlling sequences of different supporting techniques.(4) Design, implement, and evaluate a dynamically adaptive system supporting multiple ISSs in comparison to a non-adaptive baseline system.
Processes for Producing Secure Software: Summary of US National Cybersecurity Summit Subgroup Report
Authors: Noopur Davis, Watts Humphrey, Samuel T. Redwine Jr., Gerlinde Zibulski, Gary McGraw
Venue: IEEE Security and Privacy (2004)

This report summarizes work initiated at the National Cybersecurity Summit, held 2-3 December 2003 in Santa Clara, California. Attendees representing industry, academia, and the US Department of Homeland Security (DHS) formed five task forces to focus on specific topic areas. This report describes the key problems and recommendations identified by the Software Process subgroup of the "Security across the Software Development Lifecycle" task force.
Semantic video classification by integrating unlabeled samples for classifier training
Authors: Jianping Fan, Hangzai Luo
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Semantic video classification has become an active research topic to enable more effective video retrieval and knowledge discovery from large-scale video databases. However, most existing techniques for classifier training require a large number of hand-labeled samples to learn correctly. To address this problem, we have proposed a semi-supervised framework to achieve incremental classifier training by integrating a limited number of labeled samples with a large number of unlabeled samples. Specifically, this emi-supervised framework includes: (a) Modeling the semantic video concepts by using the finite mixture models to approximate the class distributions of the relevant salient objects; (b) Developing an adaptive EM algorithm to integrate the unlabeled samples to achieve parameter estimation and model selection simultaneously; The experimental results in a certain domain of medical videos are also provided.
Program quality with pair programming in CS1
Authors: Brian Hanks, Charlie McDowell, David Draper, Milovan Krnjajic
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Prior research on pair programming has found that compared to students who work alone, students who pair have shown increased confidence in their work, greater success in CS1, and greater retention in computer-related majors. In these earlier studies, pairing and solo students were not given the same programming assignments. This paper reports on a study in which this factor was controlled by giving the same programming assignments to pairing and solo students. We found that pairing students were more likely to turn in working programs, and these programs correctly implemented more required features. Our findings were mixed when we looked at some standard complexity measures of programs. An unexpected but significant finding was that pairing students were more likely to submit solutions to their programming assignments.
Optimal shape design in biomimetics based on homogenization and adaptivity
Authors: Ronald H. W. Hoppe, Svetozara I. Petrova
Venue: Mathematics and Computers in Simulation (2004)

Optimal shape design of microstructured materials has recently attracted a great deal of attention in materials science. The shape and the topology of the microstructure have a significant impact on the macroscopic properties. The paper is devoted to the shape optimization of new biomorphic microcellular silicon carbide ceramics produced from natural wood by biotemplating. This is a novel technology in the field of biomimetics which features a material synthesis from biologically grown materials into ceramic composites by fast high-temperature processing. We are interested in finding the best material-and-shape combination in order to achieve the optimal prespecified performance of the composite material. The computation of the effective material properties is carried out using the homogenization method. Adaptive mesh-refinement technique based on the computation of recovered stresses is applied in the microstructure to find the homogenized elasticity coefficients. Numerical results show the reliability of the implemented a posteriori error estimators.
A Hybrid Reality Environment and its Application to Earthquake Engineering
Authors: Tara C. Hutchinson, Falko Kuester, Tung-Ju Hsieh, Rebecca Chadwick
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

In this paper, an interactive 2D and 3D (hybrid) environment, which facilitates collaborative learning and research and utilizes techniques in visualization and VR, isdescribed. The new environment incorporates both a specially designed lecture room and laboratory integrating both 2- and 3-dimensional spatial learning by coupling a series ofinteractive projection display boards (touch sensitive whiteboards) and a semi-immersive 3D wall display. The hardware architecture designed for this new hybrid environmentas well as an initial application within the environment tothe study of a case history building subjected to a variety ofearthquakes are discussed in the paper.
Web Services Composition, Execution and Visualization
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

This paper presents a novel technique and a tool to Webservice composition, execution and visualization. Web services composition refers to the act of interconnecting multiple elementary (or other composite) Web services, in orderto create value-added functionality for customers. Graphical tools allow developers to define and create business processes on a lnplug and playlg basis. Runtime visualization ofa business process enables the developers to understand theprocess and if necessary intervene in the process.
Competitive deadline scheduling via additional or faster processors
Authors: Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
Venue: Journal of Scheduling (2003)

This paper studies on-line scheduling in a single-processor system that allows preemption. The aim is to maximize the total value of jobs completed by their deadlines. It is known that if the on-line scheduler is given a processor faster (say, two times faster) than the off-line scheduler, then there exists an on-line algorithm called SLACKER that can achieve an O(1) competitive ratio. In this paper, we show that using additional unit-speed processors instead of a faster processor is a possible but not cost effective way to achieve an O(1) competitive ratio. Specifically, we find that-zTheta;(log k) unit-speed processors are required, where k is the importance ratio. Another contribution of this paper is an improved analysis of the competitiveness of SLACKER; this new analysis enables us to show that SLACKER, when exteaded to multi-processor systems, can still guarantee an O(1) competitive ratio.
A Scalable Application-Specific Processor Synthesis Methodology
Authors: Fei Sun, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Custom processors based on application-specific ordomain-specific instruction sets are gaining popularity, and areoften used to implement critical architectural blocks in complex system-on-chips. While several advances have been madein custom processor architectures, tools, and design methodologies, designers are still required to manually perform somecritical tasks, such as selection of the custom instructions bestsuited to the given application and design constraints.We present a scalable methodology for the synthesis of acustom processor from an embedded software program. A keyfeature of the proposed methodology is its scalability, whichis achieved by exploiting the structured, hierarchical natureof large software programs. We motivate the need for such amethodology, and describe the algorithms used for the criticalsteps, including hardware resource budgeting, local optimizations, and global exploration. Our methodology utilizes the concept of "soft" instruction templates, which can be adapted by adding operations to them or deleting operations from them at any time during the design space exploration process, allowing for global design decisions to be interleaved with fine-grained optimizations.We have integrated our methodology in an open source compiler, and verified it using a commercial extensible processor. Experiments with several benchmarks indicate that ourmethodology can effectively tackle large programs. It resultedin the synthesis of high-quality custom processors that demonstrated an average speedup of 2.61X and a maximum speedupof 6.32X. The CPU times required for custom processor synthesis were quite small, indicating that the proposed techniquescan be applied to embedded software programs of significantcomplexity.
Stabilized spectral element computations of high Reynolds number incompressible flows
Authors: Chuanju Xu, Richard Pasquetti
Venue: Journal of Computational Physics (2004)

The possibility of using the spectral vanishing viscosity method for the spectral element computation of high Reynolds number incompressible flows is investigated. An exponentially accurate stabilized formulation is proposed and then applied to the computation of the 2D wake of a cylinder. Such a formulation call be easily implemented in existing spectral element solvers, since only modifying the computation of the viscous term while preserving the symmetry of the corresponding bilinear form.