ppxscal/embedding_network huggingface dataset:
A two-stage architecture for stock price forecasting by integrating self-organizing map and support vector regression
Authors: Sheng-Hsun Hsu, JJ Po-An Hsieh, Ting-Chih Chih, Kuei-Chu Hsu
Venue: Expert Systems with Applications: An International Journal (2009)

Stock price prediction has attracted much attention from both practitioners and researchers. However, most studies in this area ignored the non-stationary nature of stock price series. That is, stock price series do not exhibit identical statistical properties at each point of time. As a result, the relationships between stock price series and their predictors are quite dynamic. It is challenging for any single artificial technique to effectively address this problematic characteristics in stock price series. One potential solution is to hybridize different artificial techniques. Towards this end, this study employs a two-stage architecture for better stock price prediction. Specifically, the self-organizing map (SOM) is first used to decompose the whole input space into regions where data points with similar statistical distributions are grouped together, so as to contain and capture the non-stationary property of financial series. After decomposing heterogeneous data points into several homogenous regions, support vector regression (SVR) is applied to forecast financial indices. The proposed technique is empirically tested using stock price series from seven major financial markets. The results show that the performance of stock price prediction can be significantly enhanced by using the two-stage architecture in comparison with a single SVR model.
Clayworks: Toward user-oriented software for collaborative modeling and simulation
Authors: Sergei Gorlatch, Jens Müller-Iden, Martin Alt, Jan Dünnweber, Hamido Fujita, Yutaka Funyu
Venue: Knowledge-Based Systems (2009)

We consider the development of software systems that integrate collaborative real-time modeling and distributed computing. Our main goal is user-orientation: we need a collaborative workspace for geographically dispersed users with a seamless access of every user to high-performance servers. This paper presents a particular prototype, Clayworks, that allows modeling of virtual clay objects and running computation-intensive deformation simulations for objects crashing into each other. In order to integrate heterogeneous computational resources, we adopt modern Grid middleware and provide the users with an intuitive graphical interface. Simulations are parallelized using a higher-order component (HOC) which abstracts over the web service resource framework (WSRF) used to interconnect our worksuite to the computation server. Clayworks is a representative of a large class of demanding systems which combine collaborative, user-oriented modeling with performance-critical computations, e.g., crash-tests or simulations of biological population evolution.
Nanolithography and CAD challenges for 32nm/22nm and beyond
Authors: David Z. Pan, Stephen Renwick, Vivek Singh, Judy Huckabay
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The semiconductor industry is stuck at 193nm lithography as the main workhorse for manufacturing integrated circuits of 45nm and most likely 32nm nodes. On one hand, many novel approaches are being developed to extend the 193nm lithography, including immersion, double patterning, and exotic resolution enhancement techniques. On the other hand, next generation lithography, in particular, extreme ultra violet lithography (EUVL) is projected by ITRS as the main contender for technology nodes at or below 22nm, though significant challenges still exist from both technology and economy aspects. This tutorial will cover key nanolithography and CAD challenges with possible solutions for 32nm/22nm (and beyond?), from the underlying hardware/equipment perspectives (for double patterning, EUV, and so on), to the computational lithography aspects (extreme RET, inverse lithography, pixelated mask, etc.), and to the key EDA issues on nanolithofriendly layouts (e.g., double patterning compliance layout, and so on).
Designing of a type-2 fuzzy logic filter for improving edge-preserving restoration of interlaced-to-progressive conversion
Authors: Gwanggil Jeon, Marco Anisetti, Valerio Bellandi, Ernesto Damiani, Jechang Jeong
Venue: Information Sciences: an International Journal (2009)

This paper focuses on recently advanced fuzzy models and the application of type-2 fuzzy sets in video deinterlacing. The final goal of the proposed deinterlacing algorithm is to exactly determine an unknown pixel value while preserving the edges and details of the image. To begin, we will discuss some artefacts of spatial, temporal, and spatio-temporal domain deinterlacing methods. In order to address the aforementioned issues, we adopted type-2 fuzzy sets concepts to design a weight evaluating approach. In the proposed method, the upper and lower fuzzy membership functions of the type-2 fuzzy logic filters are derived from the type-1 (or primary) fuzzy membership function. The weights from upper and lower membership functions are considered to be multiplied with the candidate deinterlaced pixels. Experimental results proved that the performance of the proposed method was superior, both objectively and subjectively to other different conventional deinterlacing methods. Moreover, the proposed method preserved the smoothness of the original image edges and produced a high-quality progressive image.
Novel Solar Cell Structure by Coating Surface Gratings
Authors: Kao-Feng Yarn, Tsung-Chan Cheng, Wen-Chung Chang, Wei-Ching Chuang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Investigation of this study is focused on the improvement of solar cell light-collecting rate with high polymer reflecting gratings. It mainly discusses about the way to enhance the efficiency of solar cell by using both experimental holographic interferometry technology and polymer reprint method to produce high polymer reflecting gratings on the solar cell surface. Based on this method, the theoretical VOC is also calculated and raised from 2.62V to 3.62V, the maximum Vm increased from 2.5V to 3.5V. The power transfer efficiency is enhanced from 27% to 37.91%.
Developing Facebook Platform Applications with Rails
Authors: Michael Mangino
Venue:  (2008)

Developing Facebook Platform Applications with Rails leads you through the steps necessary to build your first application. You'll get hands-on experience with Facebook technologies such as FBML and FQL, and master messaging and news feeds.You'll do more than just study the Facebook API-you'll get practical tips from an experienced Facebook developer. We'll cover advanced techniques such as AJAX and asynchronous messaging, and you'll see how to slash development time with facebooker, the leading Ruby library for Facebook Platform development.Together, we'll build Karate Poke, a real Facebook Platform application, from configuration to deployment. You'll get deep into Facebook requests right off the bat. From there, you'll build the core of Karate Poke and then get a detailed look at the Facebook canvas and social features. We'll finish by looking at advanced features and tips for handling millions of users.Developing for the Facebook Platform can seem like a different world at first. Developing Facebook Platform Applications with Rails is your tour guide.
A continuous review inventory model with controllable backorder rate and investments
Authors: R. Uthayakumar, P. Parvathi
Venue: International Journal of Systems Science (2009)

In this study, we investigate a continuous review inventory model to reduce lead time, yield variability and setup cost simultaneously through capital investments. We assume that the backorder rate is depending on the length of the lead time through the amount of shortages. We also assume that lead time demand's distribution is not known but its first and second moments are known. We apply minimax distribution free procedure to minimise the expected total annual cost. By using logarithmic investment function we describe the relationship between the reduction in lead time, yield variability and setup cost with capital investment. This function was used in many existing models. Our main aim is to determine the optimal capital investment and ordering policies that minimises the expected total annual cost. To find out the optimal solution, an algorithm is given. With the help of this algorithm, optimal capital investment and ordering policies are wrought out. Numerical examples are given to elucidate the model. Our proposed model greatly differs from the model existing in the literature (the model by Lin and Hou (2005)) viz: (1) In the above model, yield variability and setup cost were reduced through capital investment. In our model we reduce yield variability setup cost and also the lead time, which plays a vital role in any business. By reducing lead time we can improve the service level to the customer so as to increase the competitive edge in business. (2) In the model (the model by Lin and Hou (2005)), it was assumed that lead time demand follows normal distribution. But in our model we take the distribution of lead time demand as distribution free. That is, it can follow any distribution which is more general. (3) In the above model (the model by Lin and Hou (2005)), shortages are completely backlogged. But we consider partial backlogging and take the backlogging rate as 0 ≤ B ≤ 1. If we set backlogging rate B = 1 we get the above model. That is, the above model is particular case of our model. (4) We also assume that the backorder rate depends on the length of the lead time through the amount of shortages. If the lead time is longer then shortage accumulation is higher. The patience of customers will result in failure in business since some customers may turn to some other supplier. Hence, the backorder rate will be reduced. This assumption is very realistic.
Contiguous Search Problem in Sierpi&#x0144;ski Graphs
Authors: Flaminia L. Luccio
Venue: Theory of Computing Systems (2009)

In this paper we consider the problem of capturing an intruder in a particular fractal graph, the Sierpi&#x0144;ski graph SG n . The problem consists of having a team of mobile software agents that collaborate in order to capture the intruder. The intruder is a mobile entity that escapes from the team of agents, moving arbitrarily fast inside the network, i.e., traversing any number of contiguous nodes as long as no other agent resides on them. The agents move asynchronously and they know the network topology they are in is a Sierpi&#x0144;ski graph SG n . We first derive lower bounds on the minimum number of agents, number of moves and time steps required to capture the intruder. We then consider some variations of the model based on the capabilities of the agents: visibility, where the agents can &#x201c;see&#x201d; the state of their neighbors and thus can move autonomously; locality, where the agents can only access local information and thus their moves have to be coordinated by a leader. For each model, we design a capturing strategy and we make some observations. One of our goals is to continue a previous study on what is the impact of visibility on complexity: in this topology we are able to reach an optimal bound on the number of agents required by both cleaning strategies. However, the strategy in the visibility model is fully distributed, whereas the other strategy requires a leader. Moreover, the second strategy requires a higher number of moves and time steps.
Dynamic Reconfiguration for Complex Multimedia Applications
Authors: Baochun Li, Klara Nahrstedt
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Current state-of-the-art distributed multimedia applications require an environment that provides stable Quality of Service (QoS). However, these applications typically run on best-effort heterogeneous platforms, and compete with other applications or connections for end system and network resources, hence suffer from instability and dynamic variations with regards to QoS. In this paper, we present a dynamically reconfigurable middleware control architecture to enhance adaptation awareness of these applications. Our middleware architecture allows for detecting QoS fluctuations in the surrounding environment and signaling optimal control actions to the application. Furthermore, we discuss the design of a core component, the Configurator, that adopts a fuzzy control approach to compute optimal control actions. Preliminary experimental results with a distributed visual tracking application show that our approach is viable and effective in controlling adaptive applications.
Linking Direct Orthogonal Signal Correction and Wavelet Transform with Radial Basis Function Neural Network to Analyze Overlapping Spectra
Authors: Shouxin Ren, Ling Gao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper suggests a novel method named DOSCWTRBFN based on radial basis function neural network (RBFN) with direct orthogonal signal correction (DOSC) and wavelet transform(WT) as a pre-processing tool for the simultaneous spectrophotometric determination of Mn(II), Zn(II), Co(II) and Cd(II). In this case, by optimization, the number of DOSC components, tolerance factor, wavelet function, decomposition level, the numbers of hidden nodes and the width σ of RBFN for DOSCWTRBFN were selected as 1, 0.001, Symmlet 5, 3, 20 and 1.2 respectively. The relative standard errors of prediction(RSEP)for all components with DOSCWTRBFN, WTRBFN and RBFN were 7.5, 8.3 and 8.9 percent respectively. The proposed method has been successfully applied to analyze overlapping spectra and was proven to be better than other techniques.
A methodology for information system design
Authors: Colette Rolland
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper concerns the design of large and integrated information systems (IS) in organizations. We propose to organize the IS development process in two interdependent steps, the first one centered on the semantic representation of the real world system, the second step including technical aspects of the solution ignored in the first one. We present an original model to design the solution at the first step we named IS conceptual schema. This model allows a complete, consistent, nonredundant and economic representation including static and dynamic aspects of the real world system.
Some Recent Results in Algorithmic Game Theory
Authors: Christos Papadimitriou
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

There are three major trends in the field of Algorithmic Game Theory: computational mechanism design, the price of anarchy, and the computation of equilibria; this talk describes one recent result in each. We show computational complexity lower bounds on truthful and approximately efficient mechanisms; we revisit the Roughgarden-Tardos result on selfish routing when routing decisions are made by the nodes, not the flows; and we show that Nash equilibria can be approximated well in several broad, unexpected, and useful classes of games. (Joint work with Costis Daskalakis, Michael Schapira, Yaron Singer, and Greg Valiant).
Adaptive Shot Change Detection for Hardware Application
Authors: Wonhee Kim, Kwangseok Moon, Jongnam Kim
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Shot change detection is the main technique for automatic temporal segmentation of video. Until now, there were little research reports about real-time shot change detection for applying to hardware terminals with low performance such as PMPs (Portable Multimedia Player) and cellular phones. In this paper, we propose an adaptive real-time shot change detection algorithm using sub-sampling, weighting variance, and an adaptive threshold. We use weighting variance of frame difference for dividing feature extraction at a changed frame. We set an adaptive threshold using the average of variance from the next one of a last shot change frame to the previous one of a current frame. In the experiments, we obtained the detection rate of about 94.4% in overall accuracy. We verified real-time operation of shot change detection by implementing our algorithm on the TVUS HM-900 PMP from the company of Homecast. Therefore, our proposing algorithm will be helpful in searching video data on portable media player such as PMPs and cellular phones.
Sparse multivariate polynomial interpolation via the quotient-difference algorithm
Authors: Annie Cuyt, Wen-shin Lee
Venue: ACM Communications in Computer Algebra (2009)

To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables [2]. On the other hand, Rutishauser's quotient-difference algorithm [7, 3], or the qd-algorithm, is an iterative method that can be use to determine the poles of a meromorphic function from its Taylor coefficients. Combining the relation between the qd-algorithm, Prony's method and their connections to the Ben-Or/Tiwari algorithm [6], we present a new algorithm for reconstructing sparse multivariate polynomials in floating point arithmetic, in which neither the number of terms nor any partial degrees are required in the input [1]. For example, consider the bivariate black box polynomial function, f(x1,x2) = 1/3x6/1+4x4/2--2.1x4/1--4x2/2+x1x2+4x2/1, termed the six-hump camel back function. Evaluate f (x1 , x2 ) at the non-equidistant s-th powers of (1/3, 1/5), in which 3 and 5 are relatively prime, and proceed with the qd-algorithm on the data f (1/3, 1/5), f (1/32, 1/52), f (1/33, 1/53), ....The magnitude of the values in the first five e-columns drops from 10--2 to machine precision, while all values in the sixth e-column are of the order of machine precision. We conclude that the number of terms is 6 and obtain the multi-indices in the support directly from the q-values: 1/q1(S) → 9 = 32. 1/q2(S) → 25 = 52. 1/q3(S) → 625 = 54. 1/q2(S) → 15 = 3151. 1/q1(S) → 81 = 34. 1/q1(S) → 729 = 36. After all six multi-indices in f are known, the coefficients in f can be recovered by a linear system formed by (at least six) evaluations of f. The convergence to zero of some e-columns in the qd-algorithm can be interpreted in an analogous way as the zero discrepancies in the early termination strategy [5, 4]. This is illustrated in Maple. Our sparse interpolation can be extended to polynomials represented in certain non-standard bases [4]. We show an extension to sparse interpolation of polynomials in the Pochhammer basis and present our current research on sparse polynomial interpolation in the Chebyshev basis, both in floating point arithmetic.
Service-oriented-architecture based framework for multi-user virtual environments
Authors: Xiaoyu Zhang, Denis Gra&ccirc;anin
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Service-Oriented Architecture (SOA) is an application framework used for creating complex enterprise systems by integrating distributed services. The SOA standards are primarily focused on the service composability and data interoperability. Because of the featured capabilities of SOA, it is also used in distributed simulations. However, SOA has its limitations in terms of the performance of real-time message exchanging. In order to address the disadvantages and improve the application performance, we propose a framework that combines the streaming technology and SOA. The proposed framework is used for constructing multi-user Virtual Environment (VE) applications by integrating the application content from distributed services. The additional streaming channels applied to SOA enable the services to actively propagate the real-time messages. The VE applications constructed using the framework have better performance. However, due to the distributed architecture of SOA and the heavy payload of message exchange in the framework, the application performance needs to be evaluated. We describe the metrics used to evaluate the performance and present the evaluation results. Based on the interaction latency we collected from the experiments, we discuss the categories of applications that can fit well in our framework.
Precision micro-/nano-machining in a scanning electron microscope by run-to-run control based on image feedbacks
Authors: Lun-De Liao, Paul C. -P. Chao, Yu-Jhu Lin, Chi-Wei Chiu, Shaou-Gang Miaou, Ming Chang, Jeng-Sheng Huang
Venue: Microelectronic Engineering (2009)

This study aims to perform the micro-/nano-machining with an atomic force microscopy (AFM) tip in a scanning electron microscope (SEM) via run-to-run (R2R) controller and digital image feedbacks. The R2R is assisted by the technique of exponentially weighted moving average (EWMA). This ''EWMA feedback'' controller is a popular R2R control scheme, which primarily uses data from past process runs to adjust settings for the next run. On the other hand, the digital images are obtained by using the wavelet transform and binarization in order to recognize machining results, and then return feedback of the digital image information to the controller; finally obtain the next input data for the actuating controller to achieve the targeted machining precision. The experimental results for preliminary machining in micro-level indicate that the EWMA controller based on image feedbacks performs with satisfactory results at reducing the process variation, particularly at the first few production runs, thereby making it possible to further reduce the bias and bring the process output closer to its target as soon as the process begins to operate. It is seen that the proposed EWMA controller with digital image feedbacks is easy to implement and provides a good approximation to the optimal variable discount factor, which can reduce the error of the machining process from initial 40% without control to 0.7% with the proposed R2R. More importantly, such a reduction can be achieved at no loss of long-term stability. With sure precision of AFM, the aforementioned resulted micro-machining precision can easily be extended to nano-levels. Therefore, this study demonstrates a successful micro-/nano-machining operation in the environment of a SEM, by employing the designed R2R controller with digital image feedbacks.
Web mining technique framework for intelligent e-business applications
Authors: Ioan Pop
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In Internet business, Web audience analysis is essential to understanding the visitors' needs. However, the existing analysis tools fail to deliver summarized and conceptual metrics needed by organization managers and Web site editors. The reason is that HTTP transaction metadata mined by these tools do not include the text content sent to the browsers. In this paper, we describe a technique framework for Intelligent E-Business applications that we conceived to mine the Web pages output by Web servers. Web mining consists of extracting knowledge from huge volumes of data available in WWW and other Web sources, allowing better business decisions to be taken. These Web Mining methods include content journaling, script parsing, server monitoring, network monitoring, and client-side mining. Finally, we are achieved our approach through a model framework (WMIB) that has the capability to offer unified heterogeneous data in a repository of data for applying different techniques from web data mining in the Intelligent E-Business domain.