ppxscal/embedding_network huggingface dataset:
Learning improvement of neural networks used in structural optimization
Authors: Nikolaos D. Lagaros, Manolis Papadrakakis
Venue: Advances in Engineering Software (2004)

The performance of feed-forward neural networks can be substantially impaired by the ill-conditioning of the corresponding Jacobian matrix. Ill-conditioning appearing in feed-forward learning process is related to the properties of the activation function used. It will be shown that the performance of the network training can be improved using an adaptive activation function with a properly updated gain parameter during the learning process. The efficiency of the proposed adaptive procedure is examined in structural optimization problems where a trained neural network is used to replace the structural analysis phase and capture the necessary data for the optimizer. The optimizer used in this study is an algorithm based on evolution strategies.
A Fast Crosstalk- and Performance-Driven Multilevel Routing System
Authors: Tsung-Yi Ho, Yao-Wen Chang, Sao-Jie Chen, D. T. Lee
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we propose a novel framework for fast multilevelrouting considering crosstalk and performance optimization. To handlethe crosstalk minimization problem, we incorporate an intermediatestage of layer/track assignment into the multilevel routing framework.For performance-driven routing, we propose a novel minimum-radiusminimum-cost spanning-tree (MRMCST) heuristic for global routing.Compared with the state-of-the-art multilevel routing, the experimentalresults show that our approach achieved a 6.7X runtime speedup, reducedthe respective maximum and average crosstalk (coupling length)by about 30% and 24%, reduced the respective maximum and averagedelay by about 15% and 5%, and resulted in fewer failed nets.
A note on the 57-th Smarandache's problem
Authors: Liu Hongyan, Zhang Wenpeng
Venue: Smarandache Notions Journal (2004)

For any positive integer n, let r1 be the positive integer such that: the set {1, 2, ..., r1} can be partitioned into n classes such that no class contains integers x, y, z with xy = z, let r2 be the positive integer such that: the set {1,2, ..., r2} can be partitioned into n classes such that no class contains integers x, y, z with x + y = z. In this paper, we use the elementary methods to give two sharp lower bound estimates for r1 and r2.
Neural Network-Based Reputation Model in a Distributed System
Authors: Weihua Song, Vir V. Phoha
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Current centralized trust models are inappropriate to apply in a large distributed multi-agent system, due to various evaluation models and partial observations in local level reputation management. This paper proposes a distributed reputation management structure, and develops a global reputation model. The global reputation model is a novel application of neural network techniques in distributed reputation evaluations. The experimental results showed that the model has robust performance under various estimation accuracy requirements. More important, the model is adaptive to changes in distributed system structures and in local reputation evaluations.
Research and Implement of an Encrypted File System Used to NAS
Venue: Proceedings of the Second IEEE International Security in Storage Workshop (2003)

Data security has become an increasinglyimportant factor in routine work with thedevelopment of applications, and users trend toobtain high security with maximum comfort. In thisarticle a cryptographic file system calledNAS_CFS used for NAS is designed. NAS_CFS hassome characteristics as below: adding encryptionfunction to file-system layer allows users to encryptdata transparently, obtaining high security by keymanagement based on session ID and user ID,attachment and timeouts mechanisms, andNAS_CFS is an in-kernel file system of highperformance using stackable mechanism.
Will IPv6 Bring Better Security?
Authors: Szabolcs Szigeti, Peter Risztics
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The deployment of the next generation Internet Protocol (IPv6) has already started. There were great expectations about the features of the new protocol, one of which was better network security. IPv6 provides network level security via IPSec. While this is an obvious improvement in security, its universal usability is still questionable. This paper examines the security aspects of IPv6, whether it will change the security of the Internet.
Adaptive Parameter Selection for Improved Fuzzy Image Enhancement
Authors: H. S. Kam, W. H. Tan
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Previously, an effective parameter controlled method for noise reduction and sharpening of images corrupted by Gaussian noise was presented [1]. However, the same parameter value was used for the entire image resulting in excess smoothing or sharpening of image features. In this paper, we adapted that method for impulse noise reduction and propose an efficient means to obtain the parameter value adaptively. After evaluating pixel local features through a fuzzy membership, each pixel location is assigned a different parameter value. Results of the proposed method are compared with the previous method and with results of other methods for sharpening of image features. Experimental results indicate that the proposed method has effectively assigned the parameter values, yielding superior performance.
Direct connect device core: design and applications
Authors: O. Elkeelany, G. Chaudhry
Venue: Integration, the VLSI Journal (2004)

In this paper, we present the design and synthesis of "Direct Connected Device Core" (DCD-Core) as a low cost and low power consumption embedded system, which includes an electrical erasable programmable read only memory (EEPROM) controller for configurable address assignments. The main function of DCD-embedded system is to eliminate the operating system processing of network protocol stack running by personal computers CPU and simplifying network connection requirements. Not only the hardware solution requires connection simplification, but also it improves network performance. Our DCD-Core utilizes the concept of network channels, where Ethernet frames are delivered through a custom multicast addressing scheme. After validating DCD-Core embedded system simulation outputs, we synthesize the design in FPGA chip using Verilog Hardware Description Language (HDL). Performance measures like power consumption and area utilization are computed using Verilog HDL synthesis tools. Initial performance measures had shown that the DCD-Core reduces the power consumption. Thus, network devices may be powered through the network cable and eliminate the process of regular electrical power outlet installations and maintenance. This way, DCD-Core reduces the connection complexity in terms of device installations, especially for large number of devices (e.g. surveillance system cameras).
Polygonal space carving with geometric anti-aliasing
Authors: Jung Lee, Chang-Hun Kim
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

This paper proposes an algorithm that solves the shape recovery problem from N arbitrary images. By introducing a polygonal carving technique, the proposed algorithm can reconstruct the image-consistent polygonal shape that is patched by input images. This algorithm eliminates the invalid vertices and polygons from the initial polygonal grid space according to the color variance that represents their image consistency. The carved shape is refined by moving the outlier vertices on the boundary of each image. The final reconstructed shape faithfully accounts for the input images, and its textured appearance reflects the similar color property of the target object.
Coexistence of memory patterns and mixed states in a sparsely encoded associative memory model storing ultrametric patterns
Authors: Tomoyuki Kimoto, Masato Okada
Venue: Biological Cybernetics (2004)

Analyzing the coexistence of memory patterns and mixed states gives important information for constructing a model for the face responsive neurons of the monkey inferior-temporal cortex. We analyzed whether the memory patterns coexist with mixed states when the sparse coding scheme is used for the associative memory model storing ultrametric patterns. For memory patterns and mixed states to coexist, there must be sufficient capacity for storing them and their threshold values must be the same. We determined that the storage capacities for all mixed states composed of correlated memory patterns diverge as 1/|flogf| (where f is the firing rate) even when the correlation of the memory patterns is infinitesimally small. We also determined that the memory patterns and the mixed states can become the equilibrium state of the model in the same threshold value. These results mean that they can coexist in this model. These findings should contribute to research on face responsive neurons in the monkey inferior-temporal cortex.
Contextual Partitioning for Comprehension of OODB Schemas
Authors: Huanying Gu, Yehoshua Perl, James Geller, Erich J. Neuhold
Venue: Knowledge and Information Systems (2004)

Object-oriented databases (OODBs) have been utilized for complex modeling tasks within a variety of application domains. The OODB schema, typically expressed in a graphical notation, can serve as a useful presentation tool for the information contained in the underlying OODB. However, such a schema can be a large, complex network of classes and relationships. This may greatly hinder its effectiveness in helping users gain an understanding of the OODB&#x2019;s contents and data organization. To facilitate this orientation process, a theoretical framework is presented that guides the refinement\/ of an existing schema&#x2019;s subclass-of\/ relationship hierarchy &#x2013; the backbone of any OODB. The framework sets forth three rules which, when satisfied, lead to the establishment of a collection of contexts, each of which exhibits an internal subclass-of\/ tree structure. A formal proof of this result is presented. An algorithmic methodology, involving a human&#x2013;computer interaction, describes how the approach can be applied to a given OODB schema. An application of the methodology to an example OODB schema is included.
Impacts of the use of e-mail and the internet on personal trip-making behavior
Authors: Bruce E. Tonn, Angela Hemrick
Venue: Social Science Computer Review (2004)

This article presents the results of a web survey of 118 residents in the Knoxville, Tennessee, metropolitan region to explore the impacts of the use of e-mail and the Internet on personal trip-making behavior. Respondents were required to be active drivers and users of e-mail and/or the Internet. Approximately 40% reported that their use of these information technologies has led to less driving overall, and 18% reported less rush hour driving. Although use of the Internet has led to both trip reduction and new trip generation, overall, weekly trips appear to be reduced by 8% from the national average of almost 28 person trips per week in 2001. The number of places respondents have access to e-mail and the Internet is highly related to trip reduction and new trip generation. Education and income were positively related to new trip generation.
Intellectual Property Protection for E-Business Methods
Authors: Yahong Li
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Business methods (BMs) deserve intellectual property law protection. National laws, however, are divergent on whether BMs are patentable. U.S. is a leading country in granting patent to BMs, while Europe and China retain BMs exclusion but allow patent when BMs possess "technicality". Unification of laws on BM patenting is much needed, but the feasibility is in great doubt.
The US national science foundation and the ITiCSE effort
Authors: Steve Cunningham, Ernest McDuffie, Harriet Taylor
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

We describe several National Science Foundation programs that support educational efforts in computer science.
Tree logical classes for efficient evaluation of XQuery
Authors: Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmanan, H. V. Jagadish
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically manipulates sets of objects with identical structure. A set of XML elements, say of type book, may have members that vary greatly in structure, e.g. in the number of author sub-elements. This kind of heterogeneity may permeate the entire document in a recursive fashion: e.g., different authors of the same or different book may in turn greatly vary in structure. Even when the document conforms to a schema, the flexible nature of schemas for XML still allows such significant variations in structure among elements in a collection. Bulk processing of such heterogeneous sets is problematic.In this paper, we introduce the notion of logical classes (LC) of pattern tree nodes, and generalize the notion of pattern tree matching to handle node logical classes. This abstraction pays off significantly in allowing us to reason with an inherently heterogeneous collection of elements in a uniform, homogeneous way. Based on this, we define a Tree Logical Class (TLC) algebra that is capable of handling the heterogeneity arising in XML query processing, while avoiding redundant work. We present an algorithm to obtain a TLC algebra expression from an XQuery statement (for a large fragment of XQuery). We show how to implement the TLC algebra efficiently, introducing the nest-join as an important physical operator for XML query processing. We show that evaluation plans generated using the TLC algebra not only are simpler but also perform better than those generated by competing approaches. TLC is the algebra used in the Timber [8] system developed at the University of Michigan.
Motion compression for telepresent walking in large target environments
Authors: Norbert Nitzsche, Uwe D. Hanebeck, Günther Schmidt
Venue: Presence: Teleoperators and Virtual Environments (2004)

Telepresent walking allows visits to remote places such as museums, exhibitions, architecture, or industrial sites with a high degree of realism. While walking freely around in the user environment, the user sees the remote environment through the "eyes" of a remote mobile teleoperator. For that purpose, the user's motion is tracked and transferred to the teleoperator. Without additional processing of the motion data, the size of the remote environment to be explored is limited to the size of the user environment. This paper proposes an extension of telepresent walking to arbitrarily large remote or virtual spaces based on compressing wide-area motion into the available user space. Motion compression is a novel approach and does not make use of scaling or walking-in-place metaphors. Rather, motion compression introduces some deviation of curvature between user motion and teleoperator motion. An optimization approach is used to find the user path of minimum curvature deviation with respect to a given predicted teleoperator path that fits inside the boundaries of the user environment. Turning angles and travel distances are mapped with a 1:1 ratio to provide the desired impression of realistic self-locomotion in the teleoperator's environment. The effects of the curvature deviation on inconsistent perception of locomotion are studied in two experiments.
Web Services for Enterprise Collaboration: A Framework and a Prototype
Authors: Ananth Srinivasan, David Sundaram
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Internet technologies are widely recognized for their promise as enablers of collaborative computing both within and among organizations. The presence of heterogeneous systems in different organizational units makes the implementation of network collaboration very complex. Web Services offer some solutions to this issue with its internet based, open standards technology. We conceptualize organizational service chains in terms of workflows and articulate a framework for orchestrating such services. A decision oriented implementation of the framework using Web Services technologies demonstrates specific ways by which organizational collaboration may be facilitated.
Adaptive stream resource management using Kalman Filters
Authors: Ankur Jain, Edward Y. Chang, Yuan-Fang Wang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

To answer user queries efficiently, a stream management system must handle continuous, high-volume, possibly noisy, and time-varying data streams. One major research area in stream management seeks to allocate resources (such as network bandwidth and memory) to query plans, either to minimize resource usage under a precision requirement, or to maximize precision of results under resource constraints. To date, many solutions have been proposed; however, most solutions are ad hoc with hard-coded heuristics to generate query plans. In contrast, we perceive stream resource management as fundamentally a filtering problem, in which the objective is to filter out as much data as possible to conserve resources, provided that the precision standards can be met. We select the Kalman Filter as a general and adaptive filtering solution for conserving resources. The Kalman Filter has the ability to adapt to various stream characteristics, sensor noise, and time variance. Furthermore, we realize a significant performance boost by switching from traditional methods of caching static data (which can soon become stale) to our method of caching dynamic procedures that can predict data reliably at the server without the clients' involvement. In this work we focus on minimization of communication overhead for both synthetic and real-world streams. Through examples and empirical studies, we demonstrate the flexibility and effectiveness of using the Kalman Filter as a solution for managing trade-offs between precision of results and resources in satisfying stream queries.
The Network Method for Medical Platform
Authors: Whe Dar Lin
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Instead of recomputing and recreating in the platform, the node and edge attributes areused to update a subset of the weblets are then integrated to form the platform. In addition tothe performance benefits in terms of lower response time, the framework facilitates Webcaching, quality-of-service support, load balancing, overload control, personalized services,and security for both dynamic as well as static.We propose a new scheme is based on an optimistic approach that is suitable for moredata contention using data mining skills for path traversal patterns. We will prevent indefinitepostponement and cascading delay as drawback for our system in customer knowledgemanagement. A detailed implementation methodology for the proposed framework is alsodescribed. We have implemented framework in an experimental setup and have measured the performance improvement in terms of server response time, throughput, and connection rate. The results demonstrate the feasibility and validate a subset of the advantages of theproposed framework. In this paper, we proposed a net protocol, which are very suited tomedical platform environment.
Embedded Parallelization Approach for Optimization in Aerodynamic Design
Authors: S. Peigin, B. Epstein
Venue: The Journal of Supercomputing (2004)

A new efficient parallelization strategy for optimization of aerodynamic shapes is proposed. The optimization method employs a full Navier-Stokes solver for accurate estimation of the objective function. As such it requires huge computational resources which makes efficient parallelization crucial for successful promotion of the method to an engineering environment. The algorithm is based on a multilevel embedded parallelization approach, which includes (1) parallelization of the multiblock full Navier-Stokes solver with parallel CFD evaluation of objective function, (2) parallelization of optimization process with parallel optimal search on multiple search domains and, finally, (3) parallel grid generation. Applications (implemented on a 144-processors distributed memory cluster) include various transonic profile optimizations in the presence of nonlinear constraints. The results demonstrate that the approach combines high accuracy of optimization with high parallel efficiency. The proposed multilevel parallelization which efficiently makes use of computational power supplied by multiprocessor systems, leads to a significant computational time-saving and allows application of the method to practical aerodynamic design in the aircraft industry.
Secure Information Flow by Self-Composition
Authors: Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Non-interference is a high-level security propertythat guarantees the absence of illicit information leakagesthrough executing programs.More precisely,non-interference for a program assumes a separation betweensecret inputs and public inputs on the one hand,and secret outputs and public outputs on the other hand,and requires that the value of public outputs does not dependon the value of secret inputs.A common meansto enforce non-interference is to use an informationflow type system.However, such type systemsare inherently imprecise, and reject many secure programs,even for simple programming languages.Thepurpose of this paper is to investigate logical formulationsof non-interference that allow a more precise analysisof programs.It appears that such formulations areoften sound an complete, and also amenable to interactiveor automated verification techniques, such astheorem-proving or model-checking.We illustrate the applicability of our method in severalscenarii, including a simple imperative language, anon-deterministic language, and finally a language withshared mutable data structures.
Combining spatial and colour information for content based image retrieval
Authors: Gunther Heidemann
Venue: Computer Vision and Image Understanding (2004)

Colour is one of the most important features in content based image retrieval. However, colour is rarely used us a feature that codes local spatial information, except for colour texture. This paper presents an approach to represent spatial colour distributions using local principal component analysis (PCA). The representation is based on image windows which are selected by two complementary data driven attentive mechanisms: a symmetry based saliency map and an edge and corner detector. The eigenvectors obtained from local PCA of the selected windows form colour patterns that capture both low and high spatial frequencies, so they are well suited for shape as well as texture representation. Projections of the windows selected from the image database to the local PCs serve as a compact representation for the search database. Queries are formulated by specifying windows within query images. System feedback makes both the search process and the results comprehensible for the user.