ppxscal/embedding_network huggingface dataset:
The NOMADS Republic - A Case for Ambient Service Oriented Computing
Authors: Miroslaw Malek
Venue: Proceedings of the IEEE International Workshop (2005)

The NOMADS Republic is the largest nation on earth. It boasts several billions of citizens already, and depending on how one counts, its population may grow from 20 billion to about a trillion citizens at the end of this decade. The NOMADS Republic has no borders and its growth cannot be stopped. Anyone or anything who/that has an ID, be it a passport or a telephone number, an IP address or a product number, when connected, may become a citizen of the NOMADS Republic such as the people, the infrastructure and embedded systems (sensors and actuators including electromechanical systems such as robots). The goal of NOMADS (Networks of Mobile Adaptive Dependable Systems) infrastructure is to provide low cost, dependable and adaptive connectivity to support mobility, billing and other basic functionality and services desired by clients and service providers including services composability. The NOMADS infrastructure is ubiquitous but rarely pervasive, it is autonomic and proactive and supports humans without technological aggression, trying to hide or embed technical aspects. The implementation of composable service-oriented paradigm across all types of systems is one of the key challenges in order to achieve the software reuse and ease-of-use by creating an ambient computing environment. The paper includes a concept of the NOMADS Republic, its societal model and a description of the service oriented architecture of NOMADS infrastructure for cross-section of computing environments.
Integrated Loop Optimizations for Data Locality Enhancement of Tensor Contraction Expressions
Authors: Swarup Kumar Sahoo, Sriram Krishnamoorthy, Rajkiran Panuganti, P. Sadayappan
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem in the context of optimizing a sequence of tensor contractions. The pertinent loop transformations are loop permutation, tiling, and fusion; in addition, the placement of disk I/O statements crucially affects performance. The space of possible combinations is exponentially large. We develop novel pruning strategies whereby a search problem in a larger space is replaced by a large number of searches in a much smaller space, to determine the optimal permutation, fusion, tiling and placement of disk I/O statements. Experimental results show that we obtain an improvement in I/O cost by a factor of up to 2.6 over an equi-tile-size approach.
Performance Variability and Project Dynamics
Authors: Bernardo A. Huberman, Dennis M. Wilkinson
Venue: Computational Mathematical Organization Theory (2005)

We present a dynamical model of complex cooperative projects such as large engineering design or software development efforts, comprised of concurrent and interrelated tasks. The model contains a stochastic component to account for temporal fluctuations both in task performance and in the interactions between related tasks. We show that as the system size increases, so does the average completion time. Also, for fixed system size, the dynamics of individual project realizations can exhibit large deviations from the average when fluctuations increase past a threshold, causing long delays in completion times. These effects are in agreement with empirical observation. We also show that the negative effects of both large groups and long delays caused by fluctuations may be mitigated by arranging projects in a hierarchical or modular structure. Our model is applicable to any arrangement of interdependent tasks, providing an analytical prediction for the average completion time as well as a numerical threshold for the fluctuation strength beyond which long delays are likely. In conjunction with previous modeling techniques, it thus provides managers with a predictive tool to be used in the design of a project's architecture.
Function-defined shape metamorphoses in VRML
Authors: Qi Liu, Alexei Sourin
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

In this paper we propose FVRML---a function-based extension of Virtual Reality Modeling Language which allows for time-dependent shape modeling on the web. Shape's geometry, 3D texture, color and transformations changing through time can be defined with analytical functions typed straight in VRML code. FVRML allows us to greatly extend the abilities of VRML with a very intuitive approach to shape modeling based on using analytical functions. Several functions can be combined into one using java scripts emulated in FVRML, which allows for even greater flexibility and convenience of shape modeling.
Seven Pernicious Kingdoms: A Taxonomy of Software Security Errors
Authors: Katrina Tsipenyuk, Brian Chess, Gary McGraw
Venue: IEEE Security and Privacy (2005)

Taxonomies can help software developers and security practitioners understand the common coding mistakes that affect security. The goal is to help developers avoid making these mistakes and more readily identify security problems whenever possible. Because developers today are by and large unaware of the security problems they can (unknowingly) introduce into code, a taxonomy of coding errors should provide a real tangible benefit to the software security community.
Information System for Evaluations of COTS
Authors: Raphael Michel, Philippe Roose, Franck Barbier
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The lack of information for COTS evaluation may results on a bad evaluation and so has important consequences into a the final product. The results are mostly traduced by a strong increasing of integration costs. That's why we focus on this crucial point for evaluations of COTS.
On Characterization and Discovery of Minimal Unexpected Patterns in Rule Discovery
Authors: Balaji Padmanabhan, Alexander Tuzhilin
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

A drawback of traditional data-mining methods is that they do not leverage prior knowledge of users. In prior work, we proposed a method that could discover unexpected patterns in data by using domain knowledge in a systematic manner. In this paper, we present new methods for discovering a minimal set of unexpected patterns by combining the two independent concepts of minimality and unexpectedness, both of which have been well-studied in the KDD literature. We demonstrate the strengths of this approach experimentally using a case study in a marketing domain.
Computer Aided Analysis of Dental Radiographic Images
Authors: Aliaa A. A. Youssif, Morshed U. Chowdhury, Sid Ray
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper is a result of a fruitful cooperation between the computer science and the dental diagnosis experiences. The study presents a new approach of applying computer algorithms to radiographic images of dental implantation used for bone regeneration. We focus here only on the contribution of the computer assistance to the clinical research as the periodontal therapy is beyond the scope of this paper. The proposed system is based on a pattern recognition approach, directed to recognize density changes in the intra-bony affected areas of patients. It comprises different modules with new algorithms specially designed to treat the patients' radiographic images more accurately. The system includes digitizing, detecting the complicated region of interest (ROI), defining reference area to correct any projection discrepancy of the follow up images, and finally to extract the distinguishing features of the ROI as a basis for determining the rate of new bone density accumulation. This study is applied to two typical dental cases for a patient who received two different operations. The results are very encouraging and more accurate than traditional techniques reported before.
Proposal of a Multi-layer Structure for Multilingual Display on a Lumisight Table
Authors: Takashi Yoshino, Mitsunori Matsushita, Jun Munemori
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

The goal of our research is to support face-to-face discussion performed by participants with differing languages. To support such a discussion, the Lumisight Table, which can provide different information simultaneously on a single screen, has been proposed. We have developed a multilingual face-to-face idea generation support system on a Lumisight Table. The advantage of the use of the multilingual function is to display the correct direction and in the participant's native language. Each user seated around a table can see a similar image but characters in the images are rotated to each user's direction. However, we found other problems in multilingual input and display. To solve the problem, we propose a concept of multi-layer structure on Lumisight Table.
Orthogonal Neighborhood Preserving Projections
Authors: E. Kokiopoulou, Y. Saad
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the data samples and the global geometry. The proposed technique constructs a weighted data graph where the weights are constructed in a data-driven fashion, similarly to Locally Linear Embedding (LLE). A major difference with the standard LLE where the mapping between the input and the reduced spaces is implicit, is that ONPP employs an explicit linear mapping between the two. As a result, and in contrast with LLE, handling new data samples becomes straightforward, as this amounts to a simple linear transformation. ONPP shares some of the properties of Locality Preserving Projections (LPP). Both ONPP and LPP rely on a k-nearest neighbor graph in order to capture the data topology. However, our algorithm inherits the characteristics of LLE in preserving the structure of local neighborhoods, while LPP aims at preserving only locality without specifically aiming at preserving the geometric structure. This feature makes ONPP an effective method for data visualization. We provide ample experimental evidence to demonstrate the advantageous characteristics of ONPP, using well known synthetic test cases as well as real life data from computational biology and computer vision.
Securing Spontaneous Communications inWireless Pervasive Computing Environments
Authors: Dongwan Shin
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Spontaneous communications for either personal or shared activities are becoming very common in wireless pervasive computing environments. However, there still remain challenging problems in this type of communications, especially their security over ad-hoc wireless channels. In this paper we present an approach to using a visual code system in order to establish secure spontaneous communications among wireless devices in pervasive computing environments. After briefly discussing the visual code system, we describe two distinct models of spontaneous communications, and then discuss how the visual code system can be leveraged in order to secure spontaneous communications in those models. We also demonstrate our approach through a proof-of-concept implementation.
Simulation documents available: from NTIS
Authors: Tuncer I. Oren
Venue: ACM SIGSIM Simulation Digest (1975)

The NTIS (National Technical Information Service) collection includes (i) Government-sponsored research and development reports, (ii) Government analyses prepared by Federal agencies, their contractors or grantees, (iii) Federally sponsored translations, and (iv) some reports written in foreign languages. The NTIS reports exist in paper copy or in microfiche unless otherwise specified and are available indefinitely. To order the documents contact: NTIS, P.O. Box 1552, Springfield, Virginia 22151.
Protein Interaction Inference as a MAX-SAT Problem
Authors: Ya Zhang, Hongyuan Zha, Chao-Hisen Chu, Xiang Ji
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Discovering interacting proteins is essential for understanding protein functions. However, high throughput interaction data are inherently noisy and only cover a small portion of the whole interactome. Domains, the building block of proteins, are believed to be responsible for the interactions among proteins. An abstract representation of interactome is achieved at domain level and this representation also facilitates the discovery of unobserved proteinprotein interactions. Many domain-based approaches have been proposed to predict protein-protein interactions and promising results have been obtained. Existing methods generally assume that domain interactions are independent of each other for the convenience of computational modeling. In this paper, a new framework of learning is proposed. The framework makes no assumption about domain interactions and consider protein interactions resulting from multiple domain interactions which may be dependent of each other. With a conjunctive normal form representation of the relationship between protein interactions and domain interactions, the problem of interaction inference is modeled as a constraint satis?ability problem and solved via linear programming. Experimental results on a combined yeast data set have demonstrated the robustness of and the accuracy of the proposed algorithm.
What Icons Communicate
Authors: Mark Mitsock
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1994)

Communicating complex ideas within the limited space of an icon is one of the most challenging tasks for user interface designers. Horton's book provides a variety of tools to make this task easier and as a result, is likely to achieve the same status as a standard reference for technical communicators as his Designing and Writing Online Documentation.
Affectionate Computing: Can We Fall in Love with a Machine?
Authors: Thecla Schiphorst
Venue: IEEE MultiMedia (2006)

This article addresses new ways of computer interaction beyond the known mouse and button paradigm. The author explores haptics as a means to pay attention to the self, and using this sense to connect with others.
Research on the Phenomenon of Software Drift in Software Processes
Authors: Yutao Ma, Jianxun Chen, Jianghua Wu
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

Software drift is a common phenomenon existing in software processes. Negative drift makes function, performance and even overall quality of a software product deviate from customers' expectations, which will bring about the loss to users and software organizations in succession. In this paper, software drift and its relevant concepts are defined initially. Then, an evolutional model of negative drift is presented, and detrimental effects of the model are also analyzed. How to analyze, measure, and control negative drift is an essential problem to be solved in software evolution. Eventually, we put forward a research framework to guide future work to measure and control negative drift for improving software processes.
Efficient association rule mining among infrequent items
Authors: Junfeng Ding
Venue:  (2005)

An efficient way is developed to find the valid association rules among the infrequent items, which is seldom mentioned by other researchers. A new disk-based data structure, called T&barbelow;ransactional C&barbelow;o-O&barbelow;ccurrence M&barbelow;atrix, in short TCOM, is designed to combine the advantages of both transactional oriented (horizontal) layout and item oriented (vertical) layout of the database. So any itemsets could be randomly accessed and counted without full scan of the original database or the TCOM, which significantly increases the efficiency of the algorithms. Then two similar compressed matrix structures that reside in the memory are constructed during the mining process based on TCOM for different applications. Both structures only contain the infrequent items and incorporate a forest-like structure. One of them is called R&barbelow;educed T&barbelow;ransactional C&barbelow;o-O&barbelow;ccurrence M&barbelow;atrix, in short RTCOM and is suitable for the applications such as mining large databases or on the machines with relative small memory space. By changing the status of the RTCOM, with a little more memory space required, the infrequent patterns and the valid association rules among infrequent items can be mined out. Another compressed structure is a variant of RTCOM which is called S&barbelow;imple T&barbelow;ransactional C&barbelow;o-O&barbelow;ccurrence M&barbelow;atrix, in short SiTCOM. The codes that we develop on this structure generally consume more memory space but definitely are more efficient. So SiTcom is suitable for the machines with large memory space. Both RTCOM and SiTcom, with a little change of the algorithms, are also suitable for solving frequency association rule mining problem.
Optimal Size of a Feedforward Neural Network: How Much does it Matter?
Authors: Lipo Wang, Hou Chai Quek, Keng Hoe Tee, Nina Zhou, Chunru Wan
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In this paper, we attempt to answer the following question with systematic computer simulations: for the same validation error rate, does the size of a feedforward neural network matter? This is related to the so-called Occam's Razor, that is, with all things being equal, the simplest solution is likely to work the best. Our simulation results indicate that for the same validation error rate, smaller networks do not tend to work better than larger networks, that is, Occam's Razor does not seem to apply to feedforward neural networks. In fact, our results show no trend between network size and performance for a given validation error.
Application of high-K gate dielectrics and metal gate electrodes to enable silicon and non-silicon logic nanotechnology
Authors: Robert Chau, Justin Brask, Suman Datta, Gilbert Dewey, Mark Doczy, Brian Doyle, Jack Kavalieros, Ben Jin, Matthew Metz, Amlan Majumdar, Marko Radosavljevic
Venue: Microelectronic Engineering (2005)

High-k gate dielectrics and metal gate electrodes are required for enabling continued equivalent gate oxide thickness scaling, and hence high performance, and for controlling gate oxide leakage for both future silicon and emerging nonsilicon nanoelectronic transistors. In addition, high-K gate dielectrics and metal gates are required for the successful demonstration of high performance logic transistors on high-mobility non-silicon substrates with high iON/iOFF ratios.
Review of "Sample Size Choice: Charts for Experiments with Linear Models, by Robert E. Odeh and Martin Fox", Marcel Dekker, 1975
Venue: ACM SIGSIM Simulation Digest (1976)

When designing experiments intended for testing statistical hypothesis, one should consider both the desired level of significance and the desired power of the test. Generally, both of these can be controlled by the size of n. Sounds familiar? How long a run do we need in a simulation experiment? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Reliability Concerns in Embedded System Designs
Authors: Vijaykrishnan Narayanan, Yuan Xie
Venue: Computer (2006)

Designing a dependable embedded system atop a less reliable hardware platform poses great challenges.
A New Trust Model for PKI Interoperability
Authors: Zheng Guo, Tohru Okuyama, Marion R. Jr. Finley
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The rapid deployment of the Internet over the last fifteen years has witnessed the birth of a number of serious security issues. In the case of e-commerce and e-government, security issues are of great concern due to the need for a high level of confidentiality in the information that is exchanged between business and governmental bodies as well as a high level of confidence or trust that in the processes of exchange. One approach to guaranteeing security in these cases is the public encryption key infrastructure or PKI. Basically, a PKI provides a structure of trust among its users or principals. PKI has become the object of international attention and much has been done to realize national and international standards for PKI, for example X.509. There are, however, serious PKI implementation issues as different countries and different organizations may adopt different security policies and implementations. This raises the question of interoperability between these various implementations, especially in such a way as to create a global trust domain. In this paper, the authors propose a new construct, a ring configuration of specialized Certification Authorities (CA's) called "Gateway Certification Authorities (GWCA's)," as a solution to the general PKI interoperability problem.
Fine-Granularity Access Control in 3-Tier Laboratory Information Systems
Authors: Xueli Li, Nomair A. Naeem, Bettina Kemme
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Laboratory information systems (LIMS) are used in life science research to manage complex experiments. Since LIMS systems are often shared by different research groups, powerful access control is needed to allow different access rights to different records of the same table. Traditional access control models that define a permission as the right of a user/role to perform a specific operation on a specific object cannot handle the enormous amount of objects and user/roles. In this paper we propose an enhancement to role-based access control by introducing conditions that can be added to the traditional concept of permissions in order to keep the number of permissions small. Furthermore, we present an implementation of our access control model at the application programming level. Although access control is performed for every single database access, our solution completely separates access control from the application logic by using aspect-oriented programming. With this, access control can be integrated into a legacy 3-tier information system without changing the application programs.
Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions
Authors: Manuel Laguna, Rafael Martí
Venue: Journal of Global Optimization (2005)

Scatter search is an evolutionary method that, unlike genetic algorithms, operates on a small set of solutions and makes only limited use of randomization as a proxy for diversification when searching for a globally optimal solution. The scatter search framework is flexible, allowing the development of alternative implementations with varying degrees of sophistication. In this paper, we test the merit of several scatter search designs in the context of global optimization of multimodal functions. We compare these designs among themselves and choose one to compare against a well-known genetic algorithm that has been specifically developed for this class of problems. The testing is performed on a set of benchmark multimodal functions with known global minima.