Dividing traffic sub-areas based on a parallel K-means algorithm

In order to alleviate the traffic congestion and reduce the complexity of traffic control and management, it is necessary to exploit traffic sub-areas division which should be effective in planing traffic. Some researchers applied the K-Means algorithm to divide traffic sub-areas on the taxi trajectories. However, the traditional K-Means algorithms faced difficulties in processing large-scale Global Position System(GPS) trajectories of taxicabs with the restrictions of memory, I/O, computing performance. This paper proposes a Parallel Traffic Sub-Areas Division(PTSD) method which consists of two stages, on the basis of the Parallel K-Means(PKM) algorithm. During the first stage, we develop a process to cluster traffic sub-areas based on the PKM algorithm. Then, the second stage, we identify boundary of traffic sub-areas on the base of cluster result. According to this method, we divide traffic sub-areas of Beijing on the real-word (GPS) trajectories of taxicabs. The experiment and discussion show that the method is effective in dividing traffic sub-areas.

A general method to eliminate laboratory induced recombinants during massive, parallel sequencing of cDNA library.

Massive, parallel sequencing is a potent tool for dissecting the regulation of biological processes by revealing the dynamics of the cellular RNA profile under different conditions. Similarly, massive, parallel sequencing can be used to reveal the complexity of viral quasispecies that are often found in the RNA virus infected host. However, the production of cDNA libraries for next-generation sequencing (NGS) necessitates the reverse transcription of RNA into cDNA and the amplification of the cDNA template using PCR, which may introduce artefact in the form of phantom nucleic acids species that can bias the composition and interpretation of original RNA profiles.

Brutalism, metabolism and its American parallel : encounters in Skopje and in the architecture of Georgi Konstantinovski

Abstract Massive, raw concrete structures – the likes of the Telecommunications Building (1972–81) by Janko Konstantinov; the campus of Ss. Cyril and Methodius University (1974) by Marko Musˇicˇ; the National Hydraulic Institute (1972) by Krsto Todorovski; and the Bank Complex (1970) by R. Lalovik and O. Papesˇ – have led to the production of an enduring monumental presence and helped inspire Skopje’s title as the “Brutalist capital of the world”. These works followed Kenzo Tange’s introduction of Japanese Metabolism to Skopje through his role in the 1965 United Nations sponsored reconstruction competition. The unique position of a Non-Aligned Yugoslavia staged and facilitated architectural and professional exchange during the Cold War. Each trajectory and manifestation illustrates the complex picture of international architectural exchange and local production. Skopje and its numerous Brutalist edifices is an elucidative story, because it represents a meeting point between Brutalism, Metabolism and its American parallel. This article discusses, in particular, the Skopje Archive Building (1966) and the “Goce Delcˇev” Student Dormitory (1969) – two buildings designed by the architect Georgi Konstantinovski, realised on his return from a Masters program at Yale University and employment within I. M. Pei’s New York office. Their architecture illustrates the simultaneous preoccupations of leading architects at the time in regaining a conceptual ground made explicit through a complete and apprehensible image. From this particular position, the article explores the question of ethics and aesthetics central to Banham’s outline of the “New Brutalism”.

Development of a novel soft parallel robot equipped with polymeric artificial muscles

This paper presents the design, analysis and fabrication of a novel low-cost soft parallel robot for biomedical applications, including bio-micromanipulation devices. The robot consists of two active flexible polymer actuator-based links, which are connected to two rigid links by means of flexible joints. A mathematical model is established between the input voltage to the polymer actuators and the robot's end effector position. The robot has two degrees-of-freedom, making it suitable for handling planar micromanipulation tasks. Moreover, a number of robots can be configured to operate in a cooperative manner for increasing micromanipulation dexterity. Finally, the experimental results demonstrate two main motion modes of the robot.

Distributed agent-based control scheme for single-phase parallel inverters in microgrids with photovoltaic systems

In this paper, an agent-based distributed control scheme is presented to control single-phase parallel inverters in solar photovoltaic (PV) systems connected to microgrids. A communication assisted multi-agent framework is developed within microgrids where agents perform their tasks in a distributed manner with an aim of stabilizing load voltage and current under normal and faulted conditions through the asymptotic tracking of the reference current signal. The distributed agent-based control scheme requires information from the neighboring agents through communication network to decide control actions. The proposed control scheme utilizes Ziegler-Nichols (Z-N) tuning approach to design proportional integral (PI) controllers for controlling inverters within the multi-agent system (MAS). A microgrid with parallel inverter-connected solar PV systems is considered for simulations under normal and faulted conditions where results show the excellency of the proposed agent-based scheme in comparison to the conventional scheme without MAS.

Cross-border travellers and parallel trade: implications for Asian economies

This paper explores the impact of parallel trade in an export market by cross-border travellers on welfare of the home country in a model with heterogeneous consumers' perceptions. We show that such parallel trade when it is organised trading always hurts the home-country welfare. However, when parallel trade is unorganised trading, it might benefit the home-country welfare provided that the size of the export market is relatively small. Along these lines, we suggest optimal policy responses in the home country to parallel trade by cross-border travellers. The results of the paper yield insightful policy implications for Asian economies.

Optimization Of Groundwater Remediation With New Efficient Parallel Algorithm For Global Optimization

Application of optimization algorithm to PDE modeling groundwater remediation can greatly reduce remediation cost. However, groundwater remediation analysis requires a computational expensive simulation, therefore, effective parallel optimization could potentially greatly reduce computational expense. The optimization algorithm used in this research is Parallel Stochastic radial basis function. This is designed for global optimization of computationally expensive functions with multiple local optima and it does not require derivatives. In each iteration of the algorithm, an RBF is updated based on all the evaluated points in order to approximate expensive function. Then the new RBF surface is used to generate the next set of points, which will be distributed to multiple processors for evaluation. The criteria of selection of next function evaluation points are estimated function value and distance from all the points known. Algorithms created for serial computing are not necessarily efficient in parallel so Parallel Stochastic RBF is different algorithm from its serial ancestor. The application for two Groundwater Superfund Remediation sites, Umatilla Chemical Depot, and Former Blaine Naval Ammunition Depot. In the study, the formulation adopted treats pumping rates as decision variables in order to remove plume of contaminated groundwater. Groundwater flow and contamination transport is simulated with MODFLOW-MT3DMS. For both problems, computation takes a large amount of CPU time, especially for Blaine problem, which requires nearly fifty minutes for a simulation for a single set of decision variables. Thus, efficient algorithm and powerful computing resource are essential in both cases. The results are discussed in terms of parallel computing metrics i.e. speedup and efficiency. We find that with use of up to 24 parallel processors, the results of the parallel Stochastic RBF algorithm are excellent with speed up efficiencies close to or exceeding 100%.

Pompidou & Pompeia: a parallel between the management strategies of two cultural institutions in the French and Brazilian contexts

A presente pesquisa foi conduzida na forma de um estudo de caso de duas instituições culturais no contexto francês e brasileiro. O Centro Pompidou é um projeto presidencial de museu financiado pelo Estado, com a missão de tornar a arte moderna em todas as suas expressões acessíveis ao público em geral. O Sesc Pompeia é um centro multidisciplinar de cultura e esporte - financiado pelo dinheiro dos impostos e administrado pela Federação do Comércio . O Sesc Pompéia é dedicado à oferta de educação informal através do cultivo da mente e do corpo. O estudo examina se as teorias de dependência de recursos e de poder podem ser utilizadas para conceituar a relação que o Centro Pompidou e do Sesc Pompéia tem com seus stakeholders financeiros. Mais especificamente, será discutido em que medida o grau de dependência influencia a estratégia de gestão das instituições. O objetivo é de responder a pergunta seguinte: quais são as estratégias que as instituições adotam para reduzir sua dependência com relação a seus principais stakeholders financeiros? Finalmente algumas implicações práticas de gestão serão elaboradas a partir do paralelo entre as estratégias das duas instituições.

Parallel Cyclostationarity-Exploiting Algorithm for Energy-Efficient Spectrum Sensing

The evolution of wireless communication systems leads to Dynamic Spectrum Allocation for Cognitive Radio, which requires reliable spectrum sensing techniques. Among the spectrum sensing methods proposed in the literature, those that exploit cyclostationary characteristics of radio signals are particularly suitable for communication environments with low signal-to-noise ratios, or with non-stationary noise. However, such methods have high computational complexity that directly raises the power consumption of devices which often have very stringent low-power requirements. We propose a strategy for cyclostationary spectrum sensing with reduced energy consumption. This strategy is based on the principle that p processors working at slower frequencies consume less power than a single processor for the same execution time. We devise a strict relation between the energy savings and common parallel system metrics. The results of simulations show that our strategy promises very significant savings in actual devices.

Bifurcation Analysis of a Van der Pol-Duffing Circuit with Parallel Resistor

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Design and Analysis of Optical Interconnection Networks for a Dataflow Parallel Computer

This work shows the design, simulation, and analysis of two optical interconnection networks for a Dataflow parallel computer architecture. To verify the optical interconnection network performance on the Dataflow architecture, we have analyzed the load balancing among the processors during the parallel programs executions. The load balancing is a very important parameter because it is directly associated to the dataflow parallelism degree. This article proves that optical interconnection networks designed with simple optical devices can provide efficiently the dataflow requirements of a high performance communication system.