ppxscal/embedding_network huggingface dataset:
Effectively finding the relevant web pages from the world web wide
Authors: N. P. Gopalan, J. Akilandeswari, P. Gabriel Sagaya Selvam
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Effective & efficient retrieval of the required quality web pages on the web is becoming a greater challenge. Early work on search engines concentrated on the textual content of web pages to find relevant pages, but in recent years, the analysis of information encoded in hyperlinks has been used to improve search engine performance. For these reasons, this paper presents three hyperlink analysis-based algorithms to find relevant pages for a given web page (URL). The first algorithm comes from the extended co citation analysis of the web pages. The second one takes advantage of linear algebra theories to reveal deeper relationships among the web pages and to identify relevant pages more precisely and effectively. The third one presents a variation on the use of linkage analysis for automatically categorizing web pages, by defining a similarity measure. This measure is used to categorize hyperlinks themselves, rather than web pages. Also this paper presents a moved Page Algorithm to detect and eliminate the dead pages.
Visualization of sound fields on vibrating steel beam using linear microphone array
Authors: Zdenek Havránek
Venue: Proceedings of the 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2006)

This paper deals with real measurement results on simply supported steel beam producing sound field in short distance from the beam surface. Beam resonant frequencies can be calculated analytically, measured with classical piezoelectric transducers with information about acceleration on the beam, and also with microphone array and near-field acoustic holography calculation. The non-contact technique with microphone array measurement has many advantages in compare with classical measurement with accelerometers.
A Fast Heuristic Algorithm for Similarity Search in Large DNA Databases
Authors: In-Seon Jeong, Kyoung-Wook Park, Hyeong-Seok Lim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Knowledge Discovery techniques seek to find new information about a domain. These techniques can either be manually performed by an expert, or automated using software algorithms (Machine Learning). However some domains (such as the field of lung function testing) contain volumes of data too vast for effective manual analysis, and require background knowledge too complex for Machine Learning algorithms. This study examines how the Multiple Classification Ripple-Down Rules (MCRDR) Knowledge Acquisition process can be adapted to develop a new Knowledge Discovery method, Exposed MCRDR. A prototype system was developed and tested in the domain of lung function. Preliminary results suggest that the EMCRDR method can be successfully applied to efficiently discover new knowledge in a complex domain. The study also reveals many potential areas of study and development for the MCRDR method, and Knowledge Acquisition and Knowledge Discovery methods in general.
Shape deformation with tunable stiffness
Authors: Wenwu Yang, Jieqing Feng, Xiaogang Jin
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

The paper presents a 2D or 3D shape deformation method which incorporates global and local stiffness controls. First, a geometric object is embedded into a regular lattice and then the deformation is conducted on the lattice; thus, the method is independent of the underlying object representation. The lattice cells are organized as overlapping local rigid regions, and the region width could be regarded as a means of the global lattice stiffness control. For each region, there is a local stiffness coefficient to control the lattice deformation locally. During the deformation a nonlinear objective function is optimized to achieve the natural lattice deformation with the prescribed global and local stiffnesses. Then, the lattice deformation is passed to the embedded object through bilinear or trilinear interpolation. In this way we can deform the object in a more physically plausible way with tunable stiffness. Experimental results show that the method is intuitive and flexible.
A method for source-microphone range estimation in reverberant environments using arrays of unknown geometry
Authors: Denis McCarthy, Frank Boland
Venue: EURASIP Journal on Advances in Signal Processing (2008)

This paper proposes a technique for determining the distance between a sound source and the microphones in an array. The proposed "Range-Finder" algorithm is robust in the presence of reverberation and, in contrast with previously published source-localization techniques, does not require knowledge of the relative positions of the microphones. We discuss the factors affecting the accuracy of our range estimates and present the results of experiments using simulated and real data to demonstrate the efficacy of our approach.
CMOS Based Low Cost Temperature Sensor
Authors: Neehar Jandhyala, Lili He, Morris Jones
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper presents the design of low power, low cost design of temperature sensor that has been designed keeping in view VLSI circuits and technology changes. The circuit occupies an area close to 0.01mm2, which is less than 1/100th of the area occupied by most of the previous circuits that use capacitors and A/D converters. Power This paper presents the design of low power, low cost design of temperature sensor that has been designed keeping in view VLSI circuits and technology changes. The circuit occupies an area close to 0.01mm2, which is less than 1/100th of the area occupied by most of the previous circuits that use capacitors and A/D converters. Power dissipation of the circuit ranges from 800µW to 1.2mW for temperatures ranging between -20°C to 80°C. It has been implemented using TSMC 0.18µm technology.
Error estimation in reconstruction of quadratic curves in 3D space
Authors: N. Sukavanam, R. Balasubramanian, Sanjeev Kumar
Venue: International Journal of Computer Mathematics (2007)

Many natural and man-made objects have planar and curvilinear surfaces. The images of such curves do not usually have sufficient distinctive features to apply conventional feature-based reconstruction algorithms. In this paper, we describe a method for the reconstruction of various kinds of quadratic curves in 3D space as an intersection of two cones containing the respective projected digitized curve images in the presence of Gaussian noise. The advantage of this method is that it overcomes the correspondence problem that occurs in pairs of projections of the curve. Using nonlinear least-squares curve fitting, the parameters of a curve in 2D digitized image planes are determined. From this we reconstruct the 3D quadratic curve. Relevant mathematical formulations and analytical solutions for obtaining the equation of the reconstructed curve are given. Simulation studies have been conducted to observe the effect of noise on errors in the process of reconstruction. Results for various types of quadratic curves are presented using simulation studies. These are the main contributions of this work. The angle between the reconstructed and the original quadratic curves in 3D space has been used as the criterion for the measurement of the error. The results of this study are useful for the design of a stereo-based imaging system (such as the LBW decision in cricket, the path of a missile, robotic vision, path planning, etc.) and for the best reconstruction with minimum error.
On the complexity of graph self-assembly in accretive systems
Authors: Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai
Venue: Natural Computing: an international journal (2008)

We study the complexity of the Accretive Graph Assembly Problem ( $${\tt{AGAP}}$$ ). An instance of $${\tt{AGAP}}$$ consists of an edge-weighted graph G, a seed vertex in G, and a temperature ¿. The goal is to determine if the graph G can be assembled by a sequence of vertex additions starting from the seed vertex. The edge weights model the forces of attraction and repulsion, and determine which vertices can be added to a partially assembled graph at the given temperature. A vertex can be added when the total weight to its already built neighbors in the graph is at least ¿. The assembly process is sequential meaning that only one vertex can be added at a time. Our first result is that $${\tt{AGAP}}$$ is NP-complete even on planar graphs with maximum degree 3 when edges have only two different types of weights. This resolves the complexity of $${\tt{AGAP}}$$ in the sense that the problem is poly-time solvable when either the maximum degree is at most 2 or the number of distinct edge weights is one, and is NP-complete otherwise. Our second result is a dichotomy theorem that completely characterizes the complexity of $${\tt{AGAP}}$$ on graphs with maximum degree 3 and two distinct weights: w p and w n . We give a simple system of linear constraints on w p , w n , and ¿ that determines whether the problem is NP-complete or is poly-time solvable. In the process of establishing this dichotomy, we give a poly-time algorithm to solve a non-trivial class of $${\tt{AGAP}}.$$ Finally, we consider the optimization version of $${\tt{AGAP}}$$ where the goal is to assemble a largest-possible induced subgraph of the given input graph. We show that even on graphs that can be assembled and have maximum degree 3, it is NP-hard to assemble a (1/n 1-¿)-fraction of the input graph for any $$\varepsilon > 0;$$ here n denotes the number of vertices in G.
BEAM: a framework for business ecosystem analysis and modeling
Authors: C. H. Tian, B. K. Ray, J. Lee, R. Cao, W. Ding
Venue: IBM Systems Journal (2008)

This paper presents a framework for the modeling and analysis of business model designs involving a network of interconnected business entities. The framework includes an ecosystem-modeling component, a simulation component, and a service-analysis component, and integrates methods from value network modeling, game theory analysis, and multiagent systems. A role-based paradigm is introduced for characterizing ecosystem entities in order to easily allow for the evolution of the ecosystem and duplicated functionality for entities. We show how the framework can be used to provide insight into value distribution among the entities and evaluation of business model performance under different scenarios. The methods are illustrated using a case study of a retail business-to-business service ecosystem.
Exploring studio-based instructional models for computing education
Authors: Christopher D. Hundhausen, N Hari Narayanan, Martha E. Crosby
Venue: ACM SIGCSE Bulletin (2008)

While the demand for college graduates with computing skills continues to rise, such skills no longer equate to mere programming skills. Modern day computing jobs demand design, communication, and collaborative work skills as well. Since traditional instructional methods in computing education tend to focus on programming skills, we believe that a fundamental rethinking of computing education is in order. We are exploring a new "studio-based" pedagogy that actively engages undergraduate students in collaborative, design-oriented learning. Adapted from architectural education, the studio-based instructional model emphasizes learning activities in which students (a) construct personalized solutions to assigned computing problems, and (b) present solutions to their instructors and peers for feedback and discussion within the context of "design crits." We describe and motivate the studio-based approach, review previous efforts to apply it to computer science education, and propose an agenda for multi-institutional research into the design and impact of studio-based instructional models. We invite educators to participate in a community of research and practice to advance studio-based learning in computing education.
Locally uniform anisotropic meshing
Authors: Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Various definitions of so called anisotropic Voronoi diagrams have been proposed. These diagrams are typically parameterized by a metric field. Under mild hypotheses on the metric field, such Voronoi diagrams can be refined so that their dual is a triangulation, with elements shaped according to the specified anisotropic metric field. We propose an alternative approach to anisotropic mesh generation, relying on the notion of locally uniform anisotropic mesh. A locally uniform anisotropic mesh is a mesh such that the star around each vertex v coincides with the star that v would have if the metric on the domain was uniform and equal to the metric at v. This definition allows to define a simple refinement algorithm which relies on elementary predicates, and provides, after completion, an anisotropic mesh in dimensions 2 and 3. A practical implementation has been done in the 2D case.
Deikto: an application of the weak sapir-whorf hypothesis
Authors: Chris Crawford
Venue: Proceedings of the hypertext 2008 workshop on Creating out of the machine: hypertext, hypermedia, and web artists explore the craft (2008)

Diekto is a meta-language system for creating user interface languages that simultaneously specify their knowledge domain.
A semi-evolutionary approach for modeling pedotransfer functions with small size of data using artificial neural networks
Authors: T. M. Taheri, K. Mahdaviani, J. Mohammadi
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

Pedotransfer functions are predictive functions of certain soil properties based on their easily or cheaply measured features. An approach based on the artificial neural networks is taken to model such functions. Due to the small size of the relevant data set, a especial procedure is used to design the architecture of the suitable network to avoid the problem of overfitting.
Algorithmic number theory-the complexity contribution
Authors: L. M. Adleman
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Though algorithmic number theory is one of man's oldest intellectual pursuits, its current vitality is perhaps unrivalled in history. This is due in part to the injection of new ideas from computational complexity. In this paper, a brief history of the symbiotic relationship between number theory and complexity theory will be presented. In addition, some of the technical aspects underlying 'modern' methods of primality testing and factoring will be described. Finally, an extensive lists of open problems in algorithmic number theory will be provided.
A service driven development process (sddp) model for ultra large scale systems
Authors: Fereidoon Shams, Amir Azim Sharifloo, Mehdi Mirakhorli, Mostafa Emaeli
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

Achieving ultra-large-scale software systems will necessarily require new and special development processes. This position paper suggests overall structure of a process model to develop and maintain system of systems similar to Ultra Large Scale (ULS) systems. The proposed process model will be introduced in details and finally, we will evaluate it considering CMMI-ACQ which has been presented by SEI for acquirer organizations.
Texture analysis of proximal femur radiographs for osteoporosis assessment
Authors: Tati Rajab Mengko, J. Tjandra Pramudito
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The osteoporosis assessment can be done by observing and analyzing the trabecular pattern in proximal femur. To reduce variability, a machine vision system based on texture analysis using Gabor filter is introduced. Multi-channel filtering implemented by Gabor function, or Gabor filter, is capable to mimics characteristics of the human visual system. In the assessment of osteoporosis, Gabor filter is used to calculate features from trabecular pattern recorded on radiographs of proximal femur. The extracted features represent the quality or structure of the bone, better quality represents better bone strength, lower quality leads to low bone strength and could be suspected as osteoporosis. Extracted features from trabecular pattern recorded in proximal femur radiographs by Gabor filter match with their predetermined Singh index.
An application protocol to integrate a small size helicopter into an IP based ad-hoc network
Authors: Florian Zeiger, Christian Selbach, Benjamin Ruderisch, Klaus Schilling
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

In modern multi robot systems, wireless any-to-any communication in combination with highly dynamical network topologies are prerequisites for mobile robots to accomplish complex tasks. This work presents a protocol for steering and controlling a small size helicopter. It fully supports the easy integration into an internet protocol based mobile ad-hoc wireless network, as well as several security and safety issues as it is required for a reliable and robust teleoperation of an unmanned aerial vehicle. The requirements of a helicopter control protocol, as well as implementation and design details on a safe and robust teleoperation are described. Besides these implementation details, also real hardware tests are evaluated to show the seamless functionality and performance of the helicopter control protocol in combination with ad-hoc on demand distance vector routing (AODV) inside the mobile ad-hoc network. It could be proved, that the proposed application protocol for steering a small size helicopter could be used in combination with AODV and relevant parameters for a reliable communication are identified.
From del.icio.us to x.qui.site: recommendations in social tagging sites
Authors: Sihem Amer-Yahia, Alban Galland, Julia Stoyanovich, Cong Yu
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We present X.QUI.SITE, a scalable system for managing recommendations for social tagging sites like del.icio.us. seamlessly incorporates various user behaviors into the recommendations and aims to recommend not only items of interest, but also other relevant information like interesting people and/or topics. Explanations are also provided so that users can obtain a better understanding of the recommendations and decide which recommendations to pursue further. We discuss the technical challenges involved in characterizing different user behaviors and in efficiently computing recommendation explanations.
On the use of SHIM6 for mobility support in IMS networks
Authors: John Ronan, Sasitharan Balasubramaniam, Adnan K Kiani, Wenbing Yao
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The future of network communications is moving towards deployment of an all-IP core network. This has given rise to many devices hitting the market equipped with multiple network interfaces. However, in order to really benefit from such a heterogeneous network environment, applications must experience minimum disruption as they roam from one network to another, which requires seamless mobility support. Although, some mobility proposals have emerged (Mobile IPv6, and its extensions), none of them give satisfactory performance in terms of handover between different networks. In addition, they require infrastructural changes to the network and give poor performance in case of a failure. In this paper, we propose a mechanism to support mobility through a multi homing SHIM6 layer. The results show that our proposed mechanism outperforms Route Optimized Mobile IPv6.
Introducing function extraction into software testing
Authors: Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevner
Venue: ACM SIGMIS Database (2008)

Software testing can benefit from technologies that enable evolution toward increased engineering discipline. In current practice, software developers lack practical means to determine the full functional behavior of programs under development, and even the most thorough testing can provide only partial knowledge of behaviors. Thus, effective scientific principles and engineering technology for revealing software behavior should have a positive impact on software testing. This paper describes the emerging technology of function extraction (FX) for computing the behavior of programs to the maximum extent possible with mathematical precision. We explore how the use of FX technologies can transform methods for functional verification of software. An example illustrates the value of full behavior knowledge for complete and confident assessment of software function and fitness for use. We conclude by describing a transition strategy for introducing FX technology into the development and operation of software systems.
Scalability comparison of Peer-to-Peer similarity search structures
Authors: Michal Batko, David Novak, Fabrizio Falchi, Pavel Zezula
Venue: Future Generation Computer Systems (2008)

Due to the increasing complexity of current digital data, similarity search has become a fundamental computational task in many applications. Unfortunately, its costs are still high and grow linearly on single server structures, which prevents them from efficient application on large data volumes. In this paper, we shortly describe four recent scalable distributed techniques for similarity search and study their performance in executing queries on three different datasets. Though all the methods employ parallelism to speed up query execution, different advantages for different objectives have been identified by experiments. The reported results would be helpful for choosing the best implementations for specific applications. They can also be used for designing new and better indexing structures in the future.
Image Compression Suitable for High Dynamic Range Image Rendering
Authors: Hironori Kaida, Masahiro Okuda
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we propose a high dynamic range image coding method based on wavelet compression. In our method, we employ a pre-processing function to minimize errors between rendered (i.e. tone mapped) version of an original and compressed images. To enhance efficiency of the coding, we introduce the Hill function as the pre-processing. This function partially compresses the dynamic range of the HDR images based on the Human Visual System. The method implicitly assigns more bits to visually important luminance regions. We show the validity of our pre-processing by some experimental results.