ppxscal/embedding_network huggingface dataset:
Automated task distribution in multicore network processors using statistical analysis
Authors: Arindam Mallik, Yu Zhang, Gokhan Memik
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Chip multiprocessor designs are the most common types of architectures seen in Network Processors. As the Network Processors are used to implement increasingly complicated applications, task distribution among the cores is becoming an important problem. In this paper, we propose a new task allocation scheme for such architectures. This scheme relies on the inherent modular nature of the networking applications and intelligently distributes modules among different execution cores. Additionally, we selectively replicate modules to parallelize execution of tasks having longer processing time. We have developed a technique that uses the probability distribution of the execution times of different modules in the networking applications. The proposed schemes result in resource utilization of up to 95%, 89%, and 84% on average for the processors with 2, 4, and 8 cores, respectively. The schemes are highly scalable and can improve the throughput by 6.72 times for 8 core processors, aggregated over four representative applications. The combination of selective replication of modules and variation-aware task allocation result in up to 12.5% (9.9% on average) performance improvement as compared to a scheme based on just mean processing time.
Microsystems the Microprocessor in the Biological Laboratory
Authors: R. L. Schoenfeld
Venue: Computer (1977)

The use of microprocessors in the biological laboratory is a logical result of the evolution of computer use in the biomedical sciences. In 1963, H. K. Hartline and Floyd Ratliff, working at Rockefeller University in New York City, hooked up a CDC 160A computer as a generalpurpose laboratory instrument for data acquisition during their experiments on vision.1For stimulus control, they used a digital programmer constructed from commercially available discrete transistor logic circuits.2The work in the Hartline-Ratliff laboratory was a continuation of earlier work done by Hartline on inhibitory interaction in the horseshoe crab's eye, for which Hartline shared the Nobel Prize for Physiology and Medicine in 1966, with Wald and Granit.3
Timing neural networks in C and ada
Authors: Martin C. Carlisle, Leemon C. Baird III
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

In this paper, we describe a neural network program that was originally developed in C, then ported to Ada 2005. We explain several simple modifications to the Ada code that reduce the overhead from 76% to 0%. These modifications could provide significant performance gains to other applications, allowing them to combine the safety of Ada with the speed of C. such a complicated data structure. In Section 3, we explain how we modified the code in translating it to Ada. Section 4 describes how we made simple changes to the Ada implementation to eliminate the additional overhead. Section 5 provides conclusions and insights for future projects.
A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods
Authors: Burak Ekşioğlu, Sandra Duni Ekşioğlu, Pramod Jain
Venue: Computers and Industrial Engineering (2008)

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a well-diversified search procedure. The performance of the algorithm is tested using Taillard's benchmark problems. The results are compared to recently developed neuro-tabu search and ant colony heuristics. The computational results indicate the effectiveness of the proposed approach.
Efficient mining of frequent episodes from complex sequences
Authors: Kuo-Yu Huang, Chia-Hui Chang
Venue: Information Systems (2008)

Discovering patterns with great significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for consecutive and fixed-time intervals in a sequence. Most of previous studies on episodes consider only frequent episodes in a sequence of events (called simple sequence). In real world, we may find a set of events at each time slot in terms of various intervals (hours, days, weeks, etc.). We refer to such sequences as complex sequences. Mining frequent episodes in complex sequences has more extensive applications than that in simple sequences. In this paper, we discuss the problem on mining frequent episodes in a complex sequence. We extend previous algorithm MINEPI to MINEPI+ for episode mining from complex sequences. Furthermore, a memory-anchored algorithm called EMMA is introduced for the mining task. Experimental evaluation on both real-world and synthetic data sets shows that EMMA is more efficient than MINEPI+.
Author's Reply
Authors: M. C. Y. Kuo
Venue: IEEE Transactions on Computers (1969)

I wish to thank J. T. Taylo for his comment on my recent Correspondence item, "Solution of nonlinear equations." It was interesting to discover that the iterative formula, which I derived, was the same as that developed by Wolfe whose paper was not previously known to me. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
First silicon functional validation and debug of multicore microprocessors
Authors: Todd J. Foster, Dennis L. Lastor, Padmaraj Singh
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Microprocessor designs are increasingly moving towards multiple cores on a single die. Validating memory consistency, coherency, ordering, and atomicity is crucial. X86 microprocessors are prevalent at most levels of computing. Thus, new x86 microprocessors undergo extensive compatibility testing. Being a high volume product, the economic and logistical repercussions of a functional deficiency escaping into the production cycle and beyond are humbling. The first silicon functional validation and debug of multicore microprocessors are constrained by design complexity, compatibility with existing hardware and software, and time-to-market pressures. This paper describes microprocessor debug features and their use in debugging functional failures. An encompassing overview of the microprocessor's first silicon validation is presented. Emphasis is put on validation and debug of multicore microprocessors targeting multinode systems. This paper presents a novel method to validate and debug intra-node and inter-node communication traffic. This paper also develops an analysis to determine optimal on die debug resources. Finally, data from an 8-node system is presented to demonstrate the extent of intrusiveness of a coherent and noncoherent traffic debug feature.
Research on Video Segmentation via Active Learning
Authors: Wenwei Tan, Shaohua Teng, Wei Zhang
Venue: ICIG (2007)

We propose a method to video segmentation via active learning. Shot segmentation is an essential first step to video segmentation. The color histogram-based shot boundary detection algorithm is one of the most reliable variants of histogram-based detection algorithms. It is not unreasonable to assume that the color content does not change rapidly within but across shots. Thus, we present a metric based on blocked color histogram (BCH) for inter-frame difference. Our metric is the normalized intersection of BCH between contiguous frames. Hard cuts and gradual shot transitions can be detected as valleys in the time series of the differences between color histograms of contiguous frames or of frames a certain distance apart. We try to estimate the valleys on the frame-to-frame difference curve. Each kind of shot transition (Cut or Gradual shot transition) has its own characteristic pattern corresponding with valleys. Therefore shot detection can be viewed as pattern recognition. We employ the support vector machine (SVM) via active learning to classify shot boundaries and non-boundaries .Our method is evaluated on the TRECVID benchmarking platform and the experimental results reveal the effectiveness and robustness of the method..
Database Conceptual Schema Matching
Authors: Marco A. Casanova, Karin K. Breitman, Daniela F. Brauner, André L. A. Marins
Venue: Computer (2007)

Emphasis on the a priori design of standard database conceptual schemas simplifies schema matching.
Software Project Management Maturity Assessment Model to Assess Software Project Management Practices
Authors: Shukor Sanim Bin Mohd Fauzi, Nuraminah Bt Ramli
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This paper presents a model to assess Software Project Management (SPM) practices using our Software Project Management Maturity Assessment (SPMMA) model. We discuss the model procedure, assessment inputs and outputs, the assessment questionnaires, team selection associated with the SPMMA. We have tested our model in a mid-size IT company. One pilot project conferred with ISO 9001 certification has been selected in order to perform the assessment. For this version of assessment, it only focuses on the Project Management practices which comprise Project Planning, Project Monitoring and Control and Risk Management process areas. The paper also discuss about strength and weaknesses of the current process in the pilot project.
Processes, Tasks, and Monitors: A Comparative Study of Concurrent Programming Primitives
Authors: P. Wegner
Venue: IEEE Transactions on Software Engineering (1983)

Three notations for concurrent programming are compared, namely CSP, Ada, and monitors. CSP is an experimental language for exploring structuring concepts in concurrent programming. Ada is a general-purpose language with concurrent programming facilities. Monitors are a construct for managing access by concurrent processes to shared resources. We start by comparing "lower-level" communication, synchronization, and nondeterminism in CSP and Ada and then examine "higher-level" module interface properties of Ada tasks and monitors.
Comparing episodic and semantic interfaces for task boundary identification
Authors: Izzet Safer, Gail C. Murphy
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Multi-tasking is a common activity for computer users. Recent computer-based approaches to help support a user in multi-tasking require the user to indicate the start (and at least implicitly) end points of tasks manually. Although there has been some work aimed at inferring the boundaries of a user's tasks, it is not yet robust enough to replace the manual approach. Unfortunately, with the manual approach, a user can sometimes forget to identify a task boundary, leading to erroneous information being associated with a task or appropriate information being missed. These problems degrade the effectiveness of the multi-tasking support. In this paper, we describe two interfaces we designed to support task boundary identification. One interface stresses the use of episodic memory for recalling the boundary of a task; the other stresses the use of semantic memory. We investigate these interfaces in the context of software development. We report on an exploratory study of the use of these two interfaces by twelve programmers. We found that the programmers determined task boundaries more accurately with the episodic memory-based interface and that this interface was also strongly preferred.
Feature location via information retrieval based filtering of a single scenario execution trace
Authors: Dapeng Liu, Andrian Marcus, Denys Poshyvanyk, Vaclav Rajlich
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The paper presents a semi-automated technique for feature location in source code. The technique is based on combining information from two different sources: an execution trace, on one hand and the comments and identifiers from the source code, on the other hand. Users execute a single partial scenario, which exercises the desired feature and all executed methods are identified based on the collected trace. The source code is indexed using Latent Semantic Indexing, an Information Retrieval method, which allows users to write queries relevant to the desired feature and rank all the executed methods based on their textual similarity to the query. Two case studies on open source software (JEdit and Eclipse) indicate that the new technique has high accuracy, comparable with previously published approaches and it is easy to use as it considerably simplifies the dynamic analysis.
Microsystems Interview with an Entrepreneur
Venue: Computer (1977)

Not too long ago, Bob Moody's idea of a computer store was a warehouse full of used 360's. At least, that's what first came into his mind when Paul Terrell suggested they pool their resources to open shop. Now just two years after the two of them founded the original Byte Shop (there are currently over 40 individually owned Byte Shops across the country), Moody is, one of the most seasoned entrepreneurs in the personal computing movement. He and Terrell parted company in 1976, "because of capitalization problems." With Bob Spitler, another computer enthusiast, Moody today owns the Byte Shop in Palo Alto, California. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A New Interval-Genetic Algorithm
Authors: Xiaowei Zhang, Sanyang Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Interval optimization algorithms usually use local search methods to obtain a good upper bound of the global optimal value. These local methods are based on point evaluations. A new interval-genetic algorithm is presented that combines an interval arithmetic and a genetic algorithm in the paper. The proposed algorithm uses the improved upper bound of the global optimal value obtained by the genetic algorithm to delete the intervals not containing the global optimal solution from the work set at each iteration. Using the interval arithmetic, the new algorithm not only has the advantages of simplicity and less knowledge about problems as traditional interval optimization algorithms, but also produces the reliable domains where the genetic algorithm is applied to search. Moreover, with the direction provided by the genetic algorithm applied, the chance to divide the reliable interval is increased. A convergence is proved and numerical experiments shows that the proposed algorithm is more efficient than traditional interval optimization algorithms.
A discrete-time single-server queue with a modified N-policy
Authors: Pilar Moreno
Venue: International Journal of Systems Science (2007)

We consider a discrete-time single-server queue where the idle server waits for reaching a level N in the queue size to start a batch service of N messages, although the following arrivals during the busy period receive single services. We find the stationary distributions of the queue and system lengths as well as some performance measures. The vacation and busy periods of the system and the number of messages served during a busy period are also analyzed. The stationary distributions of the time spent waiting in the queue and in the system are studied too. Finally, a total expected cost function is developed to determine the optimal operating N-policy at minimum cost.
Real-time Shadow Rendering in Scene System of Marine Simulator
Authors: Hong-xiang Ren, Yi-cheng Jin, Yong Yin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In the large-scale scene system based on scene management software, an efficient method was presented to render shadow with shadow volume algorithm. Approaches were discussed to convert scene model from openflight file to 3ds file. The data used to determine silhouette edge was obtained by accessing the simplest LOD of model. A new method that reduced silhouette edge by removing redundant internal edge was provided. A new strategy of shadow rendering was presented: depending on model's position, shadows were rendered with z-pass algorithm utilizing CPU or z-fail algorithm within vertex shader. The method and strategy presented in this paper can be integrated directly into the large-scale scene system based on scene management software. The effect of shadow rendering meets the real-time and reality requirements of scene system.
Multi-Speed DVS Algorithms for Periodic Tasks with Non-Preemptible Sections
Authors: Jaewoo Lee, Kern Koh, Chang-Gun Lee
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Reducing energy consumption is important for mobile embedded systems and one of its solutions is Dynamic Voltage Scaling (DVS). In this paper, we examine how to achieve further energy saving for periodic real-time tasks with non-preemptible sections on EDF algorithm by using DVS. Previous algorithms use two speed levels to deal with run-time blocking situation. However, this paper proposes a multi-speed algorithm that exploits various speed levels depending on specific blocking situation to minimize energy consumption. Moreover, it also presents an enhanced multi-speed algorithm that further reduces the energy dissipation by dropping the speed level early and considering only remaining blocking time to compute a lower speed. We induced feasibility conditions for our algorithms and proved them. The experiments show that proposed algorithms achieve up to 70.8% energy saving compared to previous algorithms.
A Method of Annotation Extraction from Paper Documents Using Alignment Based on Local Arrangements of Feature Points
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Annotations on paper documents include important information. We can exploit the information by extracting and analyzing annotations. In this paper, we propose a method of annotation extraction from paper documents. Unlike previous methods which limit colors or types of annotations to be extracted, the proposed method attempts to extract annotations by comparing a document image of an annotated document with its original document image for removing the limitations. The proposed method is characterized by fast matching and flexible subtraction of images both of which are essential to the annotation extraction by comparison. Experimental results have shown that color annotations can be extracted from color documents.
Optimal proactive caching in peer-to-peer network: analysis and application
Authors: Weixiong Rao, Lei Chen, Ada Wai-Chee Fu, YingYi Bu
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-to-Peer (P2P) technology is used as the underlying network to build new Internet-scale applications. However, one of the well known issues in such an application (for example WWW) is that the distribution of data popularities is heavily tailed with a Zipf-like distribution. With consideration of the skewed popularity we adopt a proactive caching approach to handle the challenge, and focus on two key problems: where (i.e. the placement strategy: where to place the replicas) and how (i.e. the degree problem: how many replicas are assigned to one specific content)? For the where problem, we propose a novel approach which can be generally applied to structured P2P networks. Next, we solve two optimization objectives related to the how problem: MAX_PERF and MIN_COST. Our solution is called <B>PoPCache</B>, and we discover two interesting properties: (1) the number of replicas assigned to each content is proportional to its popularity; (2) the derived optimal solutions are related to the entropy of popularity. To our knowledge, none of the previous works has mentioned such results. Finally, we apply the results of PoPCache to propose a P2P base web caching, called as Web-PoPCache. By means of web cache trace driven simulation, our extensive evaluation results demonstrate the advantages of PoPCache and Web-PoPCache.
Relative scale method to locate an object in cluttered environment
Authors: Md. Saiful Islam, Andrzej Sluzek
Venue: Image and Vision Computing (2008)

This paper proposes an efficient method to locate a three-dimensional object in cluttered environment. Model of the object is represented in a reference scale by the local features extracted from several reference images. A PCA-based hashing technique is introduced for accessing the database of reference features efficiently. Localization is performed in an estimated relative scale. Firstly, a pair of stereo images is captured simultaneously by calibrated cameras. Then the object is identified in both images by extracting features and matching them with reference features, clustering the matched features with generalized Hough transformation, and verifying clusters with spatial relations between the features. After the identification process, knowledge-based correspondences of features belonging to the object present in the stereo images are used for the estimation of the 3D position. The localization method is robust to different kinds of geometric and photometric transformations in addition to cluttering, partial occlusions and background changes. As both the model representation and localization are single-scale processes, the method is efficient in memory usage and computing time. The proposed relative scale method has been implemented and experiments have been carried out on a set of objects. The method results very good accuracy and takes only a few seconds for object localization by our primary implementation. An application of the relative scale method for exploration of an object in cluttered environment is demonstrated. The proposed method could be useful for many other practical applications.
The Precise Recognition of Moving Object in Complex Background
Authors: Weiyao Huang, Zhijing Liu, Wenjuan Pan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Moving object detection is currently one of the most active research topics in the domain of computer vision and video processing. In this paper, a simply and fast quadric binaryzation method is proposed to remove environmental noise points effectively. Moreover, based on the stability of drawing the contour from fixed scene, the background subtraction method is combined with the time-stepping method, an effective method which could be used to detect the movement areas. Through the average weighted of two means can realize to enhance the accuracy in distinguishing target. Experiment results have shown that this method gives stable performances and good robustness.