Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 6901 - 6930 of 9003

Full-Text Articles in Computer Sciences

Hedonic Valuation Of Online Game Participation, Robert J. Kauffman, Kwansoo Kim, Byungjoon Yoo Aug 2012

Hedonic Valuation Of Online Game Participation, Robert J. Kauffman, Kwansoo Kim, Byungjoon Yoo

Research Collection School Of Computing and Information Systems

We use hedonic valuation to establish a basis for valuing the time a user participates in an online gaming community. We distinguish between utilitarian and hedonic value. Our application involves elements of both utilitarian and hedonic value, however, the latter is much more important. We use an extensive data set involving a massive multi-player online role-playing game (MMORPG) from Korea. We specify and test econometric models that reflect the appropriate empirical structure for the setting, based on information about the players and the activities they engage in. The results permit us to estimate the hedonic value in monetary terms for …

Go to article

From Clickstreams To Searchstreams: Search Network Graph Evidence From A B2b E-Market, Mei Lin, M. F. Lin, Robert J. Kauffman Aug 2012

From Clickstreams To Searchstreams: Search Network Graph Evidence From A B2b E-Market, Mei Lin, M. F. Lin, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Consumers in e-commerce acquire information through search engines, yet to date there has been little empirical study on how users interact with the results produced by search engines. This is analogous to, but different from, the ever-expanding research on clickstreams, where users interact with static web pages. We propose a new network approach to analyzing search engine server log data. We call this searchstream data. We create graph representations based on the web pages that users traverse as they explore the search results that their use of search engines generates. We then analyze the graph-level properties of these search network …

Go to article

Valuation Of Benchmark Provisions On It Services Contracts, Robert J. Kauffman, Ryan Sougstad Aug 2012

Valuation Of Benchmark Provisions On It Services Contracts, Robert J. Kauffman, Ryan Sougstad

Research Collection School Of Computing and Information Systems

Information technology (IT) services are often subject to downward price pressures due to improvements in technology and business processes in a competitive market. When clients enter into IT services contracts, they are faced with the future risk that their services will be overpriced relative to the broader IT services market. To mitigate this risk, clients often add benchmark provisions, whereby a neutral third party assesses the prevailing market price for services. It will support fair price adjustments if the market prices are lower than the current prices. We model the decision to benchmark in order to provide managerial information on …

Go to article

Dynamic Stochastic Orienteering Problems For Risk-Aware Applications, Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen Aug 2012

Dynamic Stochastic Orienteering Problems For Risk-Aware Applications, Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen

Research Collection School Of Computing and Information Systems

Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing problems and tourist trip design problems. However, they suffer from two limitations travel times between cities are assumed to be time independent and the route provided is independent of the risk preference (with respect to violating the deadline) of the user. To address these issues, we make the following contributions: We introduce (1) a dynamic …

Go to article

A Secure And Efficient Discovery Service System In Epcglobal Network, Jie Shi, Yingjiu Li, Robert H. Deng Aug 2012

A Secure And Efficient Discovery Service System In Epcglobal Network, Jie Shi, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

In recent years, the Internet of Things (IOT) has drawn considerable attention from the industrial and research communities. Due to the vast amount of data generated through IOT devices and users, there is an urgent need for an effective search engine to help us make sense of this massive amount of data. With this motivation, we begin our initial works on developing a secure and efficient search engine (SecDS) based on EPC Discovery Services (EPCDS) for EPCglobal network, an integral part of IOT. SecDS is designed to provide a bridge between different partners of supply chains to share information while …

Go to article

Modeling Concept Dynamics For Large Scale Music Search, Jialie Shen, Hwee Hwa Pang, Meng Wang, Shuicheng Yan Aug 2012

Modeling Concept Dynamics For Large Scale Music Search, Jialie Shen, Hwee Hwa Pang, Meng Wang, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Continuing advances in data storage and communication technologies have led to an explosive growth in digital music collections. To cope with their increasing scale, we need effective Music Information Retrieval (MIR) capabilities like tagging, concept search and clustering. Integral to MIR is a framework for modelling music documents and generating discriminative signatures for them. In this paper, we introduce a multimodal, layered learning framework called DMCM. Distinguished from the existing approaches that encode music as an ensemble of order-less feature vectors, our framework extracts from each music document a variety of acoustic features, and translates them into low-level encodings over …

Go to article

Consumer Micro-Behavior And Tv Viewership Patterns: Data Analytics For The Two-Way Set-Top Box, Ray M. Chang, Robert J. Kauffman, Insoo Son Aug 2012

Consumer Micro-Behavior And Tv Viewership Patterns: Data Analytics For The Two-Way Set-Top Box, Ray M. Chang, Robert J. Kauffman, Insoo Son

Research Collection School Of Computing and Information Systems

Consumer behavior patterns related to home digital media use are changing due to technological innovations. We examine them in the presence of two-way cable television (CATV) settop boxes. They permit viewers to change channels, switch to the Internet, and order paid programming, among other functions. We focus on micro-level data that are generated from consumer CATV viewing behavior. We capture clickstreams of channel-changing behavior when consumer use a remote control handset to interact with the set-top box in their home. We explore a variety of data analytics results that characterize patterns of consumer channel-switching behavior, as a basis for suggesting …

Go to article

Collective Churn Prediction In Social Network, Richard J. Oentaryo, Ee-Peng Lim, David Lo, Feida Zhu, Philips K. Prasetyo Aug 2012

Collective Churn Prediction In Social Network, Richard J. Oentaryo, Ee-Peng Lim, David Lo, Feida Zhu, Philips K. Prasetyo

Research Collection School Of Computing and Information Systems

In service-based industries, churn poses a significant threat to the integrity of the user communities and profitability of the service providers. As such, research on churn prediction methods has been actively pursued, involving either intrinsic, user profile factors or extrinsic, social factors. However, existing approaches often address each type of factors separately, thus lacking a comprehensive view of churn behaviors. In this paper, we propose a new churn prediction approach based on collective classification (CC), which accounts for both the intrinsic and extrinsic factors by utilizing the local features of, and dependencies among, individuals during prediction steps. We evaluate our …

Go to article

Sampling And Ontologically Pooling Web Images For Visual Concept Learning, Shiai Zhu, Chong-Wah Ngo, Yu-Gang Jiang Aug 2012

Sampling And Ontologically Pooling Web Images For Visual Concept Learning, Shiai Zhu, Chong-Wah Ngo, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

Sufficient training examples are essential for effective learning of semantic visual concepts. In practice, however, acquiring noise-free training examples has always been expensive. Recently the rapid popularization of social media websites, such as Flickr, has made it possible to collect training exemplars without human assistance. This paper proposes a novel and efficient approach to collect training samples from the noisily tagged Web images for visual concept learning, where we try to maximize two important criteria, relevancy and coverage, of the automatically generated training sets. For the former, a simple method named semantic field is introduced to handle the imprecise and …

Go to article

Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng Aug 2012

Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, movement of taxis can be involuntary or nondeterministic (decided by the specific …

Go to article

The Patrol Scheduling Problem, Hoong Chuin Lau, Aldy Gunawan Aug 2012

The Patrol Scheduling Problem, Hoong Chuin Lau, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This paper presents the problem of scheduling security teams to patrol a mass rapid transit rail network of a large urban city. The main objective of patrol scheduling is to deploy security teams to stations at varying time periods of the network subject to rostering as well as security-related constraints. We present a mathematical programming model for this problem. We then discuss the aspect of injecting randomness by varying the start times, the break times for each team as well as the number of visits required for each station according to their reported vulnerability. Finally, we present results for the …

Go to article

Online Feature Selection For Mining Big Data, Steven C. H. Hoi, Jialei Wang, Peilin Zhao, Rong Jin Aug 2012

Online Feature Selection For Mining Big Data, Steven C. H. Hoi, Jialei Wang, Peilin Zhao, Rong Jin

Research Collection School Of Computing and Information Systems

Most studies of online learning require accessing all the attributes/features of training instances. Such a classical setting is not always appropriate for real-world applications when data instances are of high dimensionality or the access to it is expensive to acquire the full set of attributes/features. To address this limitation, we investigate the problem of Online Feature Selection (OFS) in which the online learner is only allowed to maintain a classifier involved a small and fixed number of features. The key challenge of Online Feature Selection is how to make accurate prediction using a small and fixed number of active features. …

Go to article

Confidence-Aware Graph Regularization With Heterogeneous Pairwise Features, Yuan Fang, Bo-June Paul Hsu, Kevin Chen-Chuan Chang Aug 2012

Confidence-Aware Graph Regularization With Heterogeneous Pairwise Features, Yuan Fang, Bo-June Paul Hsu, Kevin Chen-Chuan Chang

Research Collection School Of Computing and Information Systems

Conventional classification methods tend to focus on features of individual objects, while missing out on potentially valuable pairwise features that capture the relationships between objects. Although recent developments on graph regularization exploit this aspect, existing works generally assume only a single kind of pairwise feature, which is often insufficient. We observe that multiple, heterogeneous pairwise features can often complement each other and are generally more robust in modeling the relationships between objects. Furthermore, as some objects are easier to classify than others, objects with higher initial classification confidence should be weighed more towards classifying related but more ambiguous objects, an …

Go to article

Improving Patient Flow In Emergency Department Through Dynamic Priority Queue, Kar Way Tan, Chao Wang, Hoong Chuin Lau Aug 2012

Improving Patient Flow In Emergency Department Through Dynamic Priority Queue, Kar Way Tan, Chao Wang, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Most queuing problems are based on FIFO, LIFO, or static priority queues; very few address dynamic priority queues. In this paper, we present a case in a hospital’s emergency department (ED) where the queuing process can be modeled as a time-varying M/M/s queue with re-entrant patients. In order to improve patient flow in the department, we propose the use of a dynamic priority queue to dispatch patients to consultation with doctors. We test our proposed model using simulation and our experimental results show that a dynamic priority queue is effective in reducing the length of stay (LOS) of patients and …

Go to article

Measurement-Driven Performance Analysis Of Indoor Femtocellular Networks, Trung-Tuan Luong, Vigneshwaran Subbaraju, Archan Misra, Srinivasan Seshan Aug 2012

Measurement-Driven Performance Analysis Of Indoor Femtocellular Networks, Trung-Tuan Luong, Vigneshwaran Subbaraju, Archan Misra, Srinivasan Seshan

Research Collection School Of Computing and Information Systems

This paper describes initial empirical studies, performed on a 6-node 3G indoor femtocellular testbed, that investigate the impact of pedestrian mobility on network parameters, such as handoff behavior and data throughput. The studies establish that, owing to the small radii of cells, even modest changes in movement speed can have disproportionately large impact on handoff patterns and network throughput. By also revealing a strong temporal dependency effect, the studies motivate the need for algorithms to accurately predict RF signal strength distributions in dynamic indoor environments. We present such an RF prediction algorithm, based on crowd-sourced signal strength readings, and show …

Go to article

Shortest Path Computation With No Information Leakage, Kyriakos Mouratidis, Man Lung Yiu Aug 2012

Shortest Path Computation With No Information Leakage, Kyriakos Mouratidis, Man Lung Yiu

Research Collection School Of Computing and Information Systems

Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client’s position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing method for privacy-preserving shortest path computation follows the obfuscation paradigm; it prevents the LBS from inferring the source and destination of the query with a probability higher than a threshold. This implies, however, that the LBS still deduces some information (albeit not exact) about the client’s location …

Go to article

Bidder Behaviors In Repeated B2b Procurement Auctions, Jong Han Park, Jae Kyu Lee, Hoong Chuin Lau Aug 2012

Bidder Behaviors In Repeated B2b Procurement Auctions, Jong Han Park, Jae Kyu Lee, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

B2B auctions play a key role in a firm's procurement process. Even though it is known that repetition is a key characteristic of procurement auctions, traditional auctioneers typically have not put in place a suitable mechanism that supports repetitive auctions effectively. In this paper, we empirically investigate what has taken place in repeated procurement auctions based on real world data from a major outsourcing company of MRO (Maintenance, Repair and Operations) items in Korea. From this empirical study, we discovered the followings. First, we discovered that the repeated bidders contribute majority of all bids, and that the number of new …

Go to article

Adaptive Display Power Management For Oled Displays, Kiat Wee Tan, Rajesh Krishna Balan Aug 2012

Adaptive Display Power Management For Oled Displays, Kiat Wee Tan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Mobile gaming has become increasingly popular in the past few years with the proliferation of smartphones that have the increased CPU, memory, and network (3.5G etc.) capabilities to support a vast range of interesting games. In addition, these phones also have high quality displays, such as Organic Light Emitting Diodes (OLED) displays, that allow the intricate details in games to be shown in vivid detail to end users. Unfortunately, these displays tend to consume a lot of energy which in turn limits the amount of time that a user can spend actually playing games on these devices. In this paper, …

Go to article

Adapting Video Delivery Based On Motion Triggered Visual Attention, Hari Kalva, V. Adzic, Lai-Tee Cheok Aug 2012

Adapting Video Delivery Based On Motion Triggered Visual Attention, Hari Kalva, V. Adzic, Lai-Tee Cheok

Research Collection School Of Computing and Information Systems

Cues from human visual system (HVS) can be used for further optimization of compression in modern hybrid video coding platforms. We present work that explores and exploits motion related attentional limitations. Algorithms for exploiting motion triggered attention were developed and compared with MPEG AVC/H.264 encoder with various settings for different bitrate levels. For the sequences with high motion activity our algorithm provides up to 8% bitrate savings.

Go to article

Toward A Mobile Platform For Pervasive Games, Inseok Hwang, Youngki Lee, Taiwoo Park, Junehwa Song Aug 2012

Toward A Mobile Platform For Pervasive Games, Inseok Hwang, Youngki Lee, Taiwoo Park, Junehwa Song

Research Collection School Of Computing and Information Systems

Emerging pervasive games will be immersed into real-life situations and leverage new types of contextual interactions therein. For instance, a player’s punching gesture, running activity, and fast heart rate conditions can be used as the game inputs. Although the contextual interaction is the core building blocks of pervasive games, individual game developers hardly utilize a rich set of interactions within a game play. Most challenging, it is significantly difficult for developers to expect dynamic availability of input devices in real life, and adapt to the situation without system-level support. Also, it is challenging to coordinate its resource use with other …

Go to article

Automatic Compositional Verification Of Timed Systems, Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André Aug 2012

Automatic Compositional Verification Of Timed Systems, Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André

Research Collection School Of Computing and Information Systems

Specification and verification of real-time systems are important research topics with crucial applications; however, the so-called state space explosion problem often prevents model checking to be used in practice for large systems. In this work, we present a self-contained toolkit to analyze real-time systems specified using event-recording automata (ERAs), which supports system modeling, animated simulation, and fully automatic compositional verification based on learning techniques. Experimental results show that our tool outperforms the state-of-the-art timed model checker.

Go to article

Improved Bdd-Based Discrete Analysis Of Timed Systems, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu Aug 2012

Improved Bdd-Based Discrete Analysis Of Timed Systems, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu

Research Collection School Of Computing and Information Systems

Model checking timed systems through digitization is relatively easy, compared to zone-based approaches. The applicability of digitization, however, is limited mainly for two reasons, i.e., it is only sound for closed timed systems; and clock ticks cause state space explosion. The former is mild as many practical systems are subject to digitization. It has been shown that BDD-based techniques can be used to tackle the latter to some extent. In this work, we significantly improve the existing approaches by keeping the ticks simple in the BDD encoding. Taking advantage of the ‘simple’ nature of clock ticks, we fine-tune the encoding …

Go to article

A Non-Parametric Visual-Sense Model Of Images: Extending The Cluster Hypothesis Beyond Text, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia Aug 2012

A Non-Parametric Visual-Sense Model Of Images: Extending The Cluster Hypothesis Beyond Text, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia

Research Collection School Of Computing and Information Systems

The main challenge of a search engine is to find information that are relevant and appropriate. However, this can become difficult when queries are issued using ambiguous words. Rijsbergen first hypothesized a clustering approach for web pages wherein closely associated pages are treated as a semantic group with the same relevance to the query (Rijsbergen 1979). In this paper, we extend Rijsbergen’s cluster hypothesis to multimedia content such as images. Given a user query, the polysemy in the return image set is related to the many possible meanings of the query. We develop a method to cluster the polysemous images …

Go to article

Message From General Chair And Program Co-Chairs [Of Icec '12, 14th Annual International Conference On Electronic Commerce, Held In Singapore, 7-8 August 2012], Robert J. Kauffman, Martin Bichler, Hoong Chuin Lau, Christopher Yang, Yinping Yang Aug 2012

Message From General Chair And Program Co-Chairs [Of Icec '12, 14th Annual International Conference On Electronic Commerce, Held In Singapore, 7-8 August 2012], Robert J. Kauffman, Martin Bichler, Hoong Chuin Lau, Christopher Yang, Yinping Yang

Research Collection School Of Computing and Information Systems

Singapore, a major hub in the Asia Pacific region well known for its multi-racial and multicultural society, is proud to host the 14th International Conference on Electronic Commerce. Singapore Management University (SMU), the School of Information Systems (SIS) and the Living Analytics Research Center (LARC) are also delighted to be able to support the delivery of this event.

Go to article

Presynaptic Learning And Memory With A Persistent Firing Neuron And A Habituating Synapse: A Model Of Short Term Persistent Habituation, Kiruthika Ramanathan, Ning Ning, Dhiviya Dhanasekar, Guoqi Li, Luping Shi, Prahlad Vadakkepat Aug 2012

Presynaptic Learning And Memory With A Persistent Firing Neuron And A Habituating Synapse: A Model Of Short Term Persistent Habituation, Kiruthika Ramanathan, Ning Ning, Dhiviya Dhanasekar, Guoqi Li, Luping Shi, Prahlad Vadakkepat

Research Collection School Of Computing and Information Systems

Our paper explores the interaction of persistent firing axonal and presynaptic processes in the generation of short term memory for habituation. We first propose a model of a sensory neuron whose axon is able to switch between passive conduction and persistent firing states, thereby triggering short term retention to the stimulus. Then we propose a model of a habituating synapse and explore all nine of the behavioral characteristics of short term habituation in a two neuron circuit. We couple the persistent firing neuron to the habituation synapse and investigate the behavior of short term retention of habituating response. Simulations show …

Go to article

(Hidden) Social Influences In Switching Mobile Service Platforms, Virpi K. Tuunainen, Tuure Tuunanen, Fiona Fui-Hoon Nah Aug 2012

(Hidden) Social Influences In Switching Mobile Service Platforms, Virpi K. Tuunainen, Tuure Tuunanen, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

During the past few years, the mobile industry has gone through a radical change from business focusing on excellence in device manufacturing and supply chain management to ecosystems around successful focal players, such as Apple and Google, controlling these service platforms. In order to compete in this environment, these firms need to understand what makes a consumer switch between these mobile service platforms. To that end, we conducted an inductive qualitative study with university students from Finland and USA as subjects (142 altogether), delving into how and why consumers switch mobile phones, and what are the factors affecting their decisions. …

Go to article

Control-Theoretic Utility Maximization In Multihop Wireless Networks Under Mission Dynamics, Sharanya Eswaran, Archan Misra, Thomas La Porta Aug 2012

Control-Theoretic Utility Maximization In Multihop Wireless Networks Under Mission Dynamics, Sharanya Eswaran, Archan Misra, Thomas La Porta

Research Collection School Of Computing and Information Systems

Both bandwidth and energy become important resource constraints when multi-hop wireless networks are used to transport high data rate traffic for a moderately long duration. In such networks, it is important to control the traffic rates to not only conform to the link capacity bounds but also to ensure that the energy of battery-powered forwarding nodes is utilized judiciously to avoid premature exhaustion (i.e., the network lasts as long as the applications require data from the sources) without being unneccesarily conservative (i.e., ensuring that the applications derive the maximum utility possible). Unlike prior work that focuses on the instantaneous distributed …

Go to article

Embracing Analytics For A Better Competitive Edge, Tin Seong Kam Jul 2012

Embracing Analytics For A Better Competitive Edge, Tin Seong Kam

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Using Monterey Phoenix To Formalize And Verify System Architectures, Jiexin Zhang, Yang Liu, Mikhail Auguston, Jun Sun, Jin Song Dong Jul 2012

Using Monterey Phoenix To Formalize And Verify System Architectures, Jiexin Zhang, Yang Liu, Mikhail Auguston, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Modeling and analyzing software architectures are useful for helping to understand the system structures and facilitate proper implementation of user requirements. Despite its importance in the software engineering practice, the lack of formal description and verification support hinders the development of quality architectural models. In this work, we develop an approach for modeling and verifying software architectures specified using Monterey Phoenix (MP) architecture description language. Firstly, we formalize the syntax and operational semantics for MP. This language is capable of modeling system and environment behaviors based on event traces, as well as supporting different architecture composition operations and views. Secondly, …

Go to article

Probabilistic Model Checking Multi-Agent Behaviors In Dispersion Games Using Counter Abstraction, Jianye Hao, Songzheng Song, Yang Liu, Jun Sun, Lin Gui, Jin Song Dong, Ho-Fung Leung Jul 2012

Probabilistic Model Checking Multi-Agent Behaviors In Dispersion Games Using Counter Abstraction, Jianye Hao, Songzheng Song, Yang Liu, Jun Sun, Lin Gui, Jin Song Dong, Ho-Fung Leung

Research Collection School Of Computing and Information Systems

Accurate analysis of the stochastic dynamics of multi-agent system is important but challenging. Probabilistic model checking, a formal technique for analysing a system which exhibits stochastic behaviors, can be a natural solution to analyse multi-agent systems. In this paper, we investigate this problem in the context of dispersion games focusing on two strategies: basic simple strategy (BSS) and extended simple strategies (ESS). We model the system using discrete-time Markov chain (DTMC) and reduce the state space of the models by applying counter abstraction technique. Two important properties of the system are considered: convergence and convergence rate. We show that these …

Go to article

First Prev Next Last