ppxscal/embedding_network huggingface dataset:
Guest column: additive combinatorics and theoretical computer science
Authors: Luca Trevisan
Venue: ACM SIGACT News (2009)

Additive combinatorics is the branch of combinatorics where the objects of study are subsets of the integers or of other abelian groups, and one is interested in properties and patterns that can be expressed in terms of linear equations. More generally, arithmetic combinatorics deals with properties and patterns that can be expressed via additions and multiplications. In the past ten years, additive and arithmetic combinatorics have been extremely successful areas of mathematics, featuring a convergence of techniques from graph theory, analysis and ergodic theory. They have helped prove long-standing open questions in additive number theory, and they offer much promise of future progress. Techniques from additive and arithmetic combinatorics have found several applications in computer science too, to property testing, pseudorandomness, PCP constructions, lower bounds, and extractor constructions. Typically, whenever a technique from additive or arithmetic combinatorics becomes understood by computer scientists, it finds some application. Considering that there is still a lot of additive and arithmetic combinatorics that computer scientists do not understand (and, the field being very active, even more will be developed in the near future), there seems to be much potential for future connections and applications.
Subriemannian geometry of an open thermodynamical system
Authors: Cristina Stamin, Constantin Udriste
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

This paper uses the Vrânceanu congruences method to describe the subriemannian geometry of the nonholonomic hypersurface given by a Gibbs-Duhem-Pfaff equation. In Section 1 we build a system of independent congruences, strongly connected to the Gibbs-Duhem-Pfaff form. These determine a Riemannian space V6 and a Riemannian nonholonomic hypersurface V65. Section 2 describes the bilinear covariant. Section 3 gives the Levi-Civita connection components with respect to the orthonormal congruences. Section 4 presents the equations of geodesics of the hypersurface V65. Section 5 analyzes the curvature tensor of the nonholonomic GDP hypersurface. Section 6 describes the vector subspace of the bilinear covariant coefficients and Section 7 the vector subspace of Ricci rotation coefficients. Section 8 introduces the Steiner hypersurface of Ricci coefficients with four indexes. Section 9 underlines the tools and the originality of the results.
ICMPv6 Cumulative Path Traceback in Mobile Ad Hoc networks (MANET)
Authors: S. Menaka, D. Sridharan
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

The Internet provides a wealth of information, convenience, and value to its users, but this accessibility makes it extremely vulnerable to motivated and well-equipped users intent on disrupting the flow of information or using it for personal gain. The Internet is becoming the pervasive means of communications for data in particular. However, its pervasiveness has also generated many security problems, such as authentication, data confidentiality, data integrity, intrusion etc., among which, Denial-of-service (DoS) and Distributed DoS (DDoS) pose significant problems, as they are disruptive to the useful traffics and are hard to prevent. In a mobile ad-hoc networks, where the nodes are typically devices with limited bandwidth, computational resources, battery power and unpredictable routing topology, additional constraint is placed on detection and tracing technique to locate the attack sources efficiently. In this paper an overview is made on the issues of trace back in the context of mobile IPv6. A technique has been proposed then which consists of ICMPv6 Trace back with Cumulative path (ITrace-CP), and thereby retrieves the entire attack path information in the ICMPv6 trace back message to facilitate the trace back mechanism in a mobile ad hoc network.
Algorithms for adaptive palette construction using the graphics processing unit
Authors: Michael Laszlo
Venue:  (2008)

Computer image processing can be costly in terms of computing resources. Two image characteristics that can contribute to this cost, resolution and color depth, are essential when considering such tasks as changing an image's resolution or compressing the image for optimal storage. Even with the introduction of a number of algorithms to address the high cost of image processing, image processing continues to incur a penalty in terms of efficiency. Adaptive color palettes represent one approach that addresses the problem of decreased efficiency in image processing by quantizing an image from one color space to another. Additionally, recent advances have yielded a way to take advantage of the processing capabilities of a computer's graphics processing unit (GPU). These GPU advances provide yet another way to address the cost of image processing by making use of general purpose processing on the GPU. By using quantizing algorithms in conjunction with general-purpose GPU algorithms, it is possible to identify algorithmic approaches that would be applicable to GPGPU processing with the purpose of decreasing the cost of processing color image palettes.
Conditions Facilitating The Implementation of Information Communication Technology Integration in Malaysian Smart School
Authors: Wan Zah Wan Ali, Hajar Mohd. Nor, Azimi Hamzah, Nor Hayati Alwi
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In this paper, we describe the conditions that facilitated the implementation of Information Communication Technology (ICT) integration in the Malaysian Smart School locally known as Sekolah Bestari. The description was based on a study that was carried out using qualitative methodology on 21 informants, mainly teachers to discover why the teachers in this school have minimal use of ICT in their teaching. The study also attempts to identify problems that emerge during the process of integration. Three technology-rich Malaysian secondary schools, the Smart Schools, of different technology levels were involved in this study. Based on the data analysis, two sets of conditions were revealed. They were the essential conditions and the supporting conditions. The essential conditions see to implementation of ICT integration while, supporting conditions see to the continuation of implementation. The findings also revealed that teachers in this study employed four levels of approaches in integrating ICT in the schools. It seemed that the levels of approach were influenced by the presence and absence of those conditions. Time, course content and technical malfunction were found to be the main problems that the teachers faced during this process.
Discovery of feature-based hot spots using supervised clustering
Authors: Wei Ding, Tomasz F. Stepinski, Rachana Parmar, Dan Jiang, Christoph F. Eick
Venue: Computers Geosciences (2009)

Feature-based hot spots are localized regions where the attributes of objects attain high values. There is considerable interest in automatic identification of feature-based hot spots. This paper approaches the problem of finding feature-based hot spots from a data mining perspective, and describes a method that relies on supervised clustering to produce a list of hot spot regions. Supervised clustering uses a fitness function rewarding isolation of the hot spots to optimally subdivide the dataset. The clusters in the optimal division are ranked using the interestingness of clusters that encapsulate their utility for being hot spots. Hot spots are associated with the top ranked clusters. The effectiveness of supervised clustering as a hot spot identification method is evaluated for four conceptually different clustering algorithms using a dataset describing the spatial distribution of ground ice on Mars. Clustering solutions are visualized by specially developed raster approximations. Further assessment of the ability of different algorithms to yield hot spots is performed using raster approximations. Density-based clustering algorithm is found to be the most effective for hot spot identification. The results of the hot spot discovery by supervised clustering are comparable to those obtained using the G^* statistic, but the new method offers a high degree of automation, making it an ideal tool for mining large datasets for the existence of potential hot spots.
Biomedical named entity recognition using conditional random fields and rich feature sets
Authors: Burr Settles
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

As the wealth of biomedical knowledge in the form of literature increases, there is a rising need for effective natural language processing tools to assist in organizing, curating, and retrieving this information. To that end, named entity recognition (the task of identifying words and phrases in free text that belong to certain classes of interest) is an important first step for many of these larger information management goals.
The impact of network performance and perceived value on HSDPA broadband customer satisfaction and loyalty
Authors: N. R. M. Suradi, A. S. Yee, F. A. Shahabuddin, Z. M. Ali, Z. Mustafa, W. R. Ismail, M. Darus
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

This research aims to identify the impact of network performance and perceived value on HSDPA broadband customer satisfaction and loyalty. A research model was developed and four dimensions of HSDPA broadband network performance were identified. These dimensions were speed, connectivity, mobility and accessibility. Perceived value dimensions are economic value, emotional value and social value. The network performance dimensions had direct and indirect effects on economic, emotional and social value, and on loyalty through satisfaction. One dimension of perceived value, specifically emotional value had significant influences on customer satisfaction, and then, on loyalty intention. In particular, each dimension of HSDPA broadband network performance appeared to have different impacts on perceived economic, emotional and social values, level of satisfaction, and loyalty.
Large Neighborhood Search Using Constraint Satisfaction Techniques in Vehicle Routing Problem
Authors: Hyun-Jin Lee, Sang-Jin Cha, Young-Hoon Yu, Geun-Sik Jo
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

Vehicle Routing Problem(VRP) is a well known NP-hard problem, where an optimal solution to the problem cannot be achieved in reasonable time, as the problem size increases. Due to this problem, many researchers have proposed a heuristic using a local search. In this paper, we propose the Constraint Satisfaction Problem(CSP) model in Large Neighborhood Search. This model enables us to reduce the size of local search space. In addition, it enables the easy handling of many constraints in the real-world.
Localization and Segmentation of A 2D High Capacity Color Barcode
Authors: Devi Parikh, Gavin Jancke
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

A 2D color barcode can hold much more information than a binary barcode. Barcodes are often intended for consumer use where using a cellphone, a consumer can take an image of a barcode on a product, and retrieve relevant information about the product. The barcode must be read using computer vision techniques. While a color barcode can hold more information, it makes this vision task in consumer scenarios unusually challenging. We present our approach to the localization and segmentation of a 2D color barcode in such challenging scenarios, along with its evaluation on a diverse collection of images of Microsoft's recently launched High Capacity Color Barcode (HCCB). We exploit the unique trait of barcode reading: the barcode decoder can give the vision algorithm feedback, and develop a progressive strategy to achieve both - high accuracy in diverse scenarios as well as computational efficiency.
Enterprise IT governance at the state level: an emerging picture
Authors: Natalie Helbig, Jana Hrdinová, Donna Canestraro
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Over the last fifteen years the role of IT in transforming state government has received greater attention due to state performance rankings, budget crises, and technology changes. States are facing serious challenges realizing the benefits of technological innovation. To that end, improving IT governance was listed as a top priority by State Chief Information Officers (CIOs) for 2009 [5]. Although advice about IT governance is abundant, many public sector IT leaders and managers do not have answers to their primary question: How do I make IT governance in my state align with the overall governance of the state? What they are finding is that no one framework or strategy works perfectly in each state. There is no cookie cutter method that can be applied; therefore, states are focusing more attention and improvement efforts on creating IT governance within their state's context. Through Web site searches and analysis of official documents, this paper presents a point in time picture of state level IT governance practices in 10 states. In addition, through interviews with top IT officials in selected states, we discuss some of their insights from the states' experiences.
Liana: a decentralized load-dependent scheduler for performance-cost optimization of grid service
Authors: Dan Liu, Yuan-Da Cao, Chun-Qing Li
Venue: The Journal of Supercomputing (2009)

This paper addresses the scheduling problem in decentralized grid systems. Such problem focuses on computing a large set of arbitrary tasks to optimize the system performance while minimizing the average system costs. The mainstream solution flourished in recent literatures is to maximize the total system throughput by modeling such systems in either a network flow or a tree. However, most of them neglect the movements of tasks and load-dependent system costs which, in fact, are crucial to the system performance in real situations. In this paper, a Service-Oriented Overlay Network (SOON) is presented, in which the service nodes encapsulate both computation and communication resources and the links are used to track the movements of tasks instead of describing communication. An analytical Cost-Charge (C2) model, in which both running cost and service charge are dependent on load, is proposed to describe the problem by incorporating degree-dependent task allocation into a closed queuing network model. The Infinitesimal Perturbation Analysis (IPA) is applied to solve C2 theoretically. Following the theoretical analysis, a scalable decentralized scheduler named Liana (the movements of tasks in the proposed system like the growth and spread of evergreen liana, so we use Liana to name the proposed scheduler) is proposed. The major components of Liana are an autonomous scheduling algorithm and a Degree-Driven Protocol (DDP). Furthermore, trace based simulations on the test bed distributed widely across the world are implemented to compare the system performance by Liana with recent approaches. The proposed approach shows promising results that the close-to-optimal service utilization is achieved when taking system cost into account.
An asymmetric 2D Pointer/3D Ray for 3D interaction within collaborative virtual environments
Authors: Thierry Duval, Cedric Fleury
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

In this paper we present a new metaphor for interaction within Collaborative Virtual Environments (CVE). This metaphor is dedicated to non-immersive or semi-immersive 3D interactions, for which users cannot afford to buy expensive devices neither for 3D visualization of their virtual environment nor for interaction. With these low-cost restrictions, we think that it is more effective to use basic 2D metaphors rather than to try to adapt 3D virtual metaphors which would be more difficult to use because of the poor immersion level offered by such systems. The problem that will arise within a CVE is that it is difficult to make a user aware of the 2D metaphors used by another user, because they are not associated with a 3D virtual object of the shared universe. So our idea is to provide to a user a 3D virtual ray (using ray-casting for object selection) that would act like a 2D pointer on the screen, allowing the user to only control the 2D position of the closest ray end, and calculating the orientation of the ray so that its projection on the screen would always be a point. This way, since the user is controlling a 3D virtual ray, the other users can be made aware of his activity. To test the efficiency of this 2D Pointer / 3D Ray, we have made some experiments making users compare different devices to realize some simple selection and manipulation tasks. The results show that this kind of 2D solution is efficient and allows 3D interaction within Virtual Environments by people who cannot afford expensive immersive hardware. This new metaphor allows more users to collaborate within CVE.
Shared Peptides in Mass Spectrometry Based Protein Quantification
Authors: Banu Dost, Nuno Bandeira, Xiangqian Li, Zhouxin Shen, Steve Briggs, Vineet Bafna
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

In analyzing the proteome using mass spectrometry, the mass values help identify the molecules, and the intensities help quantify them, relative to their abundance in other samples. Peptides that are shared across different protein sequences are typically discarded as being uninformative w.r.t each of the parent proteins.In this paper, we investigate the use of shared peptides which are ubiquitous (~50% of peptides) in mass spectrometric data-sets. In many cases, shared peptides can help compute the relative amounts of different proteins that share the same peptide. Also, proteins with no unique peptide in the sample can still be analyzed for relative abundance. Our paper is the first attempt to use shared peptides in protein quantification, and makes use of combinatorial optimization to reduce the error in relative abundance measurements. We describe the topological and numerical properties required for robust estimates, and use them to improve our estimates for ill-conditioned systems. Extensive simulations validate our approach even in the presence of experimental error. We apply our method to a model of Arabidopsis root knot nematode infection, and elucidate the differential role of many protein family members in mediating host response to the pathogen.
A traffic engineering approach for placement and selection of network services
Authors: Reuven Cohen, Gabi Nakibly
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Network services are provided by means of dedicated service gateways, through which traffic flows are directed. Existing work on service gateway placement has been primarily focused on minimizing the length of the routes through these gateways. Only limited attention has been paid to the effect these routes have on overall network performance. We propose a novel approach for the service placement problem, which takes into account traffic engineering considerations. Rather than trying to minimize the length of the traffic flow routes, we take advantage of these routes in order to enhance the overall network performance. We divide the problem into two subproblems: finding the best location for each service gateway, and selecting the best service gateway for each flow. We propose efficient algorithms for both problems and study their performance. Our main contribution is showing that placement and selection of network services can be used as effective tools for traffic engineering.
Simulation of Semiconductor Processes and Devices 2007: SISPAD 2007, 1st edition
Authors: Tibor Grasser, Siegfried Selberherr
Venue:  (2007)

This volume will contain the proceedings of the 12th edition of the International Conference on Simulation of Semiconductor Processes and Devices (SISPAD 2007), which will take place in Vienna, Austria, on September 25-27, 2007. Like the previous meetings, SISPAD 2007 will provide a world-wide forum for the presentation and discussion of recent advances and developments in the theoretical description, physical modeling and numerical simulation and analysis of semiconductor fabrication processes, device operation and system performance. Topics covered will be device simulation, including transport in nano-structures models of VLSI device scaling limits, quantum effects, and novel devices process simulation, including both continuum and atomistic approaches equipment, topography, and lithography simulation interconnect modeling and algorithms including noise and parasitic effects compact device modeling for circuit simulation integration of circuit and device simulation user interfaces and visualization high performance computing, numerical methods and algorithms mesh generation and adaptation simulation of such devices as microsensor and optoelectronics devices benchmarking, calibration, and verification of simulators.
On Packing 2D Irregular Shapes
Authors: Alexandros Bouganis, Murray Shanahan
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Designing and implementing an intelligent system that tackles the problem of placing two-dimensional shapes on a surface, such that no shapes overlap and the uncovered surface area is minimized, is highly important in industrial applications. However, it is also interesting from the scientific perspective, in terms of artificial intelligence, since autonomous systems developed up to now have found it difficult to compete with humans in this task. This paper presents a new algorithm which addresses the on-line packing of two-dimensional irregular shapes, and achieves high quality solutions in short computational times. The key point of this algorithm is the utilization of techniques drawn from computer vision and artificial intelligence.
Towards end-user adaptable model versioning: The By-Example Operation Recorder
Authors: Petra Brosch, Philip Langer, Martina Seidl, Manuel Wimmer
Venue: Proceedings of the 2009 ICSE Workshop on Comparison and Versioning of Software Models (2009)

For the realization of language-independent, effective, and user-friendly model versioning systems, generic and efficient conflict detection is essential for correct and complete identification of conflicts caused by parallel modifications on one artifact. Usually, the genericity of the conflict detection costs a high price: language-specific operations and refactorings often remain undetected. Consequently, conflicts are not found or conflicts are wrongly indicated. To improve the quality of conflict detection, language-specific features have to be added. This involves usually much programming effort. We present a descriptive approach to define language-specific operations and refactorings by macro recording which allows an easy integration in generic conflict detection components.