ppxscal/embedding_network huggingface dataset:
Study on Dynamic Mechanism of Enterprise Distributed Innovation
Authors: Guoxin Liu, Xia Li, Xiaoqin Gao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the deepening development of globalization, knowledge economy and information technology gradually, many large corporations actively explore distributed innovation to keep the competitive power and expand their firms. Basing on the empiric analysis of Midea Group of China, this paper puts forward the concept of distributed innovation and its characters, and then reveals the driving factors of enterprise distributed innovation and this would be a reference for national strategic decision-making.
Stepwise structuring: a style of life for flexible software
Authors: Erik Sandewall, Sture Hägglund, Christian Gustafsson, Lennat Jonesjö, Ola Strömfors
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

In a life cycle perspective on software, the paper describes a strategy for initialization and successive growth of software, which emphasizes flexible introduction and flexible use. The examples in the paper are taken from office information systems or personalized data processing systems. The key points in the paper are as follows: 1. The system should be organized so that it allows multiple representations of the same information, particularly as images (bitmaps), text, and structured data. 2. New applications should first be started by using representations with relatively little structure (such as images) and only gradually shift to using more structured representations. 3. It is valuable for the end user to be able to control and make use of the gradual introduction of more structure. 4. It is useful to have software tools that facilitate the interactive work of introducing more structure into the information. Some tools that have been implemented in this project are described.
Fourier Transform Inequalities for Phylogenetic Trees
Authors: Frederick A. Matsen
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity requirement implies non-trivial constraints on the site-pattern frequency vectors. We call these additional constraints "edge-parameter inequalities." In this paper, we first motivate the edge-parameter inequalities by considering a pathological site-pattern frequency vector corresponding to a quartet tree with a negative internal edge. This site-pattern frequency vector nevertheless satisfies all of the constraints described up to now in the literature. We next describe two complete sets of edge-parameter inequalities for the group-based models; these constraints are square-free monomial inequalities in the Fourier transformed coordinates. These inequalities, along with the phylogenetic invariants, form a complete description of the set of site-pattern frequency vectors corresponding to \emph{bona fide} trees. Said in mathematical language, this paper explicitly presents two finite lists of inequalities in Fourier coordinates of the form "monomial $\leq 1$," each list characterizing the phylogenetically relevant semialgebraic subsets of the phylogenetic varieties.
Functional-link nets with genetic-algorithm-based learning for robust nonlinear interval regression analysis
Authors: Yi-Chung Hu
Venue: Neurocomputing (2009)

Interval regression analysis has been a useful tool for dealing with uncertain and imprecise data. Since the available data often contain outliers, robust methods for interval regression analysis are necessary. This paper proposes a genetic-algorithm-based method for determining two functional-link nets for the robust nonlinear interval regression model: one for identifying the upper bound of data interval, and the other for identifying the lower bound of data interval. To facilitate the inclusion of regular data in the robust nonlinear interval regression model, in the fitness function, not only the cost function with different weighting schemes but also the number of training data included in the interval model is taken into account. As for resisting outliers, the effects of training data beyond or beneath the estimated data interval on the determination of upper and lower bounds can be greatly reduced during the training phase when these data are located in the rejection region. Simulation results demonstrate that the proposed method performs well for contaminated data sets by resisting outliers and including all regular data in the data intervals.
Upgrade of a full-scope simulator for fossil-fuel power plants
Authors: José Tavira-Mondragón, José Melgar-García, Jorge García-García, Rafael Cruz-Cruz
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The upgrade of a full-scope simulator for fossil-fuel power plants is presented. The mathematical models of a control board simulator have been re-hosted on a new simulation environment based on Windows XP. In order to improve the simulator capacities, the turbine model and the turbine control model are replaced by models with a wider scope. The turbine model is based on physical laws and has an application range from cold iron up to full-load generation and shutdown operations. On the other hand, the turbine control model is based on the main features of modern electrohydraulic controls and has a full application range too. This simulator has been extensively tested during steadies and transient states and its response has been validated with regard to data plant by the instructors of a training center for power plant operators.
On the Identifiability of Finite Mixtures Based on the Union of Logarithmic Series and Discrete Rectangular Families
Authors: Aladdin Shamilov, Senay Asma
Venue: Neural Processing Letters (2009)

In this paper, finite mixtures of the union of Logarithmic Series and Discrete Rectangular families are proved to be identifiable. The sufficient condition for the identifiability of finite mixtures given by Atienza et al. (Metrika 63:215---221, 2006) is applied instead of mostly used Teicher's condition (Teicher, Ann Math Stat 34: 1265---1269, 1963). The choice of distribution is made in order to stress the fact that, contrarily to Teicher's approach, Atienza et al.'s theorem being used does apply to heterogeneous parametric families.
Global and Local Graph Modifiers
Authors: Guillaume Aucher, Philippe Balbiani, Luis Fariòas del Cerro, Andreas Herzig
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We define two modal logics that allow to reason about modifications of graphs. Both have a universal modal operator. The first one only involves global modifications (of some state label, or of some edge label) everywhere in the graph. The second one also allows for modifications that are local to states. The global version generalizes logics of public announcements and public assignments, as well as a logic of preference modification introduced by van Benthem et Liu. By means of reduction axioms we show that it is just as expressive as the underlying logic without global modifiers. We then show that adding local modifiers dramatically increases the power of the logic: the logic of global and local modifiers is undecidable. We finally study its relation with hybrid logic with binder.
Approximate autoregressive modeling for network attack detection
Authors: Harshit Nayyar, Ali A Ghorbani
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

This paper presents a technique for creating an ARX model of network signals and using it for detecting network anomalies caused by intrusions. Network signals are non-stationary, highly volatile and hard to model using traditional methods. We present our own modeling technique using a combination of system identification theory and wavelet approximation. We also present the results of a prototype implementation applied to 1999 DARPA intrusion detection evaluation data set. We verify that the technique is viable for anomaly based intrusion detection and can contribute to defense in depth in a network. The technique proposed is online, generic and can be used with many other network signals like bandwidth consumption, rate of flow arrival or SNMP variables. Moreover, it requires minimal expertise for use on the part of the network administrator and automatically adapts to the underlying network behavior.
Locomotion of legged robot with locked joint
Authors: Cristina Floriana Pana, Ionut Cristian Rescanu, Marius Niculescu, Daniela Patrascu
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

Fault-tolerant gaits in robot's locomotion are defined as gaits with which legged robot can continue their walking after a failure event occurs to a leg of the robot. This means that for a given type of failure, the problem of finding fault-tolerant gaits can be formulated with which legged robots can continue their walking after an occurrence of a failure, maintaining static stability. The considered failure is a locked joint failure which prevents a joint of a leg from moving and makes it locked in a known place. This paper presents a strategy for generating fault tolerant locomotion of a quadruped robot. The failure considered in this paper is a locked joint failure. The kinematic condition of fault tolerant locomotion is derived for straight line walking of quadruped robot on even terrain. An algorithm for fault tolerant locomotion in straight line is described.
Link-alike: using wireless to share network resources in a neighborhood
Authors: Szymon Jakubczak, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, Srinivasan Seshan
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2009)

Asymmetric broadband connections in the home provide a limited upstream pipe to the Internet. This limitation makes various applications, such as remote backup and sharing high definition video, impractical. However, homes in a neighborhood often have high bandwidth wireless networks, whose bandwidth exceeds that of a single wired uplink. Moreover, most (wired and wireless) connections are idle most of the time. In this paper, we examine the fundamental requirements of a system that aggregates upstream broadband connections in a neighborhood using wireless communication between homes. A scheme addressing this problem must operate efficiently in an environment that is: i) highly lossy; ii) broadcast in nature; and iii) half-duplex. We propose a novel scheme, Link-alike, that addresses those three challenges using opportunistic wireless reception, a novel wireless broadcast rate control scheme, and preferential use of the wired downlink. Through analytical and experimental evaluation, we demonstrate that our approach provides significantly better throughput than previous solutions based on TCP or UDP unicast.
Configurability in SaaS (software as a service) applications
Authors: Nitu
Venue: Proceedings of the 2nd India software engineering conference (2009)

In the last few years Software as a Service (SaaS) has changed from curiosity generating concept to an accepted mainstream concept. SaaS has transformed the way software is being delivered to the customer. This transformation has been possible with maturing technologies and the web becoming the primary medium of communication and collaboration. SaaS is a software delivery paradigm where the software is hosted off-premise and delivered via web to a large number of tenants and the mode of payment follows a subscription model. Configurability is one of the keystones to the success of any SaaS software. Configurability allows the single instance multiple tenant model which leads to many benefits both for the customers and the vendors which in turn has led to the acceptance and popularity of SaaS. Configurability in SaaS software aims to provide tenants/customers with a multitude of options and variations using a single code base, such that it is possible for each tenant to have a unique software configuration. How to capture and represent configuration data is an important consideration when designing for configurability in SaaS software. This paper addresses the issue of how to effectively and efficiently support configurability in SaaS software and proposes SaaS architecture to support configurability. A proof of concept implementation is done to support configurability with the configuration data in xml format. The paper aims to provide information on the nature of configurability in SaaS software, how it can be provided and the technologies needed to support it.
Web services provision: solutions, challenges and opportunities (invited paper)
Authors: Qing Li, An Liu, Hai Liu, Baoping Lin, Liusheng Huang, Naijie Gu
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Web services provision is the process of assigning particular services to the constituent tasks of business processes. It describes a promising scenario where services are dynamically chosen and invoked in a business process according to their functional and non-functional capabilities. It also introduces many challenging problems and has received much attention recently. In this paper, we distinguish three types of provision: independent provision, cooperative provision and multiple provisioning. For each type, we consider three major phases, that is, service discovery, service selection and service contracting. Following this rule, we investigate existing works in web services provision and shed some light on potential research directions.
Enhancing IEEE 802.11a/n with dynamic single-user OFDM adaptation
Authors: James Gross, Marc Emmelmann, Oscar Puñal, Adam Wolisz
Venue: Performance Evaluation (2009)

Earlier paper have demonstrated that the achievable throughput of OFDM systems can benefit significantly from individual modulation/transmit power selection on a per sub-carrier basis according to the actual gain of individual sub-carriers (so called dynamic OFDM scheme). Usage of such an approach requires, however, providing support for additional functionalities such as: acquisition of the sub-carrier gains, signaling of the modulation types used between sender and receiver, etc. Therefore dynamic OFDM is actively pursued for future radio interfaces, rather than considered as extension of existing OFDM based standards. In this paper we introduce a proposal on how the widely accepted IEEE 802.11a/g systems as well as the emerging IEEE 802.11n system might be extended to support the dynamic OFDM in a single-user (point-to-point) setting. The presented approach guarantees backward compatibility to legacy devices. We address these issues by presenting (a) a set of protocol modifications required to incorporate dynamic OFDM in 802.11a/g/n; and (b) a performance evaluation of the suggested extension (referred to further on as single-user 802.11 DYN mode). Although 802.11n already includes advanced MAC and PHY features, i.e., frame aggregation and MIMO transmissions, our performance evaluation demonstrates that a further improvement is achievable by incorporating dynamic OFDM.
Intelligent business knowledge management using topic maps
Authors: Faisal Karjikar, Suman Roy, Srinivas Padmanabhuni
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

We present a method, complete with case study, for capturing and managing the information stored in business transactions based on the widely used UBL. Where conventional wisdom would use a RDBMS-based approach, we use Topic Maps as the knowledge representation format and show how by effectively leveraging its features we can efficiently navigate, discover and retrieve content in ways not possible with the conventional approach.
Time-delay simulation analysis of local controller networks
Authors: N. Kakanakov, M. Shopov, G. Spasov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

In this paper simulation and analytical results for delay bounding and buffer size in switched Ethernet network are presented. Most of the calculations are made for the environment of Distributed Automation Systems where timing constraints are important. The traffic for the tests is from combined type -- periodic constant bit rate and stochastic with Poisson distribution. The traffic mixture is made out of four different workloads mapped to the standard communication scenarios in distributed embedded systems environment. The prioritization schemes are mapped to the 802.1p traffic types. The analytical results are made using Network Calculus. The simulation is made using Network Simulator (NS).
Multi-item lot-sizing with joint set-up costs
Authors: Shoshana Anily, Michal Tzur, Laurence A. Wolsey
Venue: Mathematical Programming: Series A and B (2009)

We consider a multi-item lot-sizing problem with joint set-up costs and constant capacities. Apart from the usual per unit production and storage costs for each item, a set-up cost is incurred for each batch of production, where a batch consists of up to C units of any mix of the items. In addition, an upper bound on the number of batches may be imposed. Under widely applicable conditions on the storage costs, namely that the production and storage costs are nonspeculative, and for any two items the one that has a higher storage cost in one period has a higher storage cost in every period, we show that there is a tight linear program with O(mT 2) constraints and variables that solves the joint set-up multi-item lot-sizing problem, where m is the number of items and T is the number of time periods. This establishes that under the above storage cost conditions this problem is polynomially solvable. For the problem with backlogging, a similar linear programming result is described for the uncapacitated case under very restrictive conditions on the storage and backlogging costs. Computational results are presented to test the effectiveness of using these tight linear programs in strengthening the basic mixed integer programming formulations of the joint set-up problem both when the storage cost conditions are satisfied, and also when they are violated.
Speaker identification based on the frame linear predictive coding spectrum technique
Authors: Jian-Da Wu, Bing-Fu Lin
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, a frame linear predictive coding spectrum (FLPCS) technique for speaker identification is presented. Traditionally, linear predictive coding (LPC) was applied in many speech recognition applications, nevertheless, the modification of LPC termed FLPCS is proposed in this study for speaker identification. The analysis procedure consists of feature extraction and voice classification. In the stage of feature extraction, the representative characteristics were extracted using the FLPCS technique. Through the approach, the size of the feature vector of a speaker can be reduced within an acceptable recognition rate. In the stage of classification, general regression neural network (GRNN) and Gaussian mixture model (GMM) were applied because of their rapid response and simplicity in implementation. In the experimental investigation, performances of different order FLPCS coefficients which were induced from the LPC spectrum were compared with one another. Further, the capability analysis on GRNN and GMM was also described. The experimental results showed GMM can achieve a better recognition rate with feature extraction using the FLPCS method. It is also suggested the GMM can complete training and identification in a very short time.
Efficient duration and hierarchical modeling for human activity recognition
Authors: Thi Duong, Dinh Phung, Hung Bui, Svetha Venkatesh
Venue: Artificial Intelligence (2009)

A challenge in building pervasive and smart spaces is to learn and recognize human activities of daily living (ADLs). In this paper, we address this problem and argue that in dealing with ADLs, it is beneficial to exploit both their typical duration patterns and inherent hierarchical structures. We exploit efficient duration modeling using the novel Coxian distribution to form the Coxian hidden semi-Markov model (CxHSMM) and apply it to the problem of learning and recognizing ADLs with complex temporal dependencies. The Coxian duration model has several advantages over existing duration parameterization using multinomial or exponential family distributions, including its denseness in the space of nonnegative distributions, low number of parameters, computational efficiency and the existence of closed-form estimation solutions. Further we combine both hierarchical and duration extensions of the hidden Markov model (HMM) to form the novel switching hidden semi-Markov model (SHSMM), and empirically compare its performance with existing models. The model can learn what an occupant normally does during the day from unsegmented training data and then perform online activity classification, segmentation and abnormality detection. Experimental results show that Coxian modeling outperforms a range of baseline models for the task of activity segmentation. We also achieve a recognition accuracy competitive to the current state-of-the-art multinomial duration model, while gaining a significant reduction in computation. Furthermore, cross-validation model selection on the number of phases K in the Coxian indicates that only a small K is required to achieve the optimal performance. Finally, our models are further tested in a more challenging setting in which the tracking is often lost and the activities considerably overlap. With a small amount of labels supplied during training in a partially supervised learning mode, our models are again able to deliver reliable performance, again with a small number of phases, making our proposed framework an attractive choice for activity modeling.
Interactive Educational Multimedia: a Quick Design and Development Tool
Authors: D. Del Corso, G. Morrone, E. Ovcin, A. Truzzi, C. Scrizzi, M. Gastaldi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The work describes an environment for quick prototyping of educational interactive multimedia packages developed at the Multimedia Laboratory of the Politecnico di Torino. It simplifies the work of content authors and their interfacing with multimedia developers. A structure generator builds content books with predejined user interface including commands and navigation tools. A tool to assist the construction of tests and exercises is included in the package. The modular structure allows to build educational modules tuned to specific user profiles and didactic targets.