ppxscal/embedding_network huggingface dataset:
An Empirical Study on Improving the Manufacturing Informatization Index System of China
Authors: Wei Guo, Ke Chen, Jia Wang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The manufacturing informatization index system (MIIS) is an indispensable tool to measure the informatization level of Chinese manufacturing industry and evaluate the implementation effect of the manufacturing informatization engineering (MIE) conducted by the government of China. Thus far, the constructs of MIIS has not been validated. This study fills this void by employing structural equation modeling (SEM) to test the MIIS model. The samples in this study come from the standard database of Chinese manufacturing informatization established by the data survey of MIE during the "Tenth Five-Year Plan" period, including 12896 enterprises samples from 11 manufacturing industries and 3472 support samples from 29 provinces of China. Based on the results of SEM analysis, some indexes of MIIS are adjusted and an improved MIIS is got at last. This empirical study proves that combining SEM technology and standard data resources would be an ideal method to improve MIIS.
A theory of competitive analysis for distributed algorithms
Authors: M. Ajtai, J. Aspnes, C. Dwork, O. Waarts
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We introduce a theory of competitive analysis for distributed algorithms. The first steps in this direction were made in the seminal papers of Y. Bartal et al. (1992), and of B. Awerbuch et al. (1992), in the context of data management and job scheduling. In these papers, as well as in other subsequent sequent work, the cost of a distributed algorithm is compared to the cost of an optimal global-control algorithm. In this paper we introduce a more refined notion of competitiveness for distributed algorithms, one that reflects the performance of distributed algorithms more accurately. In particular, our theory allows one to compare the cost of a distributed on-line algorithm to the cost of an optimal distributed algorithm. We demonstrate our method by studying the cooperative collect primitive, first abstracted by M. Saks, N. Shavit, and H. Woll (1991). We provide the first algorithms that allow processes to cooperate to finish their work in fewer steps. Specifically, we present two algorithms (with different strengths), and provide a competitive analysis for each one.
COVER STORYChanging energy use through design
Authors: James Pierce, David Roedl
Venue: interactions (2008)

Editors' Note: We are delighted to present Eli Blevis' Sustainably Ours forum as the cover story for this issue
Extremal problems on triangle areas in two and three dimensions
Authors: Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

The study of extremal problems on triangle areas was initiated in a series of papers by Erdös and Purdy in the early 1970s. Here we present new results on such problems, concerning the number of triangles of the same area that are spanned by finite point sets in the plane and in 3-space, and the number of distinct areas determined by the triangles. In the plane, our main result is an O(n44/19) = O(n2.3158) upper bound on the number of unit-area triangles spanned by n points, which is the first improvement of the classical bound of O(n7/3) from 1992. We also make progress in a number of important special cases: We show: (i) For points in convex position, there exist n-element point sets that span Ω(n log n) triangles of unit area. (ii) The number of triangles of minimum (nonzero) area determined by n points is at most 2/3(n2 -- n); there exist n-element point sets (for arbitrarily large n) that span (6/π2 -- o(1))n2 minimum-area triangles. (iii) The number of acute triangles of minimum area determined by n points is O(n); this is asymptotically tight. (iv) For n points in convex position, the number of triangles of minimum area is O(n); this is asymptotically tight. (v) If no three points are allowed to be collinear, there are n-element point sets that span (n log n) minimum-area triangles (in contrast to (ii), where collinearities are allowed and a quadratic lower bound holds). In 3-space we prove an O(n17/7β(n)) = O(n2.4286) upper bound on the number of unit-area triangles spanned by n points, where β(n) is an extremely slowly growing function related to the inverse Ackermann function. The best previous bound, O(n8/3), is another classical result of Erdös and Purdy from 1971. We further show, for point sets in3-space: (i) The number of minimum nonzero area triangles is at most n2 + O(n), and this is worst-case optimal, up to a constant factor. (ii) There are n-element point sets that span (n4/3) triangles of maximum area, all incident to a common point. In any n-element point set, the maximum number of maximum-area triangles incident to a common point is O(n4/3+ε), for any ε > 0. (iii) Every set of n points, not all on a line, determines at least (n2/3/β(n)) triangles of distinct areas, which share a common side.
Linux as a teaching aid for embedded systems
Authors: Ian McLoughlin, Anton Aendenroomer
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Linux, an operating system kernel with a heritage derived from the room-sized mainframes of the 1970s, has seen a trememdous amount of multidisciplinary and worldwide development which has resulted in its ability to operate on some of the smallest and lowest power microprocessors available today.With its ongoing penetration into mass market embedded systems such as smart phones, automotive and aeronautical equipment, multimedia entertainment devices and personal digital assistants, versions of Linux are now the operating system of choice for many embedded developers. However Linux tends to be overlooked in the more traditional embedded electronics education.This paper explores the characteristics of embedded Linux that affect the education of embedded systems, and describes a tested educational model for its teaching within a general embedded systems education course.
Extraction and optimization of fuzzy association rules using multi-objective genetic algorithm
Authors: P. Santhi Thilagam, V. S. Ananthanarayana
Venue: Pattern Analysis Applications (2008)

Association Rule Mining is one of the important data mining activities and has received substantial attention in the literature. Association rule mining is a computationally and I/O intensive task. In this paper, we propose a solution approach for mining optimized fuzzy association rules of different orders. We also propose an approach to define membership functions for all the continuous attributes in a database by using clustering techniques. Although single objective genetic algorithms are used extensively, they degenerate the solution. In our approach, extraction and optimization of fuzzy association rules are done together using multi-objective genetic algorithm by considering the objectives such as fuzzy support, fuzzy confidence and rule length. The effectiveness of the proposed approach is tested using computer activity dataset to analyze the performance of a multi processor system and network audit data to detect anomaly based intrusions. Experiments show that the proposed method is efficient in many scenarios.
FP-MAC: A distributed MAC algorithm for 802.15.4-like wireless sensor networks
Authors: Ioannis Gragopoulos, Ioannis Tsetsinas, Eirini Karapistoli, Fotini-Niovi Pavlidou
Venue: Ad Hoc Networks (2008)

In this paper we focus on the problems of high latency and low throughput arising from the periodic operation of MAC protocols for wireless sensor networks. In order to meet both design criteria we propose an energy-efficient, low delay, fast-periodic MAC algorithm, namely FP-MAC, that is exclusively designed for 802.15.4-like networks utilizing in full the standard's physical layer. Our proposal relies on the short periodic communication operation of the nodes comprising the WSN. This is achieved by decreasing the actions that a node needs to perform at the start of every communication period and by incorporating a variable radio-on operation. Moreover, the algorithm introduces differences in nodes' scheduling to further reduce delay. Local synchronization and the crucial task of determining the proper timing for transmission and reception of data is achieved through the periodic broadcast of special synchronization frames at the beginning of each on-period. FP-MAC is evaluated and compared to S-MAC and T-MAC through extensive simulations, showing a significant improvement in terms of low energy consumption and average MAC delay.
Sensing and acting with predefined trajectories
Authors: Aline Carneiro Viana, Marcelo Dias de Amorim
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

We consider applications of mobile wireless sensor actor networks(MWSAN) that require periodic readings and/or actions. In such a context, a single integrated sensor-actor can be used to monitor different regions of the target area if it is able to move from one region to another within some expected time limit. In this paper, we propose a mobility strategy that consists in making nodes follow a space-filling curve with good locality properties (i.e., regions close on the curve are also close on the area). This strategy has a number of advantages, such as higher possibility for merging readings when these latter present high spatial correlation (as in the examples listed above). We also propose that nodes use opportunistic contacts to reduce the delivery delay performed by the sensing module. Through a number of numerical analysis, we show that with a proper dimensioning of the system, we can achieve full area coverage and guarantee bounded delivery delays with a limited number of sensor-actor nodes.
Researches on Diffusion Model of MNCs' Distributed Innovation
Authors: Xiaoqin Gao, Guoxin Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Along with globalization and fast development of knowledge economy and informatization, many MNCs and large enterprises explore and practice distributed innovation actively beside their global production and operation. This article discusses about the model and law of development of distributed innovation diffusion, as well as showing the dynamic characteristics of distributed innovation diffusion. Meanwhile, the above diffusion model is used to research RP technique, and set up RP technical diffusion model, whose popularization state can be anticipated, thus provides a reference for the popularization and application of RP technique in our China.
EDF Feasibility Conditions with Kernel Overheads on an Event Driven OSEK System
Authors: Franck Bimbard, Laurent George
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper we show how to extend classical real time feasibility conditions to take into account kernel overheads for mixed preemptive and non-preemptive periodic tasks with Earliest Deadline First (EDF) scheduling policy. The EDF algorithm allows us to schedule some tasks sets which are not valid with FP/FIFO scheduling policy, the classical scheduling implemented for OSEK. That is why we have improved our OSEK by implementing EDF algorithm. First of all, we identify the sources of overheads that influence the response time of the tasks: the context switching, the mechanisms used to activates/terminates and reschedules asks, and the granularity of the periodic timer used to mplement the periodic task model. We then show how to take into account those overheads in the classical EDF feasibility conditions. We compare the response times computed with theoretical feasibility conditions with kerneloverhead to the results obtained on a real implementation. We show that the kernel overheads cannot be neglected and that our theoretical results are valid and can be used for a real-time dimensioning of an OSEK system with EDF scheduling policy. Finally, we compare the performances of our EDF implementation to the FP/FIFO native scheduling showing the benefits of implementing EDF in OSEK.
A Direct Clustering Method for Imperfect Microarray Data without Imputation
Authors: Taegyun Yun, Suyoung Kim, Taeho Hwang, Gwan-Su Yi
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The existence of missing entries in microarray data is problematic for the proper clustering process. Several approaches have been introduced to overcome this problem. The main idea of those methods is the inclusion of imputation step during clustering analysis. However, these approaches are usually computationally expensive and badly imputed values can possibly mislead clustering results. In this work, we present a new clustering method which combines the separate clustering results of individual sample dimensions without the imputation of missing values. The performance of our method was superior to other typical clustering methods when it was tested with one model dataset and four microarray datasets.
Learning to rank with partially-labeled data
Authors: Kevin Duh, Katrin Kirchhoff
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorithms has focused on cases where only labeled data is available for training (i.e. supervised learning). In this paper, we consider the question whether unlabeled (test) data can be exploited to improve ranking performance. We present a framework for transductive learning of ranking functions and show that the answer is affirmative. Our framework is based on generating better features from the test data (via KernelPCA) and incorporating such features via Boosting, thus learning different ranking functions adapted to the individual test queries. We evaluate this method on the LETOR (TREC, OHSUMED) dataset and demonstrate significant improvements.
An Efficient Approach for QoS-Aware Service Selection Based on a Tree-Based Algorithm
Authors: Minhyuk Oh, Jongmoon Baik, Sungwon Kang, Ho-jin Choi
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Service Oriented Architecture (SOA) has become a new software development paradigm because it provides a flexible framework that can help reduce development cost and time. SOA also promises loosely coupled, interoperable, and composable services. In order to maximize these benefits, many researchers have focused on service composition techniques, especially in terms of providing quality of services (QoS) to consumers in a dynamic environment. In current literature, many approaches, such as the Genetic Algorithm, Integer Programming, and the Pinsinger Algorithm approaches, have been proposed for service compositions to provide quality of services to consumers. However, these approaches are inefficient when any problem occurs during service executions since the problem causes the current execution stop, and service rebinding is required for the unexecuted path. In addition, even if a better service is discovered, it cannot be easily replaced in these approaches because replacing a single service causes a problem on global QoS constraints. In this paper, we focus on these problems by proposing a tree-based algorithm in order to provide optimal services to consumers consistently and efficiently even when the status of selected services have changed. As a result, consumers can always use the optimal services of high qualities.
An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems
Authors: Azzedine Boukerche, Yunfeng Gu, Regina B. Araujo
Venue: Journal of Computer and System Sciences (2008)

Data Distribution Management (DDM) plays a key role in traffic volume control of large-scale distributed simulations. In recent years, several solutions have been devised to make DDM more efficient and adaptive to different traffic conditions. Examples of such systems include the Region-Based, Fixed Grid-Based, Hybrid, and Dynamic Grid-Based (DGB) schemes. However, less effort has been directed toward improving the processing performance of DDM techniques. This paper presents a novel DDM scheme called the Adaptive Dynamic Grid-Based (ADGB) scheme that optimizes DDM time through analysis of matching performance. ADGB uses an advertising scheme in which information about the target cell involved in the process of matching subscribers to publishers is known in advance. An important concept known as the Distribution Rate (DR) is devised. The distribution rate represents the relative processing load and communication load generated at each federate. The matching performance and the distribution rate are used as part of the ADGB method to select, throughout the simulation, the devised advertisement scheme that achieves the maximum gain with acceptable network traffic overhead. If we assume the same worst case propagation delays, when the matching probability is high, the performance estimation of ADGB has shown that a maximum efficiency gain of 66% can be achieved over the Dynamic Grid-Based scheme. The novelty of the ADGB scheme is its focus on improving performance, an important (and often forgotten) goal of DDM strategies.
Extension of a Methodology for Risk-Aware Business Process Modeling and Simulation Enabling Process-Oriented Incident Handling Support
Authors: Simon Tjoa, Stefan Jakoubi, Gernot Goluch, Gerald Quirchmayr
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Increasingly, companies face the challenges to perform their business processes effectively as well as efficiently and to simultaneously assure the continuity of these processes. As the majority of companies rely on IT, it is essential to establish effective incident handling. In this paper, we introduce new extensions of the risk-aware business process management framework ROPE (Risk-Oriented Process Evaluation) in order to support the improvement of the management and execution of business processes. We further discuss the advantages of those extensions and how they can support the implementation of standards and best-practices such as the NIST SP800-61 (Computer Security Incident Handling Guide).
Construction by Configuration: Challenges for Software Engineering Research and Practice
Authors: Ian Sommerville
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

The past ten years have seen a radical shift in business application software development. Rather than developing software from scratch using a conventional programming language, the majority of commercial software is now developed through reuse – the adaptation and configuration of existing software systems to meet specific organizational requirements. The most widespread form of reuse is through the use of generic systems, such as ERP and COTS systems, that are configured to meet specific organizational requirements. In this paper, I discuss the implications of software construction by configuration (CbC) for software engineering. Based on our experience with systems for medical records and university administration, I highlight some of the issues and problems that can arise in "construction by configuration," I discuss problems that arise in CbC projects and identify a number of challenges for research and practice to improve this approach to software engineering.
Hotspot Prevention Using CMP Model in Design Implementation Flow
Authors: Norma Rodriguez, Li Song, Shishir Shroff, Kuang Han Chen, Taber Smith, Wilbur Luo
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As part of copper (Cu) damascene manufacturing process, Chemical Mechanical Polishing (CMP) has been applied to keep the uniformity of metal thickness, and the planarity of chip/wafer to accommodate today’s shrinking lithography process window. CMP is a process that heavily depends on the metal width and density, and there is a strong interaction between design and CMP process. Dummy fills (tiling) are routinely applied to the design files to keep metal density uniform. However, due to complex natures of CMP process (pad, slurry and metal/oxide interaction, long range and multi-level effects), CMP related hotspots are often observed in the manufacturing process. CMP related issues such as Cu pooling/bridging and excessive thickness variation will have a major impact on chip yield and circuit timing and performance. Thus it is essential to correct those hotspots during circuit design stage for better yield and performance. In this paper we will introduce the use of an accurate physical based model to simulate CMP process on a full chip level and detect CMP related hotspots. We will show by using Cadence CMP Predictor (CCP), hotspots that are related to the tiling approach were detected. The CMP model can then be used to assist developing optimal tiling approach and reduce or eliminate CMP related hotspots, hence help to enhance the yield of the designs. The unique capability of detecting CMP related hotspot accurately has made CCP a valuable tool in the design flow to improve yield and performance.
Optimal strategy in games with chance nodes
Authors: Ervin Melkó, Benedek Nagy
Venue: Acta Cybernetica (2007)

In this paper, games with chance nodes are analysed. The evaluation of these game trees uses the expectiminimax algorithm. We present pruning techniques involving random effects. The gamma-pruning aims at increasing the efficiency of expectiminimax (analogously to alpha-beta pruning and the classical minimax). Some interesting properties of these games are shown: for instance, a game without draw can be fair. A fair game may not be fair any more if it is played iteratively. To handle these phenomena, the use of additional indicators, such as the minimal guaranteed outcome value, is suggested.
Optimized RTL Code Generation from Coarse-Grain Dataflow Specification for Fast HW/SW Cosynthesis
Authors: Hyunuk Jung, Hoeseok Yang, Soonhoi Ha
Venue: Journal of Signal Processing Systems (2008)

This paper presents a new methodology of automatic RTL code generation from coarse-grain dataflow specification for fast HW/SW cosynthesis. A node in a coarse-grain dataflow specification represents a functional block such as FIR and DCT and an arc may deliver multiple data samples per block invocation, which complicates the problem and distinguishes it from behavioral synthesis problem. Given optimized HW library blocks for dataflow nodes, we aim to generate the RTL codes for the entire hardware system including glue logics such as buffer and MUX, and the central controller. In the proposed design methodology, a dataflow graph can be mapped to various hardware structures by changing the resource allocation and schedule information. It simplifies the management of the area/performance tradeoff in hardware design and widens the design space of hardware implementation of a dataflow graph. We also support Fractional Rate Dataflow (FRDF) specification for more efficient hardware implementation. To overcome the additional hardware area overhead in the synthesized architecture, we propose two techniques reducing buffer overhead. Through experiments with some real examples, the usefulness of the proposed technique is demonstrated.