ppxscal/embedding_network huggingface dataset:
Online interactive learning arena over the internet
Authors: Arvid Staupe, Line Kolås
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The article describes the experiences and results from the pilot project called "Online interactive learning arena" at the Norwegian University of Science and Technology. The pilot project used an internet-based video conferencing system in a course with about 80 students. The system was used for online lectures, online tutoring and online group work, with focus on the integration of different media types (e.g. audio, video, text, shared whiteboard) and the interactivity possibilities between the lecture room and the distributed students (via e.g. shared applications, audio- and text communication). We experienced new communication possibilities compared to traditional learning environments, but also that nervousness in public communication via the video conferencing system was less than in traditional lectures. Another experience was that one should use the possibilities and added value of the technology as a starting point for the organization of the use, and not put technology in the same frames as traditional education. The pilot project was one of several experiments conducted in the QUIS project.
Sequential Fault Diagnosis in Combinational Networks
Authors: I. Koren
Venue: IEEE Transactions on Computers (1977)

The problem considered in this paper is that of generating sequential decision trees (SDT's) for fault diagnosis in digital combinational networks. Since in most applications of the decision tree the final conclusion will be that the network is failure-free, we are interested mainly in decision trees containing minimal fault detection paths. Such a procedure will reduce the cost of verifying the proper operation of the network.
Cell Cluster Image Segmentation on Form Analysis
Authors: Weixing Wang, Hao Song
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, a segmentation algorithm based on form information is proposed for separation of touching and overlapping cells. The method integrating morphological smoothing with holes filling is employed in a pre-processing stage. Then the overlapping cell clusters are identified through a polygon approximation. Later the separation is implemented, which consists of the detecting concave points on the contours and determining the separation lines. The algorithm can split complicated large cell clusters. In addition, this algorithm can be adopted for other applications, where separation between touching and overlapping particles is needed.
Switch Complexity in Systems with Hybrid Redundancy
Authors: D. P. Siewiorek
Venue: IEEE Transactions on Computers (1973)

The combination of N-modular redundancy (NMR) and standby sparing has resulted in a promising redundancy technique for protecting those portions of a fault-tolerant system whose continuous real-time operation is essential. This technique, known as hybrid redundancy, uses N + Sp identical modules. N of these are connected to a majority voter to form an NMR core. The remaining Sp are used as standby spares. Disagreement detectors instruct a switch to replace with a standby spare any of the N modules that disagrees with the majority consensus. Since the switch and disagreement detector, as well as the modules, must function properly for the system to perform its designed task, the overall system reliability depends on the disagreement detector, switch, and hybrid reliabilities. Hence the overall reliability is a function of switch reliability. A highly reliable, thus simple, switch is desirable. First, strategies where every spare can be switched into every voter position (totally assigned) are considered. An optimal strategy is developed where the number of states in the switch is the criterion used for optimality. Formulas for the switch state count for the various strategies are derived and the strategies compared. Next, partially assigned switching strategies, strategies where every spare need not be capable of occupying every voter position, are examined. It is shown that designs where all spares are assigned to the same t + 2 of the 2t + 1 voter positions have as good reliability as the more complex totally assigned switching strategy.
Congestion management for non-blocking clos networks
Authors: Nikolaos I. Chrysos
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

We propose a distributed congestion management scheme for non-blocking, 3-stage Clos networks, comprising plain buffered crossbar switches. VOQ requests are routed using multipath routing to the switching elements of the 3rd-stage, and grants travel back to the linecards the other way around. The fabric elements contain independent single-resource schedulers, that serve requests and grants in a pipeline. As any other network with limited capacity, this scheduling network may suffer from oversubscribed links, hotspot contention, etc., which we identify and tackle. We also reduce the cost of internal buffers, by reducing the data RTT, and by allowing sub-RTT crosspoint buffers. Performance simulations demonstrate that, with almost all outputs congested, packets destined to non-congested outputs experience very low delays ( ow isolation). For applications requiring very low communication delays, we propose a second, parallel operation mode, wherein linecards can forward a few packets eagerly, each, bypassing the request-grant latency overhead.
Testing Memories for Single-Cell Pattern-Sensitive Faults
Authors: J. P. Hayes
Venue: IEEE Transactions on Computers (1980)

The design of minimum-length test sequences for pattern sensitivity in random-access memory (RAM) arrays is examined. The single pattern-sensitive fault (SPSF) model is used in which operations addressed to at most one memory cell are allowed to be faulty at any time. The influence of an SPSF affecting cell Ci is restricted to a fixed set of cells called the neighborhood of Ci. A new method is presented for efficiently generating the sequence of writes required in an SPSF test. This method yields optimal sequences for a useful class of neighborhoods called tiling neighborhoods. It is observed that RAM neighborhoods can be interpreted as polyominoes. A general procedure is given for constructing an SPSF test containing the minimum number of writes but a nonminimum number of reads. The difficult problem of minimizing the number of reads in an SPSF test is investigated for the 2-cell memory M2. A test of length 36 for M2 is derived which is optimal under certain reasonable restrictions. It is demonstrated that minimum-length SPSF tests can be inherently asymmetric.
A Dynamic Reconfigurable Adaptive Software Architecture for Federate in HLA-based Simulation
Authors: Yang Hu, Chen Hang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

As High Level Architecture (HLA) standard widely used in underwater warfare simulation applications, it is imperative that we should meet the need for the adaptation to the changing warfare requirements and improve development efficiency and reusability of simulation software, especially when developing a federate, known as a node in HLA-based distributed simulation. To address this problem, we present a dynamic reconfigurable adaptive software architecture for federate in this paper. The architecture has capability of self-adaptation to simulation requirements, and separates function realization from configuration control. It is composed of four layers, interface communication, requirement management, adaptation management and function realization. In this architecture, we partition the federate into several functional parts in terms of a definite granularity with Component-Based Software Development (CBSD) methodology. The architecture can adjust dynamically the configuration of federate to the new requirements while the simulation requirements change. Finally, we take a general sonar federate as an example to illustrate the presented architecture's support for adaptation.
Noise versus Facial Expression on 3D Face Recognition
Authors: Chaua Queirolo, Mauricio P. Segundo, Olga Bellon, Luciano Silva
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a new method for 3D face recognition. The method combines a Simulated Annealing-based approach for image registration using the Surface Interpenetration Measure (SIM) to perform a precise matching between two face images. The recognition score is obtained by combining the SIM scores of four different face regions after their alignment. Experiments were conducted on two databases with a variety of facial expressions. The images from the databases were classified according to noise level and facial expression, allowing the analysis of each particular effect on 3D face recognition. The method allows a verification rate of 99.9%, at a False Acceptance Rate (FAR) of 0%, for the FRGC ver 2.0 database when only noiseless, neutral expression face images are used. Also, the results using face images with expressions and noise demonstrate that subjects still can be recognized with 87.5% of verification rate, at a FAR of 0%.
Federal Appeals Court Sees Potential Antitrust Violation in Standardization Skullduggery
Authors: Richard Stern
Venue: IEEE Micro (2007)

The US court of appeals in Philadelphia recently ruled that intentional deception of a private standard-setting organization, when used to acquire or maintain monopoly power, can be an illegal monopolistic practice. The ruling reversed a trial court decision that had dismissed Broadcom's lawsuit against Qualcomm involving the latter's patented technology in the UMTS standard for cell phones. Stern explains the ruling and notes its implications for IEEE standard-setting bodies.
Self-Organizing Clusters for Routing Algorithm by Diffusing an Interest in Wireless Sensor Networks
Authors: Sangjoon Jung
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Traditional clustering methods have been investigated to enhance network manageability and to provide routing or multicasting scalability, since single-tier networks cause a specified node or router node to overload with too much data aggregation. We introduce a clustering strategy and self-organizing scheme for cluster-based wireless sensor networks, while maintaining the merits of a clustering approach. This scheme is a clustering method to configure cluster by diffusing an interest from a sink node. When a sink node diffuses an interest, every node decides which node is elected as a cluster head or intermediary node by sending and receiving messages. The first node receiving an interest is elected to become a cluster head and sends an advertisement message to the other nodes. Then another node receiving the advertisement message reports an acknowledgement message to the cluster head. The cluster head gathers information about cluster members and then organizes a cluster. The second node receiving first an advertisement message from the cluster head is elected as an intermediary node. When the node diffuses the interest, it is elected to be an intermediary node. The third node receiving an interest from the intermediary node can be elected to be another cluster head. The mechanism should continue to organize clusters until covering the whole network. Based on diffusing an interest, every node can participate in clusters and reports to a cluster head when receiving or sensing tasks.
Buffering global interconnects in structured ASIC design
Authors: Tianpei Zhang, Sachin S. Sapatnekar
Venue: Integration, the VLSI Journal (2008)

Structured ASICs present an attractive alternative to reducing design costs and turnaround times in nanometer designs. As with conventional ASICs, such designs require global wires to be buffered. However, via-programmable designs must prefabricate and preplace buffers in the layout. This paper proposes a novel and accurate statistical estimation technique for distributing prefabricated buffers through a layout. It employs Rent's rule to estimate the buffer distribution required for the layout, so that an appropriate structured ASIC may be selected for the design. Experimental results show that the buffer distribution estimation is accurate and economic, and that a uniform buffer distribution can maintain a high degree of regularity in design and shows a good timing performance, comparable with nonuniform buffer distribution.
A Tabu Search Algorithm using the Voronoi Diagram for the Capacitated Vehicle Routing Problem
Authors: Yong-Ju Kwon, Jun-Gyu Kim, Jeongyeon Seo, Dong-Ho Lee, Deok-Soo Kim
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

We consider the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer can be visited exactly once by one vehicle, starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the exiting local search heuristics. In particular, our tabu search algorithm incorporates the method to reduce the neighborhoods using the proximity information of the Voronoi diagram corresponding to each problem instance. Computational experiments are done on the benchmark problems and the test results are reported.
Automatic code stylizing
Authors: Steven P. Reiss
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Coding style is an important aspect of software development. We present a system that uses machine learning to deduce the coding style from a corpus of code and then applies this knowledge to convert arbitrary code to the learned style. We use a broad definition of coding style that includes spacing, indentation, naming, ordering, and equivalent programming constructs. The result provides a more flexible and powerful approach to code stylizing than current techniques.
Using Computers in Education
Authors: R. M. Aiken
Venue: Computer (1980)

Computer education and the appropriate uses of computers in education represent two especially critical areas of concern in what is rapidly becoming a computerized society. Last month, in the first of this two-part series on the impact of computers in education, we presented its philosophy and structure in a more extensive introduction; we also addressed the first concern-better training of computer professionals-with four articles that focused on curriculum issues. This month, we concentrate on the use of computers in education.
Service Is in the Eyes of the Beholder
Authors: Tiziana Margaria
Venue: Computer (2007)

We are in the early phases of the service era, with visions and promises, and as a community we still seek the essence and characterization of service orientation.
An automatic data grabber for large web sites
Authors: Valter Crescenzi, Giansalvatore Mecca, Paolo Merialdo, Paolo Missier
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We demonstrate a system to automatically grab data from data intensive web sites. The system first infers a model that describes at the intensional level the web site as a collection of classes; each class represents a set of structurally homogeneous pages, and it is associated with a small set of representative pages. Based on the model a library of wrappers, one per class, is then inferred, with the help an external wrapper generator. The model, together with the library of wrappers, can thus be used to navigate the site and extract the data.
Experimental and theoretical investigations of mouldability for feedstocks used in powder injection moulding
Authors: Çetin Karatas, Adnan Sözen, Erol Arcaklioglu, Sami Erguney
Venue: Modelling and Simulation in Engineering (2007)

Experimental and theoretical analyses of mouldability for feedstocks used in powder injection moulding are performed. This study covers two main analyses. (i) The experimental analysis: the barrel temperature, injection pressure, and flow rate are factors for powder injection moulding (PIM). Powder-binder mixture used as feedstock in PIM requires a little more attention and sensitivity. Obtaining the balance among pressure, temperature, and especially flow rate is the most important aspect of undesirable conclusions such as powder-binder separation, sink marks, and cracks in moulded party structure. In this study, available feedstocks used in PIM were injected in three different cavities which consist of zigzag form, constant cross-section, and stair form (in five different thicknesses) and their mouldability is measured. Because of the difference between material and binder, measured lengths were different. These were measured as 533 mm, 268 mm, 211 mm, and 150 mm in advanced materials trade marks Fe-2Ni, BASF firm Catamould A0-F, FN02, and 316L stainless steel, respectively. (ii) The theoretical analysis: the use of artificial neural network (ANN) has been proposed to determine the mouldability for feedstocks used in powder injection moulding using results of experimental analysis. The back-propagation learning algorithm with two different variants and logistic sigmoid transfer function were used in the network. In order to train the neural network, limited experimental measurements were used as training and test data. The best fitting training data set was obtained with three and four neurons in the hidden layer, which made it possible to predict yield length with accuracy at least as good as that of the experimental error, over the whole experimental range. After training, it was found that the R2 values are 0.999463, 0.999445, 0.999574, and 0.999593 for Fe-2Ni, BASF firm Catamould A0-F, FN02, and 316L stainless steel, respectively. Similarly, these values for testing data are 0.999129, 0.999666, 0.998612, and 0.997512, respectively. As seen from the results of mathematical modeling, the calculated yield lengths are obviously within acceptable uncertainties.
Registration Techniques for Using Imperfect and Partially Calibrated Devices in Planar Multi-Projector Displays
Authors: Ezekiel Bhasker, Ray Juang, Aditi Majumder
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Multi-projector displays today are automatically registered, both geometrically and photometrically, using cameras. Existing registration techniques assume pre-calibrated projectors and cameras that are devoid of imperfections such as lens distortion. In practice, however, these devices are usually imperfect and uncalibrated. Registration of each of these devices is often more challenging than the multi-projector display registration itself. To make tiled projection-based displays accessible to a layman user we should allow the use of uncalibrated inexpensive devices that are prone to imperfections. In this paper, we make two important advances in this direction. First, we present a new geometric registration technique that can achieve geometric alignment {\em in the presence of severe projector lens distortion} using a relatively inexpensive low-resolution camera. This is achieved via a closed-form model that relates the projectors to cameras, in planar multi-projector displays, using rational Bezier patches. This enables us to geometrically calibrate a 3000 x 2500 resolution planar multi-projector display made of 3 x 3 array of nine severely distorted projectors using a low resolution (640 x 480) VGA camera. Second, we present a photometric self-calibration technique for a projector-camera pair. This allows us to photometrically calibrate the same display made of nine projectors using a photometrically uncalibrated camera. To the best of our knowledge, this is the first work that allows geometrically imperfect projectors and photometrically uncalibrated cameras in calibrating multi-projector displays.
An Overview of Dircted Beam Graphics Display Hardware
Authors: A. P. Lucido
Venue: Computer (1978)

Directed beam CRT display devices have been available for some time now-long enough that we can discuss some organizations for practical graphics systems derived from the basic directed beam display design.
Knowledge Extraction for High-Throughput Biological Imaging
Authors: Wamiq M. Ahmed, Arif Ghafoor, J. Paul Robinson
Venue: IEEE MultiMedia (2007)

We present a multilayered architecture and spatiotemporal models for searching, retrieving, and analyzing high-throughput biological imaging data. The analysis is divided into low- and high-level processing. At the lower level, we address issues like segmentation, tracking, and object recognition. At the high level, we use finite-state-machine- and Petri-net-based models for spatiotemporal event recognition.
Dimensioning methods for data networks with flow-level QoS requirements
Authors: Pasi Lassila, Aleksi Penttinen, Jorma Virtamo
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

We consider dimensioning of data networks. The network is modeled in a dynamic setting where elastic flows (file transfers) arrive randomly and share the bandwidth according to balanced fairness. Simple methods are derived for determining the link capacities so that given flow-level throughput requirements are satisfied. We consider two different approaches to define the throughput requirements: single constraint on average throughput in the network and separate constraint for every route. The results enable a simple characterization of the order-of- magnitude of the required capacities, which can be utilized in practical network planning and dimensioning.
Modular LSI Control Logic Design with Error Detection
Authors: W. N. Toy
Venue: IEEE Transactions on Computers (1971)

This paper describes a modular approach of implementing the control circuitry. It is achieved by the use of multifunctional binary decoder circuits in conjunction with a transistor array high-speed READ-ONLY memory.
Implementing and testing dynamic timeout adjustment as a dos counter-measure
Authors: Daniel Boteanu, Edouard Reich, Jose M. Fernandez, John McHugh
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

In this paper we experimentally analyse various dynamic timeout adjustment strategies in server queues as potential counter-measures against degradation of service attacks. Previous theoretical work studied the relative performance of both coarse-grained threshold-based timeout and fine-grained adjusment strategies where the timeout value is adjusted as the number of connections in the queue varies. In addition, two methods for removing timed-out connections were explored: the deterministic method where the expiry time is determined at connection arrival depending on the timeout value at that moment, and the deferred method where connections are continuously polled and flushed when the time-in-queue is larger than the current timeout value.We report on experiments performed on a lab network where these strategies were tested against various configuration and attack parameters. The experimental results confirm the conclusions previously obtained from mathematical modelling and simulation, i.e. that a) finer-grained dynamic adjustment performs better than coarse-grained or no adjustment, and b) that the deferred method performs better than the deterministic one. Furthermore, our implementation of these counter-measures is very efficient and transparent with respect to the servers and applications it tries to protect. It could therefore be easily integrated into existing OS and applications or implemented in separate network devices, either on dedicated machines or network appliances.