ppxscal/embedding_network huggingface dataset:
Some results on an n-Ginzburg-Landau-type minimizer
Authors: Yutian Lei
Venue: Journal of Computational and Applied Mathematics (2008)

This paper is concerned with the asymptotic analysis of a minimizer of an n-Ginzburg-Landau-type functional. When the dimension n=2, the asymptotic properties were well studied, such as the convergence of the minimum of the energy, the behavior of the minimizer near its zero points, and the quantization effects for the Euler-Lagrange system in R^2. The author investigates those properties when the dimension n is not less than 3.
A Parallel Ant Colony Optimization for Multi-depot Vehicle Routing Problem
Venue: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops (2007)

This paper presents a method for solving the multi-depot vehicle routing problem (MDVRP). Due to different vehicle capacities among companies, a mathematical formulation, which considers the variable costs and the vehicles' fixed costs simultaneously, is given. Since the inherent complexity of the MDVRP makes it difficult to be solved even for a relatively small scale, an improved ant colony optimization with a new strategy to update the increased pheromone (Ant-Weight) is developed for the MDVRP. Then, a parallelization strategy for ant colony optimization is used to increase computational efficiency. Finally, the proposed algorithm is examined with the data of Wuhu city in China. The results indicate that this method performs well in terms of the solution quality and run time consumed. 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
An SSO Based Methodology for EM Emission Estimation from SoCs
Authors: S. Jairam, S. M. Stalin, Jean-Yves Oberle, H. Udayakumar
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A methodology to estimate electromagnetic (EM) emission from SoCs is presented. The solution works on estimating current spectral components at the SoC periphery by performing power integrity analysis based on simultaneously switching outputs (SSO). These components are then converted to electric and magnetic dipoles. The dipoles arethen analysed by a customised field solver, which computes the field radiation patterns. Antenna models have been generated through the lead frames for quad flat and ball grid array packages. The proposed approach enables unification of SoC periphery analysis platform for timing, signal, power integrity along with EM emission estimation. Finally the approach has been demonstrated on various SoC periphery analysis scenarios. A memory interface of a 90nm SOC design has been analysed and results have been compared with silicon measurements.
Consistency of the Group Lasso and Multiple Kernel Learning
Authors: Francis R. Bach
Venue: The Journal of Machine Learning Research (2008)

We consider the least-square regression problem with regularization by a block l1-norm, that is, a sum of Euclidean norms over spaces of dimensions larger than one. This problem, referred to as the group Lasso, extends the usual regularization by the l1-norm where all spaces have dimension one, where it is commonly referred to as the Lasso. In this paper, we study the asymptotic group selection consistency of the group Lasso. We derive necessary and sufficient conditions for the consistency of group Lasso under practical assumptions, such as model mis specification. When the linear predictors and Euclidean norms are replaced by functions and reproducing kernel Hilbert norms, the problem is usually referred to as multiple kernel learning and is commonly used for learning from heterogeneous data sources and for non linear variable selection. Using tools from functional analysis, and in particular covar iance operators, we extend the consistency results to this infinite dimensional case and also propose an adaptive scheme to obtain a consistent model estimate, even when the necessary condition required for the non adaptive scheme is not satisfied.
Mesh simplification for building typification
Authors: D. Burghardt, A. Cecconi
Venue: International Journal of Geographical Information Science (2007)

This paper describes an approach for the typification of buildings using a mesh-simplification technique. The approach is adapted from the area of computer graphics and was originally developed for surface reconstruction and mesh simplification. The main goal was to develop an algorithm which creates fast and reproducible results. The typification procedure is modelled as a two-stage process, with the steps 'positioning' and 'representation'. While the positioning step determines the number and the position of the building objects based on Delaunay triangulation, the representation step is used to calculate the size and orientation for the replacement buildings. The results presented show the important influence of weights during positioning steps to control the object distribution. The proposed parameters are the number of objects as well as several object characteristics such as size, shape, orientation, and semantic. The approach has to be extended, if building alignments are also to be preserved. Further applications are imaginable, for instance the icon placement on dynamic maps.
Query dependent ranking using K-nearest neighbor
Authors: Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, Hang Li, Heung-Yeung Shum
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existing methods do not take into consideration the fact that significant differences exist between queries, and only resort to a single function in ranking of documents. In this paper, we argue that it is necessary to employ different ranking models for different queries and onduct what we call query-dependent ranking. As the first such attempt, we propose a K-Nearest Neighbor (KNN) method for query-dependent ranking. We first consider an online method which creates a ranking model for a given query by using the labeled neighbors of the query in the query feature space and then rank the documents with respect to the query using the created model. Next, we give two offline approximations of the method, which create the ranking models in advance to enhance the efficiency of ranking. And we prove a theory which indicates that the approximations are accurate in terms of difference in loss of prediction, if the learning algorithm used is stable with respect to minor changes in training examples. Our experimental results show that the proposed online and offline methods both outperform the baseline method of using a single ranking function.
Perspectives in component-based software engineering
Authors: Jiri Adamek, Petr Hnetynka
Venue: Proceedings of the 2008 international workshop on Software Engineering in east and south europe (2008)

Component-based software engineering (CBSE) has become a commonly used development technique. Using it, applications are composed of reusable components with well defined interfaces and behavior. Currently, in the scope of CBSE, research has been driven in huge number of directions and by many research teams. Naturally, such conditions are ideal for mutual cooperation and collaboration. In this paper, we describe our experience with research cooperation, especially in the scope of Europe. We present experience gained during recent joint projects, in which we have participated. Also, we present our research areas and topics and ongoing work on them.
Towards Practical Privacy for Genomic Computation
Authors: Somesh Jha, Louis Kruger, Vitaly Shmatikov
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification attacks and may reveal highly sensitive information about individuals. We present a relatively efficient, privacy-preserving implementation of fundamental genomic computations such as calculating the edit distance and Smith-Waterman similarity scores between two sequences. Our techniques are cryptographically secure and significantly more practical than previous solutions. We evaluate our prototype implementation on sequences from the Pfam database of protein families, and demonstrate that its performance is adequate for solving real-world sequence-alignment and related problems in a privacy-preserving manner. Furthermore, our techniques have applications beyond computational biology. They can be used to obtain efficient, privacy-preserving implementations for many dynamic programming algorithms over distributed datasets.
Optimal parallel hull construction for simple polygons in O(log log n) time
Authors: H. Wagener
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The author proposes an optimal parallel algorithm for computing the convex hull of a simple polygon. The algorithm achieves a runtime of O(log log n) using O(n/log log n) processors of a CRCW-PRAM. The data structure representing the convex hull is not the standard one, i.e. an array storing the vertices of the hull in clockwise order. Indeed, a lower bound of Omega (log n/log log n) on the runtime for any algorithm employing a polynomial number of processors and computing the array-representation is known. Nevertheless, the representation is adequate for further parallel processing; standard queries like computing the intersection of the hull with a given line, etc., can be answered in time O(log n/(log p+1)+1) using p processors. In addition subchain hull queries are supported optimally in time O(log k/(log p+1)+1), where k is the length of the subchain. The algorithm can easily be adapted to other hull-like structures for simple polygons; as e.g. the orthogonal hull, and the visibility region from a point under various definitions of visibility.
Using timed automata and model-checking to simulate material flow in agricultural production systems-Application to animal waste management
Authors: Arnaud Hélias, François Guerrin, Jean-Philippe Steyer
Venue: Computers and Electronics in Agriculture (2008)

Due to intensification and specialisation of animal production and the increasing pressure of environmental regulations, the careful management of animal wastes becomes a key point for the sustainability of livestock farming. This paper addresses the dynamic representation of a network composed by a set of production units (i.e., livestock farms) that need to transfer their wastes to a set of consumption units (i.e., crops onto which wastes may be spread over). The dynamics of stocks (taken as continuous fluxes with imprecise parameters) is combined with management decisions or actions (taken as discrete events). Various temporal constraints determine the possibilities of waste transfers. For each production or consumption unit, these constraints are modelled as a timed automaton. Possible allocation of wastes is then analysed using model-checking techniques applied to the global timed automaton resulting from the product of all the elementary timed automata. To this end, the Kronos software based on the Timed Computational Tree Logic (TCTL) is used. Our approach is illustrated through the analysis of a typical farming system made of livestock and crop enterprises in the context of the Reunion Island. Using the computer tool implementing this approach, we show how an initial waste management policy can be improved by simulation to find a better waste allocation to crops.
Finite element analysis of elastic transient ultrasonic wave propagation for NDT applications
Authors: G. Aiello, E. Dilettoso, N. Salerno
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Nondestructive testing techniques are of great relevance nowadays and are extensively employed in almost all areas of engineering to detect defects in products and structures, or to point out deteriorations in industrial plants. The paper deals with techniques which make use of transient ultrasonic waves, the aim being numerical modelling and simulation of their propagation in long cylindrical shell structures affected by axisymmetric defects and/or material inhomogeneities. For this purpose a finite element code has been developed by the authors, who have validated and utilized it to perform simulations, the results of which are presented and discussed.
Optimization on distributed user management in Wireless Sensor Networks
Authors: MingJian Tang, Jinli Cao
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

In this paper, we address one of the Wireless Sensor Network (WSN) management problems - optimization on the execution of multiple commands. The objective of the paper is to provide efficient support for pre-processing a set of commands before disseminating into the sensor network. It is important that only necessary work will be assigned to the sensor network by virtue of strict energy constraint. The problem is NP-hard. We divide the problem into a series of tractable sub-problems along with their solutions. We present a novel Hierarchical Quadrant-based field Partition mechanism to virtually divide the sensor field. We also classify and model WSN management commands. We then identify merging possibilities for a given command, which results in several merging rules and constraints. Lastly, we evaluate a Simulated Annealing based search algorithm for finding optimal merge order. The results show that energy can be significantly saved within short time-delay while the overall effects of the final command set still satisfies the users&#x2019; requirements.
Compressed hierarchical binary histograms for summarizing multi-dimensional data
Authors: Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Sacc&#x00e0;, Cristina Sirangelo
Venue: Knowledge and Information Systems (2008)

Hierarchical binary partitions of multi-dimensional data are investigated as a basis for the construction of effective histograms. Specifically, the impact of adopting lossless compression techniques for representing the histogram on both the accuracy and the efficiency of query answering is investigated. Compression is obtained by exploiting the hierarchical partition scheme underlying the histogram, and then introducing further restrictions on the partitioning which enable a more compact representation of bucket boundaries. Basically, these restrictions consist of constraining the splits of the partition to be laid onto regular grids defined on the buckets. Several heuristics guiding the histogram construction are also proposed, and a thorough experimental analysis comparing the accuracy of histograms resulting from combining different heuristics with different representation models (both the new compression-based and the traditional ones) is provided. The best accuracy turns out from combining our grid-constrained partitioning scheme with one of the new heuristics. Histograms resulting from this combination are compared with state-of-the-art summarization techniques, showing that the proposed approach yields lower error rates and is much less sensitive to dimensionality, and that adopting our compression scheme results in improving the efficiency of query estimation.
Proceedings of the 2008 international workshop on Software Engineering in east and south europe
Venue: International Conference on Software Engineering (2008)

It is our great pleasure to welcome you to the Software Engineering in East and South Europe workshop -- SEESE'08. East and South European countries are going through a process of intensive changes and ICT plays an important role in supporting these changes. Most of the East and South European countries have a tradition of high quality education, in particular in natural and traditional technical sciences and thus have a good potential to take the new challenges. Today there is a strong need for advances and excellence in Software Engineering education and research, which are crucial for effective development of software industry in the region. The aim of this workshop is to bring together researchers and practitioners to discuss the strategic issues concerning SE development, research and education in East and South Europe. The current state, including problems, challenges and opportunities will be presented and discussed at the workshop. In particular, opportunities for international cooperation will be considered. The topics of the workshop are related to the specifics, then to the integration of research and practice in Software Engineering in the countries of South and East Europe, between these countries and between these countries and the countries of the EU and the US. The proceedings include 16 position papers, selected from 20 submitted. They cover topics of Software Engineering education, research and practice in East and South Europe describing specifics approaches in these countries, or giving some examples of successful or unsuccessful cooperation initiatives, and finally showing some technical achievements that illustrate the research of certain institutions or research centers. The program committee, the authors of the position papers, and most likely the majority of the participants are the researchers and practitioners from East and South Europe or those which have experience in cooperation with these countries. The aim of the workshop is to exchange the experience of challenges and ideas and we hope that you as participants will find the workshop as an inspiration and source of new ideas for further research and advances in the practice.
Using Queuing Network to Evaluate IXP2400 Based VoIP SPS
Authors: Jianmin Pang, Jiuzhen Jin, Rongcai Zhao, Zheng Shan, Zheng Zhang
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

This paper presents the M/G/1 multi-class open queuing networks performance model of IXP2400-based VoIP SPS (signaling parse system). We use UML activity diagrams and function module diagrams to describe this VoIP SYS, and derive the performance model. The resulting model could make statistic analysis of IXP2400-based VoIP SPS with First-Come-First-Serve (FCFS) scheduling policy and mix traffic. We use the approximate calculation of iterative decomposition algorithm to solve this model, and present the formulas of the utilization, delay, etc. The theoretical estimates are in excellent consistence with our testing data, this shows the effectiveness of our performance evaluating method.
Cognitive radio network architecture: part I -- general structure
Authors: K.-C. Chen, Y.-J. Peng, N. Prasad, Y.-C. Liang, S. Sun
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Cognitive radio has been considered as a key technology for future wireless communications and mobile computing. We note the cognitive radios can form cognitive radio networks (CRN) by extending the radio link features to network layer functions and above. We categorize CRN architecture into several structures and classify the unidirectional links in such structures, to pave the way for future systematic CRN research.
Gender-based feature analysis in campus-wide WLANs
Authors: Udayan Kumar, Nikhil Yadav, Ahmed Helmy
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Rapid WLAN deployment has led to various research challenges and scenarios. In this paper we come up with a technique to classify users into social groups and then use this information to investigate the usage behavior of these groups. Grouping of users can be done based on diverse parameters like gender, major or other interest groups. In this paper we show the general methodology used to accomplish WLAN user groupings with an example of grouping by gender in a major university campus. The usage patterns of Males and Females are contrasted based on this grouping. Possible applications of this work encompass user profiling; studying gender gaps in social sciences; announcement/advertisement customization to target groups.
Analog parallelism in ring-based VCOs
Authors: Daeik D. Kim, Choongyeun Cho, Jonghae Kim
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The performance advantages in parallel ring-based VCOs are explored. When the number of VCOs is doubled, the parallel VCOs enhance phase noise by 3dB, and the within-chip process-induced variation is reduced by 3dB, which improves chip-limited yield. The parallel VCOs trade off circuit area and power in exchange. The parallelism advantages in analog and digital systems are compared.
Mining knowledge from natural language texts using fuzzy associated concept mapping
Authors: W. M. Wang, C. F. Cheung, W. B. Lee, S. K. Kwok
Venue: Information Processing and Management: an International Journal (2008)

Natural Language Processing (NLP) techniques have been successfully used to automatically extract information from unstructured text through a detailed analysis of their content, often to satisfy particular information needs. In this paper, an automatic concept map construction technique, Fuzzy Association Concept Mapping (FACM), is proposed for the conversion of abstracted short texts into concept maps. The approach consists of a linguistic module and a recommendation module. The linguistic module is a text mining method that does not require the use to have any prior knowledge about using NLP techniques. It incorporates rule-based reasoning (RBR) and case based reasoning (CBR) for anaphoric resolution. It aims at extracting the propositions in text so as to construct a concept map automatically. The recommendation module is arrived at by adopting fuzzy set theories. It is an interactive process which provides suggestions of propositions for further human refinement of the automatically generated concept maps. The suggested propositions are relationships among the concepts which are not explicitly found in the paragraphs. This technique helps to stimulate individual reflection and generate new knowledge. Evaluation was carried out by using the Science Citation Index (SCI) abstract database and CNET News as test data, which are well known databases and the quality of the text is assured. Experimental results show that the automatically generated concept maps conform to the outputs generated manually by domain experts, since the degree of difference between them is proportionally small. The method provides users with the ability to convert scientific and short texts into a structured format which can be easily processed by computer. Moreover, it provides knowledge workers with extra time to re-think their written text and to view their knowledge from another angle.