ppxscal/embedding_network huggingface dataset:
Supervised and Reinforcement Evolutionary Learning for Wavelet-based Neuro-fuzzy Networks
Authors: Cheng-Jian Lin, Yong-Cheng Liu, Chi-Yung Lee
Venue: Journal of Intelligent and Robotic Systems (2008)

This study presents a wavelet-based neuro-fuzzy network (WNFN). The proposed WNFN model combines the traditional Takagi---Sugeno---Kang (TSK) fuzzy model and the wavelet neural networks (WNN). This study adopts the non-orthogonal and compactly supported functions as wavelet neural network bases. A novel supervised evolutionary learning, called WNFN-S, is proposed to tune the adjustable parameters of the WNFN model. The proposed WNFN-S learning scheme is based on dynamic symbiotic evolution (DSE). The proposed DSE uses the sequential-search-based dynamic evolutionary (SSDE) method. In some real-world applications, exact training data may be expensive or even impossible to obtain. To solve this problem, the reinforcement evolutionary learning, called WNFN-R, is proposed. Computer simulations have been conducted to illustrate the performance and applicability of the proposed WNFN-S and WNFN-R learning algorithms.
Modular Specification of GUI Layout Using Constraints
Authors: Christof Lutteroth, Gerald Weber
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

The Auckland Layout Model (ALM) is a novel technique for specifying layout. It generalizes grid-based layouts as they are widely used for print layout as well as for GUI layout. Qualitatively, in ALM the focus switches from the cells of the grid to the tabstops between cells. Quantitatively, the model permits the specification of constraints based on linear algebra, and an optimal layout is calculated using linear programming. ALM provides several advantages for developers: first, it supports several different levels of abstraction through higher-level layout constructs that are automatically translated into the lower-level primitives of linear programming. The formalism of linear programming defines a clean separation of ALM's interface and its implementation. Second, the compositional nature of ALM allows developers to group parts of a specification that belong naturally together, resulting in a modular GUI specification. Our experience has shown that it is much harder to achieve a similar separation of concerns when using common GUI layout techniques.
Grasping Related Words of Unknown Word for Automatic Extension of Lexical Dictionary
Authors: Myunggwon Hwang, Sunkyoung Baek, Junho Choi, Jongan Park, Pankoo Kim
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

An aim of this research is to grasp related words of unknown word. Currently, several lexical dictionaries have been developed for semantic retrieval such as WordNet and FrameNet. However, more new words are created in every day because of new trends, new paradigm, new technology, etc. And, it is impossible to contain all of these new words. The existing methods, which grasp the meaning of unknown word, have a limitation that is not exact. To solve this limitation, we have studied the way how to make relations between known words and unknown word. As a result, we found a noble method using co-occurrence, WordNet and Bayesian probability. The method could find what words are related with unknown word and how much weight other words relate with unknown word.
Implicit geometric constraint detection in freehand sketches using relative shape histogram
Authors: J. Pu, K. Ramani
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

In order to take advantage of the sketch-based interaction, many methods have been proposed to beautify freehand sketches. Most of these efforts are dedicated to sketch segmentation and recognition, while some important information implied in the sketches, such as geometric constraints, are largely ignored. Thus, the final beautified results by these methods do not fully reflect the true intentions from users. In this paper, a statistical approach called Relative Shape Histogram (RSH) is introduced to detect the implied geometric constraint in sketches. The basic idea arises from such a discovery that the same geometric constraints between two geometric primitives have similar relative shape histograms. By computing the similarity between RSHs, the implicit geometric constraints between two segmented primitives are inferred. To evaluate the performance of the proposed algorithm, a user-based experiment is conducted and the results are presented in this paper.
Pro PHP: Patterns, Frameworks, Testing and More (Pro)
Authors: Kevin McArthur
Venue:  (2008)

Taking care to focus solely on those topics that will have the most impact on experienced PHP developers, Pro PHP is written for readers seeking to take their understanding of both PHP and sound software development practices to the next level. Advanced objectoriented features, documentation, debugging, software patterns, and the Standard PHP Library are just a few of the topics covered in extensive detail. Author and noted PHP expert Kevin McArthur also examines emerging practices and trends such as the MVC architecture as applied to PHP, with special emphasis placed upon the increasingly popular Zend Framework. With Ajax and web services crucial to the success of todays web applications, the book concludes with several chapters covering JSON, the SOAP extension, and advanced web services topics. If youre seeking to go beyond the basics, Pro PHP is the book for you.
In-bed Patients Behaviour Monitoring System
Authors: P. Bustamante, N. Guarretxena, G. Solas, U. Bilbao
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Falls on elderly people represent a significant health problem where having a permanent care personnel attention is the unique effective method to avoid them. As more is investigated on causes originating falls, more is known about pre fall conducts. This project studies in-bed patient behaviour with the purpose of detecting a fall before it happens, sending an alarm to the complete system. The work presented in this article is still being developed within the framework of INTEK projects founded by the Basque Government, in cooperation with Atica Innovation Company.
On the completeness of object-creating query languages
Authors: J. Van den Bussche
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Recently, various database query languages have been considered that have the ability to create new domain elements. These languages, however, are not complete in the sense of Abiteboul and Kanellakis (1989). They provide a precise characterization for the class of queries that can be expressed in these languages. They call this class the constructive queries and motivate this term by establishing a close correspondence between object creation and the construction of hereditarily finite sets.
Bridging the IT Adoption Gap for Small Physician Practices: An Action Research Study on Electronic Health Records
Authors: Elizabeth Davidson, Dan Heslinga
Venue: Information Systems Management (2007)

This article reports on an action research project to investigate the barriers to adoption and assimilation of electronic health records (EHRs) in small physician practices. The project draws on theories of technology-use mediation and communities of practice to develop interventions to promote adoption and integration of EHRs into chronic care management processes in these practice settings. The field results suggest that developing community-based knowledge and resources to assist physician organizations one-on-one may be essential for their effective utilization of EHRs.
The Move to Make Social Data Portable
Authors: Karen Hayman
Venue: Computer (2008)

As the battle between the big social-network players heats up, users are demanding some level of data portability between the different sites so that they can move or transfer their information without re-entering it every time.
Performance evaluation of programming paradigms and languages using multithreading on digital image processing
Authors: Dulcinéia O. Da Penha, João B. T. Corrêa, Luiz E. S. Ramos, Christiane V. Pousa, Carlos A. P. S. Martins
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

We present a comparative performance evaluation of different programming paradigms and languages using multithreaded programming. We compare the procedural and object-oriented (OO) paradigms, as well as the C++ and Java languages, regarding both performance and programmability. The comparison is made upon sequential and parallel image convolution implementations based on those paradigms and languages. The parallel implementations used the shared-variable programming model and multithreading. They exploited not only pure parallelism, but also parallelism combined with concurrency. The performance evaluation was based on the response time of those implementations. The evaluation of system performance showed that pure parallelism yielded better performance results than parallelism combined with concurrency. Regarding the C++ implementations, the procedural paradigm led to better results than the OO paradigm. One of the most significant results in our work is the fact that Java yielded shorter response times than OO C++ for most of the multithreaded implementations.
Social aspects of a continuous inspection platform for software source code
Authors: Christian R. Prause, Markus Eisenhauer
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

Determining responsibility for a piece of source code is difficult when software is being developed collaboratively with weak code ownership. Nonetheless, a major factor for preventing "cowboy coding" and careless development of code is liability. We propose a tool for statistically acquiring per developer per document accountabilities and enable learning and self-monitoring processes within a development team while maintaining anonymity to a certain degree to not endanger team spirit. In this paper we want to examine possible social effects on the development team that employment of our tool has.
Adaptive beamspace focusing for direction of arrival estimation of wideband signals
Authors: Amr El-Keyi, T. Kirubarajan
Venue: Signal Processing (2008)

In this paper, we present an adaptive beamspace focusing technique for the direction of arrival (DOA) estimation of wideband signals. The proposed focusing scheme can perform coherent signal subspace transformation in the beamspace domain without preliminary DOA estimation or iteration. It can maintain low focusing error over a predefined sector-of-interest in the field-of-view (FOV) of the array while adaptively suppressing out-of-sector sources. The beamspace gain outside the sector-of-interest is controlled via additional constraints that provide robustness against moving or suddenly appearing out-of-sector sources. We formulate the adaptive beamspace design problem as a second-order cone program (SOCP) that can be solved efficiently using interior point methods. Numerical simulations are presented showing the superior performance of our approach compared to classical non-adaptive beamspace focusing techniques.
A novel x-axis tuning fork gyroscope with &#x201c;8 vertical springs-proofmass&#x201d; structure on (111) silicon
Authors: Fei Duan, Jiwei Jiao, Yucai Wang, Ying Zhang, Binwei Mi, Jinpeng Li, Yuelin Wang
Venue: Microsystem Technologies (2008)

A novel x-axis tuning fork gyroscope with &#x201c;8 vertical springs-proofmass&#x201d; structure is presented. Wafer-thick proofmasses are made out of (111) silicon with bulk micromachining processes to achieve lower thermo-mechanical noise. Each proofmass is supported by 8 vertical springs, which are symmetrically distributed around the proofmass. The dimensions of 8 vertical springs are precisely confined by thermal oxide protected sidewalls and the extreme slowly etched (111)-planes in KOH etching. A mode mismatch of less than 30&#x00a0;Hz is achieved before tuning. Initial test shows a sensitivity of 0.15&#x00a0;mV/(deg/s) and a rate resolution around 0.1&#x00a0;deg/s under atmosphere pressure.
Google Talk
Venue: Queue (2007)

Although Google remains relatively mum about its ambitions in the area of speech recognition, Mike Cohen, head of the company's efforts in this area and a co-founder of Nuance Communications, says that speech recognition will increasingly play a bigger role in all Web-based applications going forward. But for developers to be successful in this space, they will need to get in touch with their inner persons more than ever if they hope to create applications that ordinary people will actually use. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On absolute summability factors of infinite series
Authors: Ekrem Savaş
Venue: Computers Mathematics with Applications (2008)

In this paper a general theorem on |A,@d|"k-summability methods has been proved. This theorem includes, as a special case, a known result in [E. Savas, Factors for |A|"k Summability of infinite series, Comput. Math. Appl. 53 (2007) 1045-1049].
Preconditioners for the conjugate gradient algorithm using Gram-Schmidt and least squares methods
Authors: Julien Straubhaar
Venue: International Journal of Computer Mathematics (2007)

This paper is devoted to the study of some preconditioners for the conjugate gradient algorithm used to solve large sparse linear and symmetric positive definite systems. The construction of a preconditioner based on the Gram-Schmidt orthogonalization process and the least squares method is presented. Some results on the condition number of the preconditioned system are provided. Finally, numerical comparisons are given for different preconditioners.
Channel selection algorithms in virtual MIMO sensor networks
Authors: Jing Liang, Qilian Liang
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

In this paper, we present two practical algorithms to select a subset of channels in virtual MIMO wireless sensor networks (WSN). One is the Singular-Value Decomposition-QR with Threshold (SVD-QR-T) approach that selects the best subset of transmitters while keeping all receivers active. The threshold is adaptive by means of Fuzzy C-Mean (FCM). The other is the Maximum Spanning Tree Searching (MASTS) algorithm on a basis of graph theory in respect of cross-layer design, which potentially provides a path connecting all sensors that benefits routing and QoS of networks. The MASTS algorithm keeps all sensors active but selects Mt + Mr -1 subchannels, where Mt and Mr are the number of transmitters and receivers, respectively. These two approaches are compared against the case without channel selection in terms of capacity, bit error rate (BER), and multiplexing gain in the presence of water-filling as well as the circumstance of without water-filling under the same total transmission power constraint. Despite less multiplexing gain, when water-filling is applied, MASTS achieves higher capacity and lower BER than that of virtual MIMO without channel selection at moderate to high SNR while SVD-QR-T FCM provides the lowest BER at high SNR; in case of no water-filling and equal transmission power allocation, MASTS still offers the highest capacity at moderate to high SNR but SVD-QR-T FCM achieves the lowest BER. Both algorithms provide satisfying performances with reduced cost and resources compared to the case without channel selection.
Chip form modelling and chip-forming animation in oblique cutting
Authors: W. K. Chiu, K. M. Yu, K. H. Man
Venue: International Journal of Computer Integrated Manufacturing (2007)

The reliability of machining operation is an essential requirement in a modern production system. Chip control is one major aspect with regard to turning operation and becomes significant in industrial automation. At present, toolpath simulation is available in most computer aided manufacturing (CAM) systems. However, only the rendering scene of the stock material shape changing during cutting and the resultant part are shown. The chips formed in the machining process are not modelled or displayed in the simulation. To assess the chip control properly, many models and simulation methods were developed for predicting the chip forms produced in the cutting operation. If the chip forms can be predicted using some of the mathematical models, the design and planning of the machining operation can be greatly assisted, especially in the shop-floor level. Apart from chip form prediction, modelling of the machining process and chip formation are also issues that must be considered. To do this, a chip modelling and simulation system is proposed. Based on the machining parameters settings, the corresponding chip model can be calculated and simulated for more realistic analysis. The present paper first outlines the chip form mathematical model being used. The criteria to ensure that the theoretical model can be used to calculate the practical chip models effectively are described. Then the modelling of the chips and the simulation of the chip forming with computer graphic animation are explained. Several sets of turning parameters are used as examples to demonstrate how the corresponding chip models are calculated from the proposed system.
User Maturity Based Trust Management for Grid Computing
Authors: Gabriel Queiroz Lana, Carlos Becker Westphall
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Trust management has been considered an important factor in Grid computing security. Grids require a secure way to establish trust in their participants without requiring continuous intervention by the system administrators. This paper describes trust management in Grid computing systems and its use in evaluation environments to update the trust levels. This approach can be incorporated in Grid security systems to assist in issuing authorisations, in resource and service management, and in decision-making processes.
Value monoids of zero-dimensional valuations of rank 1
Authors: Edward Mosteig
Venue: Journal of Symbolic Computation (2008)

Classically, Grobner bases are computed by first prescribing a fixed monomial order. Moss Sweedler suggested an alternative in the mid-1980s and developed a framework for performing such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on K(x,y) that are suitable for this framework. We then perform such computations for ideals in the polynomial ring K[x,y]. Interestingly, for these valuations, some ideals have finite Grobner bases with respect to a valuation that are not Grobner bases with respect to any monomial order, whereas other ideals only have Grobner bases that are infinite.
Analysis of SIP-Based IMS Session Establishment Signaling for WiMax-3G Networks
Authors: Arslan Munir
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

The IP multimedia subsystem (IMS) is standardized by the 3rd generation partnership project (3GPP) and 3GPP2 as a new core network domain to support Internet Protocol (IP) based multimedia services over 3G networks. Session Initiation Protocol (SIP) which is an application layer signaling protocol is also standardized by 3GPP and 3GPP2 for session establishment, management, and transformation. In this paper, we study the SIP-based signaling delay for IMS session establishment in 3rd generation (3G) network and worldwide interoperability for microwave access (WiMax) network for different channel rates. In our delay analysis, we take into account transmission, processing and queueing delays at network nodes. The delay analysis of SIP based signaling for IMS provides an insight into the efficiency of SIP signaling for IMS.
Rigid Body Cable for Virtual Environments
Authors: Martin Servin, Claude Lacoursière
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

The present paper addresses real-time simulation of cables for virtual environments. A faithful physical model based on constrained rigid bodies is introduced and discretized. The performance and stability of the numerical method are analyzed in details and found to meet the requriements of interactive heavy hoisting simulations. The physical model is well behaved in the limit of infinite stiffness as well as in the elastic regime , and the tuning parameters correspond directly to conventional material constants. The integration scheme mixes the well known Störmer-Verlet method for the dynamics equations with the linearly implicit Euler method for the constraint equations and enables physical constraint relaxation and stabilization terms. The technique is shown to have superior numerical stability properties in comparison with either chain link systems, or spring and damper models. Experimental results are presented to show that the method results in stable, real-time simulations. Stability persists for moderately large fixed integration step of $\Delta t = 1/60$ s, with hoisting loads of up to $10^5$ times heavier than the elements of the cable. Further numerical experiments validating the physical model are also presented.
Resource admission control in access networks
Authors: Sven Ooghe, Adrianus Van Ewijk, Ramesh Nagarajan
Venue: Bell Labs Technical Journal (2008)

With the growing demand for high-bandwidth video services such as Internet Protocol television (IPTV), the packet network must be adapted in order to support these services with the required quality. Evolutions of broadband access technologies such as very high speed digital subscriber line 2 (VDSL2) and Gigabit passive optical networks (GPONs) create this possibility. Nevertheless, the bandwidth on the access link (the first mile) and the access node uplink (the second mile) remain a limited resource. This paper discusses how resource admission control (RAC) can be used in access networks to protect against exceptional overloads and maintain quality for active services. It describes the behavior of a local RAC function in the access node in a case where broadcast IPTV (BTV) and video on demand (VoD) share bandwidth on the first mile and shows that this solution is scalable from a message load point of view. &copy; 2008 Alcatel-Lucent.
Experiences in Designing an Energy-Aware Middleware for Pervasive Computing
Authors: Gregor Schiele, Marcus Handte, Christian Becker
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Energy efficiency in pervasive computing is crucial for devices operated by battery. To provide energy efficiency we created an energy efficient middleware, called SANDMAN. It selects energy-efficient protocol stacks dynamically and switches idle devices in an energy-efficient sleep mode. In this paper we present an overview of the challenges we met when realizing this approach, possible solutions and lessons learned.
Re-pair Achieves High-Order Entropy
Authors: Gonzalo Navarro, Luís Russo
Venue: Proceedings of the Data Compression Conference (2008)

Re-Pair is a dictionary-based compression method invented in 1999 by Larssonand Moffat. Although its practical performance has been established through experiments, the method has resisted all attempts of formal analysis. In thispaper we show that Re-Pair compresses a sequence T[1,n] over an alphabet ofsize $\sigma$ and k-th order entropy H_k, to at most 2nH_k+o(n\log\sigma)bits, for any k=o(log_sigma n).