ppxscal/embedding_network huggingface dataset:
Lure of molecular electronics: from molecular switches to distributed molecular information processing media
Authors: Nicholas G. Rambidi
Venue: Microelectronic Engineering (2003)

There are two main directions in the development of devices for molecular information processing. The first includes attempts to elaborate molecular scale primitive elements such as molecular rectifiers, molecular switches and other devices. The most remarkable examples in this direction are the chiropticene molecular switch, protein-based associative processors and volumetric memories. The second direction is based on the concept of distributed molecular (chemical) information processing media. Chemical reaction-diffusion media represent information effective processing means capable of solving problems of high computational complexity. The distributed character and complex nonlinear dynamics of chemical reactions inherent in the media are the basis of high parallelism and complex logical operations carried out by the media as primitives. Photo-sensitive catalysts of the media reactions enable easy input of initial data, output of computational results and control of the dynamics (modes of functioning) of the media. It was found during the last decade that chemical reaction-diffusion media can be used effectively for image processing, finding the shortest paths in a labyrinth and solving some other problems of high computational complexity. Detailed analysis showed that designing a media with a multilevel architecture and suitable for performing evolutionary computations can be a promising way for further development of reaction-diffusion based devices.
Soft-Error Detection Using Control Flow Assertions
Authors: O. Goloubeva, M. Rebaudengo, M. Sonza Reorda, M. Violante
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Over the last years, an increasing number of safety-critical tasks have been demanded tocomputer systems. In this paper, a software-based approach for developing safety-criticalapplications is analyzed. The technique is based on the introduction of additional executableassertions to check the correct execution of the program control flow. By applying the proposed technique, several benchmark applications have been hardened against transienterrors. Fault Injection campaigns have been performed to evaluate the fault detection capability of the proposed technique in comparison with state-of-the-art alternative assertion-based methods. Experimental results show that the proposed approach is far more effective than the other considered techniques in terms of fault detection capability, at the cost of a limited increase in memory requirements and in performance overhead.
Scheme-based web programming as a basis for a CS0 curriculum
Authors: Timothy J. Hickey
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The thesis of this paper is that Scheme-based web programming is a worthy organizing topic for CS0 computer literacy courses. We describe an approach to introducing non-science majors to Computer Science by teaching them to write webpages using HTML and CSS and to also write applets and servlets using Scheme. The programming component of our approach is completed in about nine weeks of a thirteen week course, leaving time for a treatment of more traditional CS0 topics such as intellectual property, privacy, artificial intelligence, the limits of computability, PC architecture, Operating Systems, CMOS and logic circuits. We argue that the use of a high level scripting language (like Scheme) is essential to the success of this approach. We also argue that wide scale success in teaching web programming to non-majors could enhance the students productivity when they enter the job market, and hence this approach deserves further study.
Reflections on Operating in Hostile Environments
Authors: Anil Bazaz, James D. Arthur, Randolph Marchany
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

We introduce a generally applicable framework to assess and substantiate the security of a software component of a computer system. The framework constitutes a meta-model. Security models can be derived from it for components of a computer system. The concept of trust is interwoven into the meta-model and is an integral part of derived security models.
The Impact of Free-Riding on Peer-to-Peer Networks
Authors: Ramayya Krishnan, Michael D. Smith, Zhulei Tang, Rahul Telang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Peer-to-Peer networking is gaining popularity as a architecture for sharing information goods and other computing resources. However, these networks suffer from a high level of free-riding, whereby some users consume network resources without providing any network resources. The high levels of free-riding observed by several recent studies have led some tosuggest the imminent collapse of these communities as a viable information sharing mechanism.Our research develops analytic models to analyze the behavior of P2P networks in thepresence of free-riding. In contrast to previous predictions, we find that P2P networks can operate effectively in the presence of significant free-riding. However, we also show that without external incentives, the level of free-riding in P2P networks will be higher than sociallyoptimal. Our research also explores the implications of these findings for entrepreneurs, network designers, and copyright holders.
How to Test Software for Optimal Software Reliability Assessment
Authors: Kai-Yuan Cai, Yong-Chao Li, Ke Liu
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The controlled Markov chains (CMC) approach tosoftware testing models the software under test as acontrolled Markov chain and treats it as a controlledobject. It treats software testing strategy as thecorresponding controller. Our previous work has shownthat the CMC approach is applicable to dealing with thesoftware testing problem for optimal software reliabilitygrowth. In this paper we show that software reliabilityassessment can be treated as an adaptive control problemand the CMC approach is also applicable to dealing withthe optimal software testing problem for softwarereliability assessment. The work presented in this paper isa contribution to the new area of software cyberneticsthat explores the interplay between software and control.
Towards an Ecology of Inter-Organizational Routines: A Conceptual Framework for the Analysis of Net-Enabled Organizations
Authors: Brian T. Pentland
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This paper argues that the adoption of "net" technology by "net-enabled" firms can be viewed as a population or network level phenomenon, rather than a firm level phenomenon. Using organizational ecology as a starting point, this paper outlines a framework for studying the ecology of inter-organizational routines. The paper defines key concepts and outlines some possibilities for applying this framework in empirical research. The framework emphasizes the role of network structure, technological interdependencies, and institutional factors (e.g., legitimation) in the long-run dynamics of technological change.
The game of set®: an ideal example for introducing polymorphism and design patterns
Authors: Stuart Hansen
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This paper presents an object--oriented design for a solitaire version of the game of Set® The design is responsibility driven and illustrates polymorphism and several fundamental design patterns, including Flyweight, Strategy and Factory. It introduces each of these to solve particular problems within the design. The direct application of these concepts and the interest our students show in the game make Set an ideal example for classroom discussions and assignments.
Towards modeling individual and collaborative construction of jigsaws using task knowledge structures (TKS)
Authors: Hilary Johnson, Joanne Hyde
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2003)

Recent years have seen an overwhelming interest in how people work together as a group. Both the nature of collaboration and research into how people collaborate is complex and multifaceted, with different research agendas, types of studies, and variations in the behavioral data collected. A better understanding of collaboration is needed in order to be able to make contributions to the design of systems to support collaboration and collaborative tasks. In this article, we combine relevant literature, past research, and a small-scale empirical study of two people individually and collaboratively constructing jigsaws. The objective is to make progress towards the goal of generating extensions to an existing task modeling approach, Task Knowledge Structures. The research described has enabled us to generate requirements for approaches to modeling collaborative tasks and also a set of requirements to be taken into account in the design of a computer-based collaborative virtual jigsaw.
Numerical modelling of the two-dimensional Fourier transformed Vlasov-Maxwell system
Authors: Bengt Eliasson
Venue: Journal of Computational Physics (2003)

The two-dimensional Vlasov-Maxwell system, for a plasma with mobile, magnetised electrons and ions, is investigated numerically. A previously developed method for solving the two-dimensional electrostatic Vlasov equation, Fourier transformed in velocity space, for mobile electrons and with ions fixed in space, is generalised to the fully electromagnetic, two-dimensional Vlasov-Maxwell system for mobile electrons and ions. Special attention is paid to the conservation of the divergences of the electric and magnetic fields in the Maxwell equations. The Maxwell equations are rewritten, by means of the Lorentz potentials, in a form which conserves these divergences. Linear phenomena are investigated numerically and compared with theory and with previous numerical results.
Hierarchical and predictive design techniques for improving qos and performance in modern wired and wireless networks
Authors: Wei Cui
Venue:  (2003)

In this dissertation, we first propose and evaluate a hierarchical totally mobile wireless architecture (HTMWA) that combines the advantages of the ad-hoc and the cellular models. Our tests have shown that when the total number of channels is kept the same, the two-tier system outperformed the one-tier counterpart under all load conditions. Under the constraint of equal power consumption, the two-tier system still achieved improvement over the one-tier system, especially at light and medium load levels. We introduced load balancing schemes based on the concept of reversible handoffs and analyzed the resulting performance improvement. We also investigated different channel splitting schemes that aim at optimizing the distribution of the limited spectrum resources among the mobile routers in the two tiers of the hierarchy. An analytical model to compute the new call and handoff blocking probabilities in a two-tier HTMWA has been developed and validated. To enhance the survivability of HTMWA, we developed and evaluated several recovery protocols to deal with the loss of mobile routers. We conclude the dissertation by proposing and evaluating a new linear traffic predictor that can be used for dynamically resizing the bandwidth of VPN (virtual private network) links. We present the results of extensive performance comparisons of three known predictors: Gaussian, ARMA (auto-regressive moving average) and fARIMA (fractional auto-regressive integrated moving average). Our tests have shown that the simple Gaussian predictor with higher mean square error (MSE) often outperforms the ARMA and fARIMA predictors with lower MSEs. Guided by our performance tests, we developed a new predictor for link resizing: L-PREDEC (linear predictor with dynamic error compensation). Our performance tests have shown that L-PREDEC works better than Gaussian, ARAM and fARIMA in terms of the three metrics listed above. Finally, we investigated how to choose the best L-PREDEC refitting period for non-stationary long traffic traces. We showed that the optimal refitting period should be long enough to smooth out local burstiness and short enough to filter out the long-term changes (trend and seasonality) in the traffic rate.
Statistical transliteration for english-arabic cross language information retrieval
Authors: Nasreen AbdulJaleel, Leah S. Larkey
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Out of vocabulary (OOV) words are problematic for cross language information retrieval. One way to deal with OOV words when the two languages have different alphabets, is to transliterate the unknown words, that is, to render them in the orthography of the second language. In the present study, we present a simple statistical technique to train an English to Arabic transliteration model from pairs of names. We call this a selected n-gram model because a two-stage training procedure first learns which n-gram segments should be added to the unigram inventory for the source language, and then a second stage learns the translation model over this inventory. This technique requires no heuristics or linguistic knowledge of either language. We evaluate the statistically-trained model and a simpler hand-crafted model on a test set of named entities from the Arabic AFP corpus and demonstrate that they perform better than two online translation sources. We also explore the effectiveness of these systems on the TREC 2002 cross language IR task. We find that transliteration either of OOV named entities or of all OOV words is an effective approach for cross language IR.
On varieties and covarieties in a category
Authors: Ji&rbreve;í Adámek, Hans-E. Porst
Venue: Mathematical Structures in Computer Science (2003)

A concept of equation morphism is introduced for every endofuctor $F$ of a cocomplete category $\Ce$. Equationally defined classes of $F$-algebras for which free algebras exist are called varieties. Every variety is proved to be monadic over $\Ce$, and, conversely, every monadic category is equivalent to a variety. The Birkhoff Variety Theorem is also proved for $`{\sf Set}\hbox{-like}'$ categories.By dualising, we arrive at a concept of coequation such that covarieties, that is, coequationally specified classes of coalgebras with cofree objects, correspond precisely to comonadic categories. Natural examples of covarieties are presented.
The affine equivariant sign covariance matrix: asymptotic behavior and efficiencies
Authors: Esa Ollila, Hannu Oja, Christophe Croux
Venue: Journal of Multivariate Analysis (2003)

We consider the affine equivariant sign covariance matrix (SCM) introduced by Visuri et al. (J. Statist. Plann. Inference 91 (2000) 557). The population SCM is shown to be proportional to the inverse of the regular covariance matrix. The eigenvectors and standardized eigenvalues of the covariance matrix can thus be derived from the SCM. We also construct an estimate of the covariance and correlation matrix based on the SCM. The influence functions and limiting distributions of the SCM and its eigenvectors and eigenvalues are found. Limiting efficiencies are given in multivariate normal and t-distribution cases. The estimates are highly efficient in the multivariate normal case and perform better than estimates based on the sample covariance matrix for heavy-tailed distributions. Simulations confirmed these findings for finite-sample efficiencies.
Computational models for protein structure analysis and protein-ligand binding
Authors: Douglas Brutlag
Venue:  (2003)

With the advent of structural genomics and the rapid growth of the protein structure database, computational studies of protein structures have grown increasingly important as a means to investigate the relationship between structure and function. This dissertation contributes to the study of protein structure and function by presenting computational models for the comparison and classification of protein structures and the analysis of protein-ligand interactions. We present two different algorithms for quantitatively comparing protein structures by computing an optimal correspondence between atomic coordinates from two structures. Our first technique, LOCK, computes accurate structural alignments by using secondary structure vectors to generate an initial alignment and then performing a detailed alignment of core C-&alpha; atoms. Our second technique, 3dSearch, is optimized for speed and computes approximate secondary structure alignments using geometric hashing. Our evaluation results show that LOCK is able to identify global and local structural similarities with high sensitivity and specificity and is an order of magnitude faster than other C-&alpha; level alignment techniques. We use the alignment scores generated by LOCK to hierarchically classify a representative subset of protein structures. Our classification scheme, PClass, improves on other automated structural classifications by generating annotations at each internal node of the tree. Our evaluation results show that PClass is able to capture approximately 80% of the structural relationships in the scop tree. We present a novel motion planning approach to efficiently model flexible ligand interactions at the catalytic site of a protein. Our roadmap-based motion planning model examines the distribution of all energetically favorable paths to the catalytic site and computes a weight for each path. We show that our model is able to detect the presence of a distinct energy barrier around the binding site and that this barrier can be used to distinguish the catalytic site from other potential binding sites. We also present a comprehensive evaluation system for empirically measuring the accuracy of roadmap-based models of molecular motion. We use this system to perform a series of statistical experiments to study the effect of seven specific roadmap parameters on the accuracy of the roadmap.
Probabilistic Memory-Based Collaborative Filtering
Authors: Kai Yu, Anton Schwaighofer, Volker Tresp, Xiaowei Xu, Hans-Peter Kriegel
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Memory-based collaborative filtering (CF) has been studied extensively in the literature and has proven to be successful in various types of personalized recommender systems. In this paper, we develop a probabilistic framework for memory-based CF (PMCF). While this framework has clear links with classical memory-based CF, it allows us to find principled solutions to known problems of CF-based recommender systems. In particular, we show that a probabilistic active learning method can be used to actively query the user, thereby solving the ¿new user problem.¿ Furthermore, the probabilistic framework allows us to reduce the computational cost of memory-based CF by working on a carefully selected subset of user profiles, while retaining high accuracy. We report experimental results based on two real-world data sets, which demonstrate that our proposed PMCF framework allows an accurate and efficient prediction of user preferences.
Usability & human behavior analysis through real-time performance data
Authors: Ronald J. Glotzbach, Nishant Kothary
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

Current usability testing trends involve collection of data that often lacks objectivity in the context of a testing sample (Dumas & Redish, 1999). Usability and heuristic analysis are performed on samples that are often statistically unacceptable as they are characterized by subject opinions and moods. In addition, usability studies and statistical analyses are typically accompanied by the substantial overhead of time constraints and data-collection issues. Through this Web statistical data collection application, we introduce the concept of performance data that can be collected in real-time. The Flash.NET application presented herein captures user information in real-time and sends the information to an ASP.NET application residing on the server through Flash Remoting MX, at which point the data is stored into SQL Server until the ASP.NET application is prepared to perform statistical analysis on the acquired data. The information produced from this study not only provides a framework for future usability analyses, but also a framework for predictors of human behavior in the field of computer graphics.
Modeling and Validating Globally Asynchronous Design in Synchronous Frameworks
Authors: Mohammad Reza Mousavi, Paul Le Guernic, Jean-Pierre Talpin, Sandeep Kumar Shukla, Twan Basten
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We lay a foundation for modeling and validation of asynchronous designs in a multi-clock synchronous programming model. This allows us to study properties of globally asynchronous systems using synchronous simulation and model-checking toolkits. Our approach can be summarized as automatic transformation of a design consisting of two asynchronously composed synchronous components into a fully synchronous multi-clock model preservingbehavioral equivalence. The ultimate goal of this research is to provide the ability to model and build GALS systems in a fully synchronous design framework and deploy it on an asynchronous network preserving all properties of the system proven in the synchronous framework.
Rank estimation in reduced-rank regression
Authors: Efstathia Bura, R. Dennis Cook
Venue: Journal of Multivariate Analysis (2003)

Reduced rank regression assumes that the coefficient matrix in a multivariate regression model is not of full rank. The unknown rank is traditionally estimated under the assumption of normal responses. We derive an asymptotic test for the rank that only requires the response vector have finite second moments. The test is extended to the nonconstant covariance case. Linear combinations of the components of the predictor vector that are estimated to be significant for modelling the responses are obtained.
Using Design Pattern to Develop the Quality MSC Simulator Software in Performance Test for GSM and GPRS system
Authors: Yunshan Ge
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Design pattern is a solution in the structured formatdescribing the problem and solution that can be applied inthe new background. Global System for MobileCommunication (GSM) and General Packet RadioService(GPRS) are such backgrounds and they all needgood MSC simulator software to guarantee the quality ofperformance test for the system. This paper introduces themethod to develop the simulator software using severaldesign patters for MSC performance test in GSM andGPRS system. The usage of these patterns in the software isalso depicted in detail, especially in the aspect ofObject-Oriented Design. From this paper, we can see thatit is economic to achieve quality software by using designpattern, which will make the MSC performance test moreefficiently and economically. So this paper is hopeful tobenefit the other systems which need develop the softwarewith good quality and efficiently.