ppxscal/embedding_network huggingface dataset:
Scheduling computational process on the basis of ranked models and CPL criterion functions
Authors: Leon Bobrowski
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Scheduling procedures allow to determine the order of realization of particular tasks of a given complex process. The order of such tasks can be represented as a ranked relation between some of them. Ranked models have the form of linear transformations of multivariate feature vectors on a line which preserve in a satisfactory manner a given set of ranked relations between components. The linear ranked transformations can be designed through minimization of adequate CPL criterion functions. Theoretical properties of this approach to scheduling and their applications are discussed in the paper.
&ldquo;New Methods of Statistical Economics,&rdquo; revisited: Short versus long tails and Gaussian versus power-law distributions
Authors: Benoit B. Mandelbrot
Venue: Complexity (2009)

The standard &ldquo;Brownian&rdquo; model of competitive markets asserts that the increments of price (or of its logarithm) are statistically independent and Gaussian, implying that price itself is a continuous function of time. This model arose in 1900, at an immediately high level of perfection, in the work of L. Bachelier. In many fields of science it became a classic. But for financial prices it is sharply&mdash;even overwhelmingly&mdash;contradicted by conspicuous and strong symptoms of non-independence, nonGaussianity, and discontinuity. Since 1963, the author has been tackling those symptoms one by one: first, by incorporating strongly non-Gaussian marginal distributions (1963), then by incorporating strong long-term dependence (1965), and finally by combining those two features by introducing the new notion of multifractality (1968 and since). The goal of this article is modest: largely borrowing from the author's previous articles and books, much of it collects and adapts a few brief &ldquo;teasers&rdquo; or &ldquo;appetizers&rdquo; meant to promote and assist the future development of a framework for a realistic description of actual financial fluctuations. &copy; 2008 Wiley Periodicals, Inc. Complexity, 2009
Experiences in the Design of Semantic Services Using Web Engineering Methods and Tools
Authors: Marco Brambilla, Stefano Ceri, Irene Celino, Dario Cerizza, Emanuele Valle, Federico M. Facca, Andrea Turati, Christina Tziviskou
Venue: Journal on Data Semantics XI (2008)

Although Semantic Web Services are expected to produce a revolution in the development of Web-based systems, very few concrete design experiences are available; only recently, Software Engineering methods and tools have started to embrace the deployment of Semantic Web applications. In this paper, we show how classical Software Engineering methods (i.e., formal business process development, computer-aided and component-based software design, and automatic code generation) combine with semantic methods and tools (i.e., ontology engineering, semantic service annotation and discovery) to forge a new approach to software development for the Semantic Web. In particular, we present our experience in the participation to the Semantic Web Service (SWS) challenge 2006, where the proposed approach achieved very good results in solving the proposed problems.
An effective method for detecting dental diseases by using fast neural networks
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

In this paper, a new fast algorithm for dental diseases detection is presented. Such algorithm relies on performing cross correlation in the frequency domain between input image and the input weights of fast neural networks (FNNs). It is proved mathematically and practically that the number of computation steps required for the presented FNNs is less than that needed by conventional neural networks (CNNs). Simulation results using MATLAB confirm the theoretical computations. One of the limitations of Direct Digital Radiography (DDR) is noise. Some recent publications have indicated that Digital Subtraction Radiography (DSR) might significantly aid in the clinical diagnosis of dental diseases, once various clinical logistic problems limiting its widespread use have been over come. Noise in digital radiography may result from sources other than variation in projection geometry during exposure. Structure noise consists of all anatomic features other than those of diagnostic interest. Limitations of plain radiographs in detecting early, small bone lesions are also due to the presence of structure noise. This research work has been under - taken in an attempt to minimize structure noise in digital dental radiography by using digital subtraction radiography. By minimizing the structure noise, the validity of the digitized image in detecting diseases is enhanced.
BEAMOS: a new electronic digital memory
Authors: W. C. Hughes, C. Q. Lemmond, H. G. Parks, G. W. Ellis, G. E. Possin, R. H. Wilson
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

BEAMOS, for Beam Addressed Metal Oxide Semiconductor, is a new technology for auxiliary memories based on an electron beam which reads and writes data on a simple unstructured MOS chip. It can store data for months with or without power.
Design of Cognitive Radio Wiereless Parameters Based on Multi-objective Immune Genetic Algorithm
Authors: Liu Yong, Jang Hong, Huang Yu Qing
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Cognitive radio (CR) wireless parameter optimizationis a typical multi-objective optimization problem. In order to design wireless parameters, a multiobjective immune genetic algorithm is presented based on non-dominated sort in this paper. Comparative studies are performed between the proposed algorithm and NSGA-II by the use of four typical multi-objective functions. Simulation results show that the proposed algorithm can effectively solve the multi-objective optimization problems and has a more obvious advantage than NSGA-II. We design a control module using the proposed algorithm and simulate the optimal design of CR parameters based on the IEEE 802.11a physical platform. The simulation results show that the algorithm is effective.
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Authors: Luca Cittadini, Giuseppe Battista, Massimo Rimondini
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

The Internet is a huge and complex network in which Internet Service Providers (ISPs) compete for revenue. In order to support the establishment of commercial agreements, routing in the Internet must therefore allow each ISP to autonomously set up its own routing policies while ensuring global connectivity. The Border Gateway Protocol (BGP) allows to achieve both these goals, and is the currently adopted protocol for Internet routing.It can be shown that the interaction of not-so-unlikely BGP configurations adopted at different ISPs can cause permanent oscillations of routing. Several models and algorithms have been proposed in the literature to study routing oscillations. The goal of this paper is to provide a survey of state of the art contributions in this field with an emphasis on the algorithmic aspects.
Tales from the trial trail: videotex progress in the United States
Authors: Gary H. Arlen
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

With about three dozen experiments and services under way or in preparation, the U.S. videotex industry is in the midst of lively growth. A number of factors will affect the immediate prospects for commercial services, especially the break-up of the Bell system and the activities of the resulting companies. In addition, the development of cable TV and the creation of hybrid interactive services using other new technologies will affect the growth of videotex and teletext in the U.S. Moreover, pending legal issues may shape the development of videotext services. 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
Use of neurofuzzy networks to improve wastewater flow-rate forecasting
Authors: F. J. Fernandez, A. Seco, J. Ferrer, M. A. Rodrigo
Venue: Environmental Modelling Software (2009)

A neurofuzzy wastewater flow-rate forecasting model (NFWFFM) has been developed and tested with actual data measured at the input of two wastewater treatment facilities which treat the wastewater corresponding to 150,000 and 1,250,000p.e., respectively. Good agreements between forecasted and actual flow-rates were obtained. The artificial intelligence algorithm uses only two input variables (day of the week and average daily flow-rate of day before) and one output variable (predicted average daily flow-rate). Using three months data for training the network, a long-term forecast (one month) is made with average errors below 10%. Results were compared with those obtained by applying the Census Method II (a commonly used decomposition/recomposition time series method) observing that forecast made by the NFWFFM is more accurate than the one made by this commonly used statistical method.
Constrained aggressor set selection for maximum coupling noise
Authors: Debjit Sinha, Gregory Schaeffer, Soroush Abbaspour, Alex Rubin, Frank Borkam
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

In this paper, we consider the problem of selecting a set of aggressor nets that maximize crosstalk induced noise or delay pushout on a coupled victim net, under given logical constraints. We formulate the problem mathematically, and propose efficient Lagrangian Relaxation and network flow based approaches that guarantee an optimal solution. We also formulate and solve this problem while considering the noise susceptibility of the victim's receiving gate. Experimental results show that the proposed approaches are run-time efficient by factors of up to 800X in comparison to an exhaustive search approach, and reduce timing pessimism by up to 36%.
SanskritTagger: A Stochastic Lexical and POS Tagger for Sanskrit
Authors: Oliver Hellwig
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

SanskritTagger is a stochastic tagger for unpreprocessed Sanskrit text. The tagger tokenises text and performs part-of-speech tagging using a Markov model. Parameters for these processes are estimated from a manually annotated corpus that currently comprises approximately 1,500,000 words. This article sketches the tagging process, reports the results of tagging a few short passages of Sanskrit text and describes further improvements of the program. 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
Research on the Electric Power Enterprise Performance Evaluation Based on Symbiosis Theory
Authors: Jinyu Tian, Yan Lin
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The analysis of this text was carried out on the electric power enterprise performance evaluation on basis of symbiosis theory, which had stressed on the relation of the enterprise social performance and the whole enterprise performance. It provided a type of artificial neural network trained by experts for evaluating the electric power enterprise. Finally a case was applied to qualify its validity and feasibility.
Research on the cast molding process for high quality PDMS molds
Authors: Xiangdong Ye, Hongzhong Liu, Yucheng Ding, Hansong Li, Bingheng Lu
Venue: Microelectronic Engineering (2009)

As a critical component in nanoimprint, PDMS mold is usually made by cast molding, and it is important to make high quality PDMS molds with fine, dense and deep features. A number of methods have been developed to improve the quality of the mold. However, they are mainly focused on the additives added to the polymers which will enhance the performance of PDMS mold. In this paper, two major factors in the cast molding process which will affect the physical properties of the final PDMS mold are investigated: the vacuum degree in degassing phase and the curing temperature in solidifying phase. The experiments have indicated that a higher vacuum degree and a lower temperature are the favorable conditions to make a quality PDMS mold. Moreover, through the obtained experiments results, the curing mechanism of PDMS is further revealed. As a result, the dense and fine features with a linewidth of 40nm in the PDMS mold have been replicated from the master pattern by cast molding process successfully.
Reducing the negative effects of sales promotions in supply chains using genetic algorithms
Authors: T. O'Donnell, P. Humphreys, R. McIvor, L. Maguire
Venue: Expert Systems with Applications: An International Journal (2009)

This paper considers the detrimental effect of promotions on the supply chain (SC), one of the main causes of the bullwhip effect. A genetic algorithm (GA) is proposed to reduce these negative effects. In order to validate the GA, it is used to determine the optimal ordering policy in an online version of the MIT beer distribution game. Subsequently, the GA is applied in a number of experiments involving deterministic and random demand and lead times combined with sales promotions. It is shown how GAs can be used to dampen the impact of the bullwhip effect and can be used to assist supply managers in predicting reorder quantities along the supply chain.
A New Unequal Power Allocation Scheme for Asymmetric Turbo Code System
Authors: B. Balamuralithara
Venue: Wireless Personal Communications: An International Journal (2009)

In this paper, a modified unequal power allocation scheme for the different bits of asymmetric turbo encoder has been investigated to enhance the performance. The simulation results and performance bound for the asymmetric turbo code with modified Unequal Power Allocation (UPA) scheme are obtained and compared with the system with typical UPA and without UPA. From the performance results, it is observed that the proposed asymmetric turbo code with modified UPA performs better than the system without UPA and with typical UPA and it provides a coding gain of 0.4---0.52 dB.
Goal Preservation by Choreography-Driven Matchmaking
Authors: Matteo Baldoni, Cristina Baroglio, Alberto Martelli, Viviana Patti, Claudio Schifanella
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

In this work we give a formal background and identify the limits of applicability of local matching criteria (among which the well-known Zaremski and Wings's plugin-match) when they are used to automatically retrieve all the capabilities that are necessary to instantiate a given choreography. In doing this it is necessary to take into account and somehow merge two possibly conflicting perspectives: the local criterion for selecting single capabilities and the overall goal that we mean the composition to pursue. Formally, the problem is interpreted as the study of the preservation of the global properties of a choreography, when its roles are played by specific services.
Improved Face Detection Algorithm Based on Adaboost
Authors: Li-ying Lang, Wei-wei Gu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In view of the training time-consuming shortcoming of the conventional AdaBoost algorithm in face detection, in this paper, a new algorithm was presented combining effectively the optimizing rect-features and weak classifier learning algorithm, which can largely improve the hit-rate and decrease the train time. Optimized rect-feature means that when searching rect-feature we can establish a growth step length of the rect-feature and reduce its features.And the new weak classifier training method is seeking the weak classifier error rate directly, which can avoid the iterative training, the statistic probability distribution and any other time-consuming process. The experimental result showed that the algorithm mentioned in this paper, reduces training time cost greatly compared with conventional AdaBoost algorithm. In addition, it speeds up weak classifier and improves the detection speed on the premise of high detection accuracy.
Flow, Gesture, and Spaces in Free Jazz: Towards a Theory of Collaboration
Authors: Guerino B. Mazzola, Paul B. Cherlin
Venue: Computational Music Science (2009)

The scientific approach of this book transcends the limits of art literature in that it also develops geometric theories of gestures and distributed identities, also known as swarm intelligence. We exemplify this approach in the framework of free jazz, which is a prototypical creative and collaborative art form. Leader artists such as John Coltrane, Pharoah Sanders, Cecil Taylor, Sun Ra, The Art Ensemble of Chicago, Albert Ayler, Don Cherry, and Archie Shepp are presented in their strongest works and theories. A CD with new recordings of the group Tetrade (Jeff Kaiser on trumpet, Guerino Mazzola on piano, Sirone on bass, Heinz Geisser on percussion) is included. The pillars of our theory of collaboration are built from psychologist Mihaly Csikszentmihalyis flow, physicist Gilles Chtelets gestures, and computer scientist Bill Wulf's collaboratories.
Annotation of Video by Alignment to Reference Imagery
Authors: Keith J. Hanna, Harpreet S. Sawhney, Rakesh Kumar, Y. Guo, S. Samarasekara
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Video as an entertainment or information source in consumer, military, and broadcast television applications is widespread. Typically however, the video is simply presented to the viewer, with only minimal manipulation. Examples include chroma-keying (often used in news and weather broadcasts) where specific color components are detected and used to control the video source. In the past few years, the advent of digital video and increases in computational power has meant that more complex manipulation can be performed. In this paper we present some highlights of our work in annotating video by aligning features extracted from the video to a reference set of features.Video insertion and annotation require manipulation of the video stream to composite synthetic imagery and information with real video imagery. The manipulation may involve only the 2D image space or the 3D scene space. The key problems to be solved are : (i) indexing and matching to determine the location of insertion, (ii) stable and jitter-free tracking to compute the time variation of the camera, and (iii) seamlessly blended insertion for an authentic viewing experience. We highlight our approach to these problems by showing three example scenarios: (i) 2D synthetic pattern insertion in live video, (ii) annotation of aerial imagery through geo-registration with stored reference imagery and annotations, and (iii) 3D object insertion in a video for a 3D scene.
Stream-Network Navigation in the U.S. Geological Survey StreamStats Web Application
Authors: Kernell G. Ries III, Peter A. Steeves, John D. Guthrie, Alan H. Rea, David W. Stewart
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

StreamStats is a U.S. Geological Survey Web-based geographic information systems application developed as a tool for water-resources planning and management, engineering design, and other applications. The primary functionality of StreamStats allows users to obtain drainage-basin boundaries, basin characteristics, and streamflow statistics for gaged and ungaged sites. Recently, tools that allow stream-network navigation were added to StreamStats. These tools allow users to select any point along a stream and locate activities upstream and downstream from the selected point, such as streamgaging stations, dams, and point-source discharges, and obtain information about such activities. Users also can obtain stream-reach addresses and estimates of streamflow statistics for the selected points.
Information-theoretic hashing of 3D objects using spectral graph theory
Authors: Khaled Tarmissi, A. Ben Hamza
Venue: Expert Systems with Applications: An International Journal (2009)

Identification and authentication of multimedia content has become one of the most important aspects of multimedia security. In this paper, we present a hashing technique for 3D models using spectral graph theory and entropic spanning trees. The main idea is to partition a 3D triangle mesh into an ensemble of sub-meshes, then apply eigen-decomposition to the Laplace-Beltrami matrix of each sub-mesh, followed by computing the hash value of each sub-mesh. This hash value is defined in terms of spectral coefficients and Tsallis entropy estimate. The experimental results on a variety of 3D models demonstrate the effectiveness of the proposed technique in terms of robustness against the most common attacks including Gaussian noise, mesh smoothing, mesh compression, scaling, rotation as well as combinations of these attacks.
Beginning Spatial with SQL Server 2008, 1 edition
Authors: Alastair Aitchison
Venue:  (2009)

Microsoft SQL Server 2008 introduces new geography and geometry spatial datatypes that enable the storage of structured data describing the shape and position of objects in space. This is an interesting and exciting new feature, with many potentially useful applications. Beginning Spatial with SQL Server 2008 covers everything you need to know to begin using these new spatial datatypes, and explains how to apply them in practical situations involving the spatial relationships of people, places, and things on the earth. All of the spatial concepts introduced are explained from the ground up, so you need not have any previous knowledge of working with spatial data. Every section is illustrated with code examples that you can use directly in SQL Server. All of the topics covered in this book apply to all versions of SQL Server 2008, including the freely available SQL Server 2008 Express. What youll learn Understand the fundamental concepts involved in working with spatial data, including spatial references and coordinate systems. Apply these concepts in the collection and storage of spatial data in SQL Server 2008, using the new geometry and geography field types. Create different types of spatial data objectspoints, lines, and polygonsand use these to describe realworld objects. Learn how to analyze spatial data using a range of supported methods, and be aware of a number of different practical applications for these methods. Be shown how to integrate SQL Server with other tools, such as Microsoft Virtual Earth, to display a visual representation of spatial data. Know how to ensure the performance of spatially enabled databases by creating appropriate spatial indexes. Who is this book for? SQL Server developers who wish to use spatial data in Microsoft SQL Server 2008. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entrylevel job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together realworld projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory!