ppxscal/embedding_network huggingface dataset:
Dependability-Driven Embedded Systems Networking
Authors: Miroslav Sveda, Radimir Vrba
Venue: Proceedings of the Sixth International Conference on Networking (2007)

This paper deals with embedded system networking support, which is aimed at applications based on distributed components interconnected by wired Internet and wireless sensor networks. It presents a safety and security-driven approach to embedded system networking that offers reusable patterns for designs aiming at various application domains. After introducing terminology dealing with functionality and dependability, the article copes with industrial, sensor network and Internet based architectures. It discusses an integrated networking framework stemming from the IEEE 1451.1 smart transducer interface standard, which is an object-based networking model supporting client-server and publish-subscribe communication patterns in group messaging, and from the IP multicast communication, mediating safe and secure access to wireless sensor networks through Internet. The case study demonstrates how clients can access groups of wireless smart pressure and temperature sensors and valves, which monitor and control gas pipelines effectively through Internet using developed networking architecture that respects prescribed requirements for application dependent safety and security.
Society involvement in the ABET/CSAB integration
Authors: J. Impagliazzo
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The ABET/CSAB (Accreditation Board for Engineering and Technology/Computing Sciences Accreditation Board) integration promises many benefits to the public, industry and academic institutions. These benefits place greater responsibilities on the sponsoring professional societies to ensure a smooth transition and to provide a long-lasting asset to the profession. The society perspectives on the integration are presented.
Complex backpropagation neural network using elementary transcendental activation functions
Authors: T. Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Designing a neural network (NN) for processing complex signals is a challenging task due to the lack of bounded and differentiable nonlinear activation functions in the entire complex domain C. To avoid this difficulty, 'splitting', i.e., using uncoupled real sigmoidal functions for the real and imaginary components has been the traditional approach, and a number of fully complex activation functions introduced can only correct for magnitude distortion but can not handle phase distortion. We have previously introduced a fully complex NN that uses a hyperbolic tangent function defined in the entire complex domain and showed that for most practical signal processing problems, it is sufficient to have an activation function that is bounded and differentiable almost everywhere in the complex domain. In this paper, the fully complex NN design is extended to employ other complex activation functions of the hyperbolic, circular, and their inverse function family. They are shown to successfully restore the nonlinear amplitude and phase distortions of non-constant modulus modulated signals.
Recursive partitional-hierarchical clustering for navigation in large media databases
Authors: Angelica Lozano, Paulo Villegas
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

We present in this document a tool for automatic clustering of repositories of tagged media items (images, videos) and a 3D visualization interface to enable interactive browsing of repository contents based on the generated clusters1.
CoSE: A SRLG-Disjoint Routing Algorithm
Authors: Mohammad Javad Rostami, Siavash Khorsandi, Ali Asghar Khodaparast
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms.
The Research on Individual Clothing Pattern Automatic Making Technology
Authors: Zi-tian Yang, Wei-yuan Zhang, Wen-bin Zhang, Ming Xia
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The function of traditional computer-aid designing (Fashion CAD) needs to be strengthened along with the MTM System appearance. The core technology of MTM System is how to produce the individual and digitized pattern, that is, getting the individual pattern according to the body information. It is much wiser to get the individual pattern by modifying the basic pattern. The paper focuses on the pattern modification, plans its technical feasibility, and has carried out the style classification and the pattern modification method design based on this. The experiment verifies the conclusion: the planning technical way is feasible; the style classification and the pattern modification method design is reasonable; the individual pattern is correct.
The LearningOnline Network with CAPA Initiative
Authors: G. Kortemeyer
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

With funding of the National Science Foundation Information Technology Research program, the LearningOnline Network with CAPA (LON-CAPA) Initiative aims to create and sustain a cross-institutional distributed platform for content creation, sharing, and delivery. LON-CAPA will allow groups of organizations (schools, departments, universities, commercial business) to link their online instructional resources in a common marketplace, thus creating an online economy for instructional resources.
Access Control and Integration of Health Care Systems: An Experience Report and Future Challenges
Authors: Lillian Rostad, Oystein Nytro
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Health information about a patient is usually scattered among several clinical systems, which limits the availability of the information. Integration of the most central systems is a possible solution to this problem. In this paper we present one such integration effort, with a focus on how access control is handled in the integrated system. Although this effort has not yet solved all the issues of access control integration, it demonstrates a practical approach for creating something that works today and serves as input to the discussion on future challenges for access control when integrating multiple systems.
A Comparison of Statistical and Rule-Induction Learners for Automatic Tagging of Time Expressions in English
Authors: Jordi Poveda, Mihai Surdeanu, Jordi Turmo
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Proper recognition and handling of temporal information contained in a text is key to understanding the flow of events depicted in the text and their accompanying circumstances. Consequently, time expression recognition and representation of the time information they convey in a suitable normalized form is an important task relevant to several problems in Natural Language Processing. In particular, such an analysis is largely significant for Information Extraction (IE), Question Answering (QA) and Automatic Summarization (AS). The most common approach to time expression recognition in the past has been the use of handmade extraction rules (grammars), which also served as the basis for normalization. Our aim is to explore the possibilities afforded by applying machine learning techniques to the recognition of time expressions. We focus on recognizing the appearances of time expressions in text (not normalization) and transform the problem into one of chunking, where the aim is to correctly assign Begin, Inside or Outside (BIO) tags to tokens. In this paper, we explain the knowledge representation used and compare the results obtained in our experiments with two different methods, one statistical (support vector machines) and one of rule induction (FOIL). Our empirical analysis shows that SVMs are superior.
TBBT: scalable and accurate trace replay for file server evaluation
Authors: Ningning Zhu, Jiawu Chen, Tzi-Cker Chiueh
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

This paper describes the design, implementation, and evaluation of TBBT, the first comprehensive NFS trace replay tool. Given an NFS trace, TBBT automatically detects and repairs missing operations in the trace, derives a file system image required to successfully replay the trace, ages the file system image appropriately, initializes the file server under test with that image, and finally drives the file server with a workload that is derived from replaying the trace according to user-specified parameters. TBBT can scale a trace temporally or spatially to meet the need of a simulation run without violating dependencies among file system operations in the trace.
On some properties and an application of the logarithmic barrier method
Authors: Regina S. Burachik, L. M. Gra&#x00f1;a Drummond, Susana Scheimberg
Venue: Mathematical Programming: Series A and B (2007)

We analyze the logarithmic barrier method for nonsmooth convex optimization in the setting of point-to-set theory. This general framework allows us to both extend and include classical results. We also propose an application for finding efficient points of nonsmooth constrained convex vector-valued problems.
Cyclic, diagonal and facial colorings-a missing case
Authors: Daniel Král', Tomáš Madaras, Riste Škrekovski
Venue: European Journal of Combinatorics (2007)

In [D. Kral', T. Madaras, R. Skrekovski, Cyclic, diagonal and facial colorings, European J. Combin. 26 (2005) 473-490], we established that every planar graph has a coloring with eight colors such that no two vertices joined by a facial walk of length one or two receive the same color. It turned out that the analysis of one of the cases in our proof is incomplete. We provide a completed analysis in this note.
Effective Caching in Wireless Sensor Network
Authors: Md Ashiqur Rahman, Sajid Hussain
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

This paper proposes few ways of improving a WSN's energy efficiency that already uses an energy efficient data routing protocol for continuous monitoring application. The proposed improvements are (i) data negotiation, (ii) development of data change expectancy, and (iii) data vanishing. In data negotiation, an active sensor sends its sensed data only when the data changes. In expectancy development, a sensor develops the expectancy of when its sensed data might change. It then adjusts its sensing frequency accordingly to avoid unnecessary sensing. In data vanishing, duplicate sensed data from multiple sensors are discarded while routed to the BS. Together, the proposed improvements can be viewed as an emulated cache where latest sensed data are always known without requiring the sensors to sense and report continuously. Our simulation results also show significant WSN lifetime increase from this emulated caching.
A survey of trust in computer science and the Semantic Web
Authors: Donovan Artz, Yolanda Gil
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2007)

Trust is an integral component in many kinds of human interaction, allowing people to act under uncertainty and with the risk of negative consequences. For example, exchanging money for a service, giving access to your property, and choosing between conflicting sources of information all may utilize some form of trust. In computer science, trust is a widely used term whose definition differs among researchers and application areas. Trust is an essential component of the vision for the Semantic Web, where both new problems and new applications of trust are being studied. This paper gives an overview of existing trust research in computer science and the Semantic Web.
Interoperability "Pain Points" in SMEs
Authors: Hausi Muller
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

No abstract provided.
Artistic Concept for Negative-Style Interaction Robotics
Authors: Mariko Fujita, Kiyoshi Kotani, Yoichiro Kawaguchi
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In the field of Robotics, a number of Interaction Robots are made and under research these days. In spite of that, there are some objecting opinion against such Interaction Robotics and even the communicating style itself is under doubt.Based on such background, focused on low cost and simple but appealing function, to propose a new concept of Interaction Robot, that is a one with "Negative-emotional" Interacting style, is the purpose of this theme. For addition, in order to find out the points to reform the behavior and the structure of Robot, an evaluation method, how human feels being with the Robot, has constructed and going to be tested.
Fuzzy logic in process control: a new fuzzy logic controller and an improved fuzzy-internal model controller
Authors: Carlos A. Smith, Marco E. Sanjuan
Venue:  (2006)

Two fuzzy controllers are presented. A fuzzy controller with intermediate variable designed for cascade control purposes is presented as the FCIV controller. An intermediate variable and a new set of fuzzy logic rules are added to a conventional Fuzzy Logic Controller (FLC) to build the Fuzzy Controller with Intermediate Variable (FCIV). The new controller was tested in the control of a nonlinear chemical process, and its performance was compared to several other controllers. The FCIV shows the best control performance regarding stability and robustness. The new controller also has an acceptable performance when noise is added to the sensor signal. An optimization program has been used to determine the optimum tuning parameters for all controllers to control a chemical process. This program allows obtaining the tuning parameters for a minimum IAE (Integral absolute of the error). The second controller presented uses fuzzy logic to improve the performance of the conventional internal model controller (IMC). This controller is called FAIMCr (Fuzzy Adaptive Internal Model Controller). Two fuzzy modules plus a filter tuning equation are added to the conventional IMC to achieve the objective. The first fuzzy module, the IMCFAM, determines the process parameters changes. The second fuzzy module, the IMCFF, provides stability to the control system, and a tuning equation is developed for the filter time constant based on the process parameters. The results show the FAIMCr providing a robust response and overcoming stability problems. Adding noise to the sensor signal does not affect the performance of the FAIMC. The contributions presented in this work include: (1) The development of a fuzzy controller with intermediate variable for cascade control purposes. (2) An adaptive model controller which uses fuzzy logic to predict the process parameters changes for the IMC controller. (3) An IMC filter tuning equation to update the filter time constant based in the process parameters values. (4) A variable fuzzy filter for the internal model controller (IMC) useful to provide stability to the control system.
Credible mobile ad hoc network simulation-based studies
Authors: Stuart H. Kurkowski
Venue:  (2006)

Simulation is the research tool of choice for a majority of the mobile ad hoc network (MANET) community. However, while the use of simulation has increased, the credibility of the simulation results has decreased. To determine the state of MANET simulation studies, we surveyed the 2000-2005 proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). We present the results of our survey and summarize common simulation study pitfalls. We develop standards and algorithms that help enable MANET researchers to move toward the goal of simulation-based research with credible scenarios. We also document a large variable analysis of the Location Aided Routing (LAR) protocol. This study discovers several variables that have a significant impact on LAR performance, but are not always considered in a MANET simulation study. Finally, we discuss tools we created that aid the development of credible simulation studies. We offer these results to the community with the hope of improving the credibility of MANET simulation-based studies.
Source-level loop optimization for DSP code generation
Authors: Bogong Su
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The performance of current C compilers for DSP is almost unacceptable. One of the most important reasons is the lack of implementing software pipelining. This paper presents a remedy called source-level loop optimization. DSP programmers can use source-level loop optimization first then input its result to the DSP compiler to obtain better assembly code. The implementation of source-level loop optimization is easier than that of software pipelining. The preliminary result with the DSP compiler-challenge C code shows that source-level loop optimization is a portable and efficient approach. The detailed method and working examples are presented.
A polyphase approach to time-varying filter banks
Authors: See-May Phoong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We introduce a polyphase representation for linear time-varying (LTV) filters. Using the proposed polyphase approach, we are able to show some unusual properties of LTV filter bank (FB) that have not been pointed out before. The problem of interchangeability of analysis and synthesis banks is considered. Lossless TVFBs is studied in detail. Perfect reconstruction (PR) can always be obtained for lossless TVFBs. However, in general a PR lossless TVFB will only generate a tight frame.
Optimizing Test Length for Soft Faults in DRAM Devices
Authors: Zaid Al-Ars, Said Hamdioui, Georgi Gaydadjiev
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Soft faults in DRAMs are faults that do not get sensitized directly after an operation is performed, but re- quire a time to pass before the fault can be detected. Tests developed to detect these faults are rather complex and take an exceptionally long time to apply on the memory. This paper discusses a number of methods to optimize the test length for soft faults, based on the electrical design of the memory and the topology of the layout. These methods make it possible to reduce the delay time needed in the test such that it does not scale with the number of cells in the memory.
High-order Galerkin methods for scalable global atmospheric models
Authors: Michael N. Levy, Ramachandran D. Nair, Henry M. Tufo
Venue: Computers Geosciences (2007)

Three different high-order finite element methods are used to solve the advection problem-two implementations of a discontinuous Galerkin and a spectral element (high-order continuous Galerkin) method. The three methods are tested using a 2D Gaussian hill as a test function, and the relative L"2 errors are compared. Using an explicit Runge-Kutta time stepping scheme, all three methods can be parallelized using a straightforward domain decomposition and are shown to be easily and efficiently scaled across multiple-processor distributed memory machines. The effect of a monotonic limiter on a DG scheme is demonstrated for a non-smooth solution. Additionally, the necessary geometry for implementing these methods on the surface of a sphere is discussed.
Preparing resource discovery for digitized music: an analysis of an australian application
Authors: Jennifer A. Thomas, Michael R. Middleton, Margaret Warren
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper examines procedures for the creation and delivery of digital music that are being undertaken by contributors to the National Library of Australia's federated music gateway MusicAustralia. The case study discusses access to and preservation of digital material as key drivers of the digitization movement, and compares projects being undertaken worldwide. Also analyzed are the underlying digitization principles and standards, and metadata schemas for the description and exchange of digital objects which facilitate record exchange and improve audience reach. The paper provides an overview of some individual contributing institutions, however particular focus is placed on the State Library of Queensland's (SLQ) approach to preparing its unique Queensland music collection for digital resource discovery in MusicAustralia. A detailed analysis of SLQ's strategy is presented, including its risk management approach to copyright implications,and consideration of infrastructure issues affecting the creation, preservation and online delivery of its digital music objects. Whilst SLQ's current digital music collection is relatively small, it has become core business of SLQ's Arts and Humanities branch, and the collection will expand with the continued incorporation of music material unique to Queensland into the collection. SLQ has developed a sound foundation for digitization based on widely endorsed principles and standards which should allow this to effectively occur.
Task scheduling for reliable cache architectures of multiprocessor systems
Authors: Makoto Sugihara, Tohru Ishihara, Kazuaki Murakami
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents a task scheduling method for reliable cache architectures (RCAs) of multiprocessor systems. The RCAs dynamically switch their operation modes for reducing the usage of vulnerable SRAMs under real-time constraints. A mixed integer programming model has been built for minimizing vulnerability under real-time constraints. Experimental results have shown that our task scheduling method achieved 47.7--99.9% less vulnerability than a conventional approach.
Prototype Platforms for Distributed Agreements
Authors: Alberto Baragatti, Roberto Bruni, Hernán Melgratti, Ugo Montanari, Giorgio Spagnolo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We present a prototype application for coordinating distributed agreements in multi-parties negotiations, where participants can dynamically join ongoing negotiations and where participants know only those parties they have interacted with. Our prototype is tailored to Ad-Hoc network scenarios involving the assignment of tasks for a rescue team operating over disaster areas. Our application is based on asynchronous communication and it exploits the d2pc protocol for committing or aborting a negotiation. Parties have been developed both in Jocaml+Perl and Polyphonic C^@?. The implementation of the commit protocol allows components of both types to participate within the same negotiation.
How to build serious games
Authors: Henry Kelly, Kay Howell, Eitan Glinert, Loring Holding, Chris Swain, Adam Burrowbridge, Michelle Roper
Venue: Communications of the ACM (2007)

Like a discovery game that requires players to earn the right to take on new challenges, Immune Attack compels its players to learn the rules of the immune system before it reveals deeper biological insight.