ppxscal/embedding_network huggingface dataset:
Exploring the perceived business value of the flexibility enabled by information technology infrastructure
Authors: Lior Fink, Seev Neumann
Venue: Information and Management (2009)

We developed a multidimensional definition of IT infrastructure (ITI) and applied it in exploring the perceived strategic payoffs of ITI-enabled flexibility. We began by developing a typology of theoretical approaches that can be used to organize the literature and then developed a multidimensional model by conceptualizing how flexibility can be enabled through technical, human, and process elements of ITI and how these are interrelated. We used a resource-based view of the firm and a dynamic capabilities perspective to account for competitive impacts of the flexibility. Finally, we hypothesized on the moderating effects of organizational size and reporting level of the top IT executive. Data collected from 293 IT managers showed that the range of managerial ITI capabilities, which were positively affected by all areas of IT personnel knowledge and skills, was responsible for the competitive impacts of the ITI-enabled flexibility. Multigroup analyses showed that large organizational size or reporting to the CEO reduced the positive effects of the range of managerial ITI capabilities on competitive impacts.
Reducing Variation in Bit-Rate Produced by Encoder in MPEG Video
Authors: Rajat Agarwal, Albert Mo Kim Cheng
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A shortcoming of current video transmission using the MPEG standard is that it's encoder produces a "variable bit rate" (VBR). Due to this, the encoder output has to be buffered and released over the network at a constant rate. This buffering of the encoder output introduces an additional delay between the encoding and decoding phases of the video transmission. To remedy this problem, we present a strategy to distribute the load produced by the encoder as evenly as possible, i.e., try to have a "constant bit rate" (CBR). This is done by treating the slices in each frame separately while compressing them and then mixing the different kinds of slices that are sent over the network. The resulting load variation is much more uniform, reducing the buffering delay and making future bandwidth requirement estimates more accurate.
Random Generation and Enumeration of Proper Interval Graphs
Authors: Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

We investigate connected proper interval graphs without vertex labels. We first give the number of connected proper interval graphs of n vertices. Using it, a simple algorithm that generates a connected proper interval graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected proper interval graphs is proposed. The algorithm is based on the reverse search, and it outputs each connected proper interval graph in $\mbox{\cal O}(1)$ time.
Modified Indiscernibility Relation in the Theory of Rough Sets with Real-Valued Attributes: Application to Recognition of Fraunhofer Diffraction Patterns
Authors: Krzysztof A. Cyran
Venue: Transactions on Rough Sets IX (2008)

The goal of the paper is to present the modification of classical indiscernibility relation, dedicated for rough set theory in a real-valued attributes space. Contrary to some other known generalizations, indiscernibility relation modified here, remains an equivalence relation and it is obtained by introducing a structure into collection of attributes. It defines real-valued subspaces, used in a multidimensional cluster analysis, partitioning the universe in a more natural way, as compared to one-dimensional discretization, iterated in classical model. Since the classical model is a special, extreme case of our modification, the modified version can be considered as more general. But more importantly, it allows for natural processing of real-valued attributes in a rough-set theory, broadening the scope of applications of classical, as well as variable precision rough set model, since the latter can utilize the proposed modification, equally well. In a case study, we show a real application of modified relation, a hybrid, opto-electronic recognizer of Fraunhofer diffraction patterns. Modified rough sets are used in an evolutionary optimization of the optical feature extractor implemented as a holographic ring-wedge detector. The classification is performed by a probabilistic neural network, whose error, assessed in an unbiased way is compared to earlier works.
Optimizing the performance of an MLP classifier for the automatic detection of epileptic spikes
Authors: Yakup Kutlu, Mehmet Kuntalp, Damla Kuntalp
Venue: Expert Systems with Applications: An International Journal (2009)

This paper introduces different classification systems based on artificial neural networks for the automatic detection of epileptic spikes in electroencephalogram records. Different multilayer perceptron networks are constructed and trained with different algorithms. The inputs of the networks consist of either raw data or extracted features. To improve the generalization performance of the classifiers, ''training with noise'' method is used whereby new training data is constructed by adding uncorrelated Gaussian noise to real data. The performances of the constructed classifiers are examined and compared both with each other and with other similar systems found in literature based on sensitivity, specificity and selectivity measures.
CONLAN: a formal construction method for hardware description languages: basic principles
Authors: Robert Piloty, Mario Barbacci, Dominique Borrione, Donald Dietmeyer, Fredrick Hill, Patrick Skelly
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The development of a CONLAN(CONsensus LANguage) goes back to the first Symposium on Hardware Description Languages (HDL) at Rutgers University in 1973. It was initiated by J. Lipovski, then Univ. of Florida. After two years of preparatory work the CONLAN Working Group was formed on the occasion of the third Symposium on HDL in New York. These papers represent the result of four years of hard work of a group spread out over two continents. This work is by no means complete; many things have still to be done. Nevertheless, encouraged by the positive response to an informal presentation of our approach at the fourth Symposium on HDL in Palo Alto 1979, we feel that publication of what we have obtained so far is warranted. This paper presents the basic principles of CONLAN. Two companion papers [1, 2] treat language derivation and language application within the framework of CONLAN. A more detailed report, of which a draft exists already, will be forthcoming soon.
Fast payment schemes for truthful mechanisms with verification
Authors: Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre
Venue: Theoretical Computer Science (2009)

In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al. [V. Auletta, R. De Prisco, P. Penna, P. Persiano, The power of verification for one-parameter agents, in: Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP, in: LNCS, vol. 3142, 2004, pp. 171-182]. Our goal is to allocate load among the agents, provided that the secret data of each agent is a single positive real number: the cost they incur per unit load. In such a setting the payment is given after the load completion, therefore if a positive load is assigned to an agent, we are able to verify if the agent declared to be faster than she actually is. We design truthful mechanisms when the agents' type sets are upper-bounded by a finite value. We provide a truthful mechanism that is c&middot;(1+&epsilon;)-approximate if the underlying algorithm is c-approximate and weakly-monotone. Moreover, if type sets are also discrete, we provide a truthful mechanism preserving the approximation ratio of its algorithmic part. Our results improve the existing ones which provide truthful mechanisms dealing only with finite type sets and do not preserve the approximation ratio of the underlying algorithm. Finally, we give applications for our payment schemes. Firstly, we give a full characterization of the Q‖Cmax problem by using our techniques. Even if our payment schemes need upper-bounded type sets, every instance of Q‖Cmax can be "mapped" into an instance with upper-bounded type sets preserving the approximation ratio. In conclusion, we turn our attention to binary demand games. In particular, we show that the Minimum Radius Spanning Tree admits an exact truthful mechanism with verification achieving time (and space) complexity of the fastest centralized algorithm for it. This contrasts with a recent truthful mechanism for the same problem [G. Proietti, P. Widmayer, A truthful mechanism for the non-utilitarian minimum radius spanning tree problem, in: Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, ACM Press, 2005, pp. 195-202] which pays a linear factor with respect to the complexity of the fastest centralized algorithm. Such a result is extended to several binary demand games studied in literature.
Performance Analysis for Large-Scale Parallel Microscopic Traffic Simulation System
Authors: Yin Fei, Zhang Dongliang
Venue: International Journal of Distributed Sensor Networks (2009)

PMTS (Parallel Microscopic Traffic Simulation) is a large-scale microscopic traffic network simulation system using a real traffic network of Shanghai, China. It describes traffic events in object oriented mode, uses MPI (Message Passing Interface) as communicate middleware, partitions the simulation traffic network into subnetworks, and runs simulations of subnetworks concurrently on a cluster of processors connected by high-speed Ethernet. To optimize the performance of PMTS, a number of challenges need to be solved, including traffic network partition, subnetworks communication and synchronization, and workload balance. The parallelization of PMTS is domain decomposition, which means that the geographical region for simulation is decomposed into several domains of similar size and each processor of the PC cluster is responsible for a different geographical area. The partition method needs to fulfill two conditions to make it efficient: minimize the communication overhead and partition the subnetworks of the equal computation load. The goals of maximizing the parallelization and minimizing the communication overhead is conflict, and the tradeoff should be made. PVTM simulates the vehicles activities on the traffic network, and the computation overhead for one vehicle is certain. The time overhead on one processor depends on the number of vehicles for simulation. The individual simulation of vehicle activity includes: vehicle generation, vehicle running, and the vehicle going through the boundary zone. The derivation of the predictive performance is demonstrated and the calculation of the time cost for one processor with a certain number of vehicles is provided. In order to be efficient, the load on different processors should be as similar as possible. The load depends on the actual vehicle number on the respective processor that also varies as the simulation run. In each time step, the workload is collected for each processor. For the next iteration, the information will be fed back to the load-balancer, which will move the boundary of the grid to balance the vehicle numbers among the domains. The performance metrics of the simulation system mainly depend on the load balance, scalability, speedup, and efficiency. The performance optimization of PMTS has been proved to be effective when it is put into use and the experiment results are also provided which match the analysis.
Two-Phased Active Support Kernel Machine Learning
Authors: Yasusi Sinohara, Atsuhiro Takasu
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

Since SVMs have met with significant success in numerous real-world learning, SVM-based active learning has been proposed in the active learning context and it has been successfully applied in the domains like document classification, in which SVMs using linear kernel are known to be effective for the task. However, it is difficult to apply SVM-based active learning to general domains because the kernel used in SVMs should be selected properly before the active learning process but good kernels for the target task is usually unknown. If the pre-selected kernel is inadequate for the target data, both the active learning process and the learned SVM have poor performance. Therefore, new active learning methods are required which effectively find an adequate kernel for the target data as well as the labels of unknown samples in the active learning process.In this paper, we propose a two-phased SKM-based active learning method for the purpose. By experiments, we show that the proposed SKM-based active learning method has quick response suited to interaction with human experts and can find an appropriate kernel among linear combinations of given multiple kernels.
Identification of nonlinear systems with time-varying parameters using a sliding-neural network observer
Authors: Tarek Ahmed-Ali, Godpromesse Kenné, Françoise Lamnabhi-Lagarrigue
Venue: Neurocomputing (2009)

In this paper, a new method for the identification of nonlinear systems with time-varying parameters using a sliding-neural network observer is investigated. The proof of the finite-time convergence of the estimates to their true values is achieved using Lyapunov arguments and sliding mode theories. An application example illustrated the effectiveness of the approach and the obtained results show high convergence rate and very satisfactory parameter estimation accuracy. The computing results under noisy condition also demonstrate that good state and parameter estimation can be achieved despite the disturbance (noise) in the system. The reduced number of hidden units and the small transient period demonstrate that the proposed method can be easily implementable in real-time.
Improving Acoustic Models with Captioned Multimedia Speech
Authors: Photina Jaeyun Jang, Alexander G. Hauptmann
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Speech recognition can be used to create searchable transcripts for audio indexing in digital video libraries. Large amounts of hand-transcribed speech training data are required to build or improve acoustic models of highly accurate speech recognition systems using current technologies. We present a technique to use television broadcasts with closed-captions as a source for large amounts of automatically extracted and accurately transcribed speech for improving acoustic models. The errorful closed captioned text is aligned with the also errorful speech recognition output and matching segments are used with each corresponding audio segment as acoustic training data to improve the speech recognition system. Our technique automatically extracted 131.4 hours of transcribed speech and improved the word error rate of our currently best speech recognition system (Sphinx-III) from 32.82% to 31.19%. A speech recognizer trained exclusively on 70.7 hours of this automatically transcribe! d speech produced a word error rate of 32.7%.
Using Computer-Assisted Test to Harmlessly Improve the Efficiency of Heterogeneous Grouping in Collaborative Learning
Authors: Chih-Kai Chang, Chang-Shing Lee
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Collaborative learning can bring many benefits when groups of students work together in writing, projects, or other activities. However, there are disadvantages of collaborative learning. One of the disadvantages is that the time spent on learning a topic could be unbelievable. To improve the efficiency of a collaborative learning activity, this study used computer-assisted test for the heterogeneous grouping stage. Unfortunately, any test may increase students’ learning anxiety. Therefore, the study aims to find out how to improve efficiency of collaborative learning activities in a classroom without losing the expected objectives. First, the Team-Game-Tournament (TGT) collaborative learning strategy was selected to complement the computer-assisted test. Then, we can use a questionnaire to show that there is no significant increase on learning anxiety after using computer-assisted testing. In other words, additional testing in collaborative learning is harmless to students’ learning anxiety. Finally, the time spent on learning a topic of experimental group was compared with control group to demonstrate the improvement of efficiency. The most interesting part of this study is showing computer-assisted test as a useful tool for computer-supported collaborative learning.
Semantic matchmaker with precondition and effect matching using SWRL
Authors: Ayse B. Bener, Volkan Ozadali, Erdem Savas Ilhan
Venue: Expert Systems with Applications: An International Journal (2009)

Service oriented architectures provide more effective and dynamic applications. Using semantic Web Services in service oriented architectures improves interoperability and scalability. A very important aspect of using semantic Web Services is the matchmaking process. Semantic matchmaking is used during discovery and composition of semantic Web Services to find valuable service candidates. Among these candidates, best ones are chosen to build up the composition, or for substitution in the case of an execution failure. Our proposed matchmaker architecture performs semantic matching of Web Services on the basis of input and output descriptions of semantic Web Services as well as precondition and effect matching. We present a novel approach for assigning matchmaking scores to condition expressions in OWL-S documents written in SWRL during matchmaking.
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Authors: Arnon Avron, Anna Zamansky
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one occurrence of a connective is introduced and no other connective is mentioned. Cut-elimination in such systems is fully characterized by a syntactic constructive criterion of coherence. In this paper we extend the theory of canonical systems to the considerably more general class of signed calculi. We show that the extended criterion of coherence fully characterizes only analytic cut-elimination in such calculi, while for characterizing strong and standard cut-elimination a stronger criterion of density is required. Modular semantics based on non-deterministic matrices are provided for every coherent canonical signed calculus.
Improvements on the Johnson bound for Reed-Solomon codes
Authors: V. N. Muralidhara, Sandeep Sen
Venue: Discrete Applied Mathematics (2009)

For Reed-Solomon codes with block length n and dimension k, the Johnson theorem states that for a Hamming ball of radius smaller than n-nk, there can be at most O(n^2) codewords. It was not known whether for larger radius, the number of codewords is polynomial. The best known list decoding algorithm for Reed-Solomon codes due to Guruswami and Sudan [Venkatesan Guruswami, Madhu Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory 45 (6) (1999) 1757-1767] is also known to work in polynomial time only within this radius. In this paper we prove that when k0) there can be at most O(n^c^2^@a^(^1^-^@a^)^^^2^+^c^+^2) number of codewords. For any constant c, we describe a polynomial time algorithm for enumerating all of them, thereby also improving on the Guruswami-Sudan algorithm. Although the improvement is modest, this provides evidence for the first time that the n-nk bound is not sacrosanct for such a high rate. We apply our method to obtain sharper bounds on a list recovery problem introduced by Guruswami and Rudra [Venkatesan Guruswami, Atri Rudra, Limits to list decoding Reed-Solomon codes, IEEE Transactions on Information Theory 52 (8) (2006) 3642-3649] where they establish super-polynomial lower bounds on the output size when the list size exceeds @?nk@?. We show that even for larger list sizes the problem can be solved in polynomial time for certain values of k.
Automatic metadata generation applications: a survey study
Authors: Badawia M. Albassuny
Venue: International Journal of Metadata, Semantics and Ontologies (2008)

This study is a survey of Automatic Metadata Generations Applications (AMeGAs) that are available and free on the Web. The study tested the functions as well as the features of each tool, by using a survey approach and features analysis. The results indicated that Meta Tag Generators (MTGs), which generate meta-information about the Web page, were the most available applications on the Web. Actually, they represented 89.27%. The analysing tools, which check and analyse the existing meta tags in the website, to help Webmasters optimise them, represented 6.34%. The other applications that automatically create metadata from an analysis of the digital resource such as extracting, harvesting and converting tools represented 1.46% for each tool. This study discussed the key results in addition to the future researches.
Is HEMT operating in 2D mode?
Authors: S. Mil'shtein, A. Churi, C. Gil
Venue: Microelectronics Journal (2009)

The complete answer to the question posed by the title of this paper requires a detailed explanation. The conceptual design of the pseudomorphic high electron mobility (p-HEMT) structure is based on 2D electron gas transport and, therefore, a HEMT is expected to manifest quantization at any point along the channel. Our main question addresses devices manufactured by a variety of semiconductor companies and research groups where a certain number of thick cap layers above the 2D channel space could work as a leakage passage for electrons out of the channel. Indeed, the measurements of output current performed by us at low temperature demonstrated limited quantization, which happens in a very small volume under the gate. In the current study, measurements of the output current of a dual-gate p-HEMT showed some control of the volume in which quantization occurs. Better control of quantization was observed in the novel HEMT we designed, where the escape of electrons from the channel was prevented. The appearance of quantization steps and the length of these steps in the output current at low temperature were dependent on the biases applied to the second gate. We tend to believe that quantization of electron energies at low temperature is responsible for the appearance of these steps in output current characteristics.