3,130 research outputs found
POLICY OF NATIONALISM GUIDANCE THROUGH IN TRADITIONAL MARKET MANAGEMENT IN CENTRAL JAVA
A research on policy nationalism guidance through in traditional markets management in the province of Central Java is implemented in “Pasar Gede Solo” with qualitative methods. The reason for selecting “Pasar Gede Solo” because of Solo City has a lot of cultural heritages that are still held strong until today. The cultural heritage is the local identity. The Local identity can develop into the province identity, then to be the national identity. A strong national identity shows high Nationalism which reflected from loyalty, passion and pride of the nation itself. The number of local identities in “Pasar Gede Solo” is likely to evolve into national identity should be encouraged to preserve the Government's policy to strengthen Indonesia Nationalism
Statically Checking Web API Requests in JavaScript
Many JavaScript applications perform HTTP requests to web APIs, relying on
the request URL, HTTP method, and request data to be constructed correctly by
string operations. Traditional compile-time error checking, such as calling a
non-existent method in Java, are not available for checking whether such
requests comply with the requirements of a web API. In this paper, we propose
an approach to statically check web API requests in JavaScript. Our approach
first extracts a request's URL string, HTTP method, and the corresponding
request data using an inter-procedural string analysis, and then checks whether
the request conforms to given web API specifications. We evaluated our approach
by checking whether web API requests in JavaScript files mined from GitHub are
consistent or inconsistent with publicly available API specifications. From the
6575 requests in scope, our approach determined whether the request's URL and
HTTP method was consistent or inconsistent with web API specifications with a
precision of 96.0%. Our approach also correctly determined whether extracted
request data was consistent or inconsistent with the data requirements with a
precision of 87.9% for payload data and 99.9% for query data. In a systematic
analysis of the inconsistent cases, we found that many of them were due to
errors in the client code. The here proposed checker can be integrated with
code editors or with continuous integration tools to warn programmers about
code containing potentially erroneous requests.Comment: International Conference on Software Engineering, 201
Julia Programming Language Benchmark Using a Flight Simulation
Julias goal to provide scripting language ease-of-coding with compiled language speed is explored. The runtime speed of the relatively new Julia programming language is assessed against other commonly used languages including Python, Java, and C++. An industry-standard missile and rocket simulation, coded in multiple languages, was used as a test bench for runtime speed. All language versions of the simulation, including Julia, were coded to a highly-developed object-oriented simulation architecture tailored specifically for time-domain flight simulation. A speed-of-coding second-dimension is plotted against runtime for each language to portray a space that characterizes Julias scripting language efficiencies in the context of the other languages. With caveats, Julia runtime speed was found to be in the class of compiled or semi-compiled languages. However, some factors that affect runtime speed at the cost of ease-of-coding are shown. Julias built-in functionality for multi-core processing is briefly examined as a means for obtaining even faster runtime speed. The major contribution of this research to the extensive language benchmarking body-of-work is comparing Julia to other mainstream languages using a complex flight simulation as opposed to benchmarking with single algorithms
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teqt, which distinguishes
terminating terms and total functions from possibly diverging terms and partial
functions, for a lambda calculus with general recursion and equality types. The
central idea is to include a primitive type-form "Terminates t", expressing
that term t is terminating; and then allow terms t to be coerced from possibly
diverging to total, using a proof of Terminates t. We call such coercions
termination casts, and show how to implement terminating recursion using them.
For the meta-theory of the system, we describe a translation from Teqt to a
logical theory of termination for general recursive, simply typed functions.
Every typing judgment of Teqt is translated to a theorem expressing the
appropriate termination property of the computational part of the Teqt term.Comment: In Proceedings PAR 2010, arXiv:1012.455
A Fast Compiler for NetKAT
High-level programming languages play a key role in a growing number of
networking platforms, streamlining application development and enabling precise
formal reasoning about network behavior. Unfortunately, current compilers only
handle "local" programs that specify behavior in terms of hop-by-hop forwarding
behavior, or modest extensions such as simple paths. To encode richer "global"
behaviors, programmers must add extra state -- something that is tricky to get
right and makes programs harder to write and maintain. Making matters worse,
existing compilers can take tens of minutes to generate the forwarding state
for the network, even on relatively small inputs. This forces programmers to
waste time working around performance issues or even revert to using
hardware-level APIs.
This paper presents a new compiler for the NetKAT language that handles rich
features including regular paths and virtual networks, and yet is several
orders of magnitude faster than previous compilers. The compiler uses symbolic
automata to calculate the extra state needed to implement "global" programs,
and an intermediate representation based on binary decision diagrams to
dramatically improve performance. We describe the design and implementation of
three essential compiler stages: from virtual programs (which specify behavior
in terms of virtual topologies) to global programs (which specify network-wide
behavior in terms of physical topologies), from global programs to local
programs (which specify behavior in terms of single-switch behavior), and from
local programs to hardware-level forwarding tables. We present results from
experiments on real-world benchmarks that quantify performance in terms of
compilation time and forwarding table size
Extracting verified decision procedures: DPLL and Resolution
This article is concerned with the application of the program extraction technique to a new class of problems: the synthesis of decision procedures for the classical satisfiability problem that are correct by construction. To this end, we formalize a completeness proof for the DPLL proof system and extract a SAT solver from it. When applied to a propositional formula in conjunctive normal form the program produces either a satisfying assignment or a DPLL derivation showing its unsatisfiability. We use non-computational quantifiers to remove redundant computational content from the extracted program and translate it into Haskell to improve performance. We also prove the equivalence between the resolution proof system and the DPLL proof system with a bound on the size of the resulting resolution proof. This demonstrates that it is possible to capture quantitative information about the extracted program on the proof level. The formalization is carried out in the interactive proof assistant Minlog
RECRUITMENT AND SELECTION SYSTEM OF VILLAGES IN WONOSOBO REGENCY
Basic track problems in most of the villages in Wonosobo Regency Government are the recruitment and selection practices of other villages have not been able to encourage the inception of the village with the required standards of competence. This research aims to analyze the system of recruitment and selection of other villages, supporters and restricting factors, as well as establishing a proper and contextual model in Wonosobo Regency over the approach to the management of human resources. With descriptive method, this study found that the standard of competence has not been a consideration for the Government since the beginning of the planning process, to recruitment and selection. Almost the entire selection process, starting from the determination of the criteria of candidates, selection of administration until the written exams tend not based on competence. In addition, the necessary of the village according to the preference of the villagers also has yet to be fulfilled, thus still encountered complaints from the public. The study also identifies some of the factors supporting the recruitment and selection competency-based, among others, regulation and community support. Later, inhibitor factor, among others, the quality of human resources and organizational needs analysis Committee. Based on these conditions, the model recommendations in this study encourages the process of recruitment and selection apply competency — based in practice, in order to be able to support organizational performance towards the village government is better. Start the process of sourcing, attracting, through screening, based on the needs the competence and analyzed scientifically. Community preference is also a consideration in that process in order to involve the public opinion and build public confidence to the results of the selection. These two factors also continue to support are encouraged to be optimal. Meanwhile, an inhibitor of factor continues to be minimized through a variety of innovations
INSTITUTIONAL ANALYSIS ON POVERTY REDUCTION PROGRAM IN THE SOCIETY: A CASE STUDY OF NATIONAL PROGRAM FOR COMMUNITY EMPOWERMENT OF INDEPENDENT URBAN (PNPM-MP) IN SEMARANG, INDONESIA
Institutional PNPM-MP in Semarang put poverty alleviation as the main priority of the empowerment-based development policy. The strategy developed is to synergize government agencies with community institutions built by PNPM-MP program at the village and base level, that is, Community Institutional Agency (BKM) and the Community Self-Reliance Group (KSM). The problem studied in this research is: How does PNPM-MP institutional in society involve in poverty reduction, with the aim of describing and analyzing institutional programs in the community. The research approach used phenomenological qualitative, by conducting interviews, observation, focus group discussion to obtain data from informants (BKM / KSM). Informants include two BKM and ten KSM which is purposively selected (deliberately) from two villages in two districts. The analysis was performed interactively, that is, analysis techniques which are integral cycle among data collection, data reduction, data performance and conclusion withdrawal. Research conclusion: PNPM-MP institutional at the village and base level (BKM / KSM) has not been able to be a driving force in poverty reduction and is still seen by the community as a program requirement, not institutionalized on both horizontal and vertical level. Recommendation for the research result is that it needed awareness that poverty reduction requires a synergy between government agencies and community agencies embodied in the development planning of one village one planning
- …