ppxscal/embedding_network huggingface dataset:
A cross-impact simulation forecast of the data processing industry
Authors: Paul Herbert Rosenthal
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This paper describes the application of the USC Center of Future Research's Cross-Impact Model to the simulation of the evolution of an emerging industry. The Data Processing Industry (DP) and its emerging Network and Decentralized Systems sub-industries are used to illustrate the application of the model. This application of the USC cross-impact forecasting model to the simulation of the evolution of an emerging industry and its component parts will constitute its first micro-economic application.
Discovering Significant Patterns in Multi-stream Sequences
Authors: Robert Gwadera, Fabio Crestani
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Discovering significant patterns in synchronized multi-stream sequences also known as multi-attribute event sequences (multi-sequences), is an important problem in many domains, including monitoring systems and information retrieval. In this paper we propose a new approach for assessing significance of multi-stream patterns in multi-attribute event sequences. In experiments on physiological multi-stream data we show applicability of our method.
The distributed studio: towards a theory of virtual place for creative collaboration
Authors: Viveka Weiley, Yusuf Pisan
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Virtual environments intended to support creative collaboration are being built without an informed consideration of the implicit interaction design choices being made. This paper proposes a set of design principles for such environments. Drawing from theory and reflective practice we suggest a conceptual focus on a Distributed Studio designed around the following five principles: Support Reconfiguration, Mix Realities, Control Access, Be A/Synchronous, and Transform Space into Inhabited Place.
A Language for Self-Adaptive System Requirements
Authors: Jon Whittle, Pete Sawyer, Nelly Bencomo, Betty H. C. Cheng
Venue: Proceedings of the 2008 International Workshop on Service-Oriented Computing Consequences for Engineering Requirements (2008)

Self-adaptive systems have the capability to autonomously modify their behaviour at run-time in response to changes in their environment. Such systems are now commonly built in domains as diverse as enterprise computing, automotive control systems, and environmental monitoring systems. To date, however, there has been limited attention paid to how to engineer requirements for such systems. As a result, self-adaptivity is often constructed in an ad-hoc manner. In this paper, we argue that a more rigorous treatment of requirements relating to self-adaptivity is needed and that, in particular, requirements languages for self-adaptive systems should include explicit constructs for specifying and dealing with the uncertainty inherent in self-adaptive systems. We present some initial thoughts on a new requirements language for self-adaptive systems and illustrate it using examples from the services domain.
Duty-Oriented Hybrid Peer-to-Peer Network Based on Metadata
Authors: Kan Li, Xin Sun, Yue He
Venue: International Journal of Distributed Sensor Networks (2009)

The topology structure of the peer-to-peer overlay network is a critical factor in dominating performance of resource discovery. In the paper, we consider that nodes have their duty or function in the real world, and we take full advantage of the characteristic of unstructured peer-to-peer network. According to these, a duty-oriented hybrid peer-to-peer network based on metadata (DHPM) is proposed. DHPM organizes nodes into a tree-structure hierarchical overlay network. Its nodes are divided into domains according to the duty or the function of these nodes, and into groups according to the semantic similarity in one domain. The DHPM overlay network consists of two types of nodes, super peers (SPs) and peers. A super peer is a node that acts as a centralized server submitting and answering requests on behalf of peers. A peer submits queries to its super peer, searches for the location of queries according to the metadata directory in the super peers and receives results from the real resource location. The super-peer architecture adopted in DHPM exploits the heterogeneity of nodes by assigning additional responsibilities to higher-capacity nodes. The classification of nodes helps to increase searching efficiency during routing messages in the network. In DHPM, peers query resources via metadata directory which is in the super peers. Metadata directory in the 1st level SPs manages the information of shared resources in their domains, while metadata directory in the 2nd level SPs manages the shared information in their groups. The metadata directory is a tree-like distributed infrastructure. In the first layer of the metadata directory there are all the 1st level SPs and replica directory. 1st level SPs manage all the metadata of shared resources in the domain. The metadata of shared resources include databases, files, monitoring information, and 2nd level SPs in the domain. In order to construct and maintain DHPM, node join algorithm, node departure algorithm, and query searching algorithm are presented to ensure running of the network. Duty or function is the important factor in selecting the super peers. In addition, high bandwidth, sufficient searching process power, longer online time etc. are the considered factors. In node departure algorithm, we describe two kinds of node departure cases: normal departure and abnormal departure. By means of metadata directory, query searching can be gotten in DHPM. Finally, experiments are made to show the performance of query searching with DHPM, Gnutella, and Freenet.
Algorithm and testing software for avoiding fragmentation at the application layer
Authors: Delyan Genkov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The modern recommendations regarding the IP fragmentation process is to avoid it. There are different possibilities regarding the OSI model layers to implement logic for avoiding fragmentation. The present study describes a possible algorithm about integrating the IP fragmentation avoiding logic into the application software.
Efficient dominant eigensystem computation using nodal equations
Authors: Antonio Gómez Expósito, Alfonso Bachiller Soler, José Antonio Rosendo Macías
Venue: International Journal of Circuit Theory and Applications (2009)

In this paper, alternative methods are developed for computing the smallest, the largest and a given subset of the largest eigenvalues associated with linear time-invariant circuits. The proposed methods resort to the solution of DC or AC adjoint circuits, for which conventional nodal analysis can be adopted. Experimental results obtained with test cases comprising over 500 state variables show substantial computational savings with respect to standard algorithms, based on the system matrix A arising in the state-space formulation. Copyright &copy; 2008 John Wiley & Sons, Ltd.
QR factorization for the Cell Broadband Engine
Authors: Jakub Kurzak, Jack Dongarra
Venue: Scientific Programming (2009)

The QR factorization is one of the most important operations in dense linear algebra, offering a numerically stable method for solving linear systems of equations including overdetermined and underdetermined systems. Modern implementations of the QR factorization, such as the one in the LAPACK library, suffer from performance limitations due to the use of matrix-vector type operations in the phase of panel factorization. These limitations can be remedied by using the idea of updating of QR factorization, rendering an algorithm, which is much more scalable and much more suitable for implementation on a multi-core processor. It is demonstrated how the potential of the cell broadband engine can be utilized to the fullest by employing the new algorithmic approach and successfully exploiting the capabilities of the chip in terms of single instruction multiple data parallelism, instruction level parallelism and thread-level parallelism.
Unsupervised multiphase segmentation: A recursive approach
Authors: Kangyu Ni, Byung-Woo Hong, Stefano Soatto, Tony Chan
Venue: Computer Vision and Image Understanding (2009)

We propose an unsupervised multiphase segmentation algorithm based on Bresson et al.'s fast global minimization of Chan and Vese's two-phase piecewise constant segmentation model. The proposed algorithm recursively partitions a region into two subregions, starting from the largest scale. The segmentation process automatically terminates and detects when all the regions cannot be partitioned further. The number of regions is not given and can be arbitrary. Furthermore, this method provides a full hierarchical representation that gives a structure of a given image.
Fuzzy multi-class classifier based on support vector data description and improved PCM
Authors: Yong Zhang, Zhong-Xian Chi, Ke-Qiu Li
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, a novel fuzzy classifier for multi-classification problems, based on support vector data description (SVDD) and improved PCM, is proposed. The proposed method is the robust version of SVDD by assigning a weight to each data point, which represents fuzzy membership degree of the cluster computed by the improved PCM method. Accordingly, this paper presents the multi-classification algorithm based on the robust weighted SVDD, and gives the simple classification rule. Experimental results show that the proposed method can reduce the effect of outliers and yield higher classification rate.
Neighbor embedding based super-resolution algorithm through edge detection and feature selection
Authors: Tak-Ming Chan, Junping Zhang, Jian Pu, Hua Huang
Venue: Pattern Recognition Letters (2009)

Assuming that the local geometry of low-resolution image patches is similar to that of the high-resolution counterparts, neighbor embedding based super-resolution methods learn a high-resolution image from one or more low-resolution input images by embedding its patches optimally with training ones. However, their performance suffers from inappropriate choices of features, neighborhood sizes and training patches. To address the issues, we propose an extended Neighbor embedding based super-resolution through edge detection and Feature Selection (henceforth NeedFS). Three major contributions of NeedFS are: (1) A new combination of features are proposed, which preserve edges and smoothen color regions better; (2) the training patches are learned discriminately with different neighborhood sizes based on edge detection; (3) only those edge training patches are bootstrapped to provide extra useful information with least redundancy. Experiments show that NeedFS performs better in both quantitative and qualitative evaluation. NeedFS is also robust even with a very limited training set and thus is promising for real applications.
Reparallelization techniques for migrating OpenMP codes in computational grids
Authors: Michael Klemm, Matthias Bezold, Stefan Gabriel, Ronald Veldema, Michael Philippsen
Venue: Concurrency and Computation: Practice Experience (2009)

Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system utilization. If the user underestimates the runtime, premature termination causes computation loss; overestimation is penalized by long queue times. As a solution, we present an automatic reparallelization and migration of OpenMP applications. A reparallelization is dynamically computed for an OpenMP work distribution when the number of CPUs changes. The application can be migrated between clusters when an allocated time slice is exceeded. Migration is based on a coordinated, heterogeneous checkpointing algorithm. Both reparallelization and migration enable the user to freely use computing time at more than a single point of the grid. Our demo applications successfully adapt to the changed CPU setting and smoothly migrate between, for example, clusters in Erlangen, Germany, and Amsterdam, the Netherlands, that use different kinds and numbers of processors. Benchmarks show that reparallelization and migration impose average overheads of about 4 and 2&percnt;, respectively. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Classification Using a Novel Combined Classifier for Digital Modulations in Digital Television Communication
Authors: Zhong Gao, Guanming Lu, Daquan Gu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the rapid development of the communication technology, the communication environment becomes more and more complicated these years. Many signal modulation types are used simultaneously in digital TV communication systems. Therefore, a need arises for modulation classification that can automatically detect the incoming modulation type. In this paper, we propose a new approach for modulation classification, which uses a novel combined classifier based on multi-class support vector machine (SVM) and fuzzy integral to make the classification more suitable and accurate for signals in a wide range of signal to noise rate (SNR). Further, three efficient features with high robustness and less computation are extracted from intercepted signals to classify eleven digital modulation types. The experimental results show that the proposed scheme has the advantages of high accuracy and reliability.
Real-time Parameter Estimation of Space-borne SAR Based on FrFT
Authors: Guang Yang, Shao-bin Li, Hua-dong Sun, Jianjun Gao
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Space-borne synthetic aperture radar is widely used in the military field. To counter space-borne SAR, it is necessary to estimate the parameters of space-borne SAR in real-time. After Receiving the signals of SAR, fractional Fourier transform is applied to both single pulse and pulse train, which can estimate the parameters in real-time. Theory analysis and Numerical simulation show this method has high accuracy.
Object-name search by visual appearance and spatio-temporal descriptions
Authors: Shun Hattori, Katsumi Tanaka
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

When a user searches the Web for information about a target object by submitting a keyword-based query to such a conventional Web search engine as Google, the precision and recall of the search results depend a great deal on whether or not s/he has known exactly the concrete name of the target object. However, the user does not always know the concrete name of any target object that s/he has encountered in the real world and wanted information about. In this paper, we propose an application system of Object-Name Search that helps her/him to identify the concrete name of the target object by such ambiguous features as its class-name, visual appearance and spatio-temporal information. When the user inputs a class-name, visual appearance and/or real-world context descriptions, our system returns not only concrete object-names ranked by her/his specification but also their typical images, visual appearance and spatio-temporal descriptions. And then the user can also modify her/his original specification repeatedly by using their typical features as a useful reference.
Phase reduction models for improving the accuracy of the finite element solution of time-harmonic scattering problems I: General approach and low-order models
Authors: Xavier Antoine, Christophe Geuzaine
Venue: Journal of Computational Physics (2009)

This paper introduces a new formulation of high frequency time-harmonic scattering problems in view of a numerical finite element solution. It is well-known that pollution error causes inaccuracies in the finite element solution of short-wave problems. To partially avoid this precision problem, the strategy proposed here consists in firstly numerically computing at a low cost an approximate phase of the exact solution through asymptotic propagative models. Secondly, using this approximate phase, a slowly varying unknown envelope is introduced and is computed using coarser mesh grids. The global procedure is called Phase Reduction. In this first paper, the general theoretical procedure is developed and low-order propagative models are numerically investigated in detail. Improved solutions based on higher order models are discussed showing the potential of the method for further developments.
Integrating usage control with SIP-based communications
Authors: E. Barka, A. Lakas
Venue: Journal of Computer Systems, Networks, and Communications (2008)

The Session Initiation Protocol (SIP) is a signaling protocol used for establishing and maintaining communication sessions involving two or more participants. SIP was initially designed for voice over IP and multimedia conferencing, and then was extended to support other services such as instant messaging and presence management. Today, SIP is also adopted to be used with 3G wireless networks, thus it becomes an integral protocol for ubiquitous environment. SIP has various methods that support a variety of applications such as subscribing to a service, notification of an event, status update, and location and presence services. However, when it comes to security, the use of wireless and mobile communication technologies and the pervasive nature of this environment introduce higher risks to security than that of the old simple environment. In this paper, we introduce new architecture that implements a new type of access control called usage access control (UCON) to control the access to the SIP-based communication at preconnection, during connection, and postconnection. This will enable prescribers of SIP services to control who can identify their locations to approve or disapprove their subsequent connections, and to also set some parameters to determine whether a certain communication can continue or should terminate.
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Authors: Murdoch J. Gabbay
Venue: Theoretical Computer Science (2009)

Fraenkel-Mostowski (FM) set theory delivers a model of names and alpha-equivalence. This model, now generally called the 'nominal' model, delivers inductive datatypes of syntax with alpha-equivalence - rather than inductive datatypes of syntax, quotiented by alpha-equivalence. The treatment of names and alpha-equivalence extends to the entire sets universe. This has proven useful for developing 'nominal' theories of reasoning and programming on syntax with alpha-equivalence, because a sets universe includes elements representing functions, predicates, and behaviour. Often, we want names and alpha-equivalence to model capture-avoiding substitution. In this paper we show that FM set theory models capture-avoiding substitution for names in much the same way as it models alpha-equivalence; as an operation valid for the entire sets universe which coincides with the usual (inductively defined) operation on inductive datatypes. In fact, more than one substitution action is possible (they all agree on sets representing syntax). We present two distinct substitution actions, making no judgement as to which one is 'right' - we suspect this question has the same status as asking whether classical or intuitionistic logic is 'right'. We describe the actions in detail, and describe the overall design issues involved in creating any substitution action on a sets universe. Along the way, we think in new ways about the structure of elements of FM set theory. This leads us to some interesting mathematical concepts, including the notions of planes and crucial elements, which we also describe in detail.
Nature-based information networking: on exploring robustness in TCP inspired by cellular signaling
Authors: Jian-Qin Liu, Kenji Leibnitz, Masayuki Murata
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

In this paper we will discuss the similarities found in the dynamics of cellular signal transduction networks in nature and that of communication network protocols. Based on the simplified observations from the signaling processes of the cyclin (cln) protein during the cell cycle in yeast, we formulate a generic master equation, which describes the general robustness of the system and can be applied to characterize different variants of the Transmission Control Protocol (TCP) such as FAST, Reno, HSTCP, or STCP. By presenting the generalized controller mechanism for describing the dynamics of cln signaling at system level, we infer that any corresponding second order system is similarly controllable. It is our intention that this formulation of a master equation leads to a better quantitative description of the cellular signaling process, as well as to a more robust design of protocols to be applied in new generation network architectures.
Some approaches to modelling prices in an ecological-economic system
Authors: V. S. Hrygorkyv
Venue: Cybernetics and Systems Analysis (2009)

Nonlinear deterministic and stochastic dual models are proposed for intersectoral ecological-economic balance with respect to prices in an ecologically balanced economy. Corresponding deterministic equivalents are constructed for stochastic models.
On-line analytical framework for the 2-DE based proteome information
Authors: Jung Eun Shim, Won Suk Lee
Venue: Expert Systems with Applications: An International Journal (2009)

The integration of proteome information is one of the key issues in proteomics research. There are currently several proteome databases which provide proteome information such as Swiss-Prot, PDB, and SRS. However, each proteome database system supports only simple inquiries on the proteome information of its database. In order to enhance the analysis support capability of proteome information, this paper proposes a data warehouse system which constructs proteome data by integrating diverse protein information along with clinical and experiment information produced in various methods in order to enhance the analysis support capability of proteome information. Based on the proteome data warehouse, OLAP and exception discovery queries are carried out. Therefore, complex multidimensional analysis is feasible for highly systematized proteome data in a proteome data warehouse. Furthermore, various analysis results which integrate experiment information, clinical information, image information, and spot information of proteins are provided.
Software describing attributes
Authors: Borut Jereb
Venue: Computer Standards Interfaces (2009)

This article represents a step towards defining attributes of software and the metrics of these attributes by creating a framework of them. By standardization both, the attributes and the metrics, the description of software makes useful in its life cycle processes. Some of the proposed attributes and their metrics have been in use for decades, some are under development and some are proposed in this article for the first time. However, the proposed system is unique and it classifies attributes into four groups according to their properties: 1) task system; 2) software, hardware and data surrounding; 3) time limits and 4) history of execution. Which of the attribute groups and which individual attribute within a group we need to consider depend on the nature of the software and related demands. The attribute framework should be tailored to the needs of any software project.
Orangina "Naturally Juicy"
Authors: Fred, Farid
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Crazy, sexy, over-the-top, and hugely entertaining. This is an inadequate description of "Naturally Juicy," the steamy, 1:45 spot for Orangina.