ppxscal/embedding_network huggingface dataset:
Synthesis of Networks with a Minimum Number of Negative Gates
Authors: T. Ibaraki, S. Muroga
Venue: IEEE Transactions on Computers (1971)

In this paper we develop an algorithm to design a switching network using only gates which represent negative functions. The number of gates in the network is minimized under the conditions that 1) the network consists of two levels, and 2) no fan-in restriction on each gate is imposed.
Eigenfrequencies of symmetric planar frames with semi-rigid joints using weighted graphs
Authors: A. Kaveh, L. Shahryari
Venue: Finite Elements in Analysis and Design (2007)

The main aim of this paper is to extend the recently developed methods for calculating the free vibration analysis of planar symmetric frames to include the effect of semi-rigidity of the joints. This is achieved by decomposing a symmetric weighted graph model into two submodels and using canonical forms in such a manner that the union of the eigenvalues of the submodels result in the eigenvalues of the entire model. Thus the eigenfrequencies of the frame is obtained in an efficient manner. Here, only the free vibration of frames with linear behavior is studied.
Directional geographical routing for real-time video communications in wireless sensor networks
Authors: Min Chen, Victor C. M. Leung, Shiwen Mao, Yong Yuan
Venue: Computer Communications (2007)

In this paper, we address the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN) from a small number of dispersed video-sensor nodes (VNs) to a sink by combining forward error correction (FEC) coding with a novel multipath rouing scheme called directional geographical routing (DGR). DGR constructs an application-specific number of multiple disjointed paths for a VN to transmit parallel FEC-protected H.26L real-time video streams over a bandwidth-limited, unreliable networking environment. The multiple paths in DGR facilitate load balancing, bandwidth aggregation, and fast packet delivery. Extensive simulation experiments over randomly generated WSNs show that DGR has the following advantages: (i) lower delay, (ii) substantially longer network lifetime, and (iii) a better received video quality. In particular, DGR improves the average video peak signal-to-noise ratio (PSNR) by up to 3dB, compared to a traditional geographic routing scheme.
A student-managed networking laboratory
Authors: Paul B. Albee, Laura A. Campbell, Martin A. Murray, Christopher M. Tongen, Jennifer L. Wolfe
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

A major component of undergraduate Information Technology education is hands-on experience in a realistic environment. Attempting to provide an environment that is realistic, however, poses several problems in a university setting. The major problems we have encountered thus far are a shortage of network management personnel, the need for an isolated yet Internet-connected lab, and the lack of financial resources to build a heterogeneous lab. We have addressed these problems through the establishment of a student-managed networking laboratory. This lab is currently supervised by a single faculty member and managed by six undergraduate students. The students provide support for five different courses and have devised solutions to each of the major problems we have encountered, and also have built a firewall-protected network that can be easily subnetted on an ad hoc basis, allowing students from multiple courses to use the lab simultaneously without cross-talk between the courses. Through the use of tools such as VMware Player, Linux, and SNMP we have been able to construct a lab that allows for the incorporation of physical and simulated hardware at a very low cost. The students involved with the lab have also built a suite of custom tools that allow us to re-deploy the lab for different courses in a matter of minutes. With a dedicated staff of students we are able to provide a simulation of a heterogeneous networking environment at a very low cost. The enhanced lab has become a valuable resource, and is the centerpiece of our networking laboratory facilities.
3D-STAF: scalable temperature and leakage aware floorplanning for three-dimensional integrated circuits
Authors: Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert P. Dick, Li Shang, Hai Zhou, Xianlong Hong, Qiang Zhou
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Thermal issues are a primary concern in the three-dimensional (3D) integrated circuit (IC) design. Temperature, area, and wire length must be simultaneously optimized during 3D floorplanning, significantly increasing optimization complexity. Most existing floorplanners use combinatorial stochastic optimization techniques, hampering performance and scalability when used for 3D floorplanning. In this work, we propose and evaluate a scalable, temperature-aware, force-directed floorplanner called 3D-STAF. Force-directed techniques, although efficient at reacting to physical information such as temperature gradients, must eventually eliminate overlap. This can cause significant displacement when used for heterogeneous blocks. To smooth the transition from an unconstrained 3D placement to a legalized, layer-assigned floorplan, we propose a three-stage force-directed optimization flow combined with new legalization techniques that eliminate white spaces and block overlapping during multi-layer floorplanning. A temperature-dependent leakage model is used within 3D-STAF to permit optimization based on the feedback loop connecting thermal profile and leakage power consumption. 3D-STAF has good performance that scales well for large problem instances. Compared to recently published 3D floorplanning work, 3D-STAF improves the area by 6%, wire length by 16%, via count by 22%, peak temperature by 6% while running nearly 4x faster on average.
Performance Evaluations and Estimations ofWorkload of On-Demand Updates in Soft Real-Time Systems
Authors: Thomas Gustafsson, Jorgen Hansson
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Data being used in real-time systems must be up-to-date to produce correct results. The use of outdated data can have catastrophic consequences since calculated control signals are based on stale data. Two distinct methods to update data exist: (i) dedicated tasks (DT) update data items, and (ii) on-demand (OD) updating being a conditioned part of the execution flow of tasks. On-demand updating has not been studied in terms of CPU utilization analysis for real-time systems. This paper studies on-demand updating in terms of (i) imposed workload and compares the workload to Deferrable Scheduling (DS), and (ii) analytical formula for estimating workload to be used in CPU utilization based schedulability tests. It is found that on-demand updating uses less workload for updates compared to DS, which suggests on-demand updating should be used for resource constrained systems. However, using on-demand updating makes the execution times of updates unpredictable, which currently gives two possibilities (i) be pessimistic and assume all updates always execute or (ii) be less pessimistic but estimate the times between executions of updates. This paper devises a formula for such estimates and compares their result to approach (i). Evaluations show the formula can be useful for soft real-time systems.
Mining concepts from code with probabilistic topic models
Authors: Erik Linstead, Paul Rigor, Sushil Bajracharya, Cristina Lopes, Pierre Baldi
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We develop and apply statistical topic models to software as a means of extracting concepts from source code. The effectiveness of the technique is demonstrated on 1,555 projects from SourceForge and Apache consisting of 113,000 files and 19 million lines of code. In addition to providing an automated, unsupervised, solution to the problem of summarizing program functionality, the approach provides a probabilistic framework with which to analyze and visualize source file similarity. Finally, we introduce an information-theoretic approach for computing tangling and scattering of extracted concepts, and present preliminary results
Three Cell Structures for Ternary Cellular Arrays
Authors: J. A. Bate
Venue: IEEE Transactions on Computers (1977)

Three particular cell structures are defined for use in ternary cellular arrays. Universal arrays for both general and symmetric functions are considered and the optimum size is found. Both optimal and nonoptimal universal arrays are given for these cases as well as arrays for the sum and carry functions for a ternary full adder.
A New Scheme for Off-line Signature Verification Using DWT and Fuzzy Net
Authors: Wei Tian, Yizheng Qiao, Zhiqiang Ma
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In the novel system for off-line signature verification, both static and pseudodynamic features are extracted as original signal, which is processed by Discrete Wavelet Transform (DWT) for the purpose of enhancing the difference in time domain between a genuine signature and its forgery. The verification scheme is achieved by combining the proposed fuzzy net output in each sub-band level. In addition, how to train the fuzzy net and get the appropriate training samples are also introduced. The experimental results with English and Chinese signature databases confirm the effectiveness of the proposed technique and show its ability to yield high verification rates.
GPU-based shape from silhouettes
Authors: Sofiane Yous, Hamid Laga, Masatsugu Kidode, Kunihiro Chihara
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

In this paper, we present a new method for surface-based shape reconstruction from a set of silhouette images. We propose to project the viewing cones from all viewpoints to the 3D space and compute the intersections that represent the vertices of the Visual Hull (VH). We propose a method for fast traversal of the layers of the projected cones and retrieve the viewing edges that lie to the surface of the VH. Taking advantage of the power of Graphics Processing Units (GPU), the proposed method achieves a real-time full reconstruction of VH rather than rendering a novel view of the VH. The experiments on several data sets, including real data, demonstrate the efficiency of the method for real-time visual hull reconstruction.
An Artificial Immune Method for Stock Market Avoiding Control of Hedge Fund
Authors: Ze-Jun Wu, Wang Xu, Yi-Wen Liang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

With the increasing opening of Chinese Financial Market to the world, the international venture capital, especially the hedge fund, will make big profits through various operational means in this faulty environment. To ensure the stability of stock market, a newly method should be urgently proposed to participate in detecting abnormity of stock market. This paper introduces an artificial immune method, establishes the immune detecting system framework by mining the features of single stock's abnormal fluctuation and matching with macroeconomic indexes, uses negative selection algorithm recognizing "Self" and "Non-self" at the same time, while builds up detectors with alarm mechanism, providing a new idea for the management of stock risk.
A Shader for Virtual X-Ray Imaging
Authors: Shin Hasegawa, Hidetaka Funayama, Daming Wei
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

A virtual reality environment to visualize and ma- nipulate catheter-based electrophysiology study (EPS) and catheter ablation is under development in our lab. This paper presents a project developing a shader for virtual X-ray imaging. One of main technical issues is how to visualize the motion of catheters within a 3D heart model as an actual X-ray camera does. We describe an application of a novel shader tech- nique for visualizing virtual X-ray images in computer graphics. A programmable shader was developed to calculate thickness of the three-dimensional surface model of internal organs (bone, muscle, lungs, etc.) and generate virtual X-ray images in real-time. Exper- imental results suggest that the shader can be expected to be a convenient tool in the development of a virtual X-ray monitor.
New Products
Authors: D. Michalopoulos
Venue: Computer (1979)

Teradyne's J387A for testing dynamic and static RAMs, ROMs, and PROMs features half-nsec accuracy at the pins of the memory under test, a pattern generator testing dynamic RAMs at an unrestricted 20 MHz, and 16 independent timing sets for testing five-volt, address-multiplexed, page-mode memories.
High-Speed Manipulation of the Color Chromaticity of Digital Images
Authors: A. Lehar, R. Stevens
Venue: IEEE Computer Graphics and Applications (1984)

Using Peano curves and digital techniques, this aid to the interpretation of complex images enhances color chromaticity while reducing processing time.
Microcomputer-Aided Eating for the Severely Handicapped
Authors: R. L. Ramey
Venue: Computer (1979)

A prototype system shows how small, intelligent devices may offer the handicapped a new degree of independence.
The Inevitable Cycle: Graphical Tools and Programming Paradigms
Authors: Jiri Soukup, Martin Soukup
Venue: Computer (2007)

The prevalence of graphical tools suggests that current software design has become too complex to easily manage. Returning to more compact textual programming requires new programming languages and paradigms.
Performance Evaluation of TriBA -- A Novel Scalable Architecture for High Performance Applications
Authors: Haroon-Ur-Rashid Khan, Shi Feng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper evaluates the performance of TriBA - a new idea in multiprocessor architectures. TriBA is considered to be a high performance, scalable parallel computing architecture, therefore, its performance is evaluated by well-known scalability metrics speed-up and efficiency. The root of "triplet based architecture" is based on the concept that "Complex problems can be decomposed to three relatively independent subproblems, which are data Processing, data Management and data Communication". TriBA consists of a 2D grid of small, programmable processing units, each physically connected to its three neighbors. TriBA is a real scalable architecture, featuring fractal nature for computers. TriBA is a new solution for computer architecture, which is suitable for sophisticated embedded applications with multiple concurrent processing centers. The characteristics of this architecture are its great modularity, flexibility and scalability to meet the real-time signal processing demands in future telecommunication and multimedia systems. The feasibility, effectiveness and performance of TriBA is illustrated using execution model and simulations comparing it with conventional 2D mesh architecture.
Classification of Time-Sequential Attributes by Using Sequential Pattern Rules
Authors: Ya-Han Hu, Yen-Liang Chen, Er-Hsuan Lin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Classification is an important method for predicting class labels of samples. Although attribute-values in many real-life applications may change over time, existing classification research usually assumes that attribute-values are static. In this paper, we extend the traditional classification problem to deal with time- sequential attributes whose values may change over time. Accordingly, an algorithm called MultipleMIS- SP is presented to generate all classification rules for the classifier generation. Two scoring functions are proposed to predict class labels using our classifier. Detailed experiments are also presented. The results show that the accuracy of MultipleMIS-SP is greater than the traditional classification technique C4.5 algorithm in both the synthetic datasets and the real dataset.
Boolean problem of sequential minimization of moduli of linear functions and stability theorems
Authors: V. A. Emelichev, E. E. Gurevsky
Venue: Cybernetics and Systems Analysis (2007)

A multicriterion Boolean problem of lexicographic optimization with partial criteria represented by moduli (absolute values) of linear functions is considered. Five types of stability of a set of lexicographic optima under "small" variations in the parameters of a vector criterion are investigated.
Arithmetic Codes in Residue Number Systems with Magnitude Index
Authors: F. Barsi
Venue: IEEE Transactions on Computers (1978)

The idea of adding a magnitude index to the residue representation of numbers is reconsidered. The range of a given residue number system is supposed to be divided into intervals of equal width, and the magnitude index of a number X is defined as an integer locating X into one of such intervals. It is shown that the redundancy implied by the use of the magnitude index allows error detection or correction, and the redundancy requirements to detect or correct single residue digit errors are the same as in redundant residue number systems and in product codes in residue number systems. In addition, these codes allow detection of any error affecting the residue representation, provided that the magnitude of the error exceeds a given threshold, and, whenever an error is detected, it is possible to replace the wrong number with an approximation of the correct number.
An MDA Approach to Implement Personal IR Tools
Authors: Sven Meyerzu Eissen, Benno Stein
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We introduce TIRA, a software architecture for the rapid prototyping of tailored information retrieval (IR) tools. TIRA allows to compose personal IR tools from atomic IR services, following the model driven architecture (MDA) paradigm: In a first step, an IR process is defined independently from platforms, by means of a UML activity diagram. In a second step, the activity diagram is transformed to a platform specific model, which is executed in a distributed environment. Major driving force behind our research is the question of personalization: We see a large gap between information retrieval theory and algorithms on the one hand and their implementation and deployment to satisfy a personal information need on the other. This gap can be closed with adequate software engineering means, and TIRA shall contribute in this respect.
Making an Agreement in an Order-Heterogeneous Group by using a Distributed Coordination Protocol
Authors: Ailixier Aikebaier, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In peer-to-peer (P2P) applications, multiple peer processes are required to cooperate to make a global decision. In this paper, every process is assumed to be peer and autonomous, i.e. no centralized coordination. A domain of a process is a collection of possible values which the process can take. Each process first takes a value v in its domain and notifies the other processes of the value v. A process can take another value obtained from the values received from other processes. For example, a process may abort after notifying commit but cannot commit after notifying abort in the commitment control. An existentially (E)-precedent relation shows what values a process can take after taking a value. In addition, a process takes a more preferable value if the process can take one of multiple values. Thus, values are ordered in the preferentially (P)-precedent relation. Based on the precedent relations, each process takes the most preferable one in the values which can be changed from the current value v. In this paper, we discuss a coordination protocol in a type of heterogeneous system where every pair of processes have different precedent relations on the same domain. Each process learns a part of the precedent relation of another process through exchanging values.
Multi-focus Color Image Fusion Based on SWT and IHS
Authors: Hailiang Shi, Min Fang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The objective of image fusion is to combine information from multiple images of the same scene to form one composite image that contains a more accurate description of the scene than any one of the individual source images. A multi-focus color image fusion method is proposed in this paper. This method is implemented to perform Intensity-Hue-Saturation (IHS) transform on multi-focus color images to get intensity (I) components, and get wavelet coefficients by taking Stationary Wavelet Transform (SWT) on I components as basis of calculation of activity level of each pixel, then according to the activity level to form a fused image by a selection mode. Experimental results indicate that the proposed method outperforms the traditional approaches.
Constructing learning objects for adaptive assessments
Authors: Héctor G. Barbosa León, Francisco J. García Peñalvo, Ma. José Rodríguez Conde
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This article presents the work of an investigation to define learning objects for adaptive assessments. Two adaptation processes are described here, the first one is the adaptation in the level of complexity of the questions, and the second one is the adaptation in the final presentation according to the user's learning styles. To define the items and exams, a model consisting of three levels of concretization and four sections for constructing adaptive assessments is presented.
Security as a contributor to knowledge management success
Authors: Murray E. Jennex, Suzanne Zyngier
Venue: Information Systems Frontiers (2007)

Security is an important topic, but is it important for Knowledge Management (KM)? To date, little mainstream KM research is coming through with a security focus. This paper asks why, and proposes that security be integrated into KM success models. The Jennex and Olfman (International Journal of Knowledge Management 2(3):51---68, 2006) KM success model is used to illustrate how security, specifically risk management, and the National Security Telecommunications and Information System Security Committee (NSTISSC) security model can be applied to KM management support and governance and KM Strategy. Finally, two case studies are provided that illustrate the application of risk management through governance to KM.
Arabic Handwriting Texture Analysis for Writer Identification Using the DWT-Lifting Scheme
Authors: S. Gazzah, N. Ben Amara
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we present an approach for writer identification using off-line Arabic handwriting. The proposed method explores the handwriting texture analysis by 2D Discrete Wavelet Transforms using lifting scheme. A comparative evaluation between textural features extracted by 9 different wavelet transform functions was done. A modular Multilayer Perceptron classifier was used. Experiments have shown that writer identification accuracies reach best performance levels with an average rate of 95.68%. Experiments have been carried out using a database of 180 text samples. The chosen text was made to guarantee the involvement of the various internal shapes and letter locations within an Arabic subword.