ppxscal/embedding_network huggingface dataset:
Optimizing Parameters of Fuzzy c-Means Clustering Algorithm
Authors: Yongchao Liu, Yunjie Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

For overcoming the shortcoming that Fuzzy c-Means (FCM) clustering algorithm seriously depends on the ini- tial values of clustering numbers (c) and fuzzy exponent (m), we introduce genetic algorithm to find the pair param- eters of FCM simultaneity. In the proposed algorithm, the clustering numbers and the fuzzy exponent are controlled by a binary code. In order to optimize the two parame- ters, new methods to code, decode, crossover and establish fitness function have been proposed. Results demonstrat- ing the superiority of the proposed method, as compared to other method that only use validity index to find the clus- tering numbers (c), are provided for several real-life and artificial data sets.
Effects of a magnetic field on the copper metallization using the electroplating process
Authors: Byung-Nam Park, Young-Soo Sohn, Sie-Young Choi
Venue: Microelectronic Engineering (2008)

We investigated the effects of a magnetic field on the electroplated copper films for the ULSI processes. The magnetic field was induced vertical to the electrodes and varied ranging from 0 to 600G. The electroplating process was performed with on-off square pulse current source. The variation of the magnetic field vertical to the electrodes affected the deposition rate of the electroplated copper film, step coverage and gap filling in trench. As the intensity of the magnetic field increased, the deposition rate of the copper film increased, and also the resistance of electromigration increased. However, the magnetic field did not affect resistivity and surface morphology of the electroplated Cu film. At higher intensity of the magnetic field, good step coverage was obtained.
Optimizing Supplier Management in Global Software Engineering
Authors: Christof Ebert
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Global software engineering is the consequence of the rather friction-free economic principles of the entire software industry. Many companies start global software engineering (GSE) due to perceived cost differences. Most of these companies engage globally active outsourcing companies to achieve fastest ramp-up of their globalization targets. After a while into that business they realize that savings are much smaller and problems are more difficult to cure than before. Disillusioned many abandon their GSE activities. What has gotten wrong? GSE bears many challenges, specifically if done with an external supplier. We will look in this article to lessons learned from GSE to effectively and successfully manage supplier relationships. Specifically we use process maturity and CMMI as a guidance how to improve supplier relationships. Both experiences and practical guidance result from our work with clients in automotive and telecommunication industries. They can be readily implemented, specifically our checklists for effective supplier management.
A New Orientation for Multi-Class SVM
Authors: Tu Xu, Dake He, Yu Luo
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Combined by several binary-class SVMs, present Multi-Class SVMs are usually inefficient in training process. When there is large number of categories of data to classify, training it would be very difficult. Expanded from Hyper-Sphere One-Class SVM (HSSVM), Hyper-Sphere Multi-Class SVM (HSMC-SVM), which builds a HS-SVM for every category of data, is a direct classifier. Its training speed is faster than the combined Multi-Class classifiers. In order to fast train the HSMC-SVM, a training algorithm following the idea of SMO is proposed. For researching the generalization performance of HSMC-SVM, the theoretic upper bound of generalizing error of HSMC-SVM is analyzed too. As shown in the numeric experiments, the training speed of HSMC-SVM is faster than 1-v-r and 1-v-1, but the classification precision is lower than them. HSMC-SVM provides a new idea on researching fast directed multi-class classifiers in machine learning area.
Feature interaction analysis: a maintenance perspective
Authors: Maryam Shiri Shiri, Jameleddine Hassine Hassine, Juergen Rilling
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Software systems have become more complex, with myriad features and multiple functionalities. A major challenge in developing and maintaining such complex software is to identify potential conflicts among its features. Feature interaction analysis becomes progressively more difficult as software's feature combinations and available scenarios increase. Software maintainers need to identify and analyze conflicts that can arise from feature modification requests. Our approach combines Use Case Maps with Formal Concept Analysis to assist maintainers in identifying feature modification impacts at the requirements level, without the need to examine the source code. We demonstrate the applicability of this approach using a teleommunication case study
A Representation of Hypergraphs in the Euclidean Space
Authors: K. Fukunaga
Venue: IEEE Transactions on Computers (1984)

This paper introduces a graph space that shows concisely the relative weights among combinations of vertices of a given hypergraph. (A hypergraph is a graph in which one edge may connect two or more vertices.) The hypergraph is represented by a collection of points in graph space such that the distance between vertices in graph space reflects the weights of the edges between vertices of the original hypergraph. Vertices of the hypergraph that are connected by edges with large weights are mapped to nearby points in graph space. Thus, graph space reveals properties of the connectivity of vertices in the hypergraph. A natural application of graph space is the placement of modules in computer systems since strongly coupled modules are transformed into nearby points in graph space. The graph of the airlines network in the United States is taken as an example of a hypergraph, and the paper illustrates the corresponding graph space.
VHDL Critique
Authors: J. D. Nash, L. F. Saunders
Venue: IEEE Design Test (1986)

The hardware and software communities have reviewed VHDL extensively throughout its conception and development. This followsthe 1970s example set during development of the Ada programming language. Analysis of language, like one's preference in clothing,is subjective. Nevertheless, an informed consensus acknowledges VHDL as having good aspects, deficient aspects, and controversialaspects. Additionally, VHDL has been criticized for lack of facilities outside the language contract's defined work scope;some criticisms have centered on the software support environment?particularly the simulator. We will present both positiveand negative commentary made about VHDL, concentrating on issues associated only with the language. Comments and opinionspresented here come from many sources, and are not necessarily those of our affiliated organizations.
Graph-automaton model of an adaptive distance learning and knowledge control system
Authors: Pavlo Fedoruk
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The article reviews the usage of a graph-automaton model of an adaptive distance learning and knowledge control system aimed at addressing the issue of optimal control of the quanta of knowledge stream in the process of students' perception of the course. The model under study takes into account such important aspects of distance learning as the possibility of "forgetting" the knowledge quantum by a student; the problem of the presentation sequence of quanta for processing and operating; the repetition of certain quanta in different classes and contexts. The described model of quanta stream control allows to implement considerable adaptation opportunities to the students' perception peculiarities and background knowledge in the distance learning and knowledge control system.
Planar Crossovers
Authors: W. F. McColl
Venue: IEEE Transactions on Computers (1981)

Those bases which permit the realization of a planar crossover are characterized.
Customization of arbitration policies and buffer space distribution using continuous-time Markov decision processes
Authors: Sankalp S. Kallakuri, Alex Doboli
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents a stochastic approach for bus arbiter design. Arbiter design includes policy design, buffer insertion, and optimal buffer sizing. The methodology uses continuous-time Markov decision processes (CTMDPs) to get optimal arbitration policies and buffer space distribution. The mathematical formulation of this problem in terms of a CTMDP framework leads to a linear programming problem for bus architectures without bridges, and to a nonlinear formulation for bus architectures with bridges. In the second case, the methodology splits the nonlinear problem into several smaller, linear subsystems by introducing buffers at the bridges, and then solves the linear subsystems. In our experiments, we found that stochastic policies provide efficient arbitration for bus architectures with redundant buses for communication between processors. The size of buffers in some cases was reduced by 90%, and by 50% in the average sense. Data loss was reduced by 20% to 50% with redistribution of the buffer space.
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm
Authors: Markus Kalisch, Peter Bühlmann
Venue: The Journal of Machine Learning Research (2007)

We consider the PC-algorithm (Spirtes et al., 2000) for estimating the skeleton and equivalence class of a very high-dimensional directed acyclic graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible and often very fast for sparse problems with many nodes (variables), and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove uniform consistency of the algorithm for very high-dimensional, sparse DAGs where the number of nodes is allowed to quickly grow with sample size n, as fast as O(na) for any 0 a n. We also demonstrate the PC-algorithm for simulated data.
Moving beyond user participation to achieve successful IS design
Authors: Erica L. Wagner
Venue: Communications of the ACM (2007)

A call for user engagement cannot be scheduled at a specific point in the software development process. Valuable user input comes in waves throughout the project and developers would do best to listen and learn.
The Ontology Model Based on Fuzzy Description Logic
Authors: Cuiling Zhu, Jun Ma, Dongmei Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Ontology is a conceptualization of a domain into a human understandable, machine-readable format consisting of entities, attributes, relationships, and axioms. OWL is the standard web ontology language proposed by W3C recently that is on the basis of the description logic. But there are so much uncertain and incomplete knowledge in real world. So it is necessary to import the fuzzy ability to extend the OWL. The paper proposed the ontology model based on fuzzy description logics (FDLs).It extended the OWL by importing the conditional probability on the basis of FDLs. And then the model extracts fuzzy formal concept and proposes a method to compute the similarity of the concepts. In addition it comes up with a method of fuzzy conceptual clustering and then generates the fuzzy ontology. Finally the paper gives the analysis of the model.
Thermal-driven Symmetry Constraint for Analog Layout with CBL Representation
Authors: Jiayi Liu, Sheqin Dong, Yuchun Ma, Di Long, Xianlong Hong
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In the context of SOI, thermal constraint is more serious for analog devices. Besides the hot-spot effect, the temperature gradient on symmetrical devices may cause errors and even failures in the function. In order to handle these problems, this paper introduces an accurate thermal model into the placement process. Based on the geometric symmetry which is achieved with corner block list (CBL) for the first time, the thermal model helps to find the thermal-optimal placement. And the experimental results show this method is promising.
Transport Layer Fairness and Congestion Control in Multihop Wireless Networks
Authors: Thomas Kunz, Hao Zhang
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Transmission Control Protocol (TCP) is a reliable, end-to-end transport protocol, which is widely used for data services and is very efficient for wired networks. However, experiments and research showed that TCP's congestion control algorithm performs very poorly over Wireless Ad Hoc Networks with degraded throughputs and severe unfairness among flows. This paper studies TCP's fairness and throughput issues in Wireless Ad Hoc Access Networks, and designs an improved congestion control algorithm based on the characteristics of the Wireless Ad Hoc Access Networks. The protocol is designed as extension to DCCP (Datagram Congestion Control Protocol) with a new congestion control component. We also implemented this congestion control algorithm in NS2. Simulation results show improvements on fairness and throughput achieved by using our congestion control algorithm.
The Anomalous Behavior of Flip-Flops in Synchronizer Circuits
Authors: W. Fleischhammer
Venue: IEEE Transactions on Computers (1979)

Quantitative results of the observations of oscillatory and metastable behavior of common flip-flops in response to logically undefined input conditions, such as those that occur in synchronizers and arbiters, are presented. The results are obtained with the help of a circuit developed for this purpose which measures the failure rate for a certain flip-flop and frequency. It is found that the obtained results are in good correlation with observed failure rates of a synchronizer with both short and long flip-flop resolution times allowed.
An Adaptive Key Selection Scheme in Wireless Sensor Networks
Authors: Guorui Li, Jingsha He, Yingfang Fu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Sensor networks are widely used in a variety of commercial and military applications due to their self-organization characteristics and distributed nature. As a fundamental requirement for providing security functionality in sensor networks, key management plays a central role in authentication and encryption. In this paper, we analyze the Adaptive Key Selection (AKS) scheme and the corresponding Adaptive Key Selection algorithm for multiple deployment in sensor networks in terms of security, connectivity and overhead. We show through simulation that the AKS scheme can greatly improve the connectivity and security of the existing multiple deployment scheme in wireless sensor networks.
SA1: introducing the best of ada
Authors: John G. P. Barnes
Venue: ACM SIGAda Ada Letters (2007)

This tutorial assumes no previous knowledge or experience with the Ada programming language. Ada was originally designed in around 1980. Important goals included: to provide a portable and uniform language to replace a number of existing languages then in use; to capture the state of the art in language design; to recognize that programming was a serious engineering discipline; and to be highly reliable and encourage the development of long lived and maintainable programs. However, Ada 83 (as the first version was known) was developed before the ideas of OOP matured and tasking was fully understood. Accordingly Ada was enhanced in 1995 to cover these topics and others. In this tutorial John will introduce the main themes of Ada and hopefully show why it is an excellent language for systems that need to be reliable and to be maintained.
On Modular Networks Satisfying the Shift-Register Rule
Authors: S. P. Kartashev
Venue: IEEE Transactions on Computers (1978)

This paper considers the synthesis of the network N which realizes the original program (problem oriented network) N is assembled from n unit modules partitioned into r categories (r = 1) each of which is formed from identical modules.
Challenges for Autonomous Mobile Robots
Authors: John J. Leonard
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This talk will have two parts. In part one, we will review recent progress in mobile robotics, focusing on the problems of simultaneous mapping and localization (SLAM) and cooperative navigation of mobile sensor networks. The problem of SLAM is stated as follows: starting from an initial position, a mobile robot travels through a sequence of positions and obtains a set of sensor measurements at each position. The goal is for the mobile robot to process the sensor data to compute an estimate of its position while concurrently building a map of the environment. We will present SLAM results for several scenarios including land robot mapping of large-scale environments and undersea mapping using optical imaging sensors. We will also describe work on cooperative navigation for networks of autonomous underwater vehicles (AUVs) and autonomous sea-surface vehicles (ASVs).
Knowledge-based system to define context in commercial applications
Authors: Nayat Sanchez-Pi, Virginia Fuentes, Javier Carbo, Jose Manuel Molina
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

New wireless communications, user mobility and the growing need of taking into account the characteristics of the context make feasible the development of advanced frameworks to support context-aware knowledge systems. In this paper we present the design of the contextual information for an airport domain using a platform that exploits the modular and distributed architecture to develop context-aware applications.
Temperature aware microprocessor floorplanning considering application dependent power load
Authors: Chun-Ta Chu, Xinyi Zhang, Lei He, Tom Tong Jing
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper studies microprocessor floorplanning considering thermal and throughput optimization. We first develop a stochastic heat diffusion model taking into account the application dependent power load for thermal analysis. Then, we design the floorplanning algorithm based on this model. Experimental results show that, compared with the deterministic heat diffusion model, our model obtains up to 3.2&deg;C reduction of the on-chip peak temperature, 1.25% reduction of the area, and 1.125x better CPI (cycles per instruction) performance, respectively. Compared with temperature aware floorplanning in the HOTSPOT tool set that ignores interconnect pipelining, our algorithm is up to 27x faster, reduces the peak temperature by up to 3&deg;C, and also reduces CPI significantly with a negligible area overhead.
A Novel Approach to Commercial Detection in News Video
Authors: Shijin Li, Hao Li, Zhijian Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The Detection of commercials in news video has been a challenging problem because of the diversity of the commercial programs. In this paper, we propose a novel algorithm for the detection of commercials in news program. In our method, firstly shot transition detection and anchorman shot recognition are conducted, then clustering analysis is employed to label commercial blocks roughly, finally the accurate boundaries of the commercials are marked by monitoring the visual discontinuity of the shots and the average duration of subsequent shots. The experiment results show our algorithm is efficient with high recall and precision rate.
Four security certification levels for IT Managers and Staff in the Public Sector
Authors: Sergejus Sosunovas, Olegas Vasilecas
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

The iSCAN (Improving Skills, Competencies, and Professional Qualifications in the area of Network Information Security for IT Managers and Staff in the Public Sector) project's main objective is to address the current and anticipated skills shortage in the ICT industry in Europe and promote the transferability and recognition of competences and qualifications in the IT security field in Europe by developing new standards and measures. To this end, iSCAN will develop a certification standard with a view to enhance skills and competencies in latest IT security issues of IT managers in public organizations.
Conceptual Differences Among Functional Size Measurement Methods
Authors: Cigdem Gencel, Onur Demirors
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Although Functional Size Measurement (FSM) methods have gone a long way, they still provide challenges for software managers. A major challenge is related to the comparison of the well established FSM methods. This paper identifies the conceptual similarities and differences among MkII FPA, COSMIC FFP and IFPUG FPA methods based on a case study, which involves implementation of the methods to measure the functional size of a military inventory management project integrated with a document management system.
Note: Longest alternating subsequences of k-ary words
Authors: Toufik Mansour
Venue: Discrete Applied Mathematics (2008)

Recently, Stanley [Longest alternating subsequences of permutations, preprint, arXiv/0511419v1] studied the length of the longest alternating subsequence of a permutation in the symmetric group, where a sequence a,b,c,d,... is alternating if a>bd
Adhesion properties of polymethylsilsesquioxane based low dielectric constant materials by the modified edge lift-off test
Authors: B. R. Kim, Y. D. Kim, M. S. Moon, B. K. Choi, M. J. Ko
Venue: Microelectronic Engineering (2008)

Delamination occurring during the chemical and mechanical planarization process or wire bonding steps in packaging is a fundamental issue in integrating of low dielectric constant (low-k) materials into the multilayer structures of semiconductor chips. Since it is known that low adhesion strength is mainly attributed to the failure phenomenon, the measurement of interfacial fracture toughness is critical to provide a quantitative basis in the choice of the materials. In this study, a modified edge lift-off test was adopted to measure the fracture toughness of polymethylsilsesquioxane based low-k materials with various chemical and physical structures. Interfacial fracture toughness was improved by adding multi-functional monomers to methylsilsesquioxane monomers or by increasing the percentage of functional end groups inside the prepolymers. In addition, the change in curing conditions and thickness influenced the adhesion performance presumably by changing the morphology of low-k materials.