ppxscal/embedding_network huggingface dataset:
Wideband target tracking by using SVR-based sequential Monte Carlo method
Authors: Nihat Kabaoğlu, Hakan A. Çırpan
Venue: Signal Processing (2008)

In this work, a support vector regression (SVR) based sequential Monte Carlo method is presented to track wideband moving sources using a linear and passive sensor array for a signal model based on buffered data. The SVR method is employed together with a particle filter (PF) method to improve the PF tracker performance when a small sample set is available. SVR is used as a sample producing scheme for the current state vector. To provide a good approximation of the posterior density by means of improving the sample diversity, samples (particles) are drawn from an importance density function whose mean and covariance are calculated by using the pre-estimating state vector and the state vector's previous estimate. Thus, a better posterior density than the classical one can be obtained. Simulation results show that the method proposed in this work performs better than the classical one when a small sample set is available. Moreover, the results also show that a modified signal model that utilizes buffering data is superior to the signal model in Ng et al. [Application of particle filters for tracking moving receivers in wireless communication systems, in: IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Rome, Italy, June 2003, pp. 575-579].
Architectural Organizational Patterns
Authors: Grady Booch
Venue: IEEE Software (2008)

What is the optimal design for a given system, a design that reasonably balances all the forces that weigh in on the problem? In turn, what is the optimal organizational structure for developing, deploying, and evolving that system? The challenge for every organization is to find the sweet spot that provides the right balance of innovation, predictability, repeatability, and risk confrontation for that project at every given moment. The book Organizational Patterns of Agile Development by Jim Coplien and Neil Harrison focuses on organizational patterns, a number of which are germane to the evolution of a system's architecture. The author proposes five additional, overarching organizational patterns.
Efficient aggregation for graph summarization
Authors: Yuanyuan Tian, Richard A. Hankins, Jignesh M. Patel
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying characteristics of large graphs, graph summarization techniques are critical. However, existing graph summarization methods are mostly statistical (studying statistics such as degree distributions, hop-plots and clustering coefficients). These statistical methods are very useful, but the resolutions of the summaries are hard to control. In this paper, we introduce two database-style operations to summarize graphs. Like the OLAP-style aggregation methods that allow users to drill-down or roll-up to control the resolution of summarization, our methods provide an analogous functionality for large graph datasets. The first operation, called SNAP, produces a summary graph by grouping nodes based on user-selected node attributes and relationships. The second operation, called k-SNAP, further allows users to control the resolutions of summaries and provides the "drill-down" and "roll-up" abilities to navigate through summaries with different resolutions. We propose an efficient algorithm to evaluate the SNAP operation. In addition, we prove that the k-SNAP computation is NP-complete. We propose two heuristic methods to approximate the k-SNAP results. Through extensive experiments on a variety of real and synthetic datasets, we demonstrate the effectiveness and efficiency of the proposed methods.
A simple method for citation metadata extraction using hidden markov models
Authors: Erik Hetzner
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper describes a simple method for extracting metadata fields from citations using hidden Markov models. The method is easy to implement and can achieve levels of precision and recall for heterogeneous citations comparable to or greater than other HMM-based methods. The method consists largely of string manipulation and otherwise depends only on an implementation of the Viterbi algorithm, which is widely available, and so can be implemented by diverse digital library systems.
Software Based Vision System for Automated Cell Injection
Authors: Zhang Yi, Tan KokKiong, Huang Sunan
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Recent developments in nuclear reprogramming and intracytoplasmic sperm injection reflect an increasing need for more advanced and automatic micromanipulation technologies. In this paper, we present an automatic cell injection system, which is capable of visually monitoring the injecting process and controlling the microactuators. Traditionally, cell injection was manually operated. However, it was laborious, time consuming, of low accuracy, and prone to contamination due to the handling requirement. An automatic and efficient strategy is required to eliminate all these drawbacks. In our system, the whole injection process is monitored and controlled by software. The precision achieved is physically proven to be within a good tolerance range.
Validation of MERIS water products and bio-optical relationships in the Skagerrak
Authors: K. Sørensen, E. Aas, J. Høkedal
Venue: International Journal of Remote Sensing (2007)

The MERIS Level 2 Reduced Resolution products for Case 2 water available in September 2003, and conversion functions used in the reference model, have been validated against in situ data from the Skagerrak, collected during the summers of 2002 and 2003. The MERIS water-leaving reflectance deviated less than 20% from the measured reflectances in the blue-green part of the spectrum, but it had a tendency of being overestimated by up to 40% in the blue part of the spectrum and underestimated by up to 20% in the red part. The average relative deviation between the MERIS product for total suspended material (dry weight) and the in situ values was 30%. The MERIS values for chlorophyll a were on an average a factor 2 higher than the in situ values, and a new conversion factor should be used for the Skagerrak area. The absorption coefficients for the sum of yellow substance and bleached particles at 442 nm were underestimated by a factor of up to 10 by the MERIS product. The mean values of the spectral slopes of particle scattering and bleached particle absorption were close to the values of the reference model, while the observed slope of yellow substance was slightly lower than the model slope.
A low SINR synchronization system for direct-sequence spread-spectrum communications: radio prototype, verification testbed and experimental results
Authors: Manish Amde, Jaewook Shim, Joel Marciano, Kenneth Yun, Rene Cruz
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

Ability to receive signals at low signal to interference and noise ratio (SINR) improves the spatial range and reliability of wireless networks. However, it is difficult to design a communication system that operates correctly in this type of environment. Our system uses a high spreading gain in the direct-sequence spread-spectrum (DSSS) modulation to combat the problems associated with low SINR. Undoubtedly, synchronization is a severe bottleneck for low SINR reception in DSSS. In this paper, we present a prototype hardware implementation of a DSSS synchronization system, which was proposed in [1], a testbed, and experimental results. The synchronization system is implemented on a reconfigurable radio prototyping platform and verified on a hardware testbed. Controlled experiments are performed in the laboratory to calibrate its performance. Finally, over-the-air experiments are conducted at two outdoor test sites and the results are presented.
Finite-Point Gate Model for Fast Timing and Power Analysis
Authors: Dinesh Ganesan, Alex Mitev, Janet Wang, Yu Cao
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper proposes a new finite-point based approach for efficient characterization of CMOS gate. The new method identifies several key points on the I-V and Q-V curves to define the behavior of the static CMOS gate. It targets performance metrics such as timing, short-circuit power and leakage in the presence of process variations. Experimental results validate the accuracy of the new approach and yields simulation speeds more than 15X faster than BSIM based library characterization.
Iterative optimization in the polyhedral model: part ii, multidimensional time
Authors: Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen, John Cavazos
Venue: ACM SIGPLAN Notices (2008)

High-level loop optimizations are necessary to achieve good performance over a wide variety of processors. Their performance impact can be significant because they involve in-depth program transformations that aim to sustain a balanced workload over the computational, storage, and communication resources of the target architecture. Therefore, it is mandatory that the compiler accurately models the target architecture as well as the effects of complex code restructuring. However, because optimizing compilers (1) use simplistic performance models that abstract away many of the complexities of modern architectures, (2) rely on inaccurate dependence analysis, and (3) lack frameworks to express complex interactions of transformation sequences, they typically uncover only a fraction of the peak performance available on many applications. We propose a complete iterative framework to address these issues. We rely on the polyhedral model to construct and traverse a large and expressive search space. This space encompasses only legal, distinct versions resulting from the restructuring of any static control loop nest. We first propose a feedback-driven iterative heuristic tailored to the search space properties of the polyhedral model. Though, it quickly converges to good solutions for small kernels, larger benchmarks containing higher dimensional spaces are more challenging and our heuristic misses opportunities for significant performance improvement. Thus, we introduce the use of a genetic algorithm with specialized operators that leverage the polyhedral representation of program dependences. We provide experimental evidence that the genetic algorithm effectively traverses huge optimization spaces, achieving good performance improvements on large loop nests.
Regulation of liner continuous-time singular systems with constrained states and controls
Authors: H. Boughari, N. E. Radhy
Venue: International Journal of Systems Science (2007)

This article considers the constrained regulation problem (CRP) for linear continuous-time singular systems. The study consists in finding for a completely controllable singular system a linear state feedback control law that eliminates the impulsive behavior of a system and transfers asymptotically to the origin all initial states belonging to some polyhedral subset of the state space while respecting the linear constraints on state and control vectors. The proposed method gives a solution to the CRP for a singular system from a transformation that leads to a problem of positive invariance for a reduced order nonsingular one. Conditions guaranteeing the positive invariance for the whole domain of admissible controls are deduced. It is shown that the solution to the CRP is that of a nonlinear algebraic matrix equation.
A global canonical form for nonlinear singular control systems
Authors: Xiaoping Liu
Venue: International Journal of Systems, Control and Communications (2008)

In this paper, the concept of a global generalised characteristic number is defined and global zero dynamics algorithm is developed. Based on the feasibility of this algorithm, a global diffeomorphism is constructed, under which the original system can be put into a global canonical form. Sufficient conditions for the existence of the global diffeomorphism are provided.
Disease Prediction Power and Stability of Differential Expressed Genes
Authors: Chen Yao, Min Zhang, Jinfeng Zou, Xue Gong, Lin Zhang, ChenGuang Wang, Zheng Guo
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Selecting feature genes for disease prediction is one of the most important applications of microarray technology. However,gene lists obtained in different studies for a same clinical type of patients often differ widely and have few genes in common. Recent researches suggest that gene lists ranked by fold change are more reproducible than by t-test. Here,based on the resampling method, we use training sets of different sizes to select features as top-ranked by P-value of t-test, d-value of SAM, and fold change. Then,we evaluate the stability and the disease classification power of each top ranked gene list. Our result suggests that for disease classification,gene lists selected through d-value ranking are most suitable concerning both reproducibility and classification power.
Maximal repetitions in strings
Authors: Maxime Crochemore, Lucian Ilie
Venue: Journal of Computer and System Sciences (2008)

The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the most important part of the analysis of the running time of such algorithms is counting the number of runs. Kolpakov and Kucherov [R. Kolpakov, G. Kucherov, Finding maximal repetitions in a word in linear time, in: Proc. of FOCS'99, IEEE Computer Society Press, 1999, pp. 596-604] proved it to be cn but could not provide any value for c. Recently, Rytter [W. Rytter, The number of runs in a string: Improved analysis of the linear upper bound, in: B. Durand, W. Thomas (Eds.), Proc. of STACS'06, in: Lecture Notes in Comput. Sci., vol. 3884, Springer, Berlin, Heidelberg, 2006, pp. 184-195] proved that c=
Automatic identification of weather systems from numerical weather prediction data using genetic algorithm
Authors: Ka Yan Wong, Chi Lap Yip, Ping Wah Li
Venue: Expert Systems with Applications: An International Journal (2008)

Weather systems such as tropical cyclones, fronts, troughs and ridges affect our daily lives. Yet, they are often manually located and drawn on weather charts based on forecasters' experience. To identify them, multiple atmospheric elements need to be considered, and the results may vary among forecasters. In this paper, we propose an automatic weather system identification method. A generic model of weather systems is designed, along with a genetic algorithm-based framework for finding them automatically from multidimensional numerical weather prediction data. The framework allows multiple weather elements to be analyzed. It is found that our method not only can locate weather systems with 80-100% precision, but can also discover features that could indicate the genesis or dissipation of such systems that forecasters may overlook. The method provides an independent and objective source of information to assist forecasters in identifying and positioning weather systems.
Classifying the shape of aggregate using hybrid multilayered perceptron network
Authors: Ariffuddin Joret, Nor Ashidi Mat Isa, Ahmad Nazri Ali, Kamal Zuhairi Zamli, Khairun Azizi Azizli, M. Subhi M. Al Batah
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In concrete production, shape of aggregate reflects the quality of concrete produced. The well-shaped aggregates are said to produce high quality concrete by reducing water to cement ratio. On the contrary, poor-shaped aggregates often require higher water to cement ratio in concrete production. Conventionally, the quality of concrete is determined by calculating the ratio of well-shaped aggregate to poor-shaped aggregate contained in concrete. This procedure is slow, highly subjective and laborious, which is inefficient and expensive. In order to decrease the problems, this paper proposed an intelligent classification system for the aggregates using neural network. The system uses Zernike moments, Hu's moment invariants, area and perimeter of the aggregate's mass and boundary as input data for the neural network. The HMLP which is trained using MRPE algorithm, has been used as the classification system. The system produced 85.53% accuracy. This shows that the HMLP network has high capability to be used as intelligent shape classification system for aggregates.
Antenna gain measurement using the mirror method in time domain
Authors: Hynek Bartik
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Presented single-antenna method of gain measurement is based on usage of flat reflector and gating function in time domain of PNA analyzer. Antenna under test (AUT) is directed perpendicular to the reflector surface in sufficient distance from this reflector. Vector analyzer is set to the antenna reflection coefficient measurement with filtering out all responses except signal, which is returned from the flat reflector to the AUT. Frequency dependence of this gated signal is equivalent to the frequency dependence of transmitted signal of two antenna method in double distance. Measured gain of AUT was compared with the gain obtained from two antenna method.
A Computer-Assisted Approach for Designing Context-Aware Ubiquitous Learning Activities
Authors: Tzu-Chi Yang, Fan-Ray Kuo, Gwo-Jen Hwang, Hui-Chun Chu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Recent advance of wireless communication and sensor technologies has leaded the educational conception to a new area, called context-aware ubiquitous learning. The new conception of learning not only depicts significant advantages, but also reveals the difficulty of applying it. The major difficulty is owing to the lack of procedural guidance that assists the teachers in designing learning activities that bring the new learning conception into full play. To cope with this problem, this study proposes a procedural knowledge acquisition strategy for designing context-aware ubiquitous learning activities. In addition, a practical application is presented to show the effectiveness of the innovative approach.
Retailer's optimal ordering policies with trade credit financing
Authors: Jinn-Tsair Teng, Chun-Tao Chang, Maw-Sheng Chern, Ya-Lan Chan
Venue: International Journal of Systems Science (2007)

In this article, we extended Goyal's model to develop an Economic Order Quantity (EOQ) model in which the supplier offers the retailer the permissible delay period M, and the retailer in turn provides the trade credit period N (with N ≤ M) to his/her customers. In addition, we assume that (1) the retailer's selling price per unit is necessarily higher than its unit cost, and (2) the interest rate charged by a supplier or a bank is not necessarily higher than the retailer's investment return rate. We then establish an appropriate EOQ model with trade credit financing, and provide an easy-to-use closed-form solution to the problem. Furthermore, we find it is possible that a well-established buyer may order a lower quantity and take the benefit of the permissible delay more frequently, which contradicts to the result by the previous researchers. Finally, we perform some sensitivity analyses to illustrate the theoretical results and obtain some managerial results.
An Innovative Framework for the New Generation of SCORM 2004 Conformant E-Learning Systems
Authors: Ali Shemshadi, Javad Soroor, Mohammad J. Tarokh
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With the rapid developments in e-Learning and educational Systems, updating and redesigning a learning activity is too costly and time-consuming. Web-based educational systems must be designed in order to enable reusing and repurposing of learning activities. As the most adopted framework in e-learning systems offered by ADL, SCORM can help us to reuse previous Content Objects again for developing a new learning activity. On the other hand, Agent-based systems technology has generated lots of excitement in recent years because of its promise as a new paradigm for conceptualizing, designing, and implementing software systems. This promise is particularly attractive for creating software that operates in environments that are distributed and open, such as the internet and we believe this could be the same for e-learning systems.The components and technologies discussed in the first and second sections constitute the building blocks for the realization of the futuristic vision of the new generation of SCORM conformant e-learning systems, which would allow intelligent access to highly specific and customized learning content by users.
OCTOPODA: Building Financial Gateways Family System Using Domain Specific Kits
Authors: N. Ilker Altintas, Semih Cetin, Mehmet Surav
Venue: Proceedings of the Third International Conference on Systems (2008)

Financial institutions have been progressively challenged by being linked to a network of various internal and external systems through different and complex protocols. The way to manage this challenge is exploiting application-specific gateways known as financial gateways. However, the complexities of switch protocols as well as the variety of internal and external systems make the design of financial gateways quite complicated. This paper briefly summarizes the challenges of building family of financial gateway systems and introduces a systematic approach to design and implement them with "Domain Specific Kit" abstraction. This abstraction can separate system design concerns properly, isolate them in discrete building blocks, and finally compose them by means of a structured choreography model. The approach has been implemented within the context of OCTOPODA project and experimented in real life cases. The paper also presents and discusses the results of this experimentation.
Improving change descriptions with change contexts
Authors: Chris Parnin, Carsten Görg
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Software archives are one of the best sources available to researchers for understanding the software development process. However, much detective work is still necessary in order to unravel the software development story. During this process, researchers must isolate changes and follow their trails over time. In support of this analysis, several research tools have provided different representations for connecting the many changes extracted from software archives. Most of these tools are based on textual analysis of source code and use line-based differencing between software versions. This approach limits the ability to process changes structurally resulting in less concise and comparable items. Adoption of structure-based approaches have been hampered by complex implementations and overly verbose change descriptions. We present a technique for expressing changes that is fine-grained but preserves some structural aspects. The structural information itself may not have changed, but instead provides a context for interpreting the change. This in turn, enables more relevant and concise descriptions in terms of software types and programming activities. We apply our technique to common challenges that researchers face, and then we discuss and compare our results with other techniques.