ppxscal/embedding_network huggingface dataset:
Telephone speech recognition using neural networks and hidden Markov models
Authors: DongSuk Yuk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The performance of well-trained speech recognizers using high quality full bandwidth speech data is usually degraded when used in real world environments. In particular, telephone speech recognition is extremely difficult due to the limited bandwidth of the transmission channels. In this paper, neural network based adaptation methods are applied to telephone speech recognition and a new unsupervised model adaptation method is proposed. The advantage of the neural network based approach is that the retraining of speech recognizers for telephone speech is avoided. Furthermore, because the multi-layer neural network is able to compute nonlinear functions, it can accommodate for the non-linear mapping between full bandwidth speech and telephone speech. The new unsupervised model adaptation method does not require transcriptions and can be used with the neural networks. Experimental results on TIMIT/NTIMIT corpora show that the performance of the proposed methods is comparable to that of recognizers retained on telephone speech.
A Bayes-Based Region-Growing Algorithm for Medical Image Segmentation
Authors: Zhigeng Pan, Jianfeng Lu
Venue: Computing in Science and Engineering (2007)

A new Bayesian-analysis-based region-growing algorithm for medical image segmentation can robustly and effectively segment medical images. Specifically, the approach studies homogeneity criterion parameters in a local neighbor region. Using the multislices Gaussian and anisotropic filters as a preprocess helps reduce an image's noise.
Ontology-Based Context Management Agent for Vertical Handoff Use Fuzzy Logic Decision in Heterogeneous Network
Authors: Nguyen Thi Thanh Huong, Matsumoto Mitsuji
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In recent years we've seen an increase in number of mobile devices and mobile applications, running over different types of networks (e.g., WLAN, 3G, 4G,, UMTS, WiMAX..) that enable any-where, any-time kind of applications. The user is getting flooded with these applications and the information they provide. Seamless mobility intersystem roaming across heterogeneous wireless access networks will be one of the main features in the management architecture of future generation mobile networks. In this paper we propose an ontology-based context management agent policy to manage access networks and handover fuzzy logic decision algorithm for future heterogeneous wireless networks..
Understanding the Impact of Multi-Core Architecture in Cluster Computing: A Case Study with Intel Dual-Core System
Authors: Lei Chai, Qi Gao, Dhabaleswar K. Panda
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Multi-core processors are growing as a new industry trend as single core processors rapidly reach the physical limits of possible complexity and speed. In the new Top500 supercomputer list, more than 20% processors belong to the multi-core processor family. However, without an indepth study on application behaviors and trends on multicore clusters, we might not be able to understand the characteristics of multi-core cluster in a comprehensive manner and hence not be able to get optimal performance. In this paper, we take on these challenges and design a set of experiments to study the impact of multi-core architecture on cluster computing. We choose to use one of the most advanced multi-core servers, Intel Bensley system with Woodcrest processors, as our evaluation platform, and use benchmarks including HPL, NAMD, and NAS as the applications to study. From our message distribution experiments, we find that on an average about 50% messages are transferred through intra-node communication, which is much higher than intuition. This trend indicates that optimizing intranode communication is as important as optimizing internode communication in a multi-core cluster. We also observe that cache and memory contention may be a potential bottleneck in multi-core clusters, and communication middleware and applications should be multi-core aware to alleviate this problem. We demonstrate that multi-core aware algorithm, e.g. data tiling, improves benchmark execution time by up to 70%. We also compare the scalability of a multi-core cluster with that of a single-core cluster and find that the scalability of the multi-core cluster is promising.
Evolutionary optimized pitching motion control for F-16 aircraft
Authors: Kang-Hee Lee, Chi-Ho Lee, Jong-Hwan Kim, Han-Lim Choi, Min-Jea Tahk
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A controller to stabilize F-16 aircraft flying with a steady state around the altitude of 25,000 ft is considered. The nonlinear pitching motion model of F-16 is linearized in the range of the flight envelope of velocity vs. altitude. Then the statically unstable system is stabilized by applying feedback linearization. As the gain-scheduling method is introduced at various operating points within the flight envelope, the optimized controller is designed all over the envelope. Evolutionary Optimization based on Lagrangian (Evolian II) is used to optimize the controller gains P and I satisfying complex nonlinear constraints.
Handling Dynamic Organizational Change with Community-Based Policy Management
Authors: Kevin Feeney, David Lewis, Vincent Wade
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Policy-based management (PBM) aims to provide flexibility in the management of resources so as to readily reflect changing business goals. However, as organizations increasingly use electronic means for more of their core business operations, the ability to ensure that policies accurately reflect the operation of an organization becomes more challenging. This paper presents a critique of organizational modeling abstractions used in existing policy and access rule schemes.
The 'Grand Challenge' in Informatics: Engineering Software-Intensive Systems
Authors: Manfred Broy
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

Tackling the daunting challenges of complex software systems development requires a broad stream of research supported by several new technical competencies, including a good understanding of system modeling, the effective use of models, and a modeling theory of discrete event systems.
The WUI-Toolkit: A Model-Driven UI Development Framework for Wearable User Interfaces
Authors: Hendrik Witt, Tom Nicolai, Holger Kenn
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

We introduce the "WUI-Toolkit" as a framework to support and ease the development of wearable user interfaces (WUIs). The toolkit presents a first step towards a model-driven UI design approach in wearable computing that allows even non UI experts the generation of usable and context-aware WUIs. Based on an abstract model of an envisioned user interface that is independent of any concrete representation, the toolkit is able to generate a device- and context-specific UI for a given wearable computing system at runtime. The toolkit features the ability to use available context sources and can automatically adapt generated interfaces to maintain their usability. We present the current architecture including the capabilities of the abstract model and introduce a renderer developed to generate graphical WUIs suitable for monocular head-mounted displays in industrial applications.
Design of 2-dimensional linear phase perfect reconstruction FIR filter bank using Lagrange multiplier method
Authors: M. Ikehara
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We present a design method of 2-dimensional (2D) linear phase (LP) perfect reconstruction (PR) FIR filter banks based on the Lagrange multiplier method. In M analysis filters, we first design M-1 analysis filters which have an LP property. Finally we design the Mth analysis filter with LP so that the overall system satisfy PR. Then the Mth analysis filter is optimized to have a good response while keeping PR based on the Lagrange multiplier method. By this method, 2D LP PR filter banks can be easily designed by only solving the simultaneous equation, although the order of the Mth analysis filter is higher than that of the others.
Formal Architecture Transformation Using Heuristics
Authors: Cameron Maxwell, Tim O'Neill, John Leaney
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Heuristics have long been a popular and effective mechanism for capturing the knowledge of experts. In recent times, however, the more common use of heuristics has been as a means for communicating ideas at an abstract level, with little consideration to their potential as a structured approach to design improvement. With this paper we present the issues surrounding, and a structured method for, formally capturing architectural change embodied within heuristics. We demonstrate how through the application of graph theory, category theory and predicate calculus we can capture change within a heuristic and then use it to achieve formal heuristic-based transformation of a real-world system. By capturing heuristics in the structured and formal manner discussed in this paper we present ourselves with the opportunity to create a practical and reliable heuristic-based architecture transformation system. This is done within the wider context of achieving a process for optimising the non-functional qualities of a system architecture through design transformation.
A simple rewrite notion for call-time choice semantics
Authors: Francisco J. López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is not a trivial issue that has been addressed from a semantic point of view in the Constructor-based Rewriting Logic (CRWL) framework. We investigate here how to express call-time choice and non-strict semantics from a point of view closer to classical rewriting. The proposed notion of rewriting uses an explicit representation for sharing with let-constructions and is proved to be equivalent to the CRWL approach. Moreover, we relate this let-rewriting relation (and hence CRWL) with ordinary rewriting, providing in particular soundness and completeness of let-rewriting with respect to rewriting for a class of programs which are confluent in a certain semantic sense.
Protein Homology Modeling with Heuristic Search for Sequence Alignment
Authors: Shing-Hwang Doong
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Molecular biology provides several important techniques to modern cancer research. Among them, protein structure prediction offers important insights towards the understanding of a protein's biochemical functions, which may eventually lead to the discovery of new cancer drugs. Homology modeling is an important technique for protein structure prediction. However, this modeling technique suffers from a misalignment between the template and the target sequences. The situation deteriorates when the sequence identity between the two is low. In this study, using the Modeller program we applied three heuristic search algorithms, namely genetic algorithms, tabu search and particle swarm optimization, to align the template-target pair. Two model assessment scores, GA341 and DOPE, were used to guide the search process. A preliminary result showed that, under the same constraints on computational resources, genetic algorithms produced the best search result, and DOPE provided more effective assessment for the search.
Distinguishing adaptive from non-adaptive evolution using Ashby's law of requisite variety
Authors: A. K. Seth
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The introduction of noise into an evolutionary iterated prisoner's dilemma model can promote the evolution of strategy memory. In this paper, an analysis in terms of Ashby's (1956) law of requisite variety enables a distinction to be drawn between the adaptive evolution of memory and non-adaptive evolution, or drift, a distinction which, in such situations, is remarkably insensitive to fitness statistics. As part of this, it is demonstrated how the influence of noise can depend on its locus in the evolving system. Additional evidence is presented for a second influence of noise in facilitating drift, an influence which can be interpreted in terms of noise-induced genotype-phenotype degeneracy.
Examining The Fragments of G
Authors: Steven James Perron
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

When restricted to proving \Sigma _i^q i formulas, the quantified propositional proof system G_i^* is closely related to the \Sigma_i^b theorems of Buss's theory S_2^i . Namely, G_i^* has polynomialsize proofs of the translations of theorems of S_2^i , and S_2^i proves that G_i^* is sound. However, little is known about G_i^* when proving more complex formulas. In this paper, we prove a witnessing theorem for G_1^* similar in style to the KPT witnessing theorem for T_2^i. This witnessing theorem is then used to show that S_2^i proves G_1^* is sound with respect to prenex \Sigma_i+1^q formulas. Note that unless the polynomial hierarchy collapses S_2^i is the weakest theory in the S_2 hierarchy for which this is true. The witnessing theorem is also used to show that G_1^* is p-equivalent to a quantified version of extended-Frege. This is followed by a proof that G_i p-simulates G_i+1^*. We finish by proving that S_2 can be axiomatized by S_2^1 plus axioms stating that the cut-free version of G* is sound. All together this shows that the connection between G_i^* and S_2^i does not extend to more complex formulas.
Physicians' Resistance toward Healthcare Information Technologies: A Dual-Factor Model
Authors: Anol Bhattacherjee, Neset Hikmet
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper proposes and validates a theory of physician resistance toward IT usage by drawing on prior research in the resistance to change literature and a recent dual-factor model of IT usage. This theory elaborates the interdependent and asymmetric effects of resistance vis-à-vis current usage predictors such as behavioral intention. Additionally, we propose perceived threats as a salient determinant of user resistance in the IT usage context. The resulting model is empirically supported via a survey of practicing physicians at a large acute-care hospital in the southeastern United States. Implications of this research for IT research and practice are discussed.
On-demand security and qos optimization in mobile ad hoc networks
Authors: Johnson Thomas
Venue:  (2006)

Scope and method of study. Security often comes with overhead that will impact link Quality of Service (QoS) performance. In this dissertation, we propose an on-demand security and QoS optimization architecture in mobile ad hoc networks that automatically adapts network security level to changes in network topology, traffic condition, and link QoS requirements, so as to keep the security and QoS at optimum conditions. In order to achieve the overall objective, we introduce three basic frameworks: a policy based plug-in security framework, a multi-layer QoS guided routing algorithm, and a Proportional Integral Derivative (PID) feedback control based security and QoS optimization framework. The research has been evaluated with the network simulator ns-2. Finally, we propose an attack tree and state machine based security evaluation mechanism for ad hoc networks: a new security measurement metric. Findings and conclusions. Simulations have been done for small and large network sizes, low and high communication ratios, as well as low and high mobility scenarios. The simulations show that the proposed on-demand security and QoS optimization architecture can produce similar performance to non-secure QoS routing protocol under various traffic loads. It provides more secure ad hoc networks without compromising the QoS performance, especially under light and medium traffic conditions.
Deterministic fuzzy time series model for forecasting enrollments
Authors: Sheng-Tun Li, Yi-Chung Cheng
Venue: Computers Mathematics with Applications (2007)

The fuzzy time series has recently received increasing attention because of its capability of dealing with vague and incomplete data. There have been a variety of models developed to either improve forecasting accuracy or reduce computation overhead. However, the issues of controlling uncertainty in forecasting, effectively partitioning intervals, and consistently achieving forecasting accuracy with different interval lengths have been rarely investigated. This paper proposes a novel deterministic forecasting model to manage these crucial issues. In addition, an important parameter, the maximum length of subsequence in a fuzzy time series resulting in a certain state, is deterministically quantified. Experimental results using the University of Alabama's enrollment data demonstrate that the proposed forecasting model outperforms the existing models in terms of accuracy, robustness, and reliability. Moreover, the forecasting model adheres to the consistency principle that a shorter interval length leads to more accurate results.
The future of computing technology
Authors: R. Reddy
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only as given. By 2000, one can reasonably expect that a Giga PC capable of a billion operations per second with a billion bits of memory, and billion bit network bandwidth will be available for under $2000. Barring the creation of a cartel, or some yet unforeseen technological barrier, one should see a TeraPC before 2015 and a PetaPC before 2030. The question is what will we do with all this power? How will it affect the way we live and work? Many things will hardly change. Our social systems, the food we eat, the clothes we wear and our mating rituals will hardly be affected. Others, such as the way we learn, the way we work and interact with each other should undergo profound changes. This paper provides one point of view on these topics.
Quantifying the Effectiveness of Mobile Phone Virus Response Mechanisms
Authors: Elizabeth Van Ruitenbeek, Tod Courtney, William H. Sanders, Fabrice Stevens
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Viruses that infect smartphones are emerging as a new front in the fight against computer viruses. In this paper, we model the propagation of mobile phone viruses in order to study their impact on the dependability of mobile phones. We propose response mechanisms and use the models to obtain insight on the effectiveness of these virus mitigation techniques. In particular, we consider the effects of multimedia messaging system (MMS) viruses that spread by sending infected messages to other phones. The virus model is implemented using the M¨obius software tool and is highly parameterized, enabling representation of a wide range of potential MMS virus behavior. Using the model, we present the results of four illustrative MMS virus scenarios simulated with and without response mechanisms. By measuring the propagation rate and the extent of virus penetration in the simulation phone population, we quantitatively compare the effectiveness of mobile phone virus response mechanisms.
Agent development support for Tcl
Authors: R. Scott Cost, Ian Soboroff, Jeegar Lakhani, Tim Finin, Ethan Miller, Charles Nicholas
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

In the past few years, the explosive growth of the Internet has allowed the construction of "virtual" systems containing hundreds or thousands of individual, relatively inexpensive computers. The agent paradigm is well-suited for this environment because it is based on distributed autonomous computation. Although the definition of a software agent varies widely, some common features are present in most definitions of agents. Agents should be autonomous, operating independently of their creator(s). Agents should have the ability to move freely about the Internet. Agents should be able to adapt readily to new information and changes in their environment. Finally, agents should be able to communicate at a high level, in order to facilitate coordination and co-operation among groups of agents. These aspects of agency provide a dynamic framework for the design of distributed systems.
The Services Network
Authors: Paul A. S. Ward
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Computing and communication are in flux today. On the communication side, historically there have been mul- tiple, parallel networks servicing different types of traf- fic. Cost pressures are forcing convergence to a single IP-based network. Simultaneously the computing world has been steadily moving from monolithic applications to client/server systems, and from there to arbitrary dis- tributed applications. In making this move, the computing world has typically viewed the network as little more than a high-speed bit-pipe, with the primary focus being on ser- vices provided by end hosts. This approach has a number of limitations, including replicated functionality, complex sys- tem coupling, and limited ability to integrate applications across different networks. By providing enabling services functionality, an integrated network can make possible both greater efficiencies and more-sophisticated distributed ap- plications.
Facial feature extraction using genetic algorithm
Authors: G. G. Yen, N. Nithianandan
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

An automatic facial feature extraction method is presented in this paper. The method is based on the edge density distribution of the image. In the preprocessing stage a face is approximated to an ellipse, and a genetic algorithm is applied to search for the best ellipse region match. In the feature extraction stage, the genetic algorithm is applied to extract the facial features, such as the eyes, nose and mouth, in the predefined sub regions. The simulation results validates that the proposed method is capable of automatically extracting features from various video images effectively under natural lighting environments and in the presence of certain amount of artificial noise and of multi-face oriented with angles.