ppxscal/embedding_network huggingface dataset:
Meta-heuristics for stable scheduling on a single machine
Authors: Francisco Ballestín, Roel Leus
Venue: Computers and Operations Research (2008)

This paper presents a model for single-machine scheduling with stability objective and a common deadline. Job durations are uncertain, and our goal is to ensure that there is little deviation between planned and actual job starting times. We propose two meta-heuristics for solving an approximate formulation of the model that assumes that exactly one job is disrupted during schedule execution, and we also present a meta-heuristic for the global problem with independent job durations.
(algorithms)
Authors: Pavel Curtis
Venue: ACM SIGPLAN Lisp Pointers (1989)

This issue's installment of (algorithms) is an article by Olivier Danvy giving his elegant solution to the (by now infamous) xp1 puzzle posed by Christian Queinnec and J&eacute;r&ocirc;me Chailloux back in issue I-6 of Lisp Pointers. The code in the article is written in Scheme, but should be reasonably easy for any Common Lisp programmer to read. Just in case, I've included a short guide to Scheme for Common Lisp programmers at the end of the article.
An Extension of VPRS Model Based on Dominance Relation
Authors: Li-rong Jian, Ming-yang Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

An extension of variable precision rough set model is proposed based on dominance relation instead of indiscernibility relation, which can deal with possible inconsistency from decision tables with preference attributes, and obtain probabilistic decision rules made up of preference actions. Applying these rules, a preference model from example decision systems is inferred. Research results demonstrate that the minimal set of probabilistic decision rules obtained from a preferential attribute decision table through dominance relation have a smaller number of stronger rules and use a smaller number of conditions. Key words: Variable precision rough set; decision tables with preference attribute; dominance relation; preferential probabilistic rules.
Using geometric properties of topographic manifold to detect and track eyes for human-computer interaction
Authors: Jun Wang, Lijun Yin, Jason Moore
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2007)

Automatic eye detection and tracking is an important component for advanced human-computer interface design. Accurate eye localization can help develop a successful system for face recognition and emotion identification. In this article, we propose a novel approach to detect and track eyes using geometric surface features on topographic manifold of eye images. First, in the joint spatial-intensity domain, a facial image is treated as a 3D terrain surface or image topographic manifold. In particular, eye regions exhibit certain intrinsic geometric traits on this topographic manifold, namely, the pit-labeled center and hillside-like surround regions. Applying a terrain classification procedure on the topographic manifold of facial images, each location of the manifold can be labeled to generate a terrain map. We use the distribution of terrain labels to represent the eye terrain pattern. The Bhattacharyya affinity is employed to measure the distribution similarity between two topographic manifolds. Based on the Bhattacharyya kernel, a support vector machine is applied for selecting proper eye pairs from the pit-labeled candidates. Second, given detected eyes on the first frame of a video sequence, a mutual-information-based fitting function is defined to describe the similarity between two terrain surfaces of neighboring frames. By optimizing the fitting function, eye locations are updated for subsequent frames. The distinction of the proposed approach lies in that both eye detection and eye tracking are performed on the derived topographic manifold, rather than on an original-intensity image domain. The robustness of the approach is demonstrated under various imaging conditions and with different facial appearances, using both static images and video sequences without background constraints.
Task Scheduling on the PASM Parallel Processing System
Authors: D. L. Tuomenoksa
Venue: IEEE Transactions on Software Engineering (1985)

PASM is a proposed large-scale distributed/parallel processing system which can be partitioned into independent SIMD/MIMD machines of various sizes. One design problem for systems such as PASM is task scheduling. The use of multiple FIFO queues for nonpreemptive task scheduling is described. Four multiple-queue scheduling algorithms with different placement policies are presented and applied to the PASM parallel processing system. Simulation of a queueing network model is used to compare the performance of the algorithms. Their performance is also considered in the case where there are faulty control units and processors. The multiple-queue scheduling algorithms can be adapted for inclusion in other multiple-SIMD and partitionable SIMD/MIMD systems that use similar types of interconnection networks to those being considered for PASM.
FPGA-Based Multigrid Computation for Molecular Dynamics Simulations
Authors: Yongfeng Gu, Martin C. Herbordt
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

FPGA-based acceleration of molecular dynamics (MD) has been the subject of several recent studies. Implementing long-range forces, however, has only recently been addressed. Here we describe a solution based on the multigrid method. We show that multigrid is, in general, an excellent match to FPGAs: the primary operations take advantage of the large number of independently addressable RAMs and the efficiency with which complex systolic structures can be implemented. The multigrid accelerator has been integrated into our existing MD system, and an overall performance gain of 5x to 7x has been obtained, depending on hardware configuration and reference code. The simulation accuracy is comparable to the original double precision serial code.
Implementing Software Process Improvement Initiatives in Small and Medium-Size Enterprises in Brazil
Authors: Gleison Santos, Mariano Montoni, Jucele Vasconcellos, Savio Figueiredo, Reinaldo Cabral, Cristina Cerdeiral, Anne Elise Katsurayama, Peter Lupo, David Zanetti, Ana Regina Rocha
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Appropriate process implementation approaches are fundamental for Small and Medium-size Enterprises (SMEs) to obtain the most of Software Process Improvement (SPI) benefits. COPPE/UFRJ has been providing SPI consultancy services to the Brazilian software industry for more than two decades. In order to cope with factors that have influence on SPI success, we developed an approach to implement SPI initiatives based on the Brazilian software process model (named MPS Model) through the adoption of a SPI strategy (named SPI-KM) and the support of a Process- centered Software Engineering Environment named Taba Workstation. This paper presents the work conducted in a group of Brazilian SMEs aiming to deploy the MPS model based initiatives using the SPI-KM strategy supported by the Taba Workstation. We also discuss the lessons learned from implementing SPI in this group of SMEs and also other lessons collected throughout previous SPI experiences.
Cohesion Metrics for Predicting Maintainability of Service-Oriented Software
Authors: Mikhail Perepletchikov, Caspar Ryan, Keith Frampton
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Although Service-Oriented Computing (SOC) is a promising paradigm for developing enterprise software systems, existing research mostly assumes the existence of black box services with little attention given to the structural characteristics of the implementing software, potentially resulting in poor system maintainability. Whilst there has been some preliminary work examining coupling in a service- oriented context, there has to date been no such work on the structural property of cohesion. Consequently, this paper extends existing notions of cohesion in OO and procedural design in order to account for the unique characteristics of SOC, allowing the derivation of assumptions linking cohesion to the maintainability of service-oriented software. From these assumptions, a set of metrics are derived to quantify the degree of cohesion of service oriented design constructs. Such design level metrics are valuable because they allow the prediction of maintainability early in the SDLC.
An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation
Authors: S. R. Das
Venue: IEEE Transactions on Computers (1971)

There exist a number of methods for finding minimal or nonminimal irredundant solutions of switching functions. Recently in a paper by Marcovitz and Shub, an improved algorithm for simplifying switching functions using a Karnaugh map is suggested. The present study extends the basic idea of the authors in finding minimal and nonminimal irredundant solutions by using the cover table representation of switching functions instead of the map.
A flexible UMTS/WLAN architecture for improved network performance
Authors: George Lampropoulos, Nikos Passas, Alexandros Kaloxylos, Lazaros Merakos
Venue: Wireless Personal Communications: An International Journal (2007)

Current trends in cellular telecommunications suggest the incorporation of Wireless Local Area Networks (WLANs) as supplementary access technologies into the existing cellular infrastructure. Overlay network architectures are expected to improve both service provision and resource utilization under the condition that sophisticated architectural options are followed. Many proposals suggest that all active connections be handled through the same access network technology. However, this is not believed to be efficient in a heterogeneous environment. Therefore, a mechanism that allows each connection of a terminal to be served by different radio access technology is introduced. Based on a tight coupling architecture for interworking between Universal Mobile Telecommunications System (UMTS) and WLANs, the proposed scheme combines a sophisticated decision mechanism with flexible connection management in a way that ensures seamless service continuity during handover. The performance of the system is evaluated using a detailed simulation model and compared against existing architectures. Simulation results indicate an improvement in parameters such as connection and handover blocking probabilities, which justifies the enhancement in the overall usage of network resources when connections are handled separately.
Stream Data Management Based on Integration of a Stream Processing Engine and Databases
Authors: Hiroyuki Kitagawa, Yousuke Watanabe
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Recent developments in network and sensor device technologies enable us to easily obtain real-world information, such as locations of moving objects, weather information, news, and stock prices. These data are continuously supplied, and they are regarded as data streams. Because of the dramatical increase of streaming data, their management and utilization has become more and more important. This paper describes a data stream management system named Harmonica. Harmonica employs an architecture combining our stream processing engine named Stream- Spinner and relational DBMSs. Based on the architecture, the system processes both continuous queries and traditional one-shot queries. Moreover, Harmonica supports continuous persistence requirements for streaming data as well as queries including selection, join, projection, and user-defined functions over data streams. Users can also specify continuous queries that integrate streaming data and persistent data stored in databases. Using the Harmonica API, users can develop a variety of applications coping with different continuous steaming data and data stored in databases. Our system can be deployed in network environments to achieve efficient and dependable distributed stream processing.
Scan Testing for Complete Coverage of Path Delay Faults with Reduced Test Data Volume, Test Application Time, and Hardware Cost
Authors: Dong Xiang, Krishnendu Chakrabarty, Dianwei Hu, Hideo Fujiwara
Venue: Proceedings of the 16th Asian Test Symposium (2007)

A new scan architecture, called enhanced scan forest, is proposed to detect path delay faults and reduce test stimulus data volume, test response data volume, and test application time. The enhanced scan forest architecture groups scan flipflops together, where all scan flip-flops in the same group are assigned the same value for all test vectors. All scan flipflops in the same group share the same hold latch, and the enhanced scan forest architecture makes the circuit work in the same way as a conventional enhanced scan design. The area overhead of the proposed enhanced scan forest is greatly reduced compared to that for enhanced scan design. A lowarea- overhead zero-aliasing test response compactor is designed for path delay faults. Experimental results for the ISCAS benchmark circuits are presented to demonstrate the effectiveness of the proposed method.
On the Mapping Problem
Authors: S. H. Bokhari
Venue: IEEE Transactions on Computers (1981)

In array processors it is important to map problem modules onto processors such that modules that communicate with each other lie, as far as possible, on adjacent processors. This mapping problem is formulated in graph theoretic terms and shown to be equivalent, in its most general form, to the graph isomorphism problem. The problem is also very similar to the bandwidth reduction problem for sparse matrices and to the quadratic assignment problem.
Fault Diagnosis in Synchronous Sequential Circuits Based on an Effect-Cause Analysis
Authors: M. Abramovici
Venue: IEEE Transactions on Computers (1982)

In this paper we present a new approach to fault diagnosis in sequential circuits based on an effect-cause analysis. This represents an extension of our previous work dealing with combinational circuits [1]. The main tool of our approach is the Deduction Algorithm, which deduces internal values in the circuit under test based upon the test results. The deduced values are used for fault diagnosis, which encompasses both fault detection and location.
An Analytic Approach to Group Decision Making with Uncertain Linguistic Preference Information
Authors: Xia Chen, Zhi-Ping Fan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper proposes an approach to solve the group decision-making (GDM) problem, in which the information about the attribute weights are uncertain linguistic variables, the expert weights are numbers, and the uncertain multiple attributes provided by decision makers are represented in uncertain linguistic preference information. In order to compute collective ranking values of alternatives based on uncertain linguistic preference information, a new uncertain linguistic weighted aggregation (ULWA) operator and the formula of possibility for comparing two uncertain linguistic variables are defined. Thus, individual uncertain linguistic preferences can be aggregated into a collective preference and ranking of the alternatives or selection of the best alternative(s) is obtained based on the ULWA operator and the formula of possibility for comparing two uncertain linguistic variables. A numerical example is used to illustrate the applicability of the proposed approach.
Lossless Compression of Hyperspectral Imagery Using Integer Principal Component Transform and 3-D Tarp Coder
Authors: Xin Luo, Lei Guo, Zhen Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Based on factorization of the transform matrix in triangular elementary reversible matrices (TERM), an integer approximation algorithm of the principal component transform (IPCT) is proposed. We improve the pivoting method of TERM factorization in order to obtain limited error and enhanced computational efficiency, and we develop a new lossless compression algorithm for hyperspectal imagery combining the perfectly reversible integer PCT with the 3-D Tarp coder. After applying an integer wavelet transform in spatial domain we use the improved IPCT for interband derecolation. In coding stage the novel 3-D Tarp coder allows probability estimation with five simple recursive filters. And this probability estimate can be used to drive a non-adaptive arithmetic coder to entropy code significance-map and refinement information of transformed coefficients. The main advantage of our compression algorithm is low complexity and it can yield embedded bitstreams with higher compression ratio compared to existing algorithms.
An Interconnect-Centric Approach to Cyclic Shifter Design Using Fanout Splitting and Cell Order Optimization
Authors: Haikun Zhu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We propose two orthogonal approaches to logarithmic cyclic shifter design. The first method, called fanout splitting, replaces multiplexers in a conventional design with demultiplexers which have two fanouts driving the shifting and non-shifting paths separately. The use of demultiplexers has a two-fold effect; it cuts the accumulated wire load on the critical path from O(Nlog2(N)) to O(N), and reduces the switching probabilities on the inter-stage long wires from 1/4 to 3/16. We then perform cell order optimization to further improve the delay, and formulate it as an integer linear programming problem. For the 64-bit case, the two approaches together reduce the total delay by 67.1% and dynamic power consumption by 17.6%, respectively.
Geometry for robot path planning
Authors: Lyle Noakes, Tomasz Popiel
Venue: Robotica (2007)

There have been many interesting recent results in the area of geometrical methods for path planning in robotics. So it seems very timely to attempt a description of mathematical developments surrounding very elementary engineering tasks. Even with such limited scope, there is too much to cover in detail. Inevitably, our knowledge and personal preferences have a lot to do with what is emphasised, included, or left out. Part I is introductory, elementary in tone, and important for understanding the need for geometrical methods in path planning. Part II describes the results on geometrical constructions that imitate well-known constructions from classical approximation theory. Part III reviews a class of methods where classical criteria are extended to curves in Riemannian manifolds, including several recent mathematical results that have not yet found their way into the literature.
Cooperation and groupness: community formation in small online collaborative groups
Authors: Sean P. Goggins, James Laffey, I-Chun Tsai
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

We present a detailed descriptive analysis of the adoption and adaptation of common online tools by a newly forming small group with a cooperative work task. We compare their use of different tools over the course of successive specific cooperative activities, and describe how they use these tools as objects in the formation of a small online community. General patterns of participation that recognize the physical contexts of online group members, and specific patterns of interaction that influence the formation of an online community are explicated. The results of this study have implications for understanding how tools and tasks influence group formation and sense of community in online systems.
Two-Stage Template Matching
Authors: G. J. Vanderbrug
Venue: IEEE Transactions on Computers (1977)

The computational cost of template matching can be reduced by using only a subtemplate, and applying the rest of the template only when the subtemplate's degree of match exceeds a threshold. A probabilistic analysis of this approach is given, with emphasis on the choice of subtemplate size to minimize the expected computational cost.
Ontology Mapping Based-on Angle Degree of Approaching
Authors: Kangyin Yin, Zilin Song, Weihua Ai, Yaxin Yi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Ontologies are playing an important role in semantic web. Ontology mapping is an effective method to solve the problem of ontology heterogeneity and to realize the interoperation among semantic web applications which use different ontologies. Instances and structures are important factors to establish ontology mapping, however, existing ontology mapping methods combine the results of different strategies with weighted average and the weights are subjective. In this paper, the angle degree of approaching is proposed according to the principle of fuzzy mathematics and is applied to similarity measure. Similarity measure based-on approach degree expresses all the similarities between different factors with vectors respectively, and combines them. In the end, the experimental results show this method is more objective and can calculate the similarities more accurately than the other methods. Keywords: approach degree, ontology heterogeneity, similarity, ontology mapping
A 5-GHz Mesh Interconnect for a Teraflops Processor
Authors: Yatin Hoskote, Sriram Vangal, Arvind Singh, Nitin Borkar, Shekhar Borkar
Venue: IEEE Micro (2007)

A multicore processor in 65-nm technology with 80 single-precision, floating-point cores delivers performance in excess of a teraflops while consuming less than 100 W. A 2D on-die mesh interconnection network operating at 5 GHz provides the high-performance communication fabric to connect the cores. The network delivers a bisection bandwidth of 2.56 Terabits per second and a per hop fall-through latency of 1 nanosecond.
How to distinguish posed from spontaneous smiles using geometric features
Authors: Michel F. Valstar, Hatice Gunes, Maja Pantic
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Automatic distinction between posed and spontaneous expressions is an unsolved problem. Previously cognitive sciences' studies indicated that the automatic separation of posed from spontaneous expressions is possible using the face modality alone. However, little is known about the information contained in head and shoulder motion. In this work, we propose to (i) distinguish between posed and spontaneous smiles by fusing the head, face, and shoulder modalities, (ii) investigate which modalities carry important information and how the information of the modalities relate to each other, and (iii) to which extent the temporal dynamics of these signals attribute to solving the problem. We use a cylindrical head tracker to track the head movements and two particle filtering techniques to track the facial and shoulder movements. Classification is performed by kernel methods combined with ensemble learning techniques. We investigated two aspects of multimodal fusion: the level of abstraction (i.e., early, mid-level, and late fusion) and the fusion rule used (i.e., sum, product and weight criteria). Experimental results from 100 videos displaying posed smiles and 102 videos displaying spontaneous smiles are presented. Best results were obtained with late fusion of all modalities when 94.0% of the videos were classified correctly.