ppxscal/embedding_network huggingface dataset:
Architecture-driven diagnosis of performance failures in a token ring
Authors: Andrew Williams, Priya Narasimhan
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Communication infrastructures that provide distributed systems with key services can also end up being the medium whereby faults propagate through the system. We have previously observed that a single faulty node can degrade the performance of other, non-faulty nodes in the system. We present a method for identifying the node that is the origin of the failure by examining the architecture-driven constrained network-flows in a distributed system. By identifying the effects of the failure on the network, combined with our knowledge of the network-flow constraints, we can trace the effects of the failure back to its source node. We empirically evaluate our methods on a data set that was generated by injecting multiple performance-faults into a replicated middleware system with an underlying token-ring based group communication protocol. We correctly identify the faulty node in the case of failures that significantly change the performance characteristics of the network.
Two-Step curing method for demoulding in UV nanoimprint lithography
Authors: Weitao Jiang, Yucheng Ding, Hongzhong Liu, Bingheng Lu, Yongsheng Shi, Jinyou Shao, Lei Yin
Venue: Microelectronic Engineering (2008)

In the UV nanoimprint lithography (UV NIL), it is obvious that the resist curing process is dependent on the UV dose, therefore three states of the resist pattern, i.e., uncuring, undercuring and full-curing may occur due to an inadequate curing control method. Also the demoulding force, which can influence the pattern transferring fidelity, is largely determined by the resist-curing degree. For acquiring high pattern transferring fidelity with small demoulding force, a new demoulding method is proposed in this paper. Through an analysis of the three different pattern transferring results, i.e. rounded-feature replication, fine replication, and scooped-feature replication, which may be induced by the different resist-curing degree and the relative demoulding force, it is found that the resist-curing degree is a critical factor which affects the pattern transferring fidelity. In addition, when the resist-curing degree is too low or too high, either the imprint mould may be stained or the microstructures on the mould can be damaged, which will adversely affect the subsequent imprints in a step-and-repeat process. A new demoulding method is presented, which consists of two UV exposures. The first UV exposure is done before demoulding to under-cure the resist pattern so that the demoulding force can be reduced while maintain a short-time pattern stability. The second UV exposure follows the demoulding to full-cure the resist so as to produce a sufficient rigidity in the pattern. It is experimentally shown that this new demoulding method leads to high pattern fidelity and a small demoulding force while minimizing the mould containments or microstructures damage on it.
Experiences with Product Line Development of Multi-Discipline Analysis Software at Overwatch Textron Systems
Authors: Paul Jensen
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

This report explains the challenges experienced as Overwatch Textron Systems transitioned to a software product line approach. Overwatch Textron Systems provides both software products and custom software development in the domain of intelligence planning, collection and analysis to the U.S. Government and its allies.
Preferable Improvements and Changes to FB-DiMM High-Speed Channel for 9.6Gbps Operation
Authors: Atsushi Hiraishi, Toshio Sugano, Hideki Kusamitsu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper we showed the signal degradation parts in High-speed channel of FB-DiMM system. And we also showed possible countermeasure. For the verification propose and also for establishing the precise modeling and simulation method, we compared measurement and simulation up to 9.6Gbps operation with test board. And we get good relation between them. After getting the calculated loss budget of estimated system, we made recommendations of preferable changes to Main board and DiMM socket.
Techniques for Algorithm Animation
Authors: M. H. Brown
Venue: IEEE Software (1985)

Allowing a user to interact with dynamically changing graphical representations of algorithms or data structures may help in teaching, research, or systems programming.
First-order modeling and stability analysis of illusory contours
Authors: Yoon Mo Jung, Jianhong (Jackie) Shen
Venue: Journal of Visual Communication and Image Representation (2008)

In visual cognition, illusions help elucidate certain intriguing latent perceptual functions of the human vision system, and their proper mathematical modeling and computational simulation are therefore deeply beneficial to both biological and computer vision. Inspired by existent prior works, the current paper proposes a first-order energy-based model for analyzing and simulating illusory contours. The lower complexity of the proposed model facilitates rigorous mathematical analysis on the detailed geometric structures of illusory contours. After being asymptotically approximated by classical active contours, the proposed model is then robustly computed using the celebrated level-set method of Osher and Sethian [S. Osher, J.A. Sethian, Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations, J. Comput. Phys., 79 (12) (1988) 12-49] with a natural supervising scheme. Potential cognitive implications of the mathematical results are addressed, and generic computational examples are demonstrated and discussed.
An Architecture of Dynamically Reconfigurable Processing Unit(RPU)
Authors: Guochang Zhou, Xubang Shen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Reconfigurable system can offer considerably higher performance than general purpose processors and are, in addition, significantly more flexible than application-specific systems. The efficient coarse-grained dynamically reconfigurable processing unit is the key feature of the reconfigurable system. In this paper, a novel dynamically reconfigurable processing unit (RPU) is proposed in order to improve the flexibility and adaptability of the general processing element(PE). By dynamic configuration of the configurable register(Creg), the proposed RPU can process complex number(8-bit real part and imaginary part) and 16-bit fixed number( unsigned-magnitude or 2's complement data). The operation of 8-bit complex number multiply-accumulation is performed in a single clock cycle. Therefore, two RPUs working together can execute butterfly computation in a single clock cycle. Based on Charter 0.25um standard cell library, the area of RPU is 0.8*0.8 mm2 and critical path delay is 16ns.
Optimum Logic Modules
Authors: G. I. Opsahl
Venue: IEEE Transactions on Computers (1972)

The results of an exhaustive analysis undertaken to determine the optimum three-input logic modules are examined. The optimum logic module is restricted to realize all three-variable functions in two logic levels, with one polarity available for each input variable. Only one three-input logic module satsifies these restrictions for three variables. All realizations with the fewest logic modules and minimum number of interconnections for all three-variable functions with this logic mocOule are included in a catalog. An algorithm is presented which extends the three properties of this three-input logic module. The four-input logic module from the algorithm has been verified to realize all four-variable functions in two logic levels.
Point/Counterpoint
Authors: David Ungar, Erik Ernst
Venue: IEEE Software (2007)

Point Argument: "Dynamic Languages (in Reactive Environments) Unleash Creativity," by David Ungar. For the sake of creativity, the profession needs to concentrate more on inventing new and better dynamic languages and environments and less on improving static languages. Counterpoint Argument: "Explicitly Declared Static Types: The Missing Links," by Erik Ernst. How do we understand software? Using it is a powerful approach, but it provides examples of properties, not general truths. Some static knowledge is needed. This department is part of a special issue on dynamically typed languages.
A Tag-Based Network Evolution Mechanism for Online Communities
Authors: Caihong Sun, Yan Xu, Xiaoping Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

An online community involves many interactions among members. When the interactions are frequent and important enough, they are usually explicitly shown as "friend links" among community members. In this paper, a tag-based network evolution model is proposed to simulate the growth and evolution of social networks of online communities. Our model is an agent-based model in which community members are simulated as agents who can decide whether to link to other agents as friends or not, according to their tag similarity. A tag is a value that represents an agent's total trait. Agents' traits could be their interests, locations or ages. We demonstrate the emergent properties of online communities generated by our tag-based evolution model, and compare these properties with those of other three network evolution models: BA model, small world network and random network model. Furthermore, two real-world online communities are studied empirically and compared with the online communities evolved from our model. Experimental results show that our evolution mechanism can facilitate the formation of a higher-quality community in which distances between members are smaller and members are more closely clustered.
Exact Analysis of TDMA with Slot Skipping
Authors: Nuno Pereira, Eduardo Tovar, Bjorn Andersson
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Consider a communication medium shared among a set of computer nodes; these computer nodes issue messages that are requested to be transmitted and they must finish their transmission before their respective deadlines. TDMA/SS is a protocol that solves this problem; it is a specific type of Time Division Multiple Access (TDMA) where a computer node is allowed to skip its time slot and then this time slot can be used by another computer node. We present an algorithm that computes exact queuing times for TDMA/SS in conjunction with Rate-Monotonic (RM) or Earliest- Deadline-First (EDF).
Design concept of a course visualization platform
Authors: Osamu Yamakawa, Masahiro Kikusawa, Takeyuki Tanaka, Koichi Yasutake, Takahiro Sumiya, Takahiro Tagawa, Hitoshi Inoue
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Course visualization, which is carried out by analysing the access log of the Course Management System, is very effective in revealing the learning activity of students. However, there are few practices of course visualization for lack of a procedure guideline and difficulties concerning the analysis of learning-activity data. Authors have already proposed a procedure guideline for course visualization to reduce the number of problems and have executed the process according to the guideline. In this paper, at first, the procedure guideline and examples of course visualization will be shown. Next, this paper describes the design concept and the software structure of course visualization platform (VisP) for spreading these visualization practices to the E-learning community. It will be easy to visualize the learning activity of students, when the platform is used. As the result, we will get effective feedback to instructors and students for the formative evaluation of a course.
The Simulation of Metal Sheet Pressing Based on ANN
Authors: Deng Zhaohu, Zhang Yanqin, Huang Yuping, Ruan Feng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Pressing formation involves complicated mechanical theory; it is hard to analysis the stress situation with analytical method. Based on the theory of artificial neural networks, the stress situation of metal sheet was studied in this paper. This paper attempted to establish a nonlinear model with GRNN. This model would simulate the parts pressing. For building the GRNN model, the technology of Parameter-FEM Analysis was adopted in this paper. With this technology the GRNN would be used to build the model of metal sheet pressing in place of FEM. At the same time as certification the pressing of a complicated part was simulated in this paper. Through comparing the simulation results to original data, it shows that the model with GRNN can reflect the stress situation of metal sheet pressing accurately. At the same time this technology provides an effective method for further optimization of the parameters.
Two-stage Process Analysis Using the Process-based Performance Measurement Framework and Process Simulation
Authors: Kwan Hee Han, Jin Gu Kang
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In the diagnosis phase of business process management (BPM), the operational processes are analyzed to identify problems and to find things that can be improved. And in the process design phase of BPM, to-be process is newly designed and analyzed. Proposed in this paper is a two-stage process analysis for process (re)design using the process-based performance measurement framework (PPMF) and process simulation. A two-stage process analysis consists of macro analysis and micro analysis. The most influencing business process on specific strategic level KPI is selected at the macro analysis stage. Afterwards, the performance of selected process is reviewed, and new to-be process is redesigned. The performance prediction of new process is conducted using process simulation at the micro analysis stage. By using the proposed two-stage process analysis, company practitioners involved in the process innovation can easily and efficiently find the most influencing processes upon enterprise strategy, and evaluate the performance prediction of newly designed process.
Dynamic route maintenance for geographic forwarding in mobile ad hoc networks
Authors: Chih-Hsun Chou, Kuo-Feng Ssu, Hewijin Christine Jiau
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors in geographic forwarding algorithms. The interval at which these nodes broadcast their beacon messages is typically fixed. However, determining an appropriate value for this interval is challenging. A longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces heavier control overheads. Additionally, since a fixed value is assigned to the lifetime of each routing entry, the forwarding algorithm cannot adapt well to different mobility environments. Therefore, this paper presents a dynamic route maintenance algorithm (DRM) for beacon-based geographic routing. In the approach, the mobile nodes dynamically adjust their beacon intervals based on their speed of movement. Moreover, the routing information can be well managed using the mobility prediction. The simulation results show that DRM not only significantly decreased the routing overheads in a low mobility scenario but also guaranteed the high quality packet delivery in high mobility environments.
Workshop Report Computer Science, Engineering and Data Processing Curricula
Authors: D. Rine
Venue: Computer (1978)

Colleges and universities seek to respond to the manpower needs of industry, business, and government through continuing reappraisal of computer education. Reappraisal was the unifying theme at the Fourth Joint College Curricula Workshop in Computer Science, Engineering, and Data Processing. Nearly 100 educators considered course content, model curricula, instructional materials and methods, two-and four- year program articulation, and employer needs. The workshop, held February 2-4, 1978, in Orlando, Florida, also provided sessions dealing with the use of microcomputers and top-down programming methodology in community college computer education.
Production Volume: The Key to Successful Slide-Making Systems
Authors: James Teter, Donna Roberts
Venue: IEEE Computer Graphics and Applications (1983)

Impressed by the dazzling effects that slide-making systems can produce? Who wouldn't be? Before you buy, though, make sure your company can use a system's full capabilities.
Design and Implementation of Wireless Computational Grid based on JavaSpace
Authors: Wen Bin, Liu Chang-qing
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Wireless devices have many limitations: limited processing power, energy constrain due to small batteries and small secondary storage. With the diminishing prices and increasing usage of mobile devices, the grid concept is now extended into the wireless domain. This paper focus on the design and implementation of a grid-based problem solving environment for wireless computational grid using JavaSpace .This experimental system is developed with the primary purpose to allow wireless devices to distribute the computational load among other available wireless devices and to solve problems that they would not be able to solve individually. The paper describes the system framework, operation and also presents an experimental analysis of the wireless computational grid.
The Use of Software Science in Evaluating Modularity Concepts
Authors: A. L. Baker
Venue: IEEE Transactions on Software Engineering (1979)

An investigation is made into the extent to which relationships from software science are useful in analyzing programming methodology principles that are concerned with modularity. Using previously published data from over 500 programs, it is shown that the software science effort measure provides quantitative answers to questions concerning the conditions under which modularization is beneficial. Among the issues discussed are the reduction of similar code sequences by temporary variable and subprogram defmition, and the use of global variables. Using data flow analysis, environmental considerations which affect the applicability of alternative modularity techniques are also discussed.
Time Delay Neural Network Applied for Compensation of Temperature Sensors Nonlinear Dynamics on Hysteresis Measurements
Authors: Eduardo F. Simas Filho
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

There exists many kinds of technologies and sensors for measuring temperature, however, two of the most common types of sensors are thermocouples and thermistors. These sensors have dynamical response to a temperature change in the surroundings, and also have nonlinearities in the mapping between temperature and electrical signal at their output. When dealing with the characterization of thermal hysteretic devices, the nonlinear dynamical response of the temperature sensor may cause a severe distortion in the shape of the hysteresis curve. In this paper is presented a nonlinear inverse filtering structure using an artificial neural network for distortion correction in vanadium diox- ide films thermal hysteresis measurements. A Time-delay Neural Network is applied to obtain an approximation of the true hysteretic characteristics, removing the undesired distortion. The network training is performed using exper- imentally measured data. A comparison is presented be- tween the neural method and a parametric estimation.
To Select or To Weigh: A Comparative Study of Linear Combination Schemes for SuperParent-One-Dependence Estimators
Authors: Ying Yang, Geoffrey I. Webb, Jesus Cerquides, Kevin B. Korb, Janice Boughton, Kai Ming Ting
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

We conduct a large-scale comparative study on linearly combining superparent-one-dependence estimators (SPODEs), a popular family of semi-naive Bayesian classifiers. Altogether 16 model selection and weighing schemes, 58 benchmark data sets, as well as various statistical tests are employed. This paper's main contributions are three-fold. First, it formally presents each scheme's definition, rationale and time complexity; and hence can serve as a comprehensive reference for researchers interested in ensemble learning. Second, it offers bias-variance analysis for each scheme's classification error performance. Third, it identifies effective schemes that meet various needs in practice. This leads to accurate and fast classification algorithms with immediate and significant impact on real-world applications. Another important feature of our study is using a variety of statistical tests to evaluate multiple learning methods across multiple data sets.
Rough Set Approach to Case-Based Reasoning for Operation Risk Analysis under Basel II
Authors: Ling Sun, Jia-yu Chi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

With the Basel Committee revised the position on operational risk management in 2002, it is urgent for the banks to find some suitable methods to analyze their operation risk. Case-based reasoning is the process of using solutions to previously encountered problems as a basis for reasoning solution to new problems. However, redundant features may lead to a high computational load in case retrieval. This paper presents a novel rough set- based case-based reasoning approach for operation risk analysis in banks under new Basel Capital Accord(Basel II). Through a rough set -based approach, case-based reasoning for operation risk analysis will reduce the redundant features while maintaining the classification accuracy.
Flexible and efficient IR using array databases
Authors: Roberto Cornacchia, Sándor Héman, Marcin Zukowski, Arjen P. Vries, Peter Boncz
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2008)

The Matrix Framework is a recent proposal by Information Retrieval (IR) researchers to flexibly represent information retrieval models and concepts in a single multi-dimensional array framework. We provide computational support for exactly this framework with the array database system SRAM (Sparse Relational Array Mapping), that works on top of a DBMS. Information retrieval models can be specified in its comprehension-based array query language, in a way that directly corresponds to the underlying mathematical formulas. SRAM efficiently stores sparse arrays in (compressed) relational tables and translates and optimizes array queries into relational queries. In this work, we describe a number of array query optimization rules. To demonstrate their effect on text retrieval, we apply them in the TREC TeraByte track (TREC-TB) efficiency task, using the Okapi BM25 model as our example. It turns out that these optimization rules enable SRAM to automatically translate the BM25 array queries into the relational equivalent of inverted list processing including compression, score materialization and quantization, such as employed by custom-built IR systems. The use of the high-performance MonetDB/X100 relational backend, that provides transparent database compression, allows the system to achieve very fast response times with good precision and low resource usage.